CN102136885B - Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE) - Google Patents

Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE) Download PDF

Info

Publication number
CN102136885B
CN102136885B CN 201110076521 CN201110076521A CN102136885B CN 102136885 B CN102136885 B CN 102136885B CN 201110076521 CN201110076521 CN 201110076521 CN 201110076521 A CN201110076521 A CN 201110076521A CN 102136885 B CN102136885 B CN 102136885B
Authority
CN
China
Prior art keywords
information
ack
last
column
channel
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN 201110076521
Other languages
Chinese (zh)
Other versions
CN102136885A (en
Inventor
张秀丽
梁达成
许彤
石晶林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Zhongke Polytron Technologies Inc
Original Assignee
Institute of Computing Technology of CAS
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 Institute of Computing Technology of CAS filed Critical Institute of Computing Technology of CAS
Priority to CN 201110076521 priority Critical patent/CN102136885B/en
Publication of CN102136885A publication Critical patent/CN102136885A/en
Application granted granted Critical
Publication of CN102136885B publication Critical patent/CN102136885B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

本发明提供一种3GPP LTE PUSCH信道并行信道交织和加扰的实现方法和系统,所述方法包括:1)对RI信息和ACK/NACK信息进行编码;2)输入RI信息、控制和数据信息和ACK/NACK信息,并存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI和最后写入的ACK/NACK信息所在的行编号last_row_indexACK和列编号last_column_indexACK,根据最后写入的RI信息所在的行编号和列编号和最后写入的ACK/NACK信息所在的行编号和列编号进行信道交织的输出操作;3)对RI信息、控制和数据信息和ACK/NACK信息进行加扰。本发明处理速度快,编码方式与QAM调整方式无关,而且还节约了存储空间。

Figure 201110076521

The present invention provides a method and system for implementing 3GPP LTE PUSCH channel parallel channel interleaving and scrambling, the method comprising: 1) encoding RI information and ACK/NACK information; 2) inputting RI information, control and data information and ACK/NACK information, and store the row number last_row_index RI and column number last_column_index RI where the last written RI information is located, and the row number last_row_index ACK and column number last_column_index ACK where the last written ACK/NACK information is located, according to the last written The row number and column number where the RI information is located and the row number and column number where the last written ACK/NACK information is located perform channel interleaving output operations; 3) Scramble the RI information, control and data information, and ACK/NACK information . The invention has fast processing speed, the coding mode has nothing to do with the QAM adjustment mode, and saves storage space.

Figure 201110076521

Description

一种3GPP LTE PUSCH信道并行信道交织和加扰的实现方法和系统A method and system for implementing 3GPP LTE PUSCH channel parallel channel interleaving and scrambling

技术领域 technical field

本发明涉及移动通信技术领域,具体涉及一种第三代合作伙伴计划长期演进系统(3GPP LTE)中上行共享信道(PUSCH)的信道交织及加扰实现方法和系统。The present invention relates to the technical field of mobile communication, in particular to a method and system for realizing channel interleaving and scrambling of an uplink shared channel (PUSCH) in a third generation partnership project long term evolution system (3GPP LTE).

背景技术 Background technique

3GPP LTE通信系统的上行是指用户端(UE)发送给基站(eNodeB),上行信道包括上行共享信道(PUSCH)、上行控制信道(PUCCH)和随机接入信道(PRACH)。其中PUSCH主要传输数据信息,也可以传输控制信息,例如信道质量指示信息(CQI,channel quality indicator),秩指示信息(RI,rank indication)和混合自动请求重发确认信息(HARQ-ACK),其中混合自动请求重发确认信息(HARQ-ACK)也称为ACK/NACK信息。The uplink of the 3GPP LTE communication system refers to the transmission from the user terminal (UE) to the base station (eNodeB). The uplink channels include the uplink shared channel (PUSCH), the uplink control channel (PUCCH) and the random access channel (PRACH). Among them, PUSCH mainly transmits data information, and can also transmit control information, such as channel quality indicator information (CQI, channel quality indicator), rank indicator information (RI, rank indication) and hybrid automatic retransmission request acknowledgment information (HARQ-ACK), where Hybrid Automatic Repeat Request Acknowledgment (HARQ-ACK) is also called ACK/NACK information.

PUSCH编码的流程如图1所示,可以看出,信道交织的输入有三部分:复用的信道编码后的数据和CQI信息,信道编码后的RI信息和信道编码后的HARQ-ACK信息。由于RI和HARQ-ACK的编码方式和信道交织及加扰有密切联系,先对它们作简单介绍。The process of PUSCH encoding is shown in Figure 1. It can be seen that the input of channel interleaving has three parts: multiplexed channel-coded data and CQI information, channel-coded RI information and channel-coded HARQ-ACK information. Since the encoding methods of RI and HARQ-ACK are closely related to channel interleaving and scrambling, they are briefly introduced first.

RI信息的信道编码与正交幅度调制(QAM)方式有关,按照输入比特数分为如下两类,分别如表1和表2所示:The channel coding of RI information is related to the quadrature amplitude modulation (QAM) method, and is divided into the following two categories according to the number of input bits, as shown in Table 1 and Table 2 respectively:

表11比特RI信息的编码Table 11 Coding of bit RI information

Figure BDA0000052604910000011
Figure BDA0000052604910000011

表22比特RI信息的编码Table 22 Encoding of RI information

Figure BDA0000052604910000012
Figure BDA0000052604910000012

Figure BDA0000052604910000021
Figure BDA0000052604910000021

表2中

Figure BDA0000052604910000022
其最左边为最低有效位(LSB);表1和表2中x和y是用于增加调制符号欧氏距离的占位符。Table 2
Figure BDA0000052604910000022
The leftmost is the least significant bit (LSB); x and y in Table 1 and Table 2 are placeholders used to increase the Euclidean distance of the modulation symbol.

关于HARQ-ACK的信道编码,首先ACK用二进制“1”表示,NACK用二进制“0”表示。已知时分复用(TDD)ACK/NACK编码有捆绑(bundling)和复用(multiplexing)两种反馈模式,对于捆绑反馈模式,HARQ-ACK由1-2比特信息组成;对于复用反馈模式,HARQ-ACK由1-4比特组成。与RI信息一样,HARQ-ACK的信道编码的编码方式也与QAM方式有关,具体描述如下:Regarding the channel coding of HARQ-ACK, firstly, ACK is represented by binary "1", and NACK is represented by binary "0". It is known that time division multiplexing (TDD) ACK/NACK coding has two feedback modes: bundling and multiplexing. For the bundling feedback mode, HARQ-ACK consists of 1-2 bits of information; for the multiplexing feedback mode, HARQ-ACK consists of 1-4 bits. Like the RI information, the coding method of the HARQ-ACK channel coding is also related to the QAM method. The specific description is as follows:

ACK/NACK复用反馈1比特编码和2比特编码分别如表3和表4中所示:ACK/NACK multiplexing feedback 1-bit coding and 2-bit coding are shown in Table 3 and Table 4 respectively:

表31比特HARQ-ACK/NACK信息的编码Encoding of Table 31 bit HARQ-ACK/NACK information

Figure BDA0000052604910000023
Figure BDA0000052604910000023

表42比特HARQ-ACK/NACK信息的编码Encoding of 42-bit HARQ-ACK/NACK information in table

Figure BDA0000052604910000024
Figure BDA0000052604910000024

表4中其最左边为最低有效位(LSB);表3和表4中x和y是用于增加调制符号欧氏距离的占位符。Table 4 The leftmost is the least significant bit (LSB); x and y in Table 3 and Table 4 are placeholders used to increase the Euclidean distance of the modulation symbol.

ACK/NACK捆绑反馈编码是对ACK/NACK复用反馈1或2比特编码的输出数据进行加扰,假设ACK/NACK复用反馈1或2比特编码的输出序列为

Figure BDA0000052604910000026
将其进行选择后与加扰序列按一定方式加扰(异或),得到捆绑反馈编码的输出序列为
Figure BDA0000052604910000027
加扰方式为加扰数据位和占位符“y”,占位符“x”不变。其中加扰序列如表5中所示:ACK/NACK bundling feedback coding is to scramble the output data of ACK/NACK multiplexing feedback 1 or 2-bit coding, assuming that the output sequence of ACK/NACK multiplexing feedback 1 or 2-bit coding is
Figure BDA0000052604910000026
After it is selected, it is scrambled (XOR) with the scrambling sequence in a certain way, and the output sequence of the bundled feedback code is obtained as
Figure BDA0000052604910000027
The scrambling method is scrambling data bits and a placeholder "y", and the placeholder "x" remains unchanged. The scrambling sequence is shown in Table 5:

表5TDD ACK/NACK bunding编码加扰序列Table 5 TDD ACK/NACK bunding coding scrambling sequence

Figure BDA0000052604910000031
Figure BDA0000052604910000031

其中,i=(Nbundled-1)mod 4,其中Nbundled为输入参数。Wherein, i=(N bundled -1)mod 4, where N bundled is an input parameter.

表6(32,O)的基序列The base sequence of table 6 (32, O)

ii Mi,0 M i,0 Mi,1 M i,1 Mi,2 Mi , 2 Mi,3 Mi , 3 Mi,4 Mi , 4 Mi,5 Mi , 5 Mi,6 Mi , 6 Mi,7 Mi , 7 Mi,8 Mi , 8 Mi,9 Mi , 9 Mi,10 Mi , 10   0 0   1 1   1 1   0 0   0 0   0 0   0 0   0 0   0 0   0 0   0 0   1 1   1 1   1 1   1 1   1 1   0 0   0 0   0 0   0 0   0 0   0 0   1 1   1 1   2 2   1 1   0 0   0 0   1 1   0 0   0 0   1 1   0 0   1 1   1 1   1 1   3 3   1 1   0 0   1 1   1 1   0 0   0 0   0 0   0 0   1 1   0 0   1 1   4 4   1 1   1 1   1 1   1 1   0 0   0 0   0 0   1 1   0 0   0 0   1 1   5 5   1 1   1 1   0 0   0 0   1 1   0 0   1 1   1 1   1 1   0 0   1 1   6 6   1 1   0 0   1 1   0 0   1 1   0 0   1 1   0 0   1 1   1 1   1 1   7 7   1 1   0 0   0 0   1 1   1 1   0 0   0 0   1 1   1 1   0 0   1 1   8 8   1 1   1 1   0 0   1 1   1 1   0 0   0 0   1 1   0 0   1 1   1 1   9 9   1 1   0 0   1 1   1 1   1 1   0 0   1 1   0 0   0 0   1 1   1 1   10 10   1 1   0 0   1 1   0 0   0 0   1 1   1 1   1 1   0 0   1 1   1 1   11 11   1 1   1 1   1 1   0 0   0 0   1 1   1 1   0 0   1 1   0 0   1 1   12 12   1 1   0 0   0 0   1 1   0 0   1 1   0 0   1 1   1 1   1 1   1 1   13 13   1 1   1 1   0 0   1 1   0 0   1 1   0 0   1 1   0 0   1 1   1 1   14 14   1 1   0 0   0 0   0 0   1 1   1 1   0 0   1 1   0 0   0 0   1 1   15 15   1 1   1 1   0 0   0 0   1 1   1 1   1 1   1 1   0 0   1 1   1 1   16 16   1 1   1 1   1 1   0 0   1 1   1 1   1 1   0 0   0 0   1 1   0 0   17 17   1 1   0 0   0 0   1 1   1 1   1 1   0 0   0 0   1 1   0 0   0 0   18 18   1 1   1 1   0 0   1 1   1 1   1 1   1 1   1 1   0 0   0 0   0 0   19 19   1 1   0 0   0 0   0 0   0 0   1 1   1 1   0 0   0 0   0 0   0 0   20 20   1 1   0 0   1 1   0 0   0 0   0 0   1 1   0 0   0 0   0 0   1 1   21 twenty one   1 1   1 1   0 0   1 1   0 0   0 0   0 0   0 0   0 0   1 1   1 1   22 twenty two   1 1   0 0   0 0   0 0   1 1   0 0   0 0   1 1   1 1   0 0   1 1   23 twenty three   1 1   1 1   1 1   0 0   1 1   0 0   0 0   0 0   1 1   1 1   1 1   24 twenty four   1 1   1 1   1 1   1 1   1 1   0 0   1 1   1 1   1 1   1 1   0 0   25 25   1 1   1 1   0 0   0 0   0 0   1 1   1 1   1 1   0 0   0 0   1 1   26 26   1 1   0 0   1 1   1 1   0 0   1 1   0 0   0 0   1 1   1 1   0 0   27 27   1 1   1 1   1 1   1 1   0 0   1 1   0 0   1 1   1 1   1 1   0 0   28 28   1 1   0 0   1 1   0 0   1 1   1 1   1 1   0 0   1 1   0 0   0 0   29 29   1 1   0 0   1 1   1 1   1 1   1 1   1 1   1 1   1 1   0 0   0 0   30 30   1 1   1 1   1 1   1 1   1 1   1 1   1 1   1 1   1 1   1 1   1 1   31 31   1 1   0 0   0 0   0 0   0 0   0 0   0 0   0 0   0 0   0 0   0 0

对于ACK/NACK复用反馈3或4比特编码,假设输入序列为

Figure BDA0000052604910000032
输出序列为
Figure BDA0000052604910000033
则编码方式为:For ACK/NACK multiplexing feedback 3 or 4-bit coding, assume that the input sequence is
Figure BDA0000052604910000032
The output sequence is
Figure BDA0000052604910000033
Then the encoding method is:

Figure BDA0000052604910000041
其中Mi,o如表6所示。
Figure BDA0000052604910000041
Among them, M i, o are shown in Table 6.

信道交织的作用是将数据信息、控制信息交织在一起,现有技术中的交织过程描述如下:The function of channel interleaving is to interweave data information and control information together. The interleaving process in the prior art is described as follows:

步骤1,计算该子帧交织矩阵的列数和行数,列数

Figure BDA0000052604910000042
其中
Figure BDA0000052604910000043
代表一个子帧中用于PUSCH传输的SC-OFDM符号个数,代表一个时隙中SC-OFDM符号的个数,NSRS代表一个子帧中用于SRS传输的SC-OFDM符号个数;行数Rmux=H″/Cmux,其中H″代表一个子帧中所有调制符号的个数;Step 1, calculate the number of columns and rows of the subframe interleaving matrix, the number of columns
Figure BDA0000052604910000042
in
Figure BDA0000052604910000043
Represents the number of SC-OFDM symbols used for PUSCH transmission in a subframe, Represents the number of SC-OFDM symbols in a time slot, N SRS represents the number of SC-OFDM symbols used for SRS transmission in a subframe; the number of rows R mux = H″/C mux , where H″ represents a subframe The number of all modulation symbols in ;

步骤2,如果RI信息在该子帧上传输,就将RI编码后的信息按照表7所示的列顺序从最后一行开始往上填充;Step 2, if the RI information is transmitted on the subframe, fill the RI coded information from the last row upwards according to the column order shown in Table 7;

表7RI信息在信道交织矩阵中的列集合Table 7 Column set of RI information in the channel interleaving matrix

  循环前缀配置(CP configuration) Cyclic prefix configuration (CP configuration)   RI所在的列编号 The column number where the RI is located   正常状态(普通) Normal state (common)   {1,10,7,4} {1, 10, 7, 4}   扩展状态(扩展) Extended state (extended)   {0,8,5,3} {0, 8, 5, 3}

步骤3,RI填充完后,将复用后的数据和CQI信息从矩阵的第一行开始依次往下填充,如果遇到RI信息,则跳过;Step 3, after the RI is filled, fill the multiplexed data and CQI information from the first row of the matrix to the bottom one by one, and skip if RI information is encountered;

步骤4,如果HARQ-ACK信息在该子帧上传输,按照表8所示的列顺序从最后一行开始往上填充,如果要填充的位置有步骤3中填充的数据则覆盖;Step 4, if the HARQ-ACK information is transmitted on the subframe, fill it from the last row upwards according to the column order shown in Table 8, and overwrite it if the position to be filled has the data filled in step 3;

表8HARQ-ACK信息在信道交织矩阵中的列集合Table 8 Column set of HARQ-ACK information in channel interleaving matrix

  循环前缀配置(CP configuration) Cyclic prefix configuration (CP configuration)   HARQ-ACK所在的列编号 The column number where the HARQ-ACK is located   正常状态(普通) Normal state (common)   {2,9,8,3} {2, 9, 8, 3}   扩展状态(扩展) Extended state (extended)   {1,7,6,2} {1, 7, 6, 2}

步骤5:从交织矩阵(Rmux*Cmux)中一列一列读出比特序列作为信道交织器的输出。Step 5: Read the bit sequence column by column from the interleaving matrix (R mux *C mux ) as the output of the channel interleaver.

最后,加扰模块对信道交织的输出进行加扰,加扰规则为:Finally, the scrambling module scrambles the output of channel interleaving, and the scrambling rule is:

被加扰数据如果为占位符“x”,则加扰后为“1”。If the scrambled data is a placeholder "x", it will be "1" after scrambling.

被加扰数据如果为占位符“y”,则加扰后为“前一比特的加扰值”。If the scrambled data is a placeholder "y", it will be "the scrambled value of the previous bit" after scrambling.

若为非占位符,则加扰后为随机序列和被加扰数据的异或值。If it is not a placeholder, it will be the XOR value of the random sequence and the scrambled data after scrambling.

在如上所述的现有技术中,由于信道交织之后的加扰模块要根据数据类型的不同采用不同的加扰方法,所以交织器中的每个数据都需要额外存储两个比特来指示数据类型,其中数据类型如上所述包括:RI、HARQ-ACK、复用后的数据和CQI信息,这浪费了大量存储空间;RI编码和HARQ-ACK编码均与QAM有关;存在x、y占位符,增加了复杂度;同时,交织和加扰部分数据量大,在现有技术中按比特进行操作,耗费时间长,影响整个系统的速率。In the prior art as mentioned above, since the scrambling module after channel interleaving adopts different scrambling methods according to different data types, each data in the interleaver needs to store two additional bits to indicate the data type , where the data types include: RI, HARQ-ACK, multiplexed data, and CQI information as described above, which wastes a lot of storage space; both RI encoding and HARQ-ACK encoding are related to QAM; there are x, y placeholders , increasing the complexity; at the same time, the amount of data in the interleaving and scrambling part is large, and operations are performed on a per-bit basis in the prior art, which takes a long time and affects the rate of the entire system.

发明内容 Contents of the invention

本发明的目的是解决上述现有技术的需要占用大量存储空间和速度较慢的缺点,利用控制信息RI和HARQ-ACK编码方式的特点提出了一种3GPP LTE PUSCH信道并行信道交织和加扰的实现方法。The purpose of the present invention is to solve the shortcomings of the above-mentioned prior art that require a large amount of storage space and slow speed, and propose a 3GPP LTE PUSCH channel parallel channel interleaving and scrambling method by using the characteristics of the control information RI and HARQ-ACK coding methods Implementation.

根据本发明的一个发明,提供了一种3GPP LTE PUSCH信道并行信道交织和加扰的实现方法,包括下列步骤:According to an invention of the present invention, a kind of realization method of 3GPP LTE PUSCH channel parallel channel interleaving and scrambling is provided, comprising the following steps:

1)对RI信息和ACK/NACK信息进行编码;1) Encoding RI information and ACK/NACK information;

2)输入RI信息、控制和数据信息和ACK/NACK信息,并存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI和最后写入的ACK/NACK信息所在的行编号last_row_indexACK和列编号last_column_indexACK,根据最后写入的RI信息所在的行编号和列编号和最后写入的ACK/NACK信息所在的行编号和列编号进行信道交织的输出操作;2) Input RI information, control and data information, and ACK/NACK information, and store the row number last_row_index RI and column number last_column_index RI where the last written RI information is located and the row number last_row_index ACK where the last written ACK/NACK information is located and column number last_column_index ACK , perform channel interleaving output operation according to the row number and column number where the last written RI information is located and the row number and column number where the last written ACK/NACK information is located;

3)对RI信息、复用后的控制和数据信息和ACK/NACK信息进行加扰。3) Scrambling RI information, multiplexed control and data information, and ACK/NACK information.

在上述方法中,所述步骤2)进一步包括:In the above method, said step 2) further includes:

21)计算子帧在信道交织存储器中占用的交织矩阵的行、列数;21) Calculate the number of rows and columns of the interleaving matrix occupied by the subframe in the channel interleaving memory;

22)从信道交织存储器矩阵的最后一行开始往上写入RI信息并存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI22) From the last row of the channel interleaving memory matrix, write RI information up and store the row number last_row_index RI and column number last_column_index RI where the last written RI information is located;

23)根据最后写入的RI信息所在的行编号和列编号写入复用后的数据和CQI信息;23) Write the multiplexed data and CQI information according to the row number and column number where the last written RI information is located;

24)写入ACK/NACK信息;24) Write ACK/NACK information;

25)根据最后写入的RI信息所在的行编号和列编号和/或最后写入的ACK/NACK信息所在的行编号和列编号,按列输出信道交织矩阵中的所有信息和数据。25) According to the row number and column number where the last written RI information is located and/or the row number and column number where the last written ACK/NACK information is located, output all information and data in the channel interleaving matrix by column.

在上述方法中,所述步骤1)中对RI信息进行编码的步骤包括:将RI信息编码为6比特数据,其中前4位均为1,后两位为最低有效位。In the above method, the step of encoding the RI information in step 1) includes: encoding the RI information into 6-bit data, wherein the first 4 bits are all 1, and the last two bits are the least significant bits.

在上述方法中,所述步骤1)中对ACK/NACK信息进行编码的步骤包括:将复用反馈模式中的1或2比特ACK/NACK信息编码为6比特数据,其中前4位均为1,后两位为最低有效位。In the above method, the step of encoding the ACK/NACK information in step 1) includes: encoding the 1 or 2-bit ACK/NACK information in the multiplexed feedback mode into 6-bit data, wherein the first 4 bits are all 1 , the last two digits are the least significant digits.

在上述方法中,所述步骤1)中对ACK/NACK信息进行编码的步骤包括:首先,将捆绑模式中的1或2比特ACK/NACK信息按照复用反馈模式采用的编码方式进行编码;然后将加扰序列当作12位的循环移位寄存器,每个时钟上升沿右移两比特添加到该寄存器的最左端,获得的2比特输出数据和复用反馈模式的输出数据最低的2位比特进行加扰。In the above method, the step of encoding the ACK/NACK information in step 1) includes: first, encoding the 1 or 2-bit ACK/NACK information in the bundling mode according to the encoding method adopted in the multiplexing feedback mode; then The scrambling sequence is regarded as a 12-bit circular shift register, and each rising edge of the clock shifts two bits to the right and adds to the leftmost end of the register, and the obtained 2-bit output data and the lowest 2 bits of the output data of the multiplexed feedback mode Do scrambling.

在上述方法中,所述步骤1)中对复用反馈模式中的3或4比特ACK/NACK信息编码时,将输入序列与基序列进行按位与,得到的序列再通过按位异或完成模2累加。In the above method, when encoding the 3 or 4-bit ACK/NACK information in the multiplexing feedback mode in the step 1), the input sequence and the base sequence are bitwise ANDed, and the obtained sequence is completed by bitwise exclusive OR Modulo 2 accumulates.

在上述方法中,所述步骤3)包括:In the above method, said step 3) includes:

31)采用31位并行的方式初始化伪随机加扰序列;31) Initialize the pseudo-random scrambling sequence in a 31-bit parallel manner;

32)根据初始化的伪随机加扰序列并行递推生成伪随机加扰序列;32) Generate a pseudo-random scrambling sequence in parallel and recursively according to the initialized pseudo-random scrambling sequence;

33)利用所生成的伪随机加扰序列进行数据加扰。33) Perform data scrambling using the generated pseudo-random scrambling sequence.

根据本发明另一方面,还提供了一种3GPP LTE PUSCH信道并行信道交织和加扰系统,包括:According to another aspect of the present invention, a kind of 3GPP LTE PUSCH channel parallel channel interleaving and scrambling system is also provided, comprising:

RI信道编码器,用于对RI信息进行信道编码;RI channel coder, for carrying out channel coding to RI information;

HARQ-ACK信道编码器,用于对ACK/NACK信息进行信道编码;HARQ-ACK channel encoder, used for channel encoding ACK/NACK information;

信道交织系统,输入RI信息、控制和数据信息和ACK/NACK信息,存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI和最后写入的ACK/NACK信息所在的行编号last_row_indexACK和列编号last_column_indexACK,根据最后写入的RI信息所在的行编号和列编号和/或最后写入的ACK/NACK信息所在的行编号和列编号进行信道交织的输出操作;Channel interleaving system, input RI information, control and data information and ACK/NACK information, store the row number last_row_index RI and column number last_column_index of the last written RI information, and the row number last_row_index of the last written ACK/NACK information ACK and column number last_column_index ACK , perform channel interleaving output operation according to the row number and column number where the last written RI information is located and/or the row number and column number where the last written ACK/NACK information is located;

加扰装置,用于对RI信息、复用后的控制和数据信息、ACK/NACK信息进行加扰。The scrambling device is used for scrambling RI information, multiplexed control and data information, and ACK/NACK information.

在上述信道交织和加扰系统中,所述信道交织系统包括信道交织写控制器、信道交织存储器以及信道交织读控制器,其中In the above channel interleaving and scrambling system, the channel interleaving system includes a channel interleaving write controller, a channel interleaving memory, and a channel interleaving read controller, wherein

信道交织写控制器,首先,计算子帧在信道交织存储器中占用的交织矩阵的行、列数;然后,从信道交织存储器矩阵的最后一行开始往上写入RI信息并存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI,根据最后写入的RI信息所在的行编号和列编号写入复用后的数据和CQI信息,写入ACK/NACK信息;The channel interleaving and writing controller, first, calculates the number of rows and columns of the interleaving matrix occupied by the subframe in the channel interleaving memory; then, writes RI information upwards from the last row of the channel interleaving memory matrix and stores the last written RI The row number last_row_index RI and the column number last_column_index RI where the information is located, write the multiplexed data and CQI information according to the row number and column number of the last written RI information, and write the ACK/NACK information;

信道交织存储器,用于存储RI信息、复用后的数据和控制信息、ACK/NACK信息;A channel interleaving memory, used to store RI information, multiplexed data and control information, and ACK/NACK information;

信道交织读控制器,用于接收信道交织写控制器计算出的信道交织矩阵的行、列数,并按列输出信道交织存储器中的存储的所有信息。The channel interleaving read controller is used to receive the number of rows and columns of the channel interleaving matrix calculated by the channel interleaving write controller, and output all information stored in the channel interleaving memory by column.

在上述信道交织和加扰系统中,所述信道交织存储器包括12个子存储器,每一个子存储器存储1列信息。In the above channel interleaving and scrambling system, the channel interleaving memory includes 12 sub-memory, and each sub-memory stores one column of information.

在本发明中,RI编码、HARQ-ACK编码、信道交织及加扰模块按符号操作,与比特级操作相比,大幅提高了处理速度;编码和交织阶段无需生成和存储“x”和“y”占位符,使得编码方式与QAM调整方式无关;通过交织时最后写入的RI和HARQ-ACK地址判断是否是RI和HARQ-ACK信息,节约了存储空间;加扰采用并行加扰方式,通过前面生成的指示信号判断元素类型,进行符号加扰,降低了硬件开销,进一步加快了加扰速度。In the present invention, RI coding, HARQ-ACK coding, channel interleaving and scrambling modules are operated by symbols, which greatly improves the processing speed compared with bit-level operations; the coding and interleaving stages do not need to generate and store "x" and "y " placeholder, so that the encoding method has nothing to do with the QAM adjustment method; judge whether it is RI and HARQ-ACK information by the last written RI and HARQ-ACK address during interleaving, saving storage space; scrambling adopts parallel scrambling method, The type of the element is judged by the indicator signal generated above, and the symbol scramble is performed, which reduces the hardware overhead and further speeds up the scrambling speed.

附图说明 Description of drawings

图1是3GPP LTE PUSCH信道编码的数据流程示意图;Figure 1 is a schematic diagram of the data flow of 3GPP LTE PUSCH channel coding;

图2是根据本发明优选实施例的3GPP LTE PUSCH信道并行信道交织和加扰系统的框图。2 is a block diagram of a 3GPP LTE PUSCH channel parallel channel interleaving and scrambling system according to a preferred embodiment of the present invention.

具体实施方式 Detailed ways

为了使本发明的目的、技术方案及优点更加清楚明白,以下结合附图,对根据本发明一个实施例的交织和加扰方法和系统进一步详细说明。应当理解,此处所描述的具体实施例仅仅用以解释本发明,并不用于限定本发明。In order to make the purpose, technical solution and advantages of the present invention clearer, the interleaving and scrambling method and system according to an embodiment of the present invention will be further described in detail below in conjunction with the accompanying drawings. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

根据本发明的优选实施例,该方法包括下列步骤:According to a preferred embodiment of the present invention, the method comprises the following steps:

101.RI(Rank indicator)信道编码101.RI (Rank indicator) channel coding

RI最多有2比特的有效信息,具体而言,在按符号交织和加扰时,编码后的一个符号中只有低两比特有效,高位比特是x或者无效。因此,在本发明的优选实施例中,将数据位宽定为6比特,其中高4比特固定为1,从而使得RI信道编码与QAM调制模式无关,具体实现方式如下:如果只有1比特RI信息,则编码后的一个符号为

Figure BDA0000052604910000081
最右边是最低有效位(LSB),将其连续输出,直到输出符号数达到规定的数目。如果有2比特RI信息,则编码后的符号为
Figure BDA0000052604910000082
其中
Figure BDA0000052604910000083
最右边是最低有效位(LSB),将它们依次循环输出,直到输出符号数达到规定的数目。The RI has at most 2 bits of valid information. Specifically, when interleaving and scrambling by symbol, only the lower two bits of a coded symbol are valid, and the higher bits are x or invalid. Therefore, in a preferred embodiment of the present invention, the data bit width is set to 6 bits, and the upper 4 bits are fixed to 1, so that the RI channel coding has nothing to do with the QAM modulation mode. The specific implementation is as follows: If only 1 bit RI information , then a coded symbol is
Figure BDA0000052604910000081
The rightmost is the least significant bit (LSB), which is continuously output until the number of output symbols reaches the specified number. If there is 2-bit RI information, the coded symbol is
Figure BDA0000052604910000082
in
Figure BDA0000052604910000083
The rightmost is the least significant bit (LSB), and they are output cyclically in turn until the number of output symbols reaches the specified number.

本领域普通技术人员可以理解,上面给出了一种优选的RI(Rankindicator)信道编码方法,但其也可以用其它方法来实现,例如3GPP协议中所规定的。Those skilled in the art can understand that a preferred RI (Rankindicator) channel coding method is given above, but it can also be implemented by other methods, such as those stipulated in the 3GPP protocol.

102.HARQ-ACK信道编码102.HARQ-ACK channel coding

对于ACK/NACK复用反馈1、2比特编码,按符号操作时,编码后的一个符号中只有低两比特有效,高位比特是x或者无效。因此,在本发明的优选实施例中,将数据位宽定为6比特,其中高4比特固定为1,从而使得HARQ-ACK信道编码与QAM调制模式无关。此种情况下实现方式和RI实现方式相同,在此不再重复。由于RI编码和HARQ-ACK编码不需要同时进行,因此可以利用RI编码的电路来实现HARQ-ACK编码。For ACK/NACK multiplexing feedback 1, 2-bit coding, when operating according to the symbol, only the lower two bits in a coded symbol are valid, and the upper bit is x or invalid. Therefore, in the preferred embodiment of the present invention, the data bit width is set to 6 bits, and the upper 4 bits are fixed as 1, so that the HARQ-ACK channel coding has nothing to do with the QAM modulation mode. In this case, the implementation manner is the same as that of the RI, and will not be repeated here. Since the RI coding and the HARQ-ACK coding do not need to be performed simultaneously, the RI coding circuit can be used to realize the HARQ-ACK coding.

对于ACK/NACK捆绑反馈,编码方式是先进行ACK/NACK复用反馈1或2比特的编码,然后对ACK/NACK复用反馈的输出数据进行加扰(异或)。实现时,根据加扰方式在1比特编码时是一次读取一位加扰比特,2比特编码时是三次读取同一个加扰比特,将加扰序列wACK当作一个12位的循环移位寄存器,每个时钟上升沿右移两比特添加到寄存器的最左端(MSB),得到的2比特输出数据wACK[1:0]和ACK/NACK复用反馈的输出数据最低的2位比特进行加扰。For ACK/NACK bundling feedback, the encoding method is to perform 1 or 2-bit encoding of ACK/NACK multiplexing feedback, and then scramble (exclusive OR) the output data of ACK/NACK multiplexing feedback. During implementation, according to the scrambling method, one scrambled bit is read at a time during 1-bit encoding, and the same scrambled bit is read three times during 2-bit encoding, and the scrambling sequence w ACK is regarded as a 12-bit cyclic shift Bit register, each clock rising edge shifts two bits to the right and adds to the leftmost end (MSB) of the register, and the resulting 2-bit output data w ACK [1:0] and ACK/NACK multiplexing feedback output data The lowest 2 bits Do scrambling.

加扰序列wACK的初始值在1比特编码时如表9所示,2比特编码时如表10所示,其中i=(Nbundled-1)mod 4,其中Nbundled为输入参数。The initial value of the scrambling sequence w ACK is shown in Table 9 for 1-bit encoding, and shown in Table 10 for 2-bit encoding, where i=(N bundled -1) mod 4, where N bundled is an input parameter.

表9HARQ-ACK/NACK 1-bit捆绑反馈编码加扰序列Table 9 HARQ-ACK/NACK 1-bit bundling feedback coding scrambling sequence

  i i   wACK[11:0]w ACK [11:0]   0 0   1111_1111_1111 1111_1111_1111   1 1   0101_0101_0101 0101_0101_0101   2 2   0011_0011_0011 0011_0011_0011   3 3   1001_1001_1001 1001_1001_1001

表10HARQ-ACK/NACK 2-bit捆绑反馈编码加扰序列Table 10 HARQ-ACK/NACK 2-bit bundling feedback coding scrambling sequence

  i i   wACK[11:0]w ACK [11:0]   0 0   1111_1111_1111 1111_1111_1111   1 1   0001_1100_0111 0001_1100_0111   2 2   0000_0011_1111 0000_0011_1111   3 3   1110_0000_0111 1110_0000_0111

对于ACK/NACK复用反馈3、4比特编码,假设输入序列为

Figure BDA0000052604910000091
输出序列为
Figure BDA0000052604910000092
则编码方式为:For ACK/NACK multiplexing feedback 3, 4-bit coding, assume that the input sequence is
Figure BDA0000052604910000091
The output sequence is
Figure BDA0000052604910000092
Then the encoding method is:

优选地,将输入序列与[M(i mod 32),0,M(i mod 32),1,M(i mod 32),2,M(i mod 32),3,]进行按位与,得到的序列再通过按位异或完成模2累加,获得输出序列由此,编码过程经过一个时钟周期就能完成。 Preferably, the input sequence is bitwise ANDed with [M (i mod 32), 0 , M (i mod 32), 1 , M (i mod 32), 2 , M (i mod 32), 3, ], The obtained sequence is then completed by bitwise XOR to complete the modulo 2 accumulation to obtain the output sequence Thus, the encoding process can be completed after one clock cycle.

本领域普通技术人员可以理解,上面给出了一种优选的HARQ-ACK信道编码方法,但其也可以用其它方法来实现,例如3GPP协议中所规定的。Those skilled in the art can understand that a preferred HARQ-ACK channel coding method is given above, but it can also be implemented by other methods, such as those stipulated in the 3GPP protocol.

103.信道交织103. Channel Interleaving

具体流程为如下。The specific process is as follows.

步骤1:计算该子帧在信道交织存储器中矩阵的行、列数。Step 1: Calculate the number of rows and columns of the subframe in the channel interleaving memory.

列数

Figure BDA0000052604910000103
其中
Figure BDA0000052604910000104
代表一个子帧中用于PUSCH传输的SC-OFDM符号个数,
Figure BDA0000052604910000105
代表一个时隙中SC-OFDM符号的个数,NSRS代表一个子帧中用于SRS传输的SC-OFDM符号个数;行数Rmux=H″/Cmux,其中H″代表一个子帧中所有调制符号的个数。Number of columns
Figure BDA0000052604910000103
in
Figure BDA0000052604910000104
Represents the number of SC-OFDM symbols used for PUSCH transmission in a subframe,
Figure BDA0000052604910000105
Represents the number of SC-OFDM symbols in a time slot, N SRS represents the number of SC-OFDM symbols used for SRS transmission in a subframe; the number of rows R mux = H″/C mux , where H″ represents a subframe The number of all modulation symbols in .

步骤2:如果RI信息在该子帧上传输,则从信道交织存储器矩阵的最后一行开始往上写入RI信息并且存储最后写入的RI所在的位置,其中last_row_indexRI和last_column_indexRI分别为最后写入的RI所处的行和列编号。最后写入的RI所在的位置可以用于后续步骤,从而避免了需要额外存储两个比特来指示RI的数据类型,从而节省了大量存储空间。Step 2: If the RI information is transmitted on the subframe, write the RI information upwards from the last row of the channel interleaving memory matrix and store the position of the last written RI, where last_row_index RI and last_column_index RI are the last written The row and column number of the imported RI. The location of the last written RI can be used in subsequent steps, thereby avoiding the need to store two additional bits to indicate the data type of the RI, thereby saving a large amount of storage space.

步骤3:写入复用后的数据和CQI信息。其中CQI信息在前,数据信息在后。此时写入时需要跳过前面输入的RI信息,这就需要通过最后写入的RI所在的行和列位置信息,判断出所有RI的位置。令row_index为当前输入数据写到的行编号。Step 3: Write the multiplexed data and CQI information. The CQI information comes first, and the data information follows. At this time, it is necessary to skip the previously input RI information when writing, and it is necessary to determine the positions of all RIs based on the row and column position information of the last written RI. Let row_index be the row number to which the current input data is written.

步骤3.1,当row_index<last_row_indexRI时,此行没有RI信息,将复用后的数据和CQI信息按顺序写入交织器;Step 3.1, when row_index<last_row_index RI , there is no RI information in this row, and the multiplexed data and CQI information are written into the interleaver in sequence;

步骤3.2,当row_index=last_row_indexRI,即到达RI写入的最后一行时,如表11所示该行所有RI符号所处的列位置:Step 3.2, when row_index=last_row_index RI , that is, when the last row written by RI is reached, the column positions of all RI symbols in this row are shown in Table 11:

表11最后写入的RI所处的列编号Table 11 The column number of the last written RI

与最后写入的RI所处的行中存在RI的列的编号的关系表The relationship table with the number of the column where RI exists in the row where the last written RI is located

Figure BDA0000052604910000111
Figure BDA0000052604910000111

其中

Figure BDA0000052604910000112
表示最后写入的RI所处的行中存在RI的列的编号,将复用后的数据和CQI信息写入交织器时需要跳过这些位置。in
Figure BDA0000052604910000112
Indicates the number of the RI column in the row where the last written RI is located, and these positions need to be skipped when writing the multiplexed data and CQI information into the interleaver.

步骤3.3,当Rmux>=row_index>last_row_indexRI时,用

Figure BDA0000052604910000113
表示该行所有RI符号所处的列位置。对于普通CP,
Figure BDA0000052604910000114
10、7或4;对于扩展CP,8、5或3,将复用后的数据和CQI信息写入交织器时需要跳过这些位置。Step 3.3, when R mux >= row_index > last_row_index RI , use
Figure BDA0000052604910000113
Indicates the column position of all RI symbols in the row. For ordinary CP,
Figure BDA0000052604910000114
10, 7 or 4; for extended CP, 8, 5 or 3, these positions need to be skipped when writing the multiplexed data and CQI information into the interleaver.

步骤4,如果HARQ-ACK信息在该子帧上传输,则写入HARQ-ACK信息。Step 4, if the HARQ-ACK information is transmitted on the subframe, write the HARQ-ACK information.

步骤5,信道交织的输出:数据读出按列进行,从第一列第一行开始,读完第一列,再转到第二列,一直进行到cmux列,全部数据读出。Step 5, output of channel interleaving: data readout is carried out by column, starting from the first column and first row, after reading the first column, then turn to the second column, proceed to the c mux column, and read all the data.

当读到RI信息时,将RI指示信号置高,当读到HARQ-ACK信息时,将HARQ-ACK指示信号置高。When the RI information is read, the RI indicator signal is set high, and when the HARQ-ACK information is read, the HARQ-ACK indicator signal is set high.

如果当前列编号为普通CP情况的1、10、7、4或扩展CP情况的0、8、5、3,并且行号满足row_index≥last_row_indexRI+1-ri_indicator[i]),就表示当前符号为RI信息符号,需要将RI指示信号置高。其中ri_indicator[i]由最后一个RI符号所处的列位置last_column_indexRI决定,如表12所示:If the current column number is 1, 10, 7, 4 in the normal CP case or 0, 8, 5, 3 in the extended CP case, and the row number satisfies row_index≥last_row_index RI +1-ri_indicator[i]), it means the current symbol For the RI information symbol, the RI indication signal needs to be set high. Where ri_indicator[i] is determined by the column position last_column_index RI where the last RI symbol is located, as shown in Table 12:

表12Table 12

Figure BDA0000052604910000121
Figure BDA0000052604910000121

i=0,1,2,3,代表了当前列在4个可能的RI列中的位置,设定普通CP情况时,第1列为i=0;第4列为i=1;第7列为i=2;第10列为i=3;扩展CP情况时,第0列为i=0;第3列为i=1;第5列为i=2;第8列为i=3。i=0, 1, 2, 3, represents the position of the current column in the 4 possible RI columns. When setting the normal CP situation, the 1st column is i=0; the 4th column is i=1; the 7th Column is i=2; column 10 is i=3; column 0 is i=0; column 3 is i=1; column 5 is i=2; column 8 is i=3 .

如果当前列编号为普通CP情况的2、9、8、3或扩展CP情况的1、7、6、2,并且行号满足row_index≥last_row_indexACK+1-ack_indicator[i],就表示当前符号为HARQ-ACK信息符号,需要将HARQ-ACK指示信号置高。其中ack_indicator[i]由最后一个HARQ-ACK符号所处的列位置last_column_indexACK决定,如表13所示:If the current column number is 2, 9, 8, 3 in the normal CP case or 1, 7, 6, 2 in the extended CP case, and the row number satisfies row_index≥last_row_index ACK +1-ack_indicator[i], it means that the current symbol is For the HARQ-ACK information symbol, the HARQ-ACK indication signal needs to be set high. Where ack_indicator[i] is determined by the column position last_column_index ACK where the last HARQ-ACK symbol is located, as shown in Table 13:

表13Table 13

Figure BDA0000052604910000122
Figure BDA0000052604910000122

i=0,1,2,3,代表了当前列在4个可能的HARQ-ACK列中的位置,设定普通CP情况时,第2列为i=0;第3列为i=1;第8列为i=2;第9列为i=3;扩展CP情况时,第1列为i=0;第2列为i=1;第6列为i=2;第7列为i=3。i=0, 1, 2, 3, representing the position of the current column in the 4 possible HARQ-ACK columns. When setting the normal CP situation, the second column is i=0; the third column is i=1; The 8th column is i=2; the 9th column is i=3; when extending the CP case, the 1st column is i=0; the 2nd column is i=1; the 6th column is i=2; the 7th column is i =3.

104.加扰,优选地,采用并行的方式进行。104. The scrambling is preferably performed in parallel.

步骤1:初始化伪随机加扰序列Step 1: Initialize the pseudo-random scrambling sequence

令c代表伪随机序列,采用最大的31位并行计算,得到x1(1600)和x2(1600),从而得到伪随机加扰序列的初始值c(0)=(x1(1600)+x2(1600))mod2,伪随机序列的具体生成公式参考协议3GPP 36.211 7.2节。Let c represent a pseudo-random sequence, and use the largest 31-bit parallel calculation to obtain x1(1600) and x2(1600), thereby obtaining the initial value c(0) of the pseudo-random scrambling sequence=(x1(1600)+x2(1600 ))mod2, the specific generation formula of the pseudo-random sequence refers to the protocol 3GPP 36.211 Section 7.2.

并行计算方法是x1和x2都采用31位的寄存器表示,在初始时刻计算出包含31个初始比特的x1[30:0]和x2[30:0]的值;之后就可以每个时钟周期并行递推得到31位的x1和x2;在最后一个初始化周期时钟也就是第52个时钟周期,只用对x1和x2的高19比特进行递推计算,得到x1(1600)和x2(1600)。The parallel calculation method is that both x1 and x2 are represented by 31-bit registers, and the values of x1[30:0] and x2[30:0] containing 31 initial bits are calculated at the initial moment; after that, each clock cycle can be parallelized The 31-bit x1 and x2 are obtained by recursion; in the last initialization cycle clock, which is the 52nd clock cycle, only the upper 19 bits of x1 and x2 are recursively calculated to obtain x1 (1600) and x2 (1600).

步骤2:生成伪随机加扰序列Step 2: Generate pseudo-random scrambling sequence

同时并行产生2位c[1:0]、4位c[3:0]、6位c[5:0]的伪随机加扰序列,分别对应QPSK、QAM16、QAM64情况下的加扰。At the same time, pseudo-random scrambling sequences of 2 bits c[1:0], 4 bits c[3:0], and 6 bits c[5:0] are generated in parallel, corresponding to scrambling in the case of QPSK, QAM16, and QAM64, respectively.

并行计算方法类似步骤1,只是每次并行递推的位数不同。QPSK模式时并行递推x1[1:0]和x2[1:0];QAM16模式时并行递推x1[3:0]和x2[3:0];QAM64时模式时并行递推x1[5:0]和x2[5:0]。然后再根据x1和x2计算c[1:0]、c[3:0]或c[5:0]。The parallel calculation method is similar to step 1, except that the number of bits for each parallel recursion is different. Parallel recursion x1[1:0] and x2[1:0] in QPSK mode; parallel recursion x1[3:0] and x2[3:0] in QAM16 mode; parallel recursion x1[5 in QAM64 mode :0] and x2[5:0]. Then calculate c[1:0], c[3:0] or c[5:0] based on x1 and x2.

步骤3:数据加扰Step 3: Data Scrambling

在此步骤需要按照协议的加扰规则进行加扰,由于本发明不存在占位符“x”和“y”,所以,对不同信息或数据的加扰方法包括以下3种:In this step, scrambling needs to be performed according to the scrambling rules of the protocol. Since there are no placeholders "x" and "y" in the present invention, the scrambling methods for different information or data include the following three types:

方法a:加扰最低位,次低位与最低位相同,即输入数据与6比特的{0000,c[0],c[0]}进行加扰。Method a: scramble the lowest bit, the second lowest bit is the same as the lowest bit, that is, the input data is scrambled with 6 bits of {0000, c[0], c[0]}.

方法b:加扰最低2位,即输入数据与6比特的{0000,c[1:0]}进行加扰;Method b: Scramble the lowest 2 bits, that is, input data and 6-bit {0000, c[1:0]} are scrambled;

方法c:全部加扰,即输入数据与6比特的c[5:0]进行加扰。Method c: all scrambled, that is, the input data is scrambled with 6-bit c[5:0].

根据本发明的具体实施例,完整的加扰方案为:According to a specific embodiment of the present invention, the complete scrambling scheme is:

若输入为RI信息,1比特编码的情况下,采用方法a;2比特编码情况下,采用方法b;If the input is RI information, in the case of 1-bit encoding, use method a; in the case of 2-bit encoding, use method b;

若输入为复用后的控制和数据信息,全部加扰,采用方法c;If the input is multiplexed control and data information, all scrambled, adopt method c;

若输入为HARQ-ACK信息,当反馈模式为复用反馈1比特时,采用方法a;复用反馈2比特时,采用方法b;其他HARQ-ACK信息的情况下加扰所有数据,采用方法c。If the input is HARQ-ACK information, when the feedback mode is 1-bit multiplex feedback, use method a; when multiplex feedback 2 bits, use method b; in the case of other HARQ-ACK information, scramble all data, use method c .

根据本发明的另一方面,还提供了一种3GPP LTE PUSCH信道并行信道交织和加扰系统,其结构如图2所示,该系统主要包括以下几部分:According to another aspect of the present invention, also provide a kind of 3GPP LTE PUSCH channel parallel channel interleaving and scrambling system, its structure is as shown in Figure 2, and this system mainly comprises the following several parts:

RI信道编码器201,用于对RI信息进行信道编码。根据本发明的优选实施例,将RI信息编码为6比特数据,其中前4位均为1,后两位为最低有效位。RI channel encoder 201, configured to perform channel encoding on RI information. According to a preferred embodiment of the present invention, the RI information is encoded as 6-bit data, wherein the first 4 bits are all 1, and the last two bits are the least significant bits.

HARQ-ACK信道编码器202,用于对ACK/NACK信息进行信道编码。根据本发明优选实施例:将复用反馈模式中的1或2比特ACK/NACK信息编码为6比特数据,其中前4位均为1,后两位为最低有效位;在捆绑模式下,首先,使用复用反馈模式中1或2比特的编码方式编码为6比特数据,其中前4位均为1,后两位为最低有效位;然后将加扰序列当作12位的循环移位寄存器,每个时钟上升沿右移两比特添加到该寄存器的最左端,获得的2比特输出数据和复用反馈模式的输出数据最低的2位比特进行加扰;对复用反馈模式中的3或4比特ACK/NACK信息编码时,将输入序列与基序列进行按位与,得到的序列再通过按位异或完成模2累加。The HARQ-ACK channel encoder 202 is configured to perform channel encoding on ACK/NACK information. According to a preferred embodiment of the present invention: the 1 or 2-bit ACK/NACK information in the multiplexing feedback mode is encoded as 6-bit data, wherein the first 4 bits are all 1, and the last two bits are the least significant bits; in the bundling mode, first , use the 1 or 2-bit encoding method in the multiplexing feedback mode to encode 6-bit data, in which the first 4 bits are all 1, and the last two bits are the least significant bits; then the scrambling sequence is regarded as a 12-bit circular shift register , each clock rising edge shifts two bits to the right and adds to the leftmost end of the register, and the obtained 2-bit output data and the lowest 2 bits of the output data in the multiplexed feedback mode are scrambled; the 3 or 2 bits in the multiplexed feedback mode When 4-bit ACK/NACK information is encoded, the input sequence and the base sequence are bitwise ANDed, and the obtained sequence is then bitwise XORed to complete modulo 2 accumulation.

信道交织系统210,在信道交织的输入(写信道交织存储器)过程中存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI和最后写入的ACK/NACK信息所在的行编号last_row_indexACK和列编号last_column_indexACK,然后,根据它们进行信道交织的输出(读信道交织存储器)操作。在本发明的一个优选实施例中,信道交织系统210包括信道交织写控制器211、信道交织存储器212以及信道交织读控制器213。Channel interleaving system 210 stores the row number last_row_index RI and column number last_column_index RI of the last written RI information and the row number of the last written ACK/NACK information during the input of channel interleaving (writing channel interleaving memory) last_row_index ACK and column number last_column_index ACK , and then perform channel interleaving output (read channel interleaving memory) operation according to them. In a preferred embodiment of the present invention, the channel interleaving system 210 includes a channel interleaving write controller 211 , a channel interleaving memory 212 and a channel interleaving read controller 213 .

信道交织写控制器211,用于计算子帧在信道交织存储器212中占用的交织矩阵的行、列数,并且据此将所有信息按照其各自的类型写入到信道交织存储器212中的对应地址。优选地,该信道交织写控制器203包括状态机,其用于控制写入数据流的先后顺序,在本优选实施例中该写入顺序为依次输入RI信息、复用后的数据和控制信息、ACK/NACK信息。具体写入过程为:首先,从信道交织存储器矩阵的最后一行开始往上写入RI信息并在其中的寄存器中存储最后写入的RI信息所在的行编号last_row_indexRI和列编号last_column_indexRI;然后,根据最后写入的RI信息所在的行编号和列编号写入复用后的数据和CQI信息;最后,写入ACK/NACK信息。The channel interleaving write controller 211 is used to calculate the number of rows and columns of the interleaving matrix occupied by the subframe in the channel interleaving memory 212, and accordingly write all information to the corresponding addresses in the channel interleaving memory 212 according to their respective types . Preferably, the channel interleaving write controller 203 includes a state machine, which is used to control the sequence of writing data streams. In this preferred embodiment, the writing sequence is to sequentially input RI information, multiplexed data and control information , ACK/NACK information. The specific writing process is: first, write RI information up from the last line of the channel interleaving memory matrix and store the row number last_row_index RI and column number last_column_index RI where the last written RI information is in the register; then, Write the multiplexed data and CQI information according to the row number and column number where the last written RI information is located; finally, write the ACK/NACK information.

信道交织存储器212,用于存储RI信息、复用后的数据和控制信息、ACK/NACK信息。由于信道交织在硬件实现中按符号进行,即QPSK 2bit、QAM16 4bit、QAM64 6bit,所以优选地,信道交织存储器包括一组12个子存储器,每一个子存储器存储1列信息。子存储器宽度为6比特,深度为交织器列长度,即子载波个数为12×110=1320。The channel interleaving memory 212 is used to store RI information, multiplexed data and control information, and ACK/NACK information. Since channel interleaving is carried out by symbol in hardware implementation, that is, QPSK 2bit, QAM16 4bit, QAM64 6bit, so preferably, the channel interleaving memory includes a group of 12 sub-memory, and each sub-memory stores 1 column of information. The width of the sub-memory is 6 bits, and the depth is the column length of the interleaver, that is, the number of sub-carriers is 12×110=1320.

信道交织读控制器213,用于接收信道交织写控制器计算出的子帧在信道交织存储器212中占用的交织矩阵的行、列数,并据此输出信道交织存储器中的存储的所有信息。具体地,该输出按列进行,从第一列第一行开始,读完第一列,再转到第二列,一直进行到cmux列,当读到RI信息时,将RI指示信号置高,当读到HARQ-ACK信息时,将HARQ-ACK指示信号置高。The channel interleaving read controller 213 is used to receive the number of rows and columns of the interleaving matrix occupied by the subframe in the channel interleaving memory 212 calculated by the channel interleaving writing controller, and output all information stored in the channel interleaving memory accordingly. Specifically, the output is carried out by column, starting from the first column and the first row, after reading the first column, then turning to the second column, and proceeding to the c mux column, when the RI information is read, the RI indicator signal is set to High, when HARQ-ACK information is read, set the HARQ-ACK indication signal high.

加扰装置220,用于对RI信息、控制和数据信息、ACK/NACK信息进行加扰。根据本发明的优选实施例,该加扰过程是并行完成的。The scrambling device 220 is configured to scramble RI information, control and data information, and ACK/NACK information. According to a preferred embodiment of the present invention, the scrambling process is done in parallel.

应该注意到并理解,在不脱离后附的权利要求所要求的本发明的精神和范围的情况下,能够对上述详细描述的本发明做出各种修改和改进。因此,要求保护的技术方案的范围不受所给出的任何特定示范教导的限制。It should be noted and understood that various modifications and improvements can be made to the invention described in detail above without departing from the spirit and scope of the invention as claimed in the appended claims. Accordingly, the scope of the claimed technical solution is not limited by any particular exemplary teaching given.

Claims (10)

1. a 3GPP LTE PUSCH channel parallel channel interweaves and the implementation method of scrambling, comprises the following steps:
1) RI information and ACK/NACK information are encoded;
2) input RI information, the control after multiplexing and data message and ACK/NACK information are carried out channel interleaving, comprising:
21) transmit in subframe when RI information, begin up to write the line number last_row_index at the RI information place that RI information and storage write at last from last column of channel interleaving memory matrix RIWith column number last_column_index RI
22) according to line number and the column number at the RI information place that writes at last, skip the RI information that writes previously, write data and control information after multiplexing, wherein control information is front, and data message is rear;
23) transmit in this subframe when ACK/NACK information, write ACK/NACK information;
24) according to the line number at the line number at the RI information place that writes at last and column number and the ACK/NACK information place that writes at last and the output function that column number carries out channel interleaving;
3) RI information, control after multiplexing and data message and ACK/NACK information are carried out scrambling.
2. method according to claim 1 is characterized in that, described step 21) also comprise before:
20) calculate the row, column number of the interleaver matrix that subframe takies in the channel interleaving memory.
3. method according to claim 1 and 2 is characterized in that, the step of in the described step 1) RI information being encoded comprises: be 6 Bit datas with the RI information coding, wherein front 4 are 1, and rear two is least significant bit.
4. method according to claim 1 and 2, it is characterized in that, the step of in the described step 1) ACK/NACK information being encoded comprises: 1 or 2 bit ACK in the multiplexing feedback model/nack message is encoded to 6 Bit datas, and wherein front 4 are 1, and rear two is least significant bit.
5. method according to claim 1 and 2, it is characterized in that, the step of in the described step 1) ACK/NACK information being encoded comprises: at first 1 in the tie-in mode or 2 bit ACK/nack message are encoded according to the coded system that multiplexing feedback model adopts; Then scramble sequence is used as 12 circulating register, each rising edge clock dibit that moves to right adds the high order end of this register to, and the 2 bits output data of acquisition and 2 minimum bits of output data of multiplexing feedback model carry out scrambling.
6. method according to claim 1 and 2, it is characterized in that, in the described step 1) during to 3 or 4 bit ACK in the multiplexing feedback model/nack message coding, with list entries and basic sequence carry out step-by-step with, the sequence that obtains is finished mould 2 by the step-by-step XOR again and is added up.
7. method according to claim 1 and 2 is characterized in that, described step 3) comprises:
31) the mode initializing pseudo random scramble sequence of employing 31 parallel-by-bits;
32) generate the pseudorandom scramble sequence according to initialized pseudorandom scramble sequence Parallel Recursive;
33) utilize the pseudorandom scramble sequence that generates to carry out data scrambling.
8. a 3GPP LTE PUSCH channel parallel channel interweaves and scrambling system, comprising:
The RI channel encoder is used for RI information is carried out chnnel coding;
The HARQ-ACK channel encoder is used for ACK/NACK information is carried out chnnel coding;
The channel interleaving system, be used for input RI information, the control after multiplexing and data message and ACK/NACK information and carry out channel interleaving, comprise: when RI information is transmitted in subframe, begin up to write the line number last_row_index at the RI information place that RI information and storage write at last from last column of channel interleaving memory matrix RIWith column number last_column_index RIAccording to line number and the column number at the RI information place that writes at last, skip the RI information that writes previously, write data and control information after multiplexing, wherein control information is front, and data message is rear; Transmit in this subframe when ACK/NACK information, write ACK/NACK information; According to the line number at the line number at the RI information place that writes at last and column number and/or the ACK/NACK information place that writes at last and the output function that column number carries out channel interleaving;
Scrambling apparatus is used for RI information, control and data message, ACK/NACK information after multiplexing are carried out scrambling.
9. channel interleaving according to claim 8 and scrambling system is characterized in that, described channel interleaving system comprises channel interleaving writing controller, channel interleaving memory and channel interleaving Read Controller, wherein
The channel interleaving writing controller, be used for to calculate the row, column number of the interleaver matrix that subframe takies at the channel interleaving memory, begin up to write the line number last_row_index at the RI information place that RI information and storage write at last from last column of channel interleaving memory matrix RIWith column number last_column_index RI, write data and control information after multiplexing according to the line number at the RI information place that writes at last and column number, write ACK/NACK information;
The channel interleaving memory is used for storage RI information, the data after multiplexing and control information, ACK/NACK information;
The channel interleaving Read Controller is used for receive channel interweave the row, column number of the interleaver matrix that subframe that writing controller calculates takies at the channel interleaving memory and all information of the storage in the delivery channel interleaver memory.
10. channel interleaving according to claim 9 and scrambling system is characterized in that, described channel interleaving memory comprises 12 quantum memories, 1 column information of each quantum memory storage interleaver matrix.
CN 201110076521 2011-03-29 2011-03-29 Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE) Active CN102136885B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110076521 CN102136885B (en) 2011-03-29 2011-03-29 Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110076521 CN102136885B (en) 2011-03-29 2011-03-29 Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE)

Publications (2)

Publication Number Publication Date
CN102136885A CN102136885A (en) 2011-07-27
CN102136885B true CN102136885B (en) 2013-10-16

Family

ID=44296548

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110076521 Active CN102136885B (en) 2011-03-29 2011-03-29 Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE)

Country Status (1)

Country Link
CN (1) CN102136885B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102970102A (en) * 2011-09-01 2013-03-13 中兴通讯股份有限公司 Channel interleaving achieving method and channel interleaver for long term evolution (LTE) system
CN112805942A (en) 2018-10-22 2021-05-14 华为技术有限公司 Apparatus and method for supporting HARQ
CN116405157B (en) * 2023-03-15 2025-06-24 归芯科技(深圳)有限公司 Channel interleaving method, device and chip

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1964478A (en) * 2006-12-07 2007-05-16 上海复旦微纳电子有限公司 A random processing method for scrambling/descrambling in digital video broadcast system
CN101615933A (en) * 2008-06-24 2009-12-30 三星电子株式会社 Method for sending uplink control information
KR20110009025A (en) * 2009-07-20 2011-01-27 엘지전자 주식회사 Method and apparatus for transmitting uplink control information
CN101807974B (en) * 2010-04-07 2015-05-20 中兴通讯股份有限公司 System and method for transferring ascending control signals on physical upstream sharing channel

Also Published As

Publication number Publication date
CN102136885A (en) 2011-07-27

Similar Documents

Publication Publication Date Title
KR101150608B1 (en) Encoded control channel information interleaving
CN101807974B (en) System and method for transferring ascending control signals on physical upstream sharing channel
CN103004107B (en) For up link dispensing device and the method for the mobile communication system of support uplink multiple-input and multiple-output
JP6100206B2 (en) Method and system for transmitting uplink control information, method and apparatus for determining number of encoded symbols
CN107070587B (en) Selection of retransmission settings for HARQ in WCDMA and LTE networks
JP6871396B2 (en) Methods and devices for processing information, communication devices, and communication systems
CN101902313A (en) PUSCH transmission (Physical Uplink Shared Channel) based coding method and system of uplink control information
CN101702631A (en) Transmission method of uplink control signaling and device thereof
WO2010015151A1 (en) An information multiplexing method
JP2020502899A (en) Information processing method, apparatus, communication device, and communication system
JP7684972B2 (en) Decoding method, apparatus, network device, and recording medium
JPWO2013001706A1 (en) Wireless transmission / reception apparatus, communication system, and channel coding processing method used therefor
CN101227259A (en) Method for data reading of limited length circulating buffer memory rate adaption
CN107276715A (en) A kind of method and apparatus for transmitting signal
CN109474373B (en) Interleaving method and interleaving apparatus
CN102136885B (en) Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE)
KR102248750B1 (en) Bit interleaver and bit de-interleaver
EP2164201B1 (en) Technique for providing a physical uplink shared channel bitstream
CN106936541B (en) RS coding and byte interleaving method and system
CN102546119B (en) Information bit sending method, device and system
WO2019047741A1 (en) Bit interleaving and de-interleaving method and device
CN111181572B (en) Interleaving mapping method and de-interleaving de-mapping method for LDPC code word
CN111628849B (en) Interleaving mapping method and de-interleaving de-mapping method for LDPC code word
CN103368685B (en) Dissociation rate matching method and device
WO2009061122A2 (en) Method for multiplexing data and control information

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
EE01 Entry into force of recordation of patent licensing contract

Assignee: Beijing Zhongke Jingshang Technology Co., Ltd.

Assignor: Institute of Computing Technology, Chinese Academy of Sciences

Contract record no.: 2011110000143

Denomination of invention: Parallel physical uplink shared channel (PUSCH) interleaving and scrambling realization method and system for 3rd-generation partnership project long term evolution (3GPP LTE)

License type: Exclusive License

Open date: 20110727

Record date: 20110823

C14 Grant of patent or utility model
GR01 Patent grant
EC01 Cancellation of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract

Assignee: Beijing Zhongke Polytron Technologies Inc

Assignor: Institute of Computing Technology, Chinese Academy of Sciences

Contract record no.: 2011110000143

Date of cancellation: 20181212

EM01 Change of recordation of patent licensing contract
EM01 Change of recordation of patent licensing contract

Change date: 20181212

Contract record no.: 2011110000143

Assignee after: Beijing Zhongke Polytron Technologies Inc

Assignee before: Beijing Zhongke Jingshang Technology Co., Ltd.

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190312

Address after: 100190 No. 10 South Road, Zhongguancun Academy of Sciences, Haidian District, Beijing

Patentee after: Beijing Zhongke Polytron Technologies Inc

Address before: 100190 South Road, Zhongguancun Science Academy, Haidian District, Beijing 6

Patentee before: Institute of Computing Technology, Chinese Academy of Sciences