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

Pipelined architecture to decode parallel and serial concatenated codes

Patent 6304995 Issued on October 16, 2001. Estimated Expiration Date: Icon_subject January 26, 2019. 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

Method and apparatus for implementing a maximum-likelihood decoder in a hypercube network
Patent #: 4730322
Issued on: 03/08/1988
Inventor: Pollara-Bozzola

Error-correction coding method with at least two systematic convolutional codings in parallel, corresponding iterative decoding method, decoding module and decoder
Patent #: 5446747
Issued on: 08/29/1995
Inventor: Berrou

Parallel concatenated tail-biting convolutional code and decoder therefor
Patent #: 5721745
Issued on: 02/24/1998
Inventor: Hladik, et al.

Method and coding means for protected transmission of data on the basis of multi-component coding
Patent #: 5729560
Issued on: 03/17/1998
Inventor: Hagenauer, et al.

Method and arrangement for determining an adaptive abort criterion in iterative decoding of multi-dimensionally coded information
Patent #: 5761248
Issued on: 06/02/1998
Inventor: Hagenauer, et al.

Communications systems and methods employing parallel coding without interleaving
Patent #: 5983385
Issued on: 11/09/1999
Inventor: Khayrallah, et al.

System for coding system
Patent #: 5996104
Issued on: 11/30/1999
Inventor: Herzberg

Repetitive turbo coding communication method
Patent #: 6014411
Issued on: 01/11/2000
Inventor: Wang

Hybrid concatenated codes and iterative decoding
Patent #: 6023783
Issued on: 02/08/2000
Inventor: Divsalar, et al.

Error-floor mitigating turbo code communication method
Patent #: 6028897
Issued on: 02/22/2000
Inventor: Wang

More ...

Inventors

Application

No. 237714 filed on 01/26/1999

US Classes:

714/786, Forward error correction by tree code (e.g., convolutional)714/796Branch metric calculation

Examiners

Primary: Decady, Albert
Assistant: Torres, Joseph D.

Attorney, Agent or Firm

International Class

H03M 013/03

Abstract

The present invention provides a method and apparatus (400) for iteratively decoding data which has been encoded with contatenated codes. The apparatus (400) includes pipelined and cascaded decoder processors (406, 430 and 436) connected to a multiple block memory device (402), through a multiplexing and data control block (404). A data decision element (437) is provided for generating decoded output data. The method includes receiving encoded data (802) while data already received is processed iteratively by decoder processors in a pipelined fashion. Decoder processors are designated to perform particular iterations (810) of an iterative decoding process which are performed simultaneously. As a decoder processor completes processing its designated iteration on a block of data, the decoder processor outputs decoding information (808) to the decoding processor designated to perform the subsequent iteration. Upon completion of all iterations for a block of data, the method includes generating output (814) consisting of the decoded data block. The method provides that once processing is complete on a data block, the memory block is made available (816) for the storing of new encoded input data.

Other References

  • D. Divsalar and F. Pollara, "On the Design of Turbo Codes", Communications Systems and Research Section, TDA Progress Report 42-123, Jet Propulsion Lab, NASA, Nov. 15, 1995.
  • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes, TDA Progress Report 42-124, Jet Propulsion Lab, NASA, Feb. 15, 1996.
  • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A Soft-Input Soft-Output Maximum A Posteriori (MAP) Module to Decode Parallel and Serial Concatenated Codes", TDA Progress Report 42-127, Jet Propulsion Lab, NASA, Nov. 15, 1996.
  • D. Divsalar and F. Pollara, "Multiple Turbo Codes for Deep-Space Communications", Communications Systems and Research Section, TDA Progress Report 42-121, Jet Propulsion Lab, NASA, May 15, 1995.
  • D. Raphaeli anfd Y Zarai, "Combined Turbo Equalization and Turbo Decoding", IEEE, 1997.
  • V. Franz and J. Anderson, "Concatenated Decoding with a Reduced-Search BCJR Algorithm", IEEE 1998.
  • L. Papke and K. Fazel, "Combined Multilevel Turbo-code with MR-modulation", IEEE, 1995.
  • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A Soft-Input Soft-Out-put APP Module for Iterative Decoding of Concatenated Codes", IEEE, 1997.
  • D. Divsalar and F. Pollara, "Hybrid Concatenated Codes and Iterative Decoding", Communications Systems and Research Section, TDA Progress Report 42-130, Jet Propulsion Lab, NASA, Aug. 15, 1997.
  • Blazek Z et al: "A DSP-Based Implementation of a Turbo-Decoder" IEEE Global Telecommunications Conference, US, New York, NY; IEEE, 1998, pp. 2751-2755, XP000801545 ISBN: 0-7803-4985-7, p. 2751, right-hand col., line 6-p. 2752, left-hand col., line 10; figure 1, p. 2753, paragraph 4-last paragraph
  • Sklar B; "Turbo Code Concepts Made Easy, or How I Learned to communicate and Reiterate" Annual Military Communications Conference, US, New York, NY: IEEE, 1997, pp. 20-26, XP000799643 ISBN: 0-7803-4250-X
  • Benedetto, S., Divsalar, D., Montorsi, G., and Pollara F., "Continuous Map Algorithms and Their Applications to Decode Pareallel and Serial Code Concatenations", Proceedings of the Fifth European Space Agency Workshop on Digital Signal Processing Techniques Applied to Space Communications, Sep. 1996, pp. 8.10-8.2
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
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?