Processing

Please wait...

Settings

Settings

Goto Application

1. WO2002021703 - LOSSY COMPRESSION OF STAKES FOR TURBO DECODER

Publication Number WO/2002/021703
Publication Date 14.03.2002
International Application No. PCT/EP2001/010114
International Filing Date 30.08.2001
IPC
H03M 13/29 2006.01
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
29combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
H03M 13/39 2006.01
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03-H03M13/35153
39Sequence estimation, i.e using statistical methods for the reconstruction of the original codes
CPC
H03M 13/2771
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
27using interleaving techniques
2771Internal interleaver for turbo codes
H03M 13/2957
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
29combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
2957Turbo codes and decoding
H03M 13/3723
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
3723using means or methods for the initialisation of the decoder
H03M 13/3905
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
3905Maximum 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
H03M 13/3972
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
3972using sliding window techniques or parallel windows
H03M 13/6502
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, 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
65Purpose and implementation aspects
6502Reduction of hardware complexity or efficient processing
Applicants
  • KONINKLIJKE PHILIPS ELECTRONICS N.V. [NL]/[NL]
Inventors
  • DIELISSEN, Johannus, T., M., H.
Agents
  • DEGUELLE, Wilhelmus, H., G.
Priority Data
00203051.804.09.2000EP
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) LOSSY COMPRESSION OF STAKES FOR TURBO DECODER
(FR) COMPRESSION DE JALONS AVEC PERTES POUR TURBO DECODEUR
Abstract
(EN)
A turbo decoder employing the sliding window algorithm is computational intensive. Recent developments have reduced the computational requirements in iterative decoders at the expense of increased memory usage by storing the stakes between iterations. The stakes used in this improved sliding windows algorithm can be compressed, resulting in a decoder with minimal additional memory requirements while retaining the advantages in computational requirements obtained from storing the stakes between iterations. Preferably the position of the state metric representing the lowest cost within the stake is stored.
(FR)
La présente invention concerne un turbo décodeur à grande capacité computationnelle qui fait appel à l'algorithme à fenêtre glissante. Les évolutions récentes ont permis de réduire les besoins computationnels des décodeurs itératifs, mais avec une utilisation augmentée de la mémoire étant donné qu'il faut stocker les jalons entre les itérations. Les jalons utilisés dans cet algorithme à fenêtre glissante amélioré peuvent être comprimés, ce qui permet d'obtenir un décodeur possédant des exigences minimales en matière de mémoire supplémentaire et de conserver les avantages obtenus en matière d'exigences computationnelles grâce au stockage des jalons entre les itérations. On stocke de préférence la position de la métrique d'état représentant le coût le plus faible à l'intérieur du jalon.
Latest bibliographic data on file with the International Bureau