http://iet.metastore.ingenta.com
1887

Efficient complexity reduction technique in trellis decoding algorithm

Efficient complexity reduction technique in trellis decoding algorithm

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

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

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

An efficient reduced search trellis decoding algorithm in which the decoder selects a part of existing paths by using a threshold value of the path metric is proposed. The threshold value at each time stage of the trellis is found by simply investigating the statistics of the path metrics, and does not require any prior knowledge such as the signal-to-noise ratio.

References

    1. 1)
      • S.K. Shin , P. Sweeney . Soft decision decoding of Reed Solomon codes using trellis methods. IEE Proc., Commun. , 5 , 303 - 308
    2. 2)
      • S.K. Shin , P. Sweeney . An evaluation of efficient trellis methods for soft decision decoding of Reed Solomon codes. IEE Proc., Commun. , 2 , 61 - 67
    3. 3)
      • X.-H. Peng , P.G. Farrell . Efficient trellis decoding for both maximum and near-maximum likelihood performances. Electron. Lett. , 15 , 1306 - 1308
    4. 4)
      • S.J. Simmons . Breadth-first trellis decoding with adaptive effort. IEEE Trans. Commun. , 3 - 12
    5. 5)
      • B.J. Frey , F.R. Kschischang . Early detection and trellis spicing : Reduced-complexity iterative decoding. IEEE J. Sel. Areas Commun. , 2 , 153 - 159
    6. 6)
      • D.W. Matolak , S.G. Wilson . Variable-complexity trellis decoding of binary convolutional codes. IEEE Trans. Commun. , 2 , 121 - 126
    7. 7)
      • A. Papoulis . (1965) Probability, random variables, and stochastic processes.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990081
Loading

Related content

content/journals/10.1049/el_19990081
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address