TY - GEN
T1 - Cell search for cell-based OFDM systems using quasi complete complementary codes
AU - Chen, Chao-Yu
AU - Min, Ying Ju
AU - Lu, Kuei Ying
AU - Chao, Chi Chao
PY - 2008/9/12
Y1 - 2008/9/12
N2 - Establishing a radio link in cell-based mobile communication systems involves searching and synchronizing the downlink known pattern of sequences associated with the base stations. The performance of the searching process, often referred to as cell search, depends greatly on the employed preamble sequences. In this paper, we propose a construction of quasi complete complementary codes (QCCCs) from Reed-Muller codes and, due to their good auto-correlation and cross-correlation properties, a preamble structure based on QCCCs. Furthermore, the constructed QCCCs have low peak-to-average power ratios (PAPRs) and hence are suitable for use in orthogonal frequency division multiplexing (OFDM) systems. Simulation results show that the QCCC-based preambles outperform the preambles employed in the WiMAX system, both in terms of PAPR and cell search performance. Moreover, the rich algebraic structures of QCCCs potentially admit low-complexity encoding and decoding.
AB - Establishing a radio link in cell-based mobile communication systems involves searching and synchronizing the downlink known pattern of sequences associated with the base stations. The performance of the searching process, often referred to as cell search, depends greatly on the employed preamble sequences. In this paper, we propose a construction of quasi complete complementary codes (QCCCs) from Reed-Muller codes and, due to their good auto-correlation and cross-correlation properties, a preamble structure based on QCCCs. Furthermore, the constructed QCCCs have low peak-to-average power ratios (PAPRs) and hence are suitable for use in orthogonal frequency division multiplexing (OFDM) systems. Simulation results show that the QCCC-based preambles outperform the preambles employed in the WiMAX system, both in terms of PAPR and cell search performance. Moreover, the rich algebraic structures of QCCCs potentially admit low-complexity encoding and decoding.
UR - http://www.scopus.com/inward/record.url?scp=51249124221&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51249124221&partnerID=8YFLogxK
U2 - 10.1109/ICC.2008.907
DO - 10.1109/ICC.2008.907
M3 - Conference contribution
AN - SCOPUS:51249124221
SN - 9781424420742
T3 - IEEE International Conference on Communications
SP - 4840
EP - 4844
BT - ICC 2008 - IEEE International Conference on Communications, Proceedings
T2 - IEEE International Conference on Communications, ICC 2008
Y2 - 19 May 2008 through 23 May 2008
ER -