Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Reduced-state sequence detection with convolutional codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anderson, J.B. ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; Offer, E.

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-algorithm

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 3 )