U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method for a maximum likelihood decoding of a convolutional code with decision weighting, and corresponding decoder

Patent 5406570 Issued on April 11, 1995. Estimated Expiration Date: Icon_subject April 16, 2012. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Path trace viterbi decoder
Patent #: 4777636
Issued on: 10/11/1988
Inventor: Yamashita ,   et al.

Process for the decoding of a convolutional code and corresponding decoder
Patent #: 4811346
Issued on: 03/07/1989
Inventor: Battail

Maximum likelihood decoder
Patent #: 4823346
Issued on: 04/18/1989
Inventor: Kobayashi ,   et al.

Method and apparatus for implementing a traceback maximum-likelihood decoder in a hypercube network
Patent #: 4868830
Issued on: 09/19/1989
Inventor: Pollara-Bozzola

System and method for calculating channel gain and noise variance of a communication channel Patent #: 5214675
Issued on: 05/25/1993
Inventor: Mueller, et al.

Inventors

Assignee

Application

No. 870483 filed on 04/16/1992

US Classes:

714/792, Trellis code375/341, Maximum likelihood decoder or viterbi decoder714/787, Random and burst errors714/794, Maximum likelihood714/795Viterbi decoding

Examiners

Primary: Beausoliel, Robert W. Jr.
Assistant: Decady, Albert

Attorney, Agent or Firm

International Class

H01S 003/18

Foreign Application Priority Data

1991-04-23 FR

Abstract

A method for the decoding of digital data obtained according to a convolutional coding and transmitted on a noise-ridden channel aimed at improving the methods of maximum likelihood decoding such as the Viterbi algorithm consisting in associating, with each estimation s(t) of the corresponding source digital element a(t), a weighting coefficient m(t) representing the reliability of the estimation s(t), the estimation s(t) taking account of the values of a first series of L received samples, and the weighting m(t) taking account of the values of a second series of N samples received, N being strictly greater than L. In a preferred embodiment, a second trellis is associated with the standard first decoding trellis, a trace-back being done in the second trellis on two concurrent paths, used to revise the weighting coefficients obtained at output of the first trellis.

Other References

  • Gerhard Fettweis "Cascaded Feedforward Architectures For Parallel Viterbi Decoding" pp. 978-981 IEEE 1990
  • Hornj Bar et al. `Algorithms and Architectures For Concurrent Viterbi Decoding` pp. 836-840 IEEE 1989
  • Tajima, et al., "SST Viterbi Decoder Branch Metric Computation Based on MAP Estimation Method", The Transactions of the Insitute of Electronics, Information and Comm. Engineers E72 (1989) May, No. 5, Tokyo, JP
  • Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm", IEEE Transactions on Information Theory, vol. IT-13 No. 12, Apr. 1967, pp. 260-269
  • Forney, Jr., "The Viterbi Algorithm", Proceedings of the IEEE, vol. 61, No. 3, Mar. 1973, pp. 268-278
  • Battail, et al., "Decodage par Repliques", Ann. Telecommuniq. 31, No. 11-12, 197
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?