Abstract
Owing to their ideal correlation properties, complete complementary codes (CCC) have found numerous applications in wireless engineering, in particular they have been employed to support interference-free multi-carrier code-division multiple access systems with improved spectral efficiency. In this paper, we propose a simple construction of CCCs of length Nn (n e N) based on paraunitary matrices of size N × N. This algorithm can generate CCCs from N-shift cross-orthogonal sequence sets for n > 1. Then, we introduce an easy implementation of the proposed algorithm by multiplexers and read-only memories (ROMs), i.e., a multiplier-free implementation. As multipliers are avoided, substantial reduction of construction complexity for CCCs is obtained as compared to the existing works.
| Original language | English |
|---|---|
| Title of host publication | 2017 23rd Asia-Pacific Conference on Communications |
| Subtitle of host publication | Bridging the Metropolitan and the Remote, APCC 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1-6 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781740523905 |
| DOIs | |
| Publication status | Published - Jul 2 2017 |
| Externally published | Yes |
| Event | 23rd Asia-Pacific Conference on Communications, APCC 2017 - Perth, Australia Duration: Dec 11 2017 → Dec 13 2017 |
Publication series
| Name | 2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017 |
|---|---|
| Volume | 2018-January |
Conference
| Conference | 23rd Asia-Pacific Conference on Communications, APCC 2017 |
|---|---|
| Country/Territory | Australia |
| City | Perth |
| Period | 12/11/17 → 12/13/17 |
Bibliographical note
Publisher Copyright:© 2017 University of Western Australia.
ASJC Scopus Subject Areas
- Signal Processing
- Computer Networks and Communications