상세정보
학술지
Joint Diversity for the Block Diagonalization-Precoded Spatial Multiplexing System with Multiple Users
- 발행일
- 201204
- 출처
- IEICE Transactions on Communications, v.E95.B no.4, pp.1300-1306
- ISSN
- 0916-8516
- 출판사
- 일본, 전자정보통신학회 (IEICE)
- 협약과제
- 11PR3300, 10GHz 이하 대역에서 Dynamic Spectrum Access를 위한 상호 공존성(Coexistence) 기준 연구, 정병장
- 초록
- In this paper, we propose a joint diversity algorithm for error-rate minimization in multi-user spatial multiplexing (SM) systems with block diagonalization (BD)-precoding. The proposed algorithm adapts or selects the user set, transmit antenna subset, and the number of streams by an exhaustive search over the available resources. The proposed algorithm makes use of the multi-user diversity (MUD) and the spatial diversity gains as well as the array gain through selecting the best set. Exhaustive search, however, imposes a heavy burden in terms of computational complexity which exponentially increases with the size of the total number of users, streams, and transmit antennas. For complexity reduction, we propose two suboptimal algorithms which reduce the search space by first selecting the best user or by both selecting the best user and fixing the number of streams. Simulation results show that the proposed algorithms improve error probability over the conventional algorithm due to their diversity improvement and the signal-to-noise ratio (SNR) gains over the conventional algorithm. We also show that the suboptimal algorithms significantly reduce the computational complexity over exhaustive search with low-SNR loss. © 2012 The Institute of Electronics, Information and Communication Engineers.
- KSP 제안 키워드
- Antenna Subset, Computational complexity, Information and communication, Low SNR, Multiuser diversity, Number of users, Search Space, Signal noise ratio(SNR), Signal-to-Noise, Spatial diversity(SD), array gain