State recovery techniques for (M,L) algorithm

Access Full Text

State recovery techniques for (M,L) algorithm

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

A breadth-first decoding algorithm, the (M,L) algorithm, is applied to the decoding of convolutional codes. Simulated performances obtained for codes with rate 1/n are presented. The problem of the loss of the correct state from the set of retained states is considered, together with its influence on the decoding performance. Two recovery techniques that can avoid this problem are proposed and analysed.

Inspec keywords: decoding

Other keywords: state recovery techniques; decoding performance; decoding of convolutional codes; breadth-first decoding algorithm; (M,L) algorithm

Subjects: Codes

References

    1. 1)
      • Benedetto, S., Mondin, M.: `(M, L) algorithms for reduced complexity decoding of convolutional codes', DSP90, Conf. Proc., 24–25th September 1990, Turin, Italy.
    2. 2)
      • J.B. Anderson , S. Mohan . Sequential coding algorithms: a survey and cost analysis. IEEE Trans. , 169 - 176
    3. 3)
      • Lin, C.-F., Anderson, J.B.: `M-algorithm decoding with path recovery for convolutional channel codes', Conf. Proc., 1986, Houston, GLOBECOM.
    4. 4)
      • Benedetto, S., Mondin, M.: `Performance analysis of (M, L) algorithms', Conf. Proc., TENCON '89, November 1989, Bombay, India.
    5. 5)
      • T. Aulin . (1985) , Study of a new trellis decoding algorithm and its applications.
    6. 6)
      • Roethlisberger, U.: `A path recovery scheme for the truncated Viterbi algorithm', 1988, Master Thesis, Rensselaer Polytechnic Institute, Troy, USA.
    7. 7)
      • S.J. Simmons . A nonsorting VLSI structure for implementing the (M, L) algorithm. IEEE J. Sel. Areas Commun. , 538 - 546
    8. 8)
      • J.L. Massey , D.J. Costello , Jun . Nonsystematic convolutional codes for sequential decoding in space applications. IEEE Trans. , 806 - 813
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19910364
Loading

Related content

content/journals/10.1049/el_19910364
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading