WO2001082490A1 - Procede et appareil de decodage d'une sequence de codes produits par codage turbo - Google Patents
Procede et appareil de decodage d'une sequence de codes produits par codage turbo Download PDFInfo
- Publication number
- WO2001082490A1 WO2001082490A1 PCT/JP2001/002355 JP0102355W WO0182490A1 WO 2001082490 A1 WO2001082490 A1 WO 2001082490A1 JP 0102355 W JP0102355 W JP 0102355W WO 0182490 A1 WO0182490 A1 WO 0182490A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- probability function
- regression
- vector
- backward
- determining
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- 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
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/29—Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- 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
- H03M13/3933—Decoding in probability domain
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
- H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
Definitions
- the present invention relates to error correction decoding for digital signals received over a noisy channel, and more particularly to a maximum recursive (MAP) decoding method for turbo codes based on parallel matrix processing.
- MAP maximum recursive
- Channel coding is a common method for obtaining a signal of sufficient quality at the receiver. An overview of the most prevalent methods of channel coding is given by PRoaks in Digital Commimicationsj, 1989, published by McGraw-Hill International Editions.
- the eight ways are based on the 60 1 method. See Bahl et al. March 1974 ⁇ IEEE Transactions on Information Theor Factory Optimal Decoding of Linear Codes for Minimizing Symbol error Ratej, pp. 284-287.
- the MAP method makes the best decision for each symbol and also provides the flexible reliability information needed for iterative decoding. There is a growing demand for practical MAP decoders so that turbo codes can be used in a wide range of applications, such as third-generation wideband DS-CDMA mobile communication systems.
- MAP decoders are based on convolutional code decoders (see, for example, CAS 5093 Turbo-Code Codec, data Sheetj, Comatlas, Chateaulaub, France, Efficient Channel Coding, Eastlake, Ohio, USA, August 1994. Inc., published by ECC Turbo product code technology j March 1998, and Small World Cooperation union, Sydney, Australia, MAP04 and MAP04A 16 State MAP Decoders j April 1998. In need.
- the present invention provides a matrix conversion method and apparatus for MAP decoding of an evening key code.
- successive decoding procedures are performed in parallel and successfully formulated into a series of simple and regular matrix operations. These operations are It substantially accelerates signals and reduces computational complexity, and is particularly suited for implementation in purpose-built parallel processing VLS I hardware architectures.
- the invented matrix MAP decoding implementation scheme uses shift registers to effectively reduce the required memory and to access and transfer complex data compared to those known in the prior art. Simplify.
- the invention relates to a noisy turbo coded sequence
- a method and apparatus for prompt implementation of a MAP that decodes ⁇ R 15 R 2 ,..., R N ⁇ .
- /? N initialize and start.
- the method determines the transition probability matrices ⁇ (R k ) and 1 (R k ) for each received sequence R k .
- the value of the vector k is determined according to ⁇ (R k ).
- the method performs multiplication on ⁇ (R k ) and ⁇ ⁇ (R k ).
- FIG. 1 is a diagram showing a transmission system including a turbo decoder according to the present invention
- FIG. 2 is a flowchart of a first matrix MAP decoding method according to the present invention
- FIG. 3 is a circuit diagram of a first MAP decoding method
- FIG. 4 is a flowchart of a second matrix MAP decoding method according to an alternative embodiment
- FIG. 5 is a circuit diagram of a second matrix MAP decoding method.
- FIG. 1 shows a system 100 including an evening encoder 110, a discrete memoryless channel 120, and a turbo decoder 130 according to the present invention.
- Turbo encoder 110 is constructed by a parallel series of two, usually identical, recursive tissue convolution (RSC) constituent encoders.
- RSC recursive tissue convolution
- a turbo internal interleaver is provided between the RSC encoders.
- RSC encoders and receivers can be employed to construct the turbo encoder 110.
- C k (X k, lk5 Y 2k ) means the information bit X k and the parity 'bit Y lk , Y 2k , respectively.
- the turbo-coded output sequence 104 is transmitted on a discrete memoryless' channel 120.
- channel 120 is often present in an unfavorable environment that leads to a large number of bit errors. It is the purpose of our invention to detect and correct these errors in an efficient way that can be implemented with VLSI circuits.
- turbo decoder 130 On the receiving side, the received sequence is applied to turbo decoder 130. This sequence is denoted by ⁇ R 13 R 2 ,..., R N ⁇ 105 (where R d (X, y 13 y 2 )) and R k2 (x k5 y lk , y 2k ) it is a version where there is a noise of C k at time k.
- Turbo 'decoder 130 includes two constituent decoders according to our invention.
- the decoder is preferably implemented by a VLSI circuit. Inn Yuichi Riva A / interleaver is provided between the decoders, with the same interleaving scheme used in the Turbo's encoder 110. Evening • To match the number of RSC encoders used in encoder 110, an additional RSC configuration decoder can be used.
- the output of decoder 130 is decoded symbol sequence block 106.
- M 2 v
- the kth information bit d k activates the encoder to change its state from S k to S k . This is called an encoder state transition.
- the flexible output for each decoded bit d k is determined from the log likelihood ratio (LLR).
- equations (2) and (3) of the conventional MAP method are simplified as follows.
- k (m) and ⁇ k (m) have the following equations that are simpler than (2) and (3) in the conventional MAP method.
- the simplified MAP method performs the following basic steps.
- Equation (12) the key i (: R k , m,, m) in equation (12) is expressed by the other MxM matrix as follows:
- the forward regression probability function vector is expressed as follows: a. (1), .., 3 ⁇ 4 ( ⁇ -1)] (15)
- the backward regression probability function vector is expressed as ⁇
- equations (10), (1 1) and (9) are
- matrix MAP method 1 a first matrix method for map decoding of one-button codes.
- FIG. 2 illustrates the matrix MAP method 1200 as follows.
- step 201 the forward and backward regression probability function vector ⁇ is set by performing the following settings. And /? N are initialized.
- ⁇ . [1, 0, 0, ⁇ , 0]
- step 203 For each observation R k received in step 202, in step 203, using equations (13) and (14), respectively, three transition probability matrices 1 (R k ), T, (R k ) and ⁇ (R k ) is determined.
- step 204 to determine the k shed using Equation (1 7), at the same time, ⁇ (R ⁇ (R 2 ) - ⁇ (R k), ⁇ (R 2) ⁇ (R 3) ⁇ (R k ),..., ⁇ (R k _i) ⁇ (R k ) are also determined in parallel.
- FIG. 3 shows a hardware implementation architecture 210 of the matrix MAP method 1200.
- the matrix MAP decoder 210 receives the sequence 105 from the channel 120 in FIG.
- the decoder 210 has three transition probability matrices as described above. (R k ), It includes three computers 2 1 1 to 2 13 that determine T, ( k ) and ⁇ ( k ). Is the decoder 210 the first multiplier? 24 1st shift linked by 1
- the shift register 240 has a length of N + 1 and is initialized by ( ⁇ 0 , *,..., *) In step 201 of the matrix MAP method 1200.
- the first shift-regist is a forward regression probability function vector. Used to determine the value of 0 ,..., ⁇ . Shift
- Shift registers can be implemented using 2-port memory or a register file with independent reads and writes.
- M storage elements
- matrix MAP method 2 a second matrix method for MAP decoding of turbo codes.
- FIG. 4 illustrates the matrix MAP method 2300 as follows.
- step 301 forward and backward regression Rate function vector. And /? N are initialized.
- step 304 For each observation R k received in step 302, two transition probability matrices (R k ) and ⁇ (R k ) are determined in step 303 using equations (13) and (14), respectively.
- FIG. 5 shows a hardware implementation architecture 310 for the matrix MAP method 2300.
- the matrix MAP decoder 310 receives the sequence 105 from the channel 120 in FIG.
- the decoder 310 includes two computers 2 12 and 213 that determine the two transition probability matrices ⁇ (R k ) and ⁇ (R k ) as described above.
- This shift register has a length of N + 1 and is initialized by (H 0 , *,..., *) In step 301 of the matrix MAP method 2300. This means that ⁇ (RJ ⁇ (R 2 ) to ⁇ (R k ), ⁇ (R 2 ) ⁇ (R 3 ) (R k ),..., ⁇ (R k _! ⁇ (R k ) Used to determine.
- Decoder 310 is N + 1 multipliers? Including 330. After receiving the complete sequence, these multipliers perform N N N T , aoT, (R R (R 2) ⁇ ⁇
- the number of LLR ( ⁇ ) computer units 260 and 360 shown in FIGS. 3 and 5 can vary depending on the input symbol rate. For example, for a slower symbol rate, a reduced number of ⁇ computer units are used, and each unit calculates multiple ⁇ (d k ) terms. This is done by operating ⁇ computer units at a clock speed faster than the symbol speed. This results in reduced power consumption and circuit complexity.
- the greatest advantage of the matrix MAP decoding method of the present invention is that it makes the decoding operation much faster.
- the method of the present invention reconstructs the MAP decoder structure into a series of simple regular matrix formulas.
- the matrix transformation can apply the corresponding columns to different rows in parallel, and achieve a large part of the decoding procedure in parallel.
- the computational complexity of the matrix MAP decoding method according to the present invention is about half (for forward regression) and 1/4 (for backward regression), respectively, of the conventional MAP method. Furthermore, there is no division in such a regression calculation of the matrix MAP decoding method. Division is a time-consuming operation.
- the matrix MAP decoding method of the present invention can be implemented using efficient V LSI circuits. Since it works on MxM matrix and M-dimensional vector, the method of the present invention can be regarded as a VLSI-oriented method.
- the new parallel operation in the method of the present invention provides real-time MAP decoding of turbo codes in purpose-specific parallel processing VLS I hardware circuits.
- Both the described methods and apparatus are generally applicable to channel decoding, which addresses impairments in wireless signal propagation and in which evening code is used to ensure a low error rate communication link.
- they can be used in wireless communication systems such as mobile phones, broadband wireless access systems, and mobile computing devices.
- wireless communication systems such as mobile phones, broadband wireless access systems, and mobile computing devices.
- wired systems such as ADSL, VDSL, xDSL, and home network systems.
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Error Detection And Correction (AREA)
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2001579460A JP4629295B2 (ja) | 2000-04-25 | 2001-03-23 | ターボ符号化された符号シーケンスの復号方法及び復号装置 |
EP01914214A EP1193882A4 (en) | 2000-04-25 | 2001-03-23 | METHOD AND DEVICE FOR DECODING TURBO-CODED SEQUENCES |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/558,440 US6606725B1 (en) | 2000-04-25 | 2000-04-25 | MAP decoding for turbo codes by parallel matrix processing |
US09/558,440 | 2000-04-25 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2001082490A1 true WO2001082490A1 (fr) | 2001-11-01 |
Family
ID=24229545
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2001/002355 WO2001082490A1 (fr) | 2000-04-25 | 2001-03-23 | Procede et appareil de decodage d'une sequence de codes produits par codage turbo |
Country Status (5)
Country | Link |
---|---|
US (1) | US6606725B1 (ja) |
EP (1) | EP1193882A4 (ja) |
JP (1) | JP4629295B2 (ja) |
CN (1) | CN1366739A (ja) |
WO (1) | WO2001082490A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2005539451A (ja) * | 2002-09-18 | 2005-12-22 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | データウィンドウを使用してデータを復号化するための方法 |
Families Citing this family (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3613134B2 (ja) * | 2000-05-12 | 2005-01-26 | 日本電気株式会社 | 高速ターボデコーダ |
FR2811169B1 (fr) * | 2000-06-28 | 2002-09-06 | Canon Kk | Procede et dispositif de decodage et systemes les mettant en oeuvre |
US7020827B2 (en) * | 2001-06-08 | 2006-03-28 | Texas Instruments Incorporated | Cascade map decoder and method |
US6882685B2 (en) * | 2001-09-18 | 2005-04-19 | Microsoft Corporation | Block transform and quantization for image and video coding |
US6763493B2 (en) * | 2001-09-21 | 2004-07-13 | The Directv Group, Inc. | Method and system for performing decoding using a reduced-memory implementation |
JP4185314B2 (ja) * | 2002-06-07 | 2008-11-26 | 富士通株式会社 | 情報記録再生装置、光ディスク装置及び、データ再生方法 |
US7257170B2 (en) * | 2002-08-21 | 2007-08-14 | Texas Instruments Incorporated | Channel norm-based ordering and whitened decoding for MIMO communication systems |
CN100391107C (zh) * | 2003-12-25 | 2008-05-28 | 上海贝尔阿尔卡特股份有限公司 | 信道编码方法和装置以及信道译码方法和装置 |
US7383484B2 (en) * | 2004-03-12 | 2008-06-03 | Seagate Technology Llc | Cyclic redundancy check based message passing in turbo product code decoding |
US7441175B2 (en) * | 2004-03-12 | 2008-10-21 | Seagate Technology Llc | Turbo product code implementation and decoding termination method and apparatus |
US7487193B2 (en) * | 2004-05-14 | 2009-02-03 | Microsoft Corporation | Fast video codec transform implementations |
US7415651B2 (en) * | 2004-06-02 | 2008-08-19 | Seagate Technology | Data communication system with multi-dimensional error-correction product codes |
JP2006324754A (ja) * | 2005-05-17 | 2006-11-30 | Fujitsu Ltd | 最大事後確率復号方法及び復号装置 |
US7689052B2 (en) * | 2005-10-07 | 2010-03-30 | Microsoft Corporation | Multimedia signal processing using fixed-point approximations of linear transforms |
US7783936B1 (en) | 2006-09-28 | 2010-08-24 | L-3 Communications, Corp. | Memory arbitration technique for turbo decoding |
US20100058142A1 (en) * | 2006-11-16 | 2010-03-04 | Nokia Corporation | Apparatus, methods, and computer program products utilizing a generalized turbo principle |
US8942289B2 (en) * | 2007-02-21 | 2015-01-27 | Microsoft Corporation | Computational complexity and precision control in transform-based digital media codec |
CN101398808B (zh) * | 2007-09-27 | 2012-06-13 | 光宝科技股份有限公司 | 用于通讯装置中对通讯错误进行更正的数据处理方法 |
US8127216B2 (en) | 2007-11-19 | 2012-02-28 | Seagate Technology Llc | Reduced state soft output processing |
US20090132894A1 (en) * | 2007-11-19 | 2009-05-21 | Seagate Technology Llc | Soft Output Bit Threshold Error Correction |
WO2009118713A1 (en) * | 2008-03-28 | 2009-10-01 | Nxp B.V. | Mesm: a fast bjcr based decoder implementation scheme |
US8594217B2 (en) * | 2011-12-06 | 2013-11-26 | The Mathworks, Inc. | Parallel implementation of maximum a posteriori probability decoder |
CN103368583B (zh) | 2012-04-11 | 2016-08-17 | 华为技术有限公司 | 极性码的译码方法和译码装置 |
EP2950493B1 (en) * | 2013-01-25 | 2019-05-15 | Mitsubishi Electric Corporation | Bit likelihood calculation device and bit likelihood calculation method |
WO2014166604A1 (en) * | 2013-04-08 | 2014-10-16 | Alcatel Lucent | Dynamic scaling of redundancy elimination middleboxes |
US10312947B2 (en) * | 2016-01-21 | 2019-06-04 | Huawei Technologies Co., Ltd. | Concatenated and sliding-window polar coding |
CN109087630B (zh) * | 2018-08-29 | 2020-09-15 | 深圳追一科技有限公司 | 语音识别的方法及相关装置 |
CN112216334A (zh) * | 2019-07-09 | 2021-01-12 | 本征信息技术(上海)有限公司 | 一种操作多状态存储器设备的方法和装置 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1999012265A1 (fr) * | 1997-09-02 | 1999-03-11 | Sony Corporation | Codeur/decodeur turbo et procede de codage/decodage turbo |
JP2000091926A (ja) * | 1998-09-08 | 2000-03-31 | Sony Corp | 符号化装置および方法、復号装置および方法、並びに提供媒体 |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2675971B1 (fr) | 1991-04-23 | 1993-08-06 | France Telecom | Procede de codage correcteur d'erreurs a au moins deux codages convolutifs systematiques en parallele, procede de decodage iteratif, module de decodage et decodeur correspondants. |
US5721745A (en) | 1996-04-19 | 1998-02-24 | General Electric Company | Parallel concatenated tail-biting convolutional code and decoder therefor |
US6023783A (en) | 1996-05-15 | 2000-02-08 | California Institute Of Technology | Hybrid concatenated codes and iterative decoding |
US5734962A (en) | 1996-07-17 | 1998-03-31 | General Electric Company | Satellite communications system utilizing parallel concatenated coding |
US5933462A (en) * | 1996-11-06 | 1999-08-03 | Qualcomm Incorporated | Soft decision output decoder for decoding convolutionally encoded codewords |
US6128765A (en) * | 1998-08-20 | 2000-10-03 | General Electric Company | Maximum A posterior estimator with fast sigma calculator |
US6343368B1 (en) * | 1998-12-18 | 2002-01-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and system for fast maximum a posteriori decoding |
JP3670520B2 (ja) * | 1999-06-23 | 2005-07-13 | 富士通株式会社 | ターボ復号器およびターボ復号装置 |
JP3246484B2 (ja) * | 1999-07-07 | 2002-01-15 | 日本電気株式会社 | ターボデコーダ |
US6226773B1 (en) * | 1999-10-20 | 2001-05-01 | At&T Corp. | Memory-minimized architecture for implementing map decoding |
US6400290B1 (en) * | 1999-11-29 | 2002-06-04 | Altera Corporation | Normalization implementation for a logmap decoder |
US6477679B1 (en) * | 2000-02-07 | 2002-11-05 | Motorola, Inc. | Methods for decoding data in digital communication systems |
US6516437B1 (en) * | 2000-03-07 | 2003-02-04 | General Electric Company | Turbo decoder control for use with a programmable interleaver, variable block length, and multiple code rates |
-
2000
- 2000-04-25 US US09/558,440 patent/US6606725B1/en not_active Expired - Fee Related
-
2001
- 2001-03-23 EP EP01914214A patent/EP1193882A4/en not_active Withdrawn
- 2001-03-23 CN CN01801080.6A patent/CN1366739A/zh active Pending
- 2001-03-23 JP JP2001579460A patent/JP4629295B2/ja not_active Expired - Fee Related
- 2001-03-23 WO PCT/JP2001/002355 patent/WO2001082490A1/ja not_active Application Discontinuation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1999012265A1 (fr) * | 1997-09-02 | 1999-03-11 | Sony Corporation | Codeur/decodeur turbo et procede de codage/decodage turbo |
JP2000091926A (ja) * | 1998-09-08 | 2000-03-31 | Sony Corp | 符号化装置および方法、復号装置および方法、並びに提供媒体 |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2005539451A (ja) * | 2002-09-18 | 2005-12-22 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | データウィンドウを使用してデータを復号化するための方法 |
Also Published As
Publication number | Publication date |
---|---|
JP4629295B2 (ja) | 2011-02-09 |
EP1193882A1 (en) | 2002-04-03 |
CN1366739A (zh) | 2002-08-28 |
US6606725B1 (en) | 2003-08-12 |
EP1193882A4 (en) | 2005-10-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2001082490A1 (fr) | Procede et appareil de decodage d'une sequence de codes produits par codage turbo | |
JP3604955B2 (ja) | 畳込み復号装置 | |
US7237183B2 (en) | Parallel decoding of a BCH encoded signal | |
JP3791013B2 (ja) | データ・ブロックの畳み込み符号化方法及び装置及び対応する復号方法及び装置 | |
US6697443B1 (en) | Component decoder and method thereof in mobile communication system | |
CN108847848B (zh) | 一种基于信息后处理的极化码的bp译码算法 | |
JP4764973B2 (ja) | Crc値の算出装置 | |
KR20010072498A (ko) | 맵 디코더용 분할 디인터리버 메모리 | |
CN110999095B (zh) | 用于极化码的按块并行冻结位生成 | |
US20050204268A1 (en) | Decoding and error correction for algebraic geometric codes | |
CN108199723B (zh) | 一种基于双递归的分组马尔可夫叠加编码方法 | |
CN110730011B (zh) | 一种基于部分叠加的递归分组马尔可夫叠加编码方法 | |
CN101147327B (zh) | 使用篱栅的蝴蝶结构来映射解码的度量计算的方法和装置 | |
EP2339757A1 (en) | Power-reduced preliminary decoded bits in viterbi decoder | |
KR20050019014A (ko) | 디코딩 장치 및 방법 | |
JP2002204173A (ja) | ターボデコーディング方法 | |
JP2002198935A (ja) | 次世代移動通信システムにおけるターボディコーディングを行う方法 | |
JP3888135B2 (ja) | 誤り訂正符号復号装置 | |
US9048866B2 (en) | Apparatus and method for checking decoded data, apparatus and method for decoding, and receiving terminal | |
CN100417031C (zh) | 宽带无线接入系统中里德索洛门卷积级联码的实现方法 | |
CN101753261A (zh) | 一种编码器、译码器及编码、译码方法 | |
WO2022135719A1 (en) | Staircase polar encoding and decoding | |
CN113644919A (zh) | 一种提升DVB-RCS2中Turbo译码性能的方法及译码结构 | |
CN108880569B (zh) | 一种基于反馈分组马尔科夫叠加编码的速率兼容编码方法 | |
JP6771181B2 (ja) | 符号化装置、符号化方法およびプログラム。 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 01801080.6 Country of ref document: CN |
|
ENP | Entry into the national phase |
Ref document number: 2001 579460 Country of ref document: JP Kind code of ref document: A |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CN JP |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001914214 Country of ref document: EP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 2001914214 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001914214 Country of ref document: EP |