A fast algorithm for computing distance spectrum of convolutional codes
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
New rate-compatible convolutional (RCC) codes with high constraint lengths and a wide range of code rates are presented. These new codes originate from rate 1/4 optimum distance spectrum (ODS) convolutional parent encoders with constraint lengths 7-10. Low rate encoders (rates 115 down to 1/10) are found by a nested search, and high rate encoders (rates above 1/4) are found by rate-compatible puncturing. The new codes form rate-compatible code families more powerful and flexible than those previously presented. It is shown that these codes are almost as good as the existing optimum convolutional codes of the same fates. The effects of varying the design parameters of the rate-compatible punctured convolutional (RCPC) codes, i.e., the parent encoder rate, the puncturing period, and the constraint length, are also examined. The new codes are then applied to a multicode direct-sequence code-division multiple-access (DS-CDMA) system and are shown to provide good performance and rate-matching capabilities. The results, which are evaluated in terms of the efficiency for Gaussian and Rayleigh fading channels, show that the system efficiency increases with decreasing code rate
- Technology and Engineering
"This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
- ISSN: 0090-6778