Decoding method for convolutionally coded signal

Patent metadata

Field	Value
Publication number	US-10116337-B2
Application number	US-201614992269-A
Country	US
Kind code	B2
Filing date	Jan 11, 2016
Priority date	Jan 12, 2015
Publication date	Oct 30, 2018
Grant date	Oct 30, 2018

Abstract

A decoding method for a convolutionally coded signal is provided. The convolutionally coded signal includes a trellis. The decoding method includes determining a plurality of first sub-trellises from the trellis, decoding the first sub-trellises, determining a plurality of second sub-trellises from the trellis, boundaries of the second sub-trellises being different from boundaries of the first sub-trellises, and decoding the second sub-trellises.

First claim

What is claimed is:

1. A decoding method for a convolutionally coded signal of a communication system pre-storing recursion state metrics for decoding sub-trellises resulting in accelerating iteration loop convergence and reducing bit error rates, the convolutionally coded signal comprising a trellis with steps, the decoding method comprising:
determining a plurality of first sub-trellises from the trellis, and determining a corresponding step for each of the first sub-trellises, each corresponding step represented by a corresponding dividing line in the trellis, each dividing line distinct from the boundaries of all the first sub-trellises;
decoding the first sub-trellises to generate a plurality of state metrics;
storing a first record containing the plurality of state metrics generated prior to and subsequent to the corresponding steps;
determining a plurality of second sub-trellises from the trellis, the boundaries of each of the second sub-trellises being distinct and non-aligned with the boundaries of each of the first sub-trellises; and
decoding the second sub-trellises by utilizing the first record as an initial condition of the second sub-trellises.

2. The decoding method according to claim 1 , wherein the step of determining the second sub-trellises from the trellis is performed according to the corresponding steps.

3. The decoding method according to claim 1 , wherein the step of decoding the first sub-trellises to generate the state metrics comprises:
decoding the first sub-trellises by forward recursion to generate a plurality of forward state metrics; and
decoding the first sub-trellises by backward recursion to generate a plurality of backward state metrics;
wherein, each of the state metrics prior and subsequent to the corresponding steps comprises one of the forward state metrics and one of the backward state metrics.

4. The decoding method according to claim 1 , wherein each of the first sub-trellises has a first sub-trellis length, each of the second sub-trellises has a second sub-trellis length, and the first sub-trellis length is equal to the second sub-trellis length.

5. The decoding method according to claim 1 , wherein the step of decoding the first sub-trellises is decoding the first sub-trellises in a parallel manner.

6. The decoding method according to claim 1 , wherein the steps of decoding the first and second sub-trellises are based on a soft-in-soft-out (SISO) decoding method.

7. The decoding method according to claim 1 , wherein the step of decoding the first sub-trellises is a half-iteration of one iteration, and the step of decoding the second sub-trellises is a half-iteration of another iteration.

8. The decoding method according to claim 1 , wherein the plurality of second sub-trellises from the trellis are determined such that a given step is represented by a corresponding dividing line in the trellis that is distinct from the boundary of each first sub-trellis, and the first record contains both the plurality of state metrics generated prior to the given step and the plurality of state metrics generated subsequent to the given step.

9. The decoding method according to claim 1 , wherein the first record is updated according to a forward state metric and a backward state metric at a corresponding dividing line in the trellis for two adjacent steps in the first sub-trellis.

10. A decoding method for a convolutionally coded signal of a communication system pre-storing recursion state metrics for decoding sub-trellises resulting in accelerating iteration loop convergence and reducing bit error rates, the convolutionally coded signal comprising a trellis, the decoding method comprising:
determining a plurality of first sub-trellises from the trellis, wherein the first sub-trellises forms the trellis, the boundaries of all the first sub-trellises defined by a dividing line in the trellis corresponding to a given step;
decoding the first sub-trellises;
determining a plurality of second sub-trellises from the trellis, wherein the second sub-trellises forms the trellis, and boundaries of the second sub-trellises are non-aligned, distinct, and different from the boundaries of the first sub-trellises; and
decoding the second sub-trellises.

11. The decoding method according to claim 10 , wherein the first sub-trellises are non-overlapping.

12. The decoding method according to claim 10 , further comprising:
when decoding the first sub-trellises, generating a plurality of state metrics for the first sub-trellises; and
when decoding the second sub-trellises, utilizing the state metrics as initial conditions of the second sub-trellises.

13. The decoding method according to claim 10 , wherein the step of decoding the first sub-trellises comprises:
decoding one of the first sub-trellises by forward recursion to generate a forward state metric, the forward state metric corresponding to a first step of the trellis; and
decoding the one of the first sub-trellises by backward recursion to generate a backward state metric, the backward state metric corresponding to a second step of the trellis, the first and second steps being adjacent to each other, the second step being earlier than the first step; and
the step of decoding the second sub-trellises comprises:
utilizing the backward state metric as an initial condition for decoding one of the second sub-trellises; and
utilizing the forward state metric as an initial condition of another of the second sub-trellises, the another of the second sub-trellises following the one of the second sub-trellis.

14. The decoding method according to claim 10 , wherein each of the first sub-trellises has a first sub-trellis length, each of the second sub-trellises has a second sub-trellis length, and the first sub-trellis length is equal to the second sub-trellis length.

15. The decoding method according to claim 10 , wherein the step of decoding the first sub-trellises is decoding the first sub-trellises in a parallel manner.

16. The decoding method according to claim 10 , wherein the first sub-trellises comprise a previous first sub-trellis and a next first sub-trellis, one of the second sub-trellises comprises a part of the previous first sub-trellis and a part of the next first sub-trellis, and the next first sub-trellis follows to the previous first sub-trellis.

17. The decoding method according to claim 10 , further comprising:
providing a turbo decoder;
wherein, the turbo decoder decodes the trellis twice in one iteration loop, and the steps of decoding the first sub-trellises and the step of decoding the second sub-trellises are from different iteration loops.

18. The decoding method according to claim 10 , wherein the step of decoding the first sub-trellises and the step of decoding the second sub-trellises calculate soft output for each step by utilizing a maximum a posteriori (MAP) algorithm, and the MAP algorithm is one of log-MAP, MAP, max-log-MAP and constant-log-MAP algorithms.

Assignees

• Mstar Semiconductor Inc

Inventors

• Ku Yu-Hsien

Classifications

• H03M13/258

  with turbo codes, e.g. Turbo Trellis Coded Modulation [TTCM] · CPC title

• H03M13/3972 Primary

  using sliding window techniques or parallel windows · CPC title

• H03M13/3905

  Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding · CPC title

• H03M13/3938

  Tail-biting (H03M13/2996 takes precedence) · CPC title

• H03M13/413

  tail biting Viterbi decoding · CPC title