근사화된 Gradient 방법을 사용한 널링 알고리즘 설계
Nulling algorithm design using approximated gradient method
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.
Abstract
This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.
참고문헌 (9)
- D. Gesbert, "From single user to multiuser communications; Shifting the MIMO paradigm", IEEE Signal Process. Mag (2007)
- M. Costa, "Writing on dirty paper", IEEE Trans. Inf. Theory, 29(3), pp.439~441 (1983)
- H. Weingarten, "The capacity region of the Gaussian MIMO broadcast channel", Proc. IEEE Int. Symp. Inf. Theory (ISIT) (2004)
- T. Yoo, "On the optimality of multi-antenna broadcast scheduling using zero-forcing beamforming", IEEE J. Sel. Areas Commun., 24, pp.528~542 (2006)
- T. Yoo, "Sum-rate optimal multi-antenna downlink beamforming strategy based on clique search", IEEE Global Telecommun, Conf., 3 (2005)
- 오태열, "2차원 선형보간법을 이용한 OFDM MIMO 시스템에서의 채널 추정", (사)디지털산업정보학회 논문지, 7(3), pp.107~113 (2011), (사)디지털산업정보학회
- 양환석, "MANET에서 효율적 역추적을 위한 경로관리에 관한 연구", (사)디지털산업정보학회 논문지, 7(4), pp.31~37 (2011), (사)디지털산업정보학회
- S. Choi, "A novel adaptive beamforming algorithm for a smart antenna systme in a CDMA mobile communication environment", IEEE Trans. Vehicular Technology, 49(5), pp.1793~1806 (2000)
- W. Choi, "Phase-only adaptive processing based on a direct data domain least squares approach using the conjugate gradient method", IEEE Transaction on Antennas and Propagation, 52(12), pp.3265~3272 (2004)