Abstract
In this paper, we consider block spread code division multiple access (BS-CDMA) systems using Chu sequences as the spreading codes, namely the Chu-BS-CDMA systems, and study the percoder design for such systems. We show that Chu-BS-CDMA using the conventional zero-padding precoder and minimum mean squared error (MMSE) detector yields an inferior performance, while that using the existing optimal S-precoder with successive detection yields a substantial performance gain with a high computational complexity. To combat the disadvantages occurred in the aforementioned two types of precoders, we propose in this paper a novel suboptimal precoder design, where Chu-BS-CDMA using the proposed precoder and decoder and successive detection is shown to achieve a performance comparable to that using the optimal S-precoder, while offering a much reduced complexity. In particular, the design of optimal S-precoder requires channel state information (CSI) and iterative eigen-value decompositions at the transmitter, while the proposed precoder and decoder design does not.
Original language | English |
---|---|
Title of host publication | IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2011. PacRim 2011. |
Place of Publication | NEW YORK |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 310-315 |
Number of pages | 6 |
ISBN (Print) | 978-1-4577-0251-8 |
Publication status | Published - Aug 2011 |
Event | IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) - Victoria, Canada Duration: 23 Aug 2011 → 26 Aug 2011 |
Conference
Conference | IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) |
---|---|
Country/Territory | Canada |
City | Victoria |
Period | 23/08/11 → 26/08/11 |