A multiplier-free generator for polyphase complete complementary codes
Complementary sets of sequences (CSS) and complete complementary codes (CCC) have found numerous applications in wireless communications and radar sensing owing to their perfect aperiodic correlation properties. In this paper, we first present a new algorithm for generating polyphase CSS and CCC bas...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/85317 http://hdl.handle.net/10220/49211 |
| _version_ | 1811694352677732352 |
|---|---|
| author | Majhi, Sudhan Liu, Zilong Guan, Yong Liang Das, Shibsankar Budisin, Srdjan |
| author2 | School of Electrical and Electronic Engineering |
| author_facet | School of Electrical and Electronic Engineering Majhi, Sudhan Liu, Zilong Guan, Yong Liang Das, Shibsankar Budisin, Srdjan |
| author_sort | Majhi, Sudhan |
| collection | NTU |
| description | Complementary sets of sequences (CSS) and complete complementary codes (CCC) have found numerous applications in wireless communications and radar sensing owing to their perfect aperiodic correlation properties. In this paper, we first present a new algorithm for generating polyphase CSS and CCC based on paraunitary (PU) matrices which uses equivalent forms of unimodular unitary matrices. Then, we propose a multiplier-free implementation of this generator based on multiplexers and read-only memories (ROMs). Our proposed algorithm generalizes the previous PU generator for complementary pairs by Budišin and Spasojević. Some previous algorithms for CSS and CCC can also be derived from our CCC generator as special cases. In addition, we give the enumeration formula and show that the number of generated sequences is significantly higher compared to previous works. |
| first_indexed | 2024-10-01T07:06:13Z |
| format | Journal Article |
| id | ntu-10356/85317 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:06:13Z |
| publishDate | 2019 |
| record_format | dspace |
| spelling | ntu-10356/853172020-03-07T13:57:27Z A multiplier-free generator for polyphase complete complementary codes Majhi, Sudhan Liu, Zilong Guan, Yong Liang Das, Shibsankar Budisin, Srdjan School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Complementary Sets Of Sequences (CSS) Complete Complementary Codes (CCC) Complementary sets of sequences (CSS) and complete complementary codes (CCC) have found numerous applications in wireless communications and radar sensing owing to their perfect aperiodic correlation properties. In this paper, we first present a new algorithm for generating polyphase CSS and CCC based on paraunitary (PU) matrices which uses equivalent forms of unimodular unitary matrices. Then, we propose a multiplier-free implementation of this generator based on multiplexers and read-only memories (ROMs). Our proposed algorithm generalizes the previous PU generator for complementary pairs by Budišin and Spasojević. Some previous algorithms for CSS and CCC can also be derived from our CCC generator as special cases. In addition, we give the enumeration formula and show that the number of generated sequences is significantly higher compared to previous works. 2019-07-09T06:48:12Z 2019-12-06T16:01:25Z 2019-07-09T06:48:12Z 2019-12-06T16:01:25Z 2018 Journal Article Das, S., Budisin, S., Majhi, S., Liu, Z., & Guan, Y. L. (2018). A Multiplier-Free Generator for Polyphase Complete Complementary Codes. IEEE Transactions on Signal Processing, 66(5), 1184-1196. doi:10.1109/TSP.2017.2780050 1053-587X https://hdl.handle.net/10356/85317 http://hdl.handle.net/10220/49211 10.1109/TSP.2017.2780050 en IEEE Transactions on Signal Processing © 2017 IEEE. All rights reserved. |
| spellingShingle | Engineering::Electrical and electronic engineering Complementary Sets Of Sequences (CSS) Complete Complementary Codes (CCC) Majhi, Sudhan Liu, Zilong Guan, Yong Liang Das, Shibsankar Budisin, Srdjan A multiplier-free generator for polyphase complete complementary codes |
| title | A multiplier-free generator for polyphase complete complementary codes |
| title_full | A multiplier-free generator for polyphase complete complementary codes |
| title_fullStr | A multiplier-free generator for polyphase complete complementary codes |
| title_full_unstemmed | A multiplier-free generator for polyphase complete complementary codes |
| title_short | A multiplier-free generator for polyphase complete complementary codes |
| title_sort | multiplier free generator for polyphase complete complementary codes |
| topic | Engineering::Electrical and electronic engineering Complementary Sets Of Sequences (CSS) Complete Complementary Codes (CCC) |
| url | https://hdl.handle.net/10356/85317 http://hdl.handle.net/10220/49211 |
| work_keys_str_mv | AT majhisudhan amultiplierfreegeneratorforpolyphasecompletecomplementarycodes AT liuzilong amultiplierfreegeneratorforpolyphasecompletecomplementarycodes AT guanyongliang amultiplierfreegeneratorforpolyphasecompletecomplementarycodes AT dasshibsankar amultiplierfreegeneratorforpolyphasecompletecomplementarycodes AT budisinsrdjan amultiplierfreegeneratorforpolyphasecompletecomplementarycodes AT majhisudhan multiplierfreegeneratorforpolyphasecompletecomplementarycodes AT liuzilong multiplierfreegeneratorforpolyphasecompletecomplementarycodes AT guanyongliang multiplierfreegeneratorforpolyphasecompletecomplementarycodes AT dasshibsankar multiplierfreegeneratorforpolyphasecompletecomplementarycodes AT budisinsrdjan multiplierfreegeneratorforpolyphasecompletecomplementarycodes |