# US 2001/0022819 A1 · Coding method for reducing number of state transition paths determined in accordance with code sequence, and communication system for transmitting information by using the coding method

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

- Number: US 2001/0022819 A1
- Document ID: US20010022819A1
- Status: Published application
- Kind: A1
- Application number: 09/793,483
- Filed: 2001-02-27
- Published: 2001-09-20
- Earliest claimed: 2000-03-03
- Assignees: NEC Corporation
- Inventors: Yoshikazu Kakura
- Web page: https://patentgrep.com/patent/US20010022819A1

## CPC

- H04L 1/006: {Trellis-coded modulation}
- H03M 13/39: Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M 13/41: using the Viterbi algorithm or Viterbi processors
- H03M 13/4107: {implementing add, compare, select [ACS] operations}
- H03M 13/6505: {Memory efficient implementations}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0052: {Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables}
- H04L 1/0054: {Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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

A communication system is composed of an encoder encoding an input sequence to sequentially generate output codes X0, X1, . . . , and a decoder decoding the output codes by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L. The output code Xk of the output codes X0, X1, . . . is determined based on the input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number. The output code Xi(N+1) of the output codes X0, X1, . . . are uniquely determined based on a subset of a set consisting of the output codes Xi(N+1)−L+1, Xi(N+1)−L+2, . . . , Xi(N+1)−1 of the output codes X0, X1, . . . The subset includes the output code X1(N+1)−L+1 of the output codes Xi(N+1)−L+1, Xi(N+1)−L+2, X1 (N+1)−1.

## Claims

### Claim 1

A communication system comprising:
an encoder encoding an input sequence to sequentially generate output codes X0, X1, . . . ; and
a decoder decoding said output codes by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said output code Xk of said output codes X0, X1, . . . is determined based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
wherein said output code Xi(N+1) of said output codes X0, X1, . . . are uniquely determined based on a subset of a set consisting of said output codes Xi(N+1)−L+1, Xi(N+1)−L+2, . . . , Xi(N+1)−1 of said output codes X0, X1, . . . and
wherein said subset includes said output code X1(N+1)−L+1 of said output codes Xi(N+1)−L+1, Xi(N+1)−L+2, X1(N+1)−1.

### Claim 2 (depends on 1)

The communication system according to claim 1, wherein said N is one, and said output code X2i is expressed as:
X2l=f( X2i−1, X2l−2, . . . , X2l−L+1),
where f is a function.

### Claim 3 (depends on 2)

The communication system according to claim 2 .wherein said output code X2i is expressed as:
X2l=q·X2i−1·X2i−2·. . . ·X2i−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 4 (depends on 1)

The communication system according to claim 1, wherein said input sequence includes input codes a0, a1, . . . , sequentially inputted to said encoder , and
wherein said output code Xk for k that is not equal to i(N+1) is expressed as:
X0=a0, (k=0)
X1(N+1)−p=a1N−(p−1) (k0),
where p is any of integers between 1 to N.

### Claim 5

A communication system comprising:
an encoder encoding an input sequence to sequentially generate output codes X0, X1, . . . ; and
a decoder decoding said output codes by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said output code Xk of said output codes X0, X1, . . . is determined based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
wherein said output code Xi(N+1) of said output codes X0, X1, . . . is uniquely determined based on said output code X1(N+1)−L+1 of said output codes X0, X1, . . .

### Claim 6 (depends on 5)

The communication system according to claim 5, wherein said N is one, and said output code X2i is expressed as:
X2l=f (X2i−L+1),
where f is a function.

### Claim 7 (depends on 6)

The communication system according to claim 6, wherein said output code X2l is expressed as:
X2i=q·X2i−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 8 (depends on 5)

The communication system according to claim 5, wherein said input sequence includes input codes a0, a1, . . . sequentially inputted to said encoder, and
wherein said output codes Xk for k that is not equal to i(N+1) is expressed as:
X0=a0, (k=0)
Xi(N+1)−p=aiN−(p−1) (k≠0)
where p is any of integers between 1 to N.

### Claim 9

An encoder comprising:
input means for being inputted by an input sequence;
encoding means for encoding said input sequence to sequentially generate output codes X0, X1, . . . which are to be decoded by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said output code Xk of said output codes X0, X1, . . . is determined based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
wherein said output code Xi(N+1) of said output codes X0, X1, . . . are uniquely determined based on a subset of a set consisting of said output codes X1(N+1)−L+1, X1(N+1)−L+2, Xi(N+1)−1 of said output codes X0, X1, . . . , and
wherein said subset includes said output code X1(N+1)−L+1 of said output codes X1(N+1)−L+1, X1(N+1)−L+2, . . . Xi(N+1)−1.

### Claim 10 (depends on 9)

The encoder according to claim 9, wherein said N is one, and said output code X2i is expressed as:
X2i=f (X2i−1, X2l−2, . . . , X2l−L+1).
where f is a function.

### Claim 11 (depends on 10)

The encoder according to claim 10, wherein said output code X2l is expressed as:
X2l=q·X2l−1·X2i−2·. . . X2l−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 12 (depends on 9)

The encoder according to claim 9 wherein said input sequence includes input codes a0, a1, . . . sequentially inputted to said input means, and
wherein said output code Xk for k that is not equal to i(N+1) are expressed as:
X0=a0, (k≠0)
Xi(N+1)−p=aiN−(p−1) (k≠0),
where p is any of integers between 1 to N.

### Claim 13

A encoder comprising:
input means for being inputted by an input sequence;
encoding means for encoding said input sequence to sequentially generate output codes X0, X1, . . . which are to be decoded by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said output code Xk of said output codes X0, X1, . . . is determined based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
wherein said output code Xi(N+1) of said output codes X0, X1, . . . is uniquely determined based on said output code Xi(N+1)−L+1 of said output codes X0, X1, . . .

### Claim 14 (depends on 13)

The encoder according to claim 13, wherein said N is one, and said output code X2i is expressed as:
X2l=f (X2i−L+1),
where f is a function.

### Claim 15 (depends on 14)

The encoder according to claim 14, wherein said output code X2l is expressed as:
X2l=q·X2l−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 16 (depends on 13)

The encoder according to claim 13, wherein said input sequence includes input codes a0, a1, . . . sequentially inputted to said input means, and
wherein said output codes Xk for k that is not equal to i(N+1) is expressed as:
X0=a0, (k=0)
X1(N+1)−p=aiN−(p−1) (k≠0),
where p is any of integers between 1 to N.

### Claim 17

A method of communication comprising:
encoding an input sequence to sequentially generate output codes X0, X1, . . . ; and
decoding said output codes by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said encoding includes:
determining said output code Xk of said output codes X0, X1, . . . based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
determining said output code Xi(N+1) of said output codes X0, X1, . . . based on a subset of a set consisting of said output codes Xi(N+1)−L+1, X1(N+1)−L+2, . . . Xi(N+1)−1 of said output codes X0, X1, . . . , and
wherein said subset includes said output code X1(N+1)−L+1 of said output codes X1(N+1)−L+1, X1(N+1)−L+2, . . . X1(N+1)−1.

### Claim 18

A method of communication comprising:
encoding an input sequence to sequentially generate output codes X0, X1, . . . ; and
decoding said output codes by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said encoding includes:
determining said output code Xk of said output codes X0, X1, . . . based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
determining said output code Xi(N+1) of said output codes X0, X1, based only on said output code X1(N+1)−L+1 of said output codes X0, X1, . . .

### Claim 19

A method of encoding comprising:
inputting an input sequence; and
encoding an input sequence to sequentially generate output codes X0, X1, . . . which are to be decoded by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said encoding includes:
determining said output code Xk of said output codes X0, X1, . . . based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
determining said output code Xi(N+1) of aid output codes X0, X1, . . . based on a subset of set consisting of said output codes Xi(N+1)−L+1, Xi(N+1)−L+2, . . . Xi(N+1)−1 of said output codes X0, X1, . . . , and
wherein said subset includes said output ode X1(N+1)−L+1 of said output codes X1(N+1)−L+1, X1(N+1)−L+2, . . . , X1(N+1)−1.

### Claim 20 (depends on 19)

The method according to claim 19, wherein said N is one, and said output code X2l, is expressed as:
X2l=f(X2l−1, X2i−2, . . . , X2i−L+1),
where f is a function.

### Claim 21 (depends on 20)

The method according to claim 20, wherein said output code X2l is expressed as:
X2l=q·X2i−1·X2i−2·. . . ·X2i−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 22 (depends on 19)

The method according to claim 19, wherein said input sequence includes input codes a0, a1, . . . which are sequentially inputted, and
wherein said output code Xk for k that is not equal to i(N+1) are expressed as:
X0=a0, (k=0)
Xi(N+1)−p=aiN−(p−1) (k≠0)
where p is any of integers between 1 to N.

### Claim 23

A method of encoding comprising:
inputting an input sequence; and
encoding an input sequence to sequentially generate output codes X0, X1, . . . which are to be decoded by a MLSD (Maximum Likelihood Sequence Detection) method with a trellis memory length being L, wherein said encoding includes:
determining said output code Xk of said output codes X0, X1, . . . based on said input sequence for k that is not equal to i(N+1) with i being any of natural numbers and with N being an natural number, and
determining said output code Xi(N+1) of said output codes X0, X1, . . . based only on said output code Xi(N+1)−L+1 of said output codes X0, X1, . . .

### Claim 24 (depends on 23)

The method according to claim 23, wherein said N is one, and said output code X2i is expressed as:
X2i=f (X2l−L+1),
where f is a function.

### Claim 25 (depends on 24)

The method according to claim 24, wherein said output code X2l is expressed as:
X2i=q·X2i−L+1,
where q is an number selected from a group consisting of 1, −1, j, and −j.

### Claim 26 (depends on 23)

The method according to claim 23, wherein said input sequence includes input codes a0, a1, . . . which are sequentially inputted, and
wherein said output codes Xk for k that is not equal to i(N+1) is expressed as:
X0=a0, (k=0)
Xi(N+1)−p=a1N−(p−1) (k≠0)
where p is any of integers between 1 to N.
