WO2009062425A1 - Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code - Google Patents

Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code Download PDF

Info

Publication number
WO2009062425A1
WO2009062425A1 PCT/CN2008/072307 CN2008072307W WO2009062425A1 WO 2009062425 A1 WO2009062425 A1 WO 2009062425A1 CN 2008072307 W CN2008072307 W CN 2008072307W WO 2009062425 A1 WO2009062425 A1 WO 2009062425A1
Authority
WO
WIPO (PCT)
Prior art keywords
reading
columns
buffer
harq
column
Prior art date
Application number
PCT/CN2008/072307
Other languages
English (en)
Chinese (zh)
Inventor
Zhifeng Yuan
Jun Xu
Original Assignee
Zte Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zte Corporation filed Critical Zte Corporation
Publication of WO2009062425A1 publication Critical patent/WO2009062425A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0066—Parallel concatenated codes

Definitions

  • the present invention relates to digital communication systems, and more particularly to a method for turbo code rate matching and codeword bit reading in channel coding of a digital communication system.
  • the digital communication system usually includes a source, a source encoder, a channel encoder and a modulator, and the receiving end usually includes a demodulator, a channel decoder, a source decoder and a sink, as shown in FIG. Show.
  • the channel coder is used to introduce information bits into the redundant information according to certain rules so that the receiving channel decoder can correct the error occurring when the information is transmitted on the channel to some extent.
  • Turbo codes are currently recognized as one of the best forward error correction codes.
  • the error correction performance of Turbo codes is far superior to that of other codes, and the more decoding iterations, the better the performance of decoding and error correction. Therefore, it is often recommended to use in data transmission where reliability is very high.
  • the third generation mobile communication uses the 8-state 1/3 bit rate binary turbo code as the channel coding standard.
  • the commonly used binary Turbo coding is a parallel concatenated code with an internal interleaver, which is generally formed by parallel concatenation of two recursive systematic convolutional code (RSC) component code encoders of the same structure.
  • the Turbo intra-code interleaver randomly replaces the bit positions in the input binary information sequence before the second component code encoder.
  • the Turbo code When the interleaver is sufficiently large, the Turbo code has the characteristics of an approximately random long code.
  • Such a binary Turbo code is used in WCDMA (Wideband Code Division Multiple Access) and TD-SCDMA (Time Division Synchronous Code Division Multiple Access), and the structure is as shown in FIG.
  • the input binary information sequence; ⁇ generates a one-way 3 full sequence Z k through the first component code encoder.
  • the input binary information sequence Xji is interleaved by the Turbo code interleaver, and the second component code encoder generates another check sequence Z k '.
  • the output code rate of the Turbo code is 1/3, and the coded bit sequence obtained by the output is: , ⁇ , ⁇ , '' ⁇ 1 ⁇ 2 , where is the length of the input binary information sequence.
  • the tail bits need to be taken out of the shift register feedback to perform the trellis operation termination.
  • the first three tail bits are used to terminate the first component code encoder, and the last three tail bits are used to terminate the second component code encoder. According to the above operation, you can get 12 grids.
  • the transmitted bit terminated by the shape operation, the bit order is:
  • each code when designing a coded modulation scheme, different order modulation modes (such as quadrature phase shift keying QPSK, 16QAM (Quadrature Amplitude Modulation), 64QAM, etc.) are usually set. Different codes (such as convolutional codes, convolutional Turbo codes, etc.), each code usually has a different code rate (Rate, such as 1/2, 2/3, 3/4, 5/6, etc.). When the system is scheduled, a specific coding modulation mode is arranged for each burst according to the channel quality and service requirements. In order to achieve better link adaptation, each code is better able to achieve a smaller granularity when transforming the code rate.
  • QPSK quadrature phase shift keying
  • 16QAM Quadrature Amplitude Modulation
  • 64QAM Quadrature Amplitude Modulation
  • Different codes such as convolutional codes, convolutional Turbo codes, etc.
  • each code When the system is scheduled, a specific coding modulation mode is arranged for each burst according to the channel quality and service
  • Rate Match Rate Matching, or RM
  • HARQ hybrid automatic repeat request
  • CB RM Chemical Buffer Rate Matching
  • CB RM provides a method for simply generating a punctual pattern with excellent performance.
  • the specific structure is shown in Figure 3.
  • each data stream will be rearranged by a respective sub-interleaver, which is called sub-block interleaver; usually, in order to simplify the hardware implementation, the number of columns of the block interleaver is fixed.
  • the number of rows changes as the length of the interleave changes, so the circular buffer can be thought of as a row buffer of "R rows x C columns", that is, as a "R row x C column” virtual buffer.
  • the intra-block interleaving used in the cyclic buffer matching method of 3GPP is a block interleaver with a fixed number of columns of 32 columns. Since there are three data streams of system bits, first parity bits and second parity bits in the loop buffer, the "loop buffer" can be regarded as a virtual buffer with 96 columns.
  • the cyclic buffer rate matching bit selection is to sequentially read L bits from the beginning of the buffer somewhere as a rate matched output.
  • the bits selected for transmission can be read from any point in the buffer, and if they reach the end of the buffer, they can be wound into the buffer. The starting position continues to read the data until the completion of reading L bits.
  • the bits selected for transmission are preferably read from a certain column start position of the virtual buffer instead of any one bit position.
  • redundancy versions can be specified by defining different starting points.
  • the introduction of the redundancy version helps to simplify the synchronous HARQ operation.
  • the introduction of the redundancy version may cause the overlapping of the codewords corresponding to different HARQ sub-packets, and the redundancy version is also selected during the asynchronous HARQ operation. It needs to be controlled by signaling, thus increasing the signaling overhead of the system.
  • the technical problem to be solved by the present invention is to provide a cyclic buffer rate matching method and a bit reading method, so that the HARQ of the turbo code is retransmitted to the optimized orthogonal retransmission; and the HARQ retransmission is not required to be defined.
  • the redundancy version number can save signaling overhead.
  • the present invention provides a method for rate matching of Turbo codes, including the following steps:
  • the foregoing method may further have the following feature, in the step (c), reading the HARQ When the required E codeword bits are transmitted, the reading begins from the next column of the column of the transmitted codeword bits of the previous HARQ transmission.
  • the above method may further have the following feature: the reading from the next column of the column of the codeword bits transmitted from the previous HARQ transmission refers to reading from the starting position of the next column.
  • the reading position of each HARQ sub-package is determined according to the following principles:
  • the number of columns; ife/to is the number of offset columns in the first transmission; it indicates that the number of columns corresponding to the "R row x C column" virtual buffer is transmitted in the previous n transmissions.
  • the above method may further have the following features, and the C fatigue is further determined by:
  • the above method may also have the following characteristics: the bit position of the current n + 1th start reading is read according to the following principles:
  • R is the number of rows in the virtual buffer; the total number of columns in the virtual buffer; delta is the number of offset columns in the first transmission; indicating that the previous n transmissions have a total of "R rows XC columns" "The number of columns in the virtual buffer.”
  • the above method may further have the following feature: if the codeword bit is read, the end of the circular buffer is reached, and the code sub-bit is continuously read from the beginning position of the circular buffer until the reading E is completed. Codeword bits.
  • the present invention also proposes a method for reading codeword bits, which sequentially reads E codeword bits required for each HARQ transmission from a circular buffer, wherein the current nth + 1th start reading bit position Read according to the following principles:
  • R is the number of rows in the virtual buffer; the total number of columns in the virtual buffer; delta is the number of offset columns in the first transmission; indicating that the previous n transmissions are transmitted in a corresponding "R" Row XC column” The number of columns in the virtual buffer.
  • the cyclic buffer-based rate matching algorithm proposed by the present invention completely implements orthogonal retransmission of Turbo codes to optimize Turbo decoding performance; and the rate matching algorithm proposed by the present invention does not need to define a redundancy version number. Save signaling overhead.
  • 1 is a schematic structural diagram of a digital communication system
  • Figure 2 is the structure of a Turbo encoder
  • Figure 3 is a structure of the existing cyclic buffer rate matching
  • Figure 4 is a structure of continuous transmission loop buffer rate matching
  • Figure 5 is a continuous transfer structure of virtual loop buffer rate matching.
  • the present invention is directed to the characteristics of the cyclic buffer rate matching, and proposes that the codeword bits selected for each HARQ retransmission sub-packet are immediately following the codeword bits of the previous HARQ sub-packet.
  • the loop buffer can be regarded as a "virtual loop buffer" of "R row x C column", as shown in Fig. 5.
  • the circular buffer in the 3GPP rate matching algorithm can be thought of as a 96-column virtual buffer.
  • the current HARQ sub-packet reads the codeword bit from the i+1th column, and if it reaches the end of the buffer, The data is read until the start position of the buffer continues until the L bits are read, as shown in FIG.
  • the present invention provides a method for Turbo code rate matching, comprising the following steps:
  • the information packet is sent to a turbo code encoder having a code rate of 1/r, and a system bit stream and (r-1) parity bit streams are generated.
  • the code rate is 1/3
  • the check bit stream is two.
  • the code rate is 1/5
  • the check bit stream is
  • the technical content of the present invention will be further described below by taking the 1/3 code rate of 3GPP as an example.
  • the present invention provides a Turbo code rate matching method, which includes the following steps:
  • the system bit stream is then placed in front of the circular buffer, and the bit streams of the first and second parity are placed erroneously behind the system bit stream, resulting in a total of 96 columns of virtual circular buffers.
  • R is the number of rows of the virtual buffer (that is, the number of rows of the sub-interleaver); represents the total number of columns of the virtual buffer; ife/to is the number of offset columns at the time of the first transmission, and % indicates Modular operation. Therefore, the current HARQ sub-package is read from the (C n + i ⁇ column).
  • the offset column number delta of the first transmission is 2 .
  • E 2 bits are read to form a HARQ sub-packet. And so on.
  • the cyclic buffer-based rate matching algorithm proposed by the present invention completely implements orthogonal retransmission of Turbo codes to optimize Turbo decoding performance; and the rate matching algorithm proposed by the present invention does not need to define a redundancy version number. Save signaling overhead.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

Le procédé selon l'invention, destiné à mettre en correspondance un débit de turbo code, comprend les étapes suivantes consistant à : (a) envoyer un paquet d'informations à un codeur de turbo code avec un débit de code 1/r, et générer un flux binaire systématique et un flux binaire vérifié (r-1) ; (b) faire passer respectivement le flux binaire systématique et le flux binaire vérifié (r-1) codé par le turbo codeur à travers un sous-entrelaceur respectif, afin qu'ils forment, une fois entrelacés, un tampon circulaire, le flux binaire systématique étant fourni devant un tampon circulaire, et le flux binaire vérifié étant fourni après le flux binaire systématique par l'entrelacement ; (c) lire les bits de mot de code E requis par la transmission de demande de répétition automatique hybride HARQ de la zone du tampon circulaire alternativement chaque fois, et former un sous-paquet HARQ. La retransmission orthogonale du turbo code est réalisée et la capacité de turbo décodage est optimisée par la mise en œuvre de l'algorithme de mise en correspondance de débit sur la base d'un tampon circulaire fourni par la présente invention. Par ailleurs, l'algorithme de mise en correspondance de débit fourni par la présente invention n'a pas besoin de définir un numéro de version superflu et permet d'économiser le coût de signalisation.
PCT/CN2008/072307 2007-10-29 2008-09-09 Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code WO2009062425A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101657523A CN101159513B (zh) 2007-10-29 2007-10-29 一种Turbo码速率匹配及码字比特读取的方法
CN200710165752.3 2007-10-29

Publications (1)

Publication Number Publication Date
WO2009062425A1 true WO2009062425A1 (fr) 2009-05-22

Family

ID=39307454

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/072307 WO2009062425A1 (fr) 2007-10-29 2008-09-09 Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code

Country Status (2)

Country Link
CN (1) CN101159513B (fr)
WO (1) WO2009062425A1 (fr)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159513B (zh) * 2007-10-29 2012-05-23 中兴通讯股份有限公司 一种Turbo码速率匹配及码字比特读取的方法
CN102611528A (zh) * 2008-07-31 2012-07-25 华为技术有限公司 对经过Turbo编码后的比特流进行打孔的方法及装置
CN101436865B (zh) * 2008-07-31 2012-01-04 华为技术有限公司 对经过Turbo编码后的比特流进行打孔的方法及装置
CN101640580B (zh) * 2008-07-31 2012-12-12 华为技术有限公司 对经过Turbo编码后的比特流进行打孔的方法及装置
CN101547064B (zh) * 2009-05-06 2011-11-09 普天信息技术研究院有限公司 一种交织速率匹配和解交织解速率匹配方法
JP6363721B2 (ja) 2014-02-21 2018-07-25 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． ポーラ符号のためのレートマッチング方法および装置
WO2015139248A1 (fr) * 2014-03-19 2015-09-24 华为技术有限公司 Procede d'adaptation de debit de code polaire et dispositif d'adaptation de debit
CN110401456B (zh) * 2014-12-22 2023-10-13 Oppo广东移动通信有限公司 极性码的编码方法和编码装置
CN107786300B (zh) * 2016-08-26 2022-06-14 中兴通讯股份有限公司 一种数据发送方法及装置
CN109257137B (zh) * 2017-07-12 2021-03-05 普天信息技术有限公司 数据传输时冗余版本的选取方法及装置
CN110557220B (zh) * 2018-05-30 2023-06-27 上海矽久微电子有限公司 一种物理层信道编码及解码方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2277239A1 (fr) * 1999-07-08 2001-01-08 Wen Tong Realisation de discontinuite de codes convolutionnels
CN1461120A (zh) * 2003-06-06 2003-12-10 上海华龙信息技术开发中心 一种用于码分多址通信系统的速率匹配装置
CN101060338A (zh) * 2007-06-18 2007-10-24 中兴通讯股份有限公司 一种卷积码速率匹配的方法和装置
CN101159513A (zh) * 2007-10-29 2008-04-09 中兴通讯股份有限公司 一种Turbo码速率匹配及码字比特读取的方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100834655B1 (ko) * 2002-01-26 2008-06-02 삼성전자주식회사 부호분할다중접속 이동통신시스템에서 비트/심벌간신뢰도를 이용한 데이터 송/수신 장치 및 방법
CN100571046C (zh) * 2006-04-20 2009-12-16 北京信威通信技术股份有限公司 一种在SCDMA系统中实现Turbo编译码方案的装置和方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2277239A1 (fr) * 1999-07-08 2001-01-08 Wen Tong Realisation de discontinuite de codes convolutionnels
CN1461120A (zh) * 2003-06-06 2003-12-10 上海华龙信息技术开发中心 一种用于码分多址通信系统的速率匹配装置
CN101060338A (zh) * 2007-06-18 2007-10-24 中兴通讯股份有限公司 一种卷积码速率匹配的方法和装置
CN101159513A (zh) * 2007-10-29 2008-04-09 中兴通讯股份有限公司 一种Turbo码速率匹配及码字比特读取的方法

Also Published As

Publication number Publication date
CN101159513B (zh) 2012-05-23
CN101159513A (zh) 2008-04-09

Similar Documents

Publication Publication Date Title
WO2009062425A1 (fr) Procédé destiné à mettre en correspondance un débit de turbo code et à lire les bits de mot de code
US7260770B2 (en) Block puncturing for turbo code based incremental redundancy
JP3701263B2 (ja) Ｃｄｍａ移動通信システムにおけるデータの送受信装置およびその方法
JP3476807B2 (ja) 複合再伝送方式を使用するデータ通信システムにおけるデータ送信装置及び方法
CN101119182B (zh) 一种高阶调制中的比特优先选择方法
US7000173B2 (en) Turbo code based incremental redundancy
WO2013135022A1 (fr) Procédé et dispositif d'envoi de données sur la base d'une adaptation de taux par tampons circulaires de longueur finie
JP3779271B2 (ja) 移動通信システムにおけるパケットデータを伝送するための方法及び装置
RU2501171C2 (ru) Выбор настроек повторной передачи для harq в сетях wcdma и lte
US7475330B2 (en) Method and apparatus for generating a punctured symbol vector for a given information vector
CN101217352B (zh) 一阶段速率匹配的缓冲设置方法
US6973611B2 (en) Interleaved coder and method
WO2008153353A1 (fr) Procédé de génération de sous-paquets à index binaire adaptatif
WO2010118606A1 (fr) Procédé et équipement d'adaptation de débit
Mantha et al. A capacity-approaching hybrid ARQ scheme using turbo codes
WO2009065326A1 (fr) Procédé de mappage de bits de modulation d'ordre élevé
US20050050427A1 (en) Method of rate matching for link adaptation and code space management
KR20130102820A (ko) 부호화 장치 및 복호화 장치의 동작 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08800819

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08800819

Country of ref document: EP

Kind code of ref document: A1