TY - GEN
T1 - A CP-CDMA system with comb spectrum codes and its performance evaluation in Nakagami fading channels
AU - Cheng, Hongbing
AU - Jiaot, Bingli
AU - Yao, Yu Dong
PY - 2008
Y1 - 2008
N2 - Cyclic prefix code division multiple access (CP-CDMA) is a promising technology for broadband wireless communications. It can efficiently resist the multiple access interference (MAI) by the use of CP and frequency domain equalization in DS-CDMA systems. However, the equalization complexity, which is increased with bandwidth, hindered its application. A comb spectrum (CS) code was proposed to solve this problem. This technology combines the frequency orthogonality of orthogonal frequency division multiplexing (OFDM) to CDMA code design for grouping the codes and allows a significant reduction for the calculations in channel equalization. The proposed code design method divides the codes of M chips in length into N groups, which are orthogonal to each other in frequency domain. Each of the groups contains K codes which are mutually orthogonal in time domain. A CP-CDMA system with CS code is described and its complexity and BER performance are evaluated in this paper to show the effectiveness of the CS codes.
AB - Cyclic prefix code division multiple access (CP-CDMA) is a promising technology for broadband wireless communications. It can efficiently resist the multiple access interference (MAI) by the use of CP and frequency domain equalization in DS-CDMA systems. However, the equalization complexity, which is increased with bandwidth, hindered its application. A comb spectrum (CS) code was proposed to solve this problem. This technology combines the frequency orthogonality of orthogonal frequency division multiplexing (OFDM) to CDMA code design for grouping the codes and allows a significant reduction for the calculations in channel equalization. The proposed code design method divides the codes of M chips in length into N groups, which are orthogonal to each other in frequency domain. Each of the groups contains K codes which are mutually orthogonal in time domain. A CP-CDMA system with CS code is described and its complexity and BER performance are evaluated in this paper to show the effectiveness of the CS codes.
UR - http://www.scopus.com/inward/record.url?scp=49049109915&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49049109915&partnerID=8YFLogxK
U2 - 10.1109/SARNOF.2008.4520111
DO - 10.1109/SARNOF.2008.4520111
M3 - Conference contribution
AN - SCOPUS:49049109915
SN - 1424418437
SN - 9781424418435
T3 - Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF
BT - Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF
T2 - 2008 IEEE Sarnoff Symposium, SARNOFF
Y2 - 28 April 2008 through 30 April 2008
ER -