Abstract
This paper presents a novel low-complexity deter- ministic technique for the generation of DS-CDMA signature sequences with a wide range of correlation properties that is based on the well-known Viterbi search algorithm. This approach provides a fast method of generating binary or polyphase codes with no inherent constraints on code length or size of the codeset. In addition, the algorithm is iterative and provides increasingly better codes in terms of average mean-square aperiodic cor- relation properties as the number of iterations increases. We build on the results in (1) and develop a much-lower-complexity version of the algorithm that could allow for some level of signature-sequence adaptation in a near-real-time environment. The algorithm is shown to outperform existing complex-code design techniques and provides codes with similar correlation properties to well-known codesets while using significantly fewer unique phases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
