New! View global litigation for patent families

GB2305827B - Viterbi co-processor and method of operation therefor - Google Patents

Viterbi co-processor and method of operation therefor

Info

Publication number
GB2305827B
GB2305827B GB9519995A GB9519995A GB2305827B GB 2305827 B GB2305827 B GB 2305827B GB 9519995 A GB9519995 A GB 9519995A GB 9519995 A GB9519995 A GB 9519995A GB 2305827 B GB2305827 B GB 2305827B
Authority
GB
Grant status
Grant
Patent type
Prior art keywords
path
state
calculations
metric
branch
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
GB9519995A
Other versions
GB2305827A (en )
GB9519995D0 (en )
Inventor
Paul Adrian Golding
Irwin Russell Bennett
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Motorola Solutions Inc
Original Assignee
Motorola Solutions Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0054Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4115Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors list output Viterbi decoding
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4138Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions
    • H03M13/4146Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions soft-output Viterbi decoding according to Battail and Hagenauer in which the soft-output is determined using path metric differences along the maximum-likelihood path, i.e. "SOVA" decoding
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4138Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions
    • H03M13/4146Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions soft-output Viterbi decoding according to Battail and Hagenauer in which the soft-output is determined using path metric differences along the maximum-likelihood path, i.e. "SOVA" decoding
    • H03M13/4153Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions soft-output Viterbi decoding according to Battail and Hagenauer in which the soft-output is determined using path metric differences along the maximum-likelihood path, i.e. "SOVA" decoding two-step SOVA decoding, i.e. the soft-output is determined by a second traceback operation after the determination of the hard decision like in the Berrou decoder
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H03M13/4161Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors implementing path management
    • H03M13/4169Sequence 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
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/65Purpose and implementation aspects
    • H03M13/6502Reduction of hardware complexity or efficient processing
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/65Purpose and implementation aspects
    • H03M13/6502Reduction of hardware complexity or efficient processing
    • H03M13/6505Memory efficient implementations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0052Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H04L1/0053Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables specially adapted for power saving

Abstract

The Viterbi state trellis (120) was Window Error Detection and effects two passes of a frame through the trellis (120). During a first pass, metric-difference calculations are suspended, but path metric calculations are indexed. At an identified branch, trellis data words (138-144) are recorded and associated with the branch. Upon completion of the first pass, a desired survivor path is determined and "traced-back" to its corresponding state in the identified branch using indexed path metrics, for example. The path metric corresponding to this state is nominally reloaded and, starting from that state, decoding of the frame occurs for a second pass while metric-difference (L-value) calculations are performed on the desired survivor path only, and only a single lowest L-value for the desired survivor path is recorded. This is intended to reduce memory space for the calculations and reduce power requirements. It may be used in GSM cellular communications using forward error correction.
GB9519995A 1995-09-30 1995-09-30 Viterbi co-processor and method of operation therefor Expired - Fee Related GB2305827B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB9519995A GB2305827B (en) 1995-09-30 1995-09-30 Viterbi co-processor and method of operation therefor

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
GB9519995A GB2305827B (en) 1995-09-30 1995-09-30 Viterbi co-processor and method of operation therefor
CN 96197832 CN1200849A (en) 1995-09-30 1996-09-24 Viterbi co-processor and method of operation therefor
EP19960933367 EP0855107A1 (en) 1995-09-30 1996-09-24 Viterbi co-processor and method of operation therefor
PCT/EP1996/004160 WO1997013327A1 (en) 1995-09-30 1996-09-24 Viterbi co-processor and method of operation therefor
JP51393797A JPH11513544A (en) 1995-09-30 1996-09-24 Viterbi co-processor and method thereof

Publications (3)

Publication Number Publication Date
GB9519995D0 GB9519995D0 (en) 1995-12-06
GB2305827A true GB2305827A (en) 1997-04-16
GB2305827B true GB2305827B (en) 2000-01-19

Family

ID=10781562

Family Applications (1)

Application Number Title Priority Date Filing Date
GB9519995A Expired - Fee Related GB2305827B (en) 1995-09-30 1995-09-30 Viterbi co-processor and method of operation therefor

Country Status (5)

Country Link
EP (1) EP0855107A1 (en)
JP (1) JPH11513544A (en)
CN (1) CN1200849A (en)
GB (1) GB2305827B (en)
WO (1) WO1997013327A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100190291B1 (en) * 1996-07-30 1999-06-01 윤종용 Trellis back control device of viterbi decoder
CN1154284C (en) * 1997-06-13 2004-06-16 西门子公司 Source-controlled channel decoding using intra-frame correlation
FI104774B (en) 1998-03-23 2000-03-31 Nokia Networks Oy A method and apparatus for detecting the modulation of
FI106416B (en) 1999-02-09 2001-01-31 Nokia Mobile Phones Ltd A method and apparatus for determining the reliability of a decoded symbol sequence
JP3374908B2 (en) * 1999-05-06 2003-02-10 日本電気株式会社 The method of updating the reference value in high speed closed loop mode transmit power control
EP1334563B1 (en) * 2000-10-24 2004-12-29 Infineon Technologies AG Method and device for decoding a sequence of physical signals, reliability detection unit and viterbi decoding unit
US20100278287A1 (en) * 2003-03-27 2010-11-04 Nokia Corporation List Output Viterbi Deconder with Blockwise ACS and Traceback

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3600905A1 (en) * 1986-01-15 1987-07-16 Ant Nachrichtentech A method of decoding binary signals and Viterbi decoder and Applications
DE3725655A1 (en) * 1987-08-03 1989-02-16 Ant Nachrichtentech A method for evaluating branch and path metrics and arrangement
BE1004814A3 (en) * 1991-05-08 1993-02-02 Bell Telephone Mfg Decoder.
US5408502A (en) * 1992-07-13 1995-04-18 General Instrument Corporation Apparatus and method for communicating digital data using trellis coded QAM with punctured convolutional codes
US5430768A (en) * 1994-09-21 1995-07-04 Seagate Technology, Inc. Maximum likelihood detector for a disc drive PRML read channel

Also Published As

Publication number Publication date Type
JPH11513544A (en) 1999-11-16 application
GB2305827A (en) 1997-04-16 application
WO1997013327A1 (en) 1997-04-10 application
CN1200849A (en) 1998-12-02 application
EP0855107A1 (en) 1998-07-29 application
GB9519995D0 (en) 1995-12-06 grant

Similar Documents

Publication Publication Date Title
Bauch et al. A comparison of soft-in/soft-out algorithms for turbo detection
US6901117B1 (en) Soft output decoder for convolutional codes
US5721746A (en) Optimal soft-output decoder for tail-biting trellis codes
US6885711B2 (en) Turbo decoder with multiple scale selections
US4583078A (en) Serial Viterbi decoder
US6829313B1 (en) Sliding window turbo decoder
US6065149A (en) Error correction device for a communication system
US6671852B1 (en) Syndrome assisted iterative decoder for turbo codes
US5014276A (en) Convolutional encoder and sequential decoder with parallel architecture and block coding properties
US6725409B1 (en) DSP instruction for turbo decoding
US6865710B2 (en) Butterfly processor for telecommunications
US6445755B1 (en) Two-step soft output viterbi algorithm decoder using modified trace back
Niu et al. CRC-aided decoding of polar codes
EP0413505A1 (en) Generalized viterbi decoding algorithms
US5933462A (en) Soft decision output decoder for decoding convolutionally encoded codewords
US6452979B1 (en) Soft output decoder for convolutional codes
US6708308B2 (en) Soft output viterbi algorithm (SOVA) with error filters
US6484285B1 (en) Tailbiting decoder and method
US6754290B1 (en) Highly parallel map decoder
US20020124227A1 (en) High speed turbo codes decoder for 3G using pipelined SISO log-map decoders architecture
US6434203B1 (en) Memory architecture for map decoder
US7116732B2 (en) Method and apparatus for decoding a bit sequence
US5710784A (en) Multirate serial viterbi decoder for code division multiple access system applications
US20040205445A1 (en) Turbo decoder employing simplified log-map decoding
US6189126B1 (en) Efficient trellis state metric normalization

Legal Events

Date Code Title Description
PCNP Patent ceased through non-payment of renewal fee

Effective date: 20000419