FFT implementable CS-CDMA and its performance under polar clipping noise

Li, Yue; Hashimoto, Takeshi

doi:10.1109/iwsda.2011.6159415

Cited by 4 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For CCCCs, the resistance against clipping noise is considered to monotonically weaken with the increment of padding zeros [31] and, in this study, we only test the crude CCCCs.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…A key difference between CC-and CS-CDMA is that, in CC-CDMA, each user utilizes multiple spreading sequences as well as OFDMA while a single sequence is used in CS-CDMA. a OFDM like fast Fourier transform (FFT) based implementation structure for the transmitter of CCC-CDMA to reduce the computational complexity of the CS operation, and showed a trade-off relationship between clipping resistance and computational complexity [31], [32].…”

Section: ) Synchronizationmentioning

confidence: 99%

See 1 more Smart Citation

Concatenative Complete Complementary Code Division Multiple Access and Its Fast Transform

Mizuyoshi

Han

2023

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Over multipath channels, complete complementary code division multiple access (CC-CDMA) and convolutional spreading code division multiple access (CS-CDMA) provide inter-channel interference (ICI) free transmission with an enhanced spectral efficiency (SE). However, the convolutional spreading (CS) operation of the systems is computationally complex and involves a high peak-to-average power ratio (PAPR). To address such issues, we propose the concatenative complete complementary code (CCCC) division multiple access, named (CCC-CDMA). Since the CCCCs can be generated from the rows of the Walsh-Hadamard or discrete Fourier transform (DFT) matrices, the CS operation can be implemented using corresponding fast transforms (FTs) to reduce computational complexity. Simulation results show that the enlargement of the spreading factor (SF) strengthens the robustness against clipping noise. The binary CCCC generated by Walsh-Hadamard matrix exhibited excellent robustness against Doppler frequency shifts. Index Terms CDMA, complete complementary codes, zero correlation zone sequences, CC-CDMA, CS-CDMA I. INTRODUCTION To date, the generational changes of mobile communication technology have been primarily characterized by the adopted multiple access (MA) schemes. In the first generation, users have H. Mizuyoshi and C. Han was with the

show abstract

“…For CCCCs, the resistance against clipping noise is considered to monotonically weaken with the increment of padding zeros [31] and, in this study, we only test the crude CCCCs.…”

Section: Simulation Resultsmentioning

confidence: 99%

Section: ) Synchronizationmentioning

confidence: 99%

Concatenative Complete Complementary Code Division Multiple Access and Its Fast Transform

Mizuyoshi

Han

2023

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…For CCCCs, the resistance against clipping noise is known to be monotonically weaken with the increment of padding zeros [30] and, in this paper, we only test the crude CCCCs. respectively, and these are 1 symbol short for M-ZCZ.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…the CS operation, Han et al proposed a OFDM like fast Fourier transform (FFT) based implementation structure for the transmitter of CCC-CDMA and showed a trade-off relationship between clipping resistance and computational complexity[30].…”

mentioning

confidence: 99%

Concatenative Complete Complementary Code Division Multiple Access and its Fast Transform based Implementation

Mizuyoshi¹

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Over multipath channels, \textit{complete complementary code division multiple access} (CC-CDMA) and \textit{convolutional spreading code division multiple access} (CS-CDMA) provide {\it inter-channel interference} (ICI) free transmission with an enhanced {\it spectral efficiency} (SE). However, the {\it convolutional spreading} (CS) operation of the systems is computationally complex and involves a high \textit{peak-to-average power ratio} (PAPR). Address such issues, we propose the \textit{concatenative complete complementary code division multiple access} (CCC-CDMA). Since the CCCCs can be generated from the rows of the Walsh-Hadamard or \textit{discrete Fourier transform} (DFT) matrices, the CS operation can be implemented using corresponding {\it fast transforms} (FTs) to reduce computational complexity. Simulation results shown that enlargement of {\it spreading factor} (SF) strengthens the robustness against clipping noise and the binary CCCC generated by Walsh-Hadamard matrix has excellent robustness against Doppler frequency shifts.

show abstract

CS-CDMA System with Binary Z-connectable Complete Complementary Codes

Mizuyoshi

2019

2019 16th IEEE Annual Consumer Communications &Amp; Networking Conference (CCNC)

View full text Add to dashboard Cite

FFT implementable CS-CDMA and its performance under polar clipping noise

Cited by 4 publications

References 14 publications

Concatenative Complete Complementary Code Division Multiple Access and Its Fast Transform

Concatenative Complete Complementary Code Division Multiple Access and Its Fast Transform

Concatenative Complete Complementary Code Division Multiple Access and its Fast Transform based Implementation

CS-CDMA System with Binary Z-connectable Complete Complementary Codes

Contact Info

Product

Resources

About