Advanced

A fast algorithm for computing distance spectrum of convolutional codes

Cedervall, Mats LU and Johannesson, Rolf LU (1989) In IEEE Transactions on Communications 35(6). p.1146-1159
Abstract
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... (More)
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 (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Transactions on Communications
volume
35
issue
6
pages
1146 - 1159
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • Scopus:0024766697
ISSN
0090-6778
DOI
10.1109/18.45271
language
English
LU publication?
yes
id
93351760-2394-4a87-aedd-945416b5666b (old id 1056902)
date added to LUP
2008-04-11 13:37:07
date last changed
2016-10-13 04:31:58
@misc{93351760-2394-4a87-aedd-945416b5666b,
  abstract     = {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},
  author       = {Cedervall, Mats and Johannesson, Rolf},
  issn         = {0090-6778},
  language     = {eng},
  number       = {6},
  pages        = {1146--1159},
  publisher    = {ARRAY(0x90986d0)},
  series       = {IEEE Transactions on Communications},
  title        = {A fast algorithm for computing distance spectrum of convolutional codes},
  url          = {http://dx.doi.org/10.1109/18.45271},
  volume       = {35},
  year         = {1989},
}