Reduced-state sequence detection with convolutional codes
- 1 May 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (3) , 965-972
- https://doi.org/10.1109/18.335914
Abstract
Reduced-state sequence detection (RSSD) reduces the state trellis of a channel code by forming the states into classes. States within a class are such that paths into the states lie further than a distance parameter d from each other. An RSSD decoder retains only one survivor per class at each trellis level. The authors apply RSSD to ordinary binary convolutional codes. They first give a class-forming algorithm that finds the greatest reduction. It turns out that no commonly tabulated good code benefits from RSSD. However, RSSD is an effective way to repair weaker codes, such as quick look-in and RCPC codes. Finally, the authors show that RSSD cannot be more efficient than the M-algorithmKeywords
This publication has 8 references indexed in Scilit:
- Reduced-search trellis decoding of coded modulations over ISI channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reduced state sequence detection of partial response continuous phase modulationIEE Proceedings I Communications, Speech and Vision, 1991
- Source and Channel CodingPublished by Springer Nature ,1991
- Reduced state sequence detection of full response continuous phase modulationElectronics Letters, 1990
- Decoding of trellis-encoded signals in the presence of intersymbol interference and noiseIEEE Transactions on Communications, 1989
- Limited search trellis decoding of convolutional codesIEEE Transactions on Information Theory, 1989
- Reduced-state sequence estimation for coded modulation of intersymbol interference channelsIEEE Journal on Selected Areas in Communications, 1989
- Rate-compatible punctured convolutional codes (RCPC codes) and their applicationsIEEE Transactions on Communications, 1988