# US 2004/0064781 A1 · Viterbi decoder and Viterbi decoding method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0064781 A1
- Document ID: US20040064781A1
- Status: Published application
- Kind: A1
- Application number: 10/673,255
- Filed: 2003-09-30
- Published: 2004-04-01
- Earliest claimed: 1999-10-01
- Assignees: Matsushita Electric Industrial Co., Ltd.
- Inventors: Takehiro Kamada
- Web page: https://patentgrep.com/patent/US20040064781A1

## CPC

- H03M 13/6502: {Reduction of hardware complexity or efficient processing}
- H03M 13/25: Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] {(modulation codes H03M13/31)}
- H03M 13/41: using the Viterbi algorithm or Viterbi processors
- H03M 13/4169: {using traceback (H03M13/4192 takes precedence)}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

In the Viterbi decoder for decoding a trellis-coded modulated signal of this invention, a path memory is constructed of a general RAM, whereby the circuit size and power consumption are reduced. A trace-back section traces back path select signals stored in a trace-back memory by a predetermined length. Using the number of a node through which a most likely path passes obtained by the tracing back and in accordance with a trellis diagram, a subset number generator section outputs coding bits relating to transition to the node concerned and a subset number. A selector section selectively outputs a noncoding bit relating to the transition to the node based on the subset number.

## Claims

### Claim 1

A Viterbi decoder for decoding a trellis-coded modulated signal, comprising:
a subset selector section for receiving a reception signal, selecting a transmission symbol having the highest likelihood with respect to a reception symbol point for each subset, and outputting a branch metric corresponding to the selected transmission symbol and a subset select signal for specifying the selected transmission symbol;
delays for delaying the subset select signals for a predetermined time;
an add-compare-select (ACS) section for receiving the branch metrics, performing arithmetic operation to obtain path metrics in accordance with a trellis diagram, and outputting path select signals for selecting paths having high likelihood;
a trace-back memory for storing the path select signals;
a trace-back section for tracing back the path select signals stored in the trace-back memory by a predetermined trace-back length from a start node number as a start point;
a subset number generator section for outputting, using the number of a first node through which a most likely path passes obtained by the trace-back section and in accordance with a trellis diagram, coding bits relating to transition to the first node and a subset number;
a selector section for receiving the subset number and the subset select signals output from the delays and outputting a noncoding bit relating to the transition to the first node; and
a LIFO memory for storing the coding bits output from the subset number generator section and the noncoding bit output from the selector section in combination and outputting the stored bits as a decoded signal.

### Claim 2 (depends on 1)

The Viterbi decoder of claim 1, further comprising a most likely path decision section for receiving the path metrics from the ACS section, detecting a most likely path among the received path metrics, and outputting a node number through which the detected path passes,
wherein the trace-back section determines the start node number based on the node number output from the most likely path decision section.

### Claim 3 (depends on 1)

The Viterbi decoder of claim 1, wherein the subset number generator section generates the coding bits and the subset number using the first node number and a second node number through which the most likely path has passed one time point before the first node.

### Claim 4 (depends on 3)

The Viterbi decoder of claim 3, wherein the subset number generator section has table data representing the relationship between a combination of the first and second node numbers and a combination of the coding bits and the subset number.

### Claim 5 (depends on 1)

The Viterbi decoder of claim 1, wherein the subset number generator section generates the coding bits and the subset number using the first node number and a path select signal corresponding to the first node.

### Claim 6 (depends on 5)

The Viterbi decoder of claim 5, wherein the subset number generator section has table data representing the relationship between a combination of the first node number and the path select signal and a combination of the coding bits and the subset number.

### Claim 7 (depends on 3, 5)

The Viterbi decoder of claim 3 or 5, wherein the subset number generator section includes an operator for performing arithmetic operation based on an generator polynomial of an encoder.

### Claim 8 (depends on 1)

The Viterbi decoder of claim 1, wherein the subset selector section generates the subset select signal so that the subset select signal matches the noncoding bit corresponding to the selected transmission symbol.

### Claim 9 (depends on 1)

The Viterbi decoder of claim 1, wherein the trace-back memory includes a RAM storing the subset select signals and the path select signals at the same addresses.
