Collins et al., 1989 - Google Patents
Memory management in traceback Viterbi decodersCollins et al., 1989
View PDF- Document ID
- 330768056598896158
- Author
- Collins O
- Pollara F
- Publication year
- Publication venue
- The Telecommunications and Data Acquisition Report
External Links
Snippet
The new Viterbi decoder for long constraint length codes, under development for the Deep Space Network, stores path information according to an algorithm called traceback. The details of a particular implementation of this algorithm, based on three memory buffers, are …
- 230000015654 memory 0 title abstract description 47
Classifications
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
- H03M13/4107—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing add, compare, select [ACS] operations
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
- H03M13/4161—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management
- H03M13/4169—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management using traceback
- H03M13/4176—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management using traceback using a plurality of RAMs, e.g. for carrying out a plurality of traceback implementations simultaneously
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/65—Purpose and implementation aspects
- H03M13/6502—Reduction of hardware complexity or efficient processing
- H03M13/6505—Memory efficient implementations
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3972—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using sliding window techniques or parallel windows
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3900637B2 (en) | Viterbi decoder | |
| JP3747604B2 (en) | Viterbi decoder | |
| US5787127A (en) | Viterbi decoding method and apparatus with balance among memory and processing requirements | |
| KR100426712B1 (en) | Viterbi decoder | |
| Collins et al. | Memory management in traceback Viterbi decoders | |
| US7246298B2 (en) | Unified viterbi/turbo decoder for mobile communication systems | |
| JP2996615B2 (en) | Viterbi decoding apparatus and method | |
| KR20020048975A (en) | High-speed acs unit for a viterbi decoder | |
| Cypher et al. | Generalized trace-back techniques for survivor memory management in the Viterbi algorithm | |
| Feygin et al. | Survivor sequence memory management in Viterbi decoders | |
| US5712880A (en) | Traceback-performing apparatus in viterbi decoder | |
| US7590928B2 (en) | Apparatus and method for Viterbi decoding | |
| US6601215B1 (en) | Traceback buffer management for VLSI Viterbi decoders | |
| KR100785671B1 (en) | Method and apparatus for efficiently reading and storing state metrics in memory for high-speed acs viterbi decoder implementations | |
| EP1739843B1 (en) | Power efficient Viterbi decoder | |
| US7035356B1 (en) | Efficient method for traceback decoding of trellis (Viterbi) codes | |
| ResearchSection | Memory Management in Traceback Viterbi Decoders | |
| US5828675A (en) | Viterbi decoder circuit | |
| Pollara | Memory Management in Traceback Viterbi Decoders | |
| JPH1155130A (en) | Viterbi decoder | |
| CN1787386A (en) | Method for path measuring me mory of viterbi decoder | |
| JP4047697B2 (en) | Viterbi decoder | |
| JP3753822B2 (en) | Viterbi decoding method and apparatus | |
| EP1192719A1 (en) | Viterbi decoder | |
| US20050257123A1 (en) | Memory management algorithm for trellis decoders |