The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jan. 20, 2004

Filed:

Nov. 22, 1999
Applicant:
Inventor:

Farhad Hemmati, Rockville, MD (US);

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 2/706 ; H04L 2/302 ; H03M 1/303 ;
U.S. Cl.
CPC ...
H04L 2/706 ; H04L 2/302 ; H03M 1/303 ;
Abstract

A decoding method and apparatus, using the Viterbi algorithm for selecting survivor paths terminating on each trellis state, applied for realization of a shared channel decoder (SCD). The shared channel decoder include a branch metric calculator for calculating branch metrics B , a plurality of ACS units for computing and exchanging new path metrics &Ggr; and survivor paths E , a memory (RAM) for storing new path metrics &Ggr; and survivor paths E , and a memory (RAM) for storing previous path metrics &Ggr; and previous survivor paths E . The branch metrics B is the set of branch metrics for decoding step t (e.g., for a code rate of ½, B ={B , B , B , B }), the path metrics &Ggr; is the set of S survivor metrics {&ggr; , &ggr; , . . . , &ggr; } at decoding step t and the survivor paths E is the set of S survivor metrics {E ,E , . . . , E } where S is the number of decoder states. In one embodiment, the shared channel decoder includes a branch metric queue for storing branch metrics B , a tentative path metric memory for storing tentative path metrics &Ggr; , and a multiplexer (selector) for selecting the previous path metrics &Ggr; when t≠T+cD, and selecting the tentative path metrics &Ggr; when t=T+cD. In an alternative embodiment, the size of required RAM is traded off against the decoder BER performance, but tentative path metrics are not stored when t=(c+1)D. Instead, when t=T+cD, the state j having best path metric is selected and the contents of the survivor register, denoted by E , are output as the D decoded bits.


Find Patent Forward Citations

Loading…