WO2003069819A1 - Method and apparatus for decoding transport format combination indicator data - Google Patents

Method and apparatus for decoding transport format combination indicator data Download PDF

Info

Publication number
WO2003069819A1
WO2003069819A1 PCT/CN2003/000058 CN0300058W WO03069819A1 WO 2003069819 A1 WO2003069819 A1 WO 2003069819A1 CN 0300058 W CN0300058 W CN 0300058W WO 03069819 A1 WO03069819 A1 WO 03069819A1
Authority
WO
WIPO (PCT)
Prior art keywords
tfci
value
information sequence
decoding
sent
Prior art date
Application number
PCT/CN2003/000058
Other languages
French (fr)
Chinese (zh)
Inventor
Huabin Liu
Original Assignee
Huawei Technologies Co. Ltd
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 Huawei Technologies Co. Ltd filed Critical Huawei Technologies Co. Ltd
Priority to AU2003211811A priority Critical patent/AU2003211811A1/en
Publication of WO2003069819A1 publication Critical patent/WO2003069819A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0036Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
    • H04L1/0039Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver other detection of signalling, e.g. detection of TFCI explicit signalling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0025Transmission of mode-switching indication

Definitions

  • the present invention relates to a decoding method and device in a code division multiple access (CDMA) mobile communication system, and particularly to a decoding method for transmission format combination indicator (TFCI) data in a CDMA system and a device for implementing the method.
  • CDMA code division multiple access
  • TFCI transmission format combination indicator
  • TFCI indicates the transmission format combination of multiple transmission channels.
  • the transmission format includes information such as the transmission rate, CRC length, and encoding type. Therefore, the correctness of TFCI decoding is a prerequisite for the correct decoding of business data such as voice and data.
  • 3GPP 3rd Generation Mobile Communication Cooperative Organization
  • a linear block code (reed-leg ler) with better performance is used for encoding, and the other
  • the aspect also increases the anti-interference ability by increasing the transmission power (relative to the dedicated physical data channel DPDCH, the transmission power is 0-6dB higher); at the receiving end, the TFCI bit error rate is reduced by selecting a better linear block code decoding method.
  • TFCI decoding method can refer to the document "Optimal sof t Deci son Block Decoders Based on Fast Hadamard Transform" YAIR BEERY., IEEE Trans on Information Theory, 1986, May. P355-P365) on page 355-365 of this document defines the maximum release function for TFCI decoding, which is described as:
  • s is the binary sequence of TFCI information to be encoded Si e ⁇ 0, l ⁇ , when the sequence is converted to decimal, the leftmost side of the sequence is the low-order bit, and the right-hand side is the high-order bit.
  • v ( VQ , Vl , ... v M — 0 is the received information sequence, this sequence contains the noise caused by the wireless channel, which belongs to all real numbers.
  • k is the length of the binary representation sequence of TFCI, is The system pre-defined, it determines the maximum number of different TFCI values that the physical layer can transmit is 2f .
  • M is the codeword length (number of binary bits) after TFCI encoding.
  • M is also pre-defined by the system and is determined by the system
  • the decoding method directly based on formula (1) is theoretically feasible, but when k is large, the operation when decoding is implemented is very complicated, and an equivalent decoding method that reduces the amount of calculation is usually used: based on fast Hada Decoding method of Fast Hadamard Transform.
  • the decoding method based on fast Hada code transformation can be summarized as the following steps:
  • Step 3 The maximum value in the search, that is o ⁇ J ⁇ 2M;
  • Step 4 Get the index i of the maximum value obtained in Step 3 is the decimal decoding
  • the resulting TFCI value is the maximum value search in step 3 . Due to the large search range, the time and resources required for implementation are also relatively small. There are many TFCI values sent in the actual system, which are not all theoretically possible values, and they are often only a small part. Existing TFCI data decoding methods are not based on this fact, resulting in low decoding efficiency. Summary of the Invention
  • An object of the present invention is to provide a decoding method for a transmission format combination instruction data with higher decoding efficiency and a device for implementing the method.
  • the method for decoding the transmission format combination indication data provided by the present invention includes: (1) The transmission format combination indication (TFCI) decoding device searches from a transmission format combination set (TFCS) table configured to the physical layer by the network layer to obtain a decimal TFCI value that may actually be sent, and uses the symbol as ⁇ ti , ... J n _i, where "is the number of TFCs in the TFCS table;
  • TFCS transmission format combination set
  • the decoding device for the transmission format combination indication data provided by the present invention includes a TFCI searcher, a bit shift truncation processor, a position translator, a demask selection switch, and a mask processing unit.
  • Processor Hada code converter, maximum value searcher and comparison judger, wherein:
  • a TFCI searcher configured to search from a TFCS table configured by the network layer to the physical layer, and obtain a decimal TFCI value that may actually be sent;
  • a bit shift truncation processor is used to receive the decimal TFCI value sent by the TFCI searcher, and decide whether to pre-process the extraction mask of TFCI according to the current TFCI encoding situation.
  • the mask is used when TFCI encoding, Extract the mask from the TFCI value and send it to the mask processor to remove the mask; it is also used to extract the symbol control information from the TFCI value and send it to the maximum value searcher to adjust the sign of the Hada code transformation value;
  • FIG. 1 is a flowchart of an embodiment of the method of the present invention
  • FIG. 2 is a flowchart of TFCI decoding in a normal mode by applying the present invention
  • FIG. 3 is a block diagram of an embodiment of the apparatus of the present invention. DETAILED DESCRIPTION OF THE INVENTION The present invention will be described in further detail below with reference to the drawings and embodiments. It can be known from the existing decoding method of TFC I that the maximum likelihood decoding of the existing method is — 1
  • FIG. 1 is a flowchart of an embodiment of a method according to the present invention. According to Figure 1,
  • the TFCI decoding device searches and extracts the TFCI value that can be actually sent from the TFCS table configured by the network layer to the physical layer, and uses the symbol to, t x , .... t n- , Where w is the number of TFCs in the TFCS table. It is also the number of TFCI values that may actually be sent.
  • This step is a critical step. Because this step reduces the scope of TFCI decoding, and thus changes the TFCI codeword weighting division, it may also increase the minimum code distance of the TFCI codeword, resulting in a final reduction in the amount of decoding operations. At the same time, the decoding performance is optimized.
  • the above 2 / f transformation results correspond to the formula (1), which is a result obtained by traversing 2 / £ possible TFCI binary to-be-encoded information sequences.
  • the result obtained by performing a fast Hada code transformation on the expanded information in this step corresponds to the result obtained by traversing all ⁇ possible s calculations in formula (1). Therefore, compared with the direct use of formula (1), the calculation in this step can greatly reduce the amount of calculation and is easy to implement.
  • Step 6 Narrow the search range and search only in the Hada code transform value subscripted as TFCI
  • T max h t!, 0 ⁇ j ⁇ n- l maximum value, suppose the transformation value of subscript ⁇ is the largest, that is, Q ⁇ "-1.
  • Step 6 is another key step of the present invention. Since step 1 has already obtained the actual possible TFCI value sent from the network layer, the search for the maximum value in this step does not need to be performed in all theoretically possible ranges, only the subscript is actually possible Search for the maximum value in the Hada code transform value of the sent n TFCI values. This step is closely combined with step 1 to reduce the scope of TFCI decoding, so that the TFCI codeword weight distribution can be changed, and the minimum code distance of the TFCI codeword may be increased, resulting in a reduction in the amount of decoding operations and optimization of decoding performance. . In step 7, the index of the maximum value obtained in step 6 is the TFCI value of the decimal decoding result.
  • two encoding methods of TFCI in 3GPP are used: first-order RM (16, 5) linear block code coding in split mode and second-order M code subcode (32, 10) linear block code coding in normal mode. The decoding method is further explained.
  • step 11 search TFCI set to give 10 decimal in the TFCS, referred to as a, t x, ... J "-i , which" is the number of TFCS a TFC table.
  • step 12 use c 0 , c l5 ... c Uber-1 to record the mask obtained by shifting the TFCI right by 6 bits.
  • the mask set obtained may be duplicated. Delete the duplicated mask to obtain a valid mask.
  • step 13 the 32 received TFCI data to be decoded are buffered and transformed into the normal order.
  • the original 30th data is transferred to the current 0th data
  • the original 31st data is transferred to the current 16th data
  • the original 0-14 These data are adjusted to the current 1-15 data
  • the original 15-29 data are adjusted to the current 17-31 data, denoted as ⁇ 2 ⁇ . ,, ).
  • an initial value is assigned to the global maximum value variable max_value of the Hada code transformation value, and an initial value ⁇ ⁇ 0 is assigned to the mask counter.
  • step 15 the 32 TFCI data to be decoded are demasked and subjected to a 32-level Hada code transformation, and 32 transformation values are recorded, which are denoted as Ao, hj 31 .
  • step 17 it is judged whether the mask set has been traversed. If not, the mask counter is incremented by 1, that is, steps 15 and 16 are repeated; if it has been traversed, the decoded TFCI value of step 18 is output, that is, the step after the last demasking process.
  • the decoding method of the present invention corresponding to the first-order (16, 5) TFCI encoding of the split mode, first searches for the TFCI set in base 10 from the TFCS, and records it as ti,...! Where "" is the number of TFCs in the TFCS table. Step 2 will receive the TFCI-encoded information sequence through the wireless channel. Adjust the order, put the last data first, that is, the original 15th data V15 is adjusted to the current 0th data ⁇ . , 0 to 14 of the original data is now adjusted VQ ⁇ vu ⁇ 15 data of vi ⁇ v 15. Since the last column of the encoding matrix is all 1, we can reduce the order pair in step 3.
  • FIG. 3 is a block diagram of an embodiment of the device according to the present invention.
  • the decoding device for the transmission format combination indication data shown in FIG. 3 includes a module 103 for demodulating the TFCI information sequence of the RAKE receiver, and a TFCI searcher 101, a bit shift truncation processor 102, a position switch 104, and a demasking.
  • the code selection switch 105, the mask processor 106, the Hada code converter 107, the maximum value searcher 108, and the comparison decision device 109 wherein:
  • the TFCI searcher 101 is configured to search from a TFCS table configured by the network layer to the physical layer, and obtain a decimal TFCI value that may actually be sent, and the value is sent to the bit-shift interception processor 102, according to the current TFCI
  • the encoding situation determines whether to pre-process the TFCI extraction mask.
  • the mask is extracted from the TFCI value and sent to the mask processor 106 to remove the mask.
  • Bit shift truncation processing The processor 102 also extracts symbol control information from the TFCI value and sends it to the maximum value searcher 108 to adjust the sign of the Hada code transformation value;
  • the sequence M (" ⁇ ,” ⁇ ,. ⁇ ⁇ 2 ⁇ ) is sent to the mask processor 106,

Abstract

The present invention discloses a method for decoding transport format combination indicator data. The method obtains a decimal value of TFCI that actual may be sent by searching the TFCS table which was disposed to physical layer by network layer, and expands a received information sequence ν=(ν0’, ν1’, ..νm-1) experienced the demodulation by the wireless channel which is TFCI encoded, sent from a RAKE receiver to an information sequence u=(u0,u1, …u2k-1), further obtains a result H=(h0,h1,...h2k-1) by performing a 2k step fast hadamard transform , and then narrows the hunting zone, which only searching the hadamard transform values with TFCI suffix for the maximum, and regards suffix t; of the maximum obtained as the result of the decimal TFCI value; adopting the above-mentioned scheme makes it need not to go on in possible ranges of all theories when searching for the maximum ,and narrows the range of TFCI decoding , thus changes the distribute of the weight of TFCI codeword, and may increase minimum distances of the TFCI codeword, thereby reduces the operation amount of the decoding, and optimizes the performance of decoding at the same time.

Description

传输格式组合指示数据的译码方法及装置 技术领域  Method and device for decoding transmission format combination indication data
本发明涉及码分多址( CDMA )移动通信系统中的译码方法及装置, 具体地说涉及 CDMA系统中传输格式组合指示 ( TFCI )数据的译码方 法以及实现该方法的装置。  The present invention relates to a decoding method and device in a code division multiple access (CDMA) mobile communication system, and particularly to a decoding method for transmission format combination indicator (TFCI) data in a CDMA system and a device for implementing the method.
背景技术 Background technique
TFCI 指示了多个传输信道的传输格式组合, 传输格式包括了传 输速率, CRC长度, 编码类型等信息。 因此 TFCI译码的正确性是语 音、数据等业务数据正确译码的前提。 为了提高 TFCI传输的正确性, 在第三代移动通信合作组织(3GPP )中, 在数据发送端, 一方面通过 一种性能较好的线性分组码(reed—腿 l ler )进行编码, 另一方面也 通过提高发射功率来增加抗干扰能力 (相对专用物理数据信道 DPDCH 的发射功率高 0—6dB ); 在收端则通过选择较优的线性分组码译码方 法来降低 TFCI的误码率。传统的比较流行的 TFCI译码方法可以参考 文献 "分组码的基于快速哈达码变换的最优软符号译码方法" ( Opt imal sof t Deci son Block Decoders Based on Fast Hadamard Transform" YAIR BEERY. , IEEE Trans on Informat ion Theory , 1986, May. P355-P365 )在该文献的第 355-365页中定义了 用于 TFCI译码的最大释然函数, 该函数的描述为:  TFCI indicates the transmission format combination of multiple transmission channels. The transmission format includes information such as the transmission rate, CRC length, and encoding type. Therefore, the correctness of TFCI decoding is a prerequisite for the correct decoding of business data such as voice and data. In order to improve the correctness of TFCI transmission, in the 3rd Generation Mobile Communication Cooperative Organization (3GPP), on the data transmitting end, on the one hand, a linear block code (reed-leg ler) with better performance is used for encoding, and the other The aspect also increases the anti-interference ability by increasing the transmission power (relative to the dedicated physical data channel DPDCH, the transmission power is 0-6dB higher); at the receiving end, the TFCI bit error rate is reduced by selecting a better linear block code decoding method. The traditional and more popular TFCI decoding method can refer to the document "Optimal sof t Deci son Block Decoders Based on Fast Hadamard Transform" YAIR BEERY., IEEE Trans on Information Theory, 1986, May. P355-P365) on page 355-365 of this document defines the maximum release function for TFCI decoding, which is described as:
( 1 ) ( 1)
Figure imgf000003_0001
Figure imgf000003_0001
式 中 , s 为 TFCI 的 2 进制 待 编 码 信 息 序 列
Figure imgf000004_0001
Sie{0, l}, 该序列转换为 10进制时, 序列最左边为低 位, 右边为高位。 v = (VQVl,...vM— 0是接收的信息序列, 该序列包含了 由于经历无线信道而带来的噪声, 属于一切实数。 k是 TFCI的二进 制表示序列的长度, 是系统预先规定好的, 它决定了物理层最多可传 送的不同的 TFCI值的个数为 2f。 m是 TFCI编码后的码字长度(二进 制比特数) 。 m也是系统预先规定好的, 由系统采取的编码方式决 定。 例如若系统的 TFCI编码方式采用分裂模式的一阶腹(16, 5) 线性分组码编码, 即 k = 5, m = 16, 则物理层最多可传送 25 = 32种不 同的 TFCI值, 且 TFCI编码后码字长度为 16。 又如若系统的 TFCI 编码方式采用正常模式的二阶 RM子码(32, 10)线性分组码编码, 即 k = 10, m= 32, 则物理层最多可传送 21Q = 1024种不同的 TFCI值, 且 TFCI编码后码字长度为 32。 为线性分组码编码矩阵的第 i 列向 量。
Where s is the binary sequence of TFCI information to be encoded
Figure imgf000004_0001
Si e {0, l}, when the sequence is converted to decimal, the leftmost side of the sequence is the low-order bit, and the right-hand side is the high-order bit. v = ( VQ , Vl , ... v M — 0 is the received information sequence, this sequence contains the noise caused by the wireless channel, which belongs to all real numbers. k is the length of the binary representation sequence of TFCI, is The system pre-defined, it determines the maximum number of different TFCI values that the physical layer can transmit is 2f . M is the codeword length (number of binary bits) after TFCI encoding. M is also pre-defined by the system and is determined by the system The encoding method used is determined. For example, if the system's TFCI encoding method uses the first order belly (16, 5) linear block code encoding of the split mode, that is, k = 5, m = 16, the physical layer can transmit up to 25 = 32 different TFCI value, and the codeword length after TFCI encoding is 16. Another example is if the system's TFCI encoding method uses the normal mode second-order RM subcode (32, 10) linear block code encoding, that is, k = 10, m = 32, then The physical layer can transmit a maximum of 2 1Q = 1024 different TFCI values, and the codeword length after TFCI encoding is 32. It is the vector of the i-th column of the linear block code encoding matrix.
直接基于公式(1)的译码方法在理论上是可行的, 但当 k较大 时, 则译码实现时的运算非常复杂, 通常采用可减少运算量的等价译 码方法: 基于快速哈达码变换(Fast Hadamard Transform )的译码 方法。  The decoding method directly based on formula (1) is theoretically feasible, but when k is large, the operation when decoding is implemented is very complicated, and an equivalent decoding method that reduces the amount of calculation is usually used: based on fast Hada Decoding method of Fast Hadamard Transform.
基于快速哈达码变换的译码方法可概括为以下步骤:  The decoding method based on fast Hada code transformation can be summarized as the following steps:
步驟 1:接收到 RAKE接收机送来的 TFCI 编码后经过无线信道的 解调后的信息序列 "^。, … -), 按下列公式( 2 )扩充得到信息 序列 M = (Uo,Ui, ..U2k-\) ∑ Vi Aj 空集 Step 1: After receiving the TFCI code sent by the RAKE receiver and demodulating the information sequence "^., ...-) of the wireless channel, expand the information sequence M = (Uo, Ui,...) According to the following formula (2). .U 2 k- \) ∑ Vi Aj empty set
Uj = { 0 4' =空集 ( 2 ) U j = { 0 4 '= empty set (2)
其中 .={ :0(^.)= } , y = 0,l,2...2A-l (3) 上述式(3) 中, 6(^·)表示将二进制列向量 转化为一个 10进 制值。 4是编码矩阵里的按公式 (3)计算得到的一些列向量的下标 的集合, 这些列向量必须满足的奈件是当它转换为 10进制数时正好 等于 j ; Where. = { : 0 (^.) =}, Y = 0, l, 2 ... 2 A -l (3) In the above formula (3), 6 (^ ·) means to convert the binary column vector into a Decimal value. 4 is a set of subscripts of some column vectors calculated according to formula (3) in the coding matrix. The only thing these column vectors must satisfy is that it is exactly equal to j when it is converted to a decimal number
步骤 2: 对¾ = 0。,"1,.. -1)进行^阶快速哈达码变换, 得到结果
Figure imgf000005_0001
Step 2: Pair ¾ = 0. , "1, .. -1) Perform ^ -order fast Hada code transformation to get the result
Figure imgf000005_0001
hi二 max hj, 0<i≤2k-l 步驟 3: 搜索 里的最大值, 即 o≤J≤2M ; 步骤 4: 获取步骤 3得到的最大值的下标 i 就是 10进制的译码 结果 TFCI值。 现有方法的缺点在于, 在步骤 3中进行的 里的最大值的搜索是 在 所有可能的 2/f个值中搜索最大值, 由于搜索的范围较大, 实现时 耗费的时间和资源也较多, 而实际系统中发送的 TFCI值并不是理论 上的所有 ^个可能值, 往往只是很少的一部分, 现有的 TFCI数据译 码方法由于没有基于这个事实, 导致译码的效率较低。 发明内容 hi two max hj, 0 <i≤2 k -l Step 3: The maximum value in the search, that is o≤J≤2M; Step 4: Get the index i of the maximum value obtained in Step 3 is the decimal decoding The resulting TFCI value. The disadvantage of the existing method is that the maximum value search in step 3 is to search for the maximum value among all possible 2 / f values. Due to the large search range, the time and resources required for implementation are also relatively small. There are many TFCI values sent in the actual system, which are not all theoretically possible values, and they are often only a small part. Existing TFCI data decoding methods are not based on this fact, resulting in low decoding efficiency. Summary of the Invention
本发明的目的在于提供一种译码效率较高的传输格式组合指示 数据的译码方法以及实现该方法的装置。 为达到上述目的,本发明提供的传输格式组合指示数据的译码方 法, 包括: ( 1)传输格式组合指示 (TFCI )译码装置从网络层配置给物理 层的传输格式组合集(TFCS)表中搜索, 得到实际可能发送的 10进 制的 TFCI值, 用符号记为^ ti, ...Jn_i, 其中"为 TFCS表里 TFC的 个数; An object of the present invention is to provide a decoding method for a transmission format combination instruction data with higher decoding efficiency and a device for implementing the method. To achieve the above object, the method for decoding the transmission format combination indication data provided by the present invention includes: (1) The transmission format combination indication (TFCI) decoding device searches from a transmission format combination set (TFCS) table configured to the physical layer by the network layer to obtain a decimal TFCI value that may actually be sent, and uses the symbol as ^ ti , ... J n _i, where "is the number of TFCs in the TFCS table;
( 2 ) TFCI译码装置接收到 RAKE接收机送来的 TFCI 编码后经过 无线信道的解调后的信息序列 二^,^,…^ ^后, 按下述公式扩充 得到信息序列 " = ("Q , " 1 , · ."2一1 ): (2) After the TFCI decoding device receives the TFCI-encoded information sequence 2 demodulated by the wireless channel from the RAKE receiver, and then ^, ^, ... ^ ^, it expands to obtain the information sequence according to the following formula " = (" Q, "1, ·." 2-1):
∑ vt Aj≠空集  ∑ vt Aj ≠ empty set
Uj = { 0 =空集 U j = { 0 = empty set
式中 4 =
Figure imgf000006_0001
,l,2...2k-l, 表示将二进制列向量 转化为一个 10进制值; .
Where 4 =
Figure imgf000006_0001
, l, 2 ... 2 k -l, means to convert a binary column vector into a decimal value;.
( 3)判断 TFCI 编码中是否存在掩码, 如果存在, 对信息序列 u = (u0,u .."2— 1)进行去掩码处理, 然后执行步骤 ( 4 ), 否则不进行 去掩码处理, 直接执行步骤(4); (3) Determine whether there is a mask in the TFCI encoding. If it exists, perform a demasking process on the information sequence u = (u 0 , u .. "2-1), and then perform step (4), otherwise, do not perform the demasking. Code processing, and directly execute step (4);
(4)对信息序列 = ( 0,Μι, .Μ2^)进行 2 Α阶快速哈达码变换得 到结果 =(/'。, /",...½-1); (4) Perform a 2 A fast Hada code transformation on the information sequence = ( 0 , Μι, .Μ 2 ^) to get the result = (/ '., /",...½-1);
( 5 )缩小搜索范围, 只在下标为 TFCI的哈达码变换值中搜索最 (5) Narrow the search range, and search only the Hada code transformation values subscripted as TFCI.
7 h — max htj, <j <n- \ 大值, 设下标为 的变换值 最大, 即 <¾·≤"-ι ; 7 h — max h tj , <j <n- \ large value, let the subscript be the maximum transformation value, that is, <¾ · ≤ "-ι;
( 6 )获取步骤 5得到的最大值的下标 作为 10进制的译码结 果 TFCI值。 (6) Obtain the subscript of the maximum value obtained in step 5 as the TFCI value of the decimal decoding result.
本发明提供的传输格式组合指示数据的译码装置, 包括 TFCI搜 索器、 比特移位截位处理器、 位置调换器、 去掩码选择开关、 掩码处 理器、 哈达码变换器、 最大值搜索器和比较判决器, 其中: The decoding device for the transmission format combination indication data provided by the present invention includes a TFCI searcher, a bit shift truncation processor, a position translator, a demask selection switch, and a mask processing unit. Processor, Hada code converter, maximum value searcher and comparison judger, wherein:
TFCI搜索器, 用于从网络层配置给物理层的 TFCS表中搜索, 得 到实际可能发送的 10进制的 TFCI值; A TFCI searcher, configured to search from a TFCS table configured by the network layer to the physical layer, and obtain a decimal TFCI value that may actually be sent;
比特移位截位处理器,用于接收 TFCI搜索器送出 10进制的 TFCI 值,根据当前 TFCI的编码情况决定是否要对 TFCI作提取掩码的预处 理, 当 TFCI编码时利用了掩码, 则从 TFCI值里提取掩码送给掩码处 理器以去除掩码; 还用于从 TFCI值中提取符号控制信息, 送给最大 值搜索器, 以调整哈达码变换值的符号;  A bit shift truncation processor is used to receive the decimal TFCI value sent by the TFCI searcher, and decide whether to pre-process the extraction mask of TFCI according to the current TFCI encoding situation. The mask is used when TFCI encoding, Extract the mask from the TFCI value and send it to the mask processor to remove the mask; it is also used to extract the symbol control information from the TFCI value and send it to the maximum value searcher to adjust the sign of the Hada code transformation value;
位置调换器, 用于将 RAKE 接收机解调后的 TFCI 信息序列 ν=(ν。,νι,···ν『ι)按下述公式扩充得到信息序列 " = 0。,Ml,..w2M);A position switcher is used to demodulate the TFCI information sequence ν = ( ννι , ... ν 『ι) after demodulation of the RAKE receiver to obtain the information sequence" = 0 "according to the following formula, Ml , ..w 2M );
∑ vt Aj≠空集 ∑ v t Aj ≠ empty set
Uj = { 空集 U j = ( empty set
式中4 = { : )= } , j = 0,l,2...2^-l, 表示将二进制列向量 转化为一个 10进制值; Formula 4 = {:) =}, j = 0, l, 2 ... 2 ^ -l, shows a binary column vector into a decimal value;
去掩码选择开关, 用于根据 TFCI编码方式判断是否需要对信息 序列^^^^^,^^—^进行去掩码处理, 如需要, 将信息序列 u = (u0,u .. 2'£— 1)送给掩码处理器, 否则将该信息序列直接送给哈达 码变换器; A demasking selection switch is used to judge whether the information sequence ^^^^^, ^^ — ^ needs to be demasked according to the TFCI encoding mode, and if necessary, the information sequence u = (u 0 , u .. 2 ' £ — 1) is sent to the mask processor, otherwise the information sequence is directly sent to the Hada code converter;
掩码处理器,用于采用比特移位截位处理器送来的掩码对需要进 行去掩码处理的信息序列" = ("Q,"1,.."2 )进行去掩码处理, 然后将 去除掩码的信息序列 " = ("o,"i, 1)送给哈达码变换器;  A mask processor for demasking an information sequence that needs to be demasked using a mask sent by a bit shift truncation processor "= (" Q, "1, .." 2), Then send the masked information sequence "= (" o, "i, 1) to the Hada code converter;
哈达码变换器,用于对信息序列"= ("0^1,.."2—1)进行^阶快速哈 达码变换得到结果 ^^ (^ …^一); 最大值搜索器, 用于在哈达码变换器输出的变换结果 Hada code converter, used for ^ -order fast ha for the information sequence "= (" 0 ^ 1, .. "2-1) Result obtained by the code conversion ^^ (^… ^ a); a maximum value searcher, which is used to transform the output of the code of the hard code converter
H^/^/^ J^)中的下标为 TFCI 的哈达码变换值里搜索最大值, 将 搜索结果送给比较判决器, 判决输出 10进制译码结果 TFCI值。 由于本发明从网络层获取实际可能发送的 TFCI值, 充分利用了 H ^ / ^ / ^ J ^) search for the maximum value in the Hada code transform value of the subscript TFCI, and send the search result to the comparison decider, and decide to output the TFCI value of the decimal decoding result. Since the present invention obtains the actually possible TFCI value sent from the network layer, it makes full use of
TFCS表的信息,使得搜索最大值时不需要在所有理论可能的范围里进 行, 只需在下标为实际可能发送的 n个 TFCI值的哈达码变换值里进 行, 缩小了 TFCI译码的范围, 从而改变了 TFCI的码字权重分布, 也可 能增大 TFCI码字的最小码距, 从而减少了译码的运算量, 同时优化了 译码性能, 因此采用本发明进行 TFCI的译码效率较高。 附图说明 图 1是本发明所述方法的实施例流程图; 图 2是应用本发明采用正常模式进行 TFCI译码的流程图; 图 3是本发明所述装置的实施例框图。 具体实施方式 下面结合附图和实施例对本发明作进一步详细的描述。 通过现有的 TFC I的译码方法可知,现有方法的最大似然译码就是 — 1 The information in the TFCS table makes searching for the maximum value not necessary in all theoretically possible ranges. It only needs to be performed in the Hada code transformation value of the n TFCI values that may be actually sent, reducing the scope of TFCI decoding. As a result, the weight distribution of the TFCI codeword is changed, and the minimum code distance of the TFCI codeword may be increased, thereby reducing the amount of decoding operations and optimizing the decoding performance. Therefore, the present invention is more efficient for TFCI decoding . BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a flowchart of an embodiment of the method of the present invention; FIG. 2 is a flowchart of TFCI decoding in a normal mode by applying the present invention; and FIG. 3 is a block diagram of an embodiment of the apparatus of the present invention. DETAILED DESCRIPTION OF THE INVENTION The present invention will be described in further detail below with reference to the drawings and embodiments. It can be known from the existing decoding method of TFC I that the maximum likelihood decoding of the existing method is — 1
在所有可能的 2A个信息 s中寻找一个使公式^^) = S (-1)^^'计算值最 ' 大的 S,从所有 2 十算值中搜索得到最大值,从而根据最大值恢复出 S , 实现译码。 由于在所有可能的 2个值中搜索最大值, 而实际系统发送 的 TFCI值并不是理论上的所有 2个可能值, 往往只是很少的一部分, 如 2个, 或 6个, 这实际发送的很少的几个可能的 TFCI值是可以从网络 层配置给物理层的信息中提取得到的, 本发明将利用这个信息, 简化 运算量, 优化性能。 Find one of all possible 2A pieces of information s that makes the formula ^^) = S ( -1 ) ^^ 'the calculated value is the largest', and search for the maximum value from all the 20 values, so as to recover from the maximum value Out S, realize decoding. Because the maximum value is searched among all possible 2 values, and the TFCI value sent by the actual system is not all theoretically 2 possible values, it is often only a small part. For example, there are two or six. The few possible TFCI values actually sent can be obtained from the information configured by the network layer to the physical layer. The present invention will use this information to simplify the calculation amount and optimize the performance. .
图 1是本发明所述方法的实施例流程图。 按照图 1,  FIG. 1 is a flowchart of an embodiment of a method according to the present invention. According to Figure 1,
首先在步骤 1, TFCI译码装置从网络层配置给物理层的 TFCS表里 搜索提取得到实际可能发送的 10进制的 T F C I值, 用符号记为 to, tx , ....tn- , 其中 w为 TFCS表里 TFC的个数。 也是实际可能发送的 TFCI值个数。 该步驟是关键的一步, 由于该步骤缩小了 TFCI译码的范 围, 从而改变了 TFCI的码字权重分部, 也可能增大了 TFCI码字的最小 码距, 从而导致最终减少译码运算量, 同时优化了译码性能。 First, in step 1, the TFCI decoding device searches and extracts the TFCI value that can be actually sent from the TFCS table configured by the network layer to the physical layer, and uses the symbol to, t x , .... t n- , Where w is the number of TFCs in the TFCS table. It is also the number of TFCI values that may actually be sent. This step is a critical step. Because this step reduces the scope of TFCI decoding, and thus changes the TFCI codeword weighting division, it may also increase the minimum code distance of the TFCI codeword, resulting in a final reduction in the amount of decoding operations. At the same time, the decoding performance is optimized.
在步骤 2, TFCI译码装置接收到 RAKE接收机送来的 TFCI 编码后经 过无线信道的解调后的信息序列 二(^,11,』『1)后,按下列公式( 2 ) 扩充得到信息序列 M = { Q,Ul, ..U2k-l) In step 2, after the TFCI decoding device receives the TFCI code sent from the RAKE receiver and demodulates the information sequence two (^, 11 , "" 1) of the wireless channel, it expands to obtain the information according to the following formula (2) Sequence M = (Q, Ul, ..U 2 kl)
∑ vi Aj Φ空集  ∑ vi Aj Φ empty set
Uj = x 0 ^ =空集 ( 2 ) Uj = x 0 ^ = empty set (2)
其中 ={z' : bfe) '} ' = 0,l,2...2/c-l, 表示将二进制列向量 转化为一个 10进制值。 即 '是编码矩阵里的按公式( 3 )计算得到的 一些列向量的下标的集合,这些列向量必须满足的条件是当它转换为 10进制数时正好等于 j 。该步骤扩充信息序列^^^,^,… - 的目 的是为了在公式(1 ) 与快速哈达码变换之间建立内在联系, 使得下 一步可直接对扩充后的信息序列 M = 0G,"i, ..W2M)进行快速哈达码变 换。 在步骤 3, 判断 TFCI编码中是否存在掩码, 如果存在, 在步骤 4 对信息序列 " = ("Q,"i,.."2 )进行去掩码处理, 然后执行步骤 5, 否 则直接进行步骤 5 , 对信息序列 u = (uo, u 2 )进行 ^阶快速哈达码 变换,得到结果 i^d/ , ...½—)。上述 2/f个变换结果正好对应公式( 1 ) 遍历 2个可能的 即 TFCI的二进制待编码信息序列计算得到的结果。 ' 正因为在步骤 2对接收信息序列进行了扩充, 所以在本步骤对扩充后 的信息进行快速哈达码变换后得到的结果正好对应公式(1 )遍历所 有 ^个可能的 s 计算得到的结果。 因此采用本步驟计算与直接利用公 式 (1 )相比可以大大减少运算量, 易于实现。 Where = {z ': bfe)'} '= 0, l, 2 ... 2 / / c -l, which translates a binary column vector into a decimal value. That is, 'is a set of subscripts of some column vectors calculated according to formula (3) in the coding matrix. The condition that these column vectors must meet is that when it is converted to a decimal number, it is exactly equal to j. The purpose of this step to expand the information sequence ^^^, ^, ...-is to establish an internal relationship between formula (1) and the fast Hada code transformation, so that the extended information sequence M = 0 G can be directly used in the next step. " i, .. W2M) for fast Hada code transformation. In step 3, it is determined whether there is a mask in the TFCI encoding. If it exists, in step 4 the information sequence " = (" Q, "i, .." 2 ) is demasked, and then step 5 is performed, otherwise it is directly performed. Step 5: ^ order fast Hada code transformation is performed on the information sequence u = (uo, u 2) to obtain the results i ^ d /, ... ½—). The above 2 / f transformation results correspond to the formula (1), which is a result obtained by traversing 2 / £ possible TFCI binary to-be-encoded information sequences. 'Because the received information sequence is expanded in step 2, the result obtained by performing a fast Hada code transformation on the expanded information in this step corresponds to the result obtained by traversing all ^ possible s calculations in formula (1). Therefore, compared with the direct use of formula (1), the calculation in this step can greatly reduce the amount of calculation and is easy to implement.
步骤 6, 缩小搜索范围, 只在下标为 TFCI的哈达码变换值里搜索  Step 6. Narrow the search range and search only in the Hada code transform value subscripted as TFCI
T = max ht!, 0<j≤n- l 最大值, 设下标为 ^的变换值 最大, 即 Q≤≤"- 1 。 T = max h t!, 0 <j≤n- l maximum value, suppose the transformation value of subscript ^ is the largest, that is, Q≤≤ "-1.
步骤 6是本发明另一个关键步骤,由于步驟 1已经从网络层获取实 际可能发送的 TFCI值,所以该步骤搜索最大值时不需要在所有理论可 能的范围里进行,只需在下标为实际可能发送的 n个 TFCI值的哈达码 变换值里搜索最大值。 该步骤与步驟 1紧密结合缩小了 TFCI译码的范 围, 从而可以改变 TFCI的码字权重分布, 也可能增大 TFCI码字的最小 码距, 导致最终减少译码的运算量和优化译码性能。 在步骤 7, 获取步骤 6得到的最大值的下标 就是 10进制的译码 结果 TFCI值。 这是因为步驟 2的处理隐含了一个事实: 如果 TFCI的二 进制待编码信息序列 s = (s。, ,..., -i), ^-6{0,1}, 转化为 10进制数是 那么根据公式 (1 )计算的 M正好等于 / 。 所以若 是最大值, 下 标 ^就是译码结果 TFCI的 10进制值。 下面通过 3GPP中 TFCI的两种编码方式, 分裂模式的一阶 RM (16, 5) 线性分组码编码和正常模式的二阶 M码子码 (32, 10)线性分組 码编码, 对本发明所述的译码方法进行进一步说明。 Step 6 is another key step of the present invention. Since step 1 has already obtained the actual possible TFCI value sent from the network layer, the search for the maximum value in this step does not need to be performed in all theoretically possible ranges, only the subscript is actually possible Search for the maximum value in the Hada code transform value of the sent n TFCI values. This step is closely combined with step 1 to reduce the scope of TFCI decoding, so that the TFCI codeword weight distribution can be changed, and the minimum code distance of the TFCI codeword may be increased, resulting in a reduction in the amount of decoding operations and optimization of decoding performance. . In step 7, the index of the maximum value obtained in step 6 is the TFCI value of the decimal decoding result. This is because the processing of step 2 implies a fact: if the TFCI binary sequence to be encoded information s = (s.,, ..., -i), ^ -6 {0,1}, converted to decimal The number is then M calculated according to formula (1) is exactly equal to /. So if it is the maximum value, the subscript ^ is the decimal value of the decoded result TFCI. In the following, two encoding methods of TFCI in 3GPP are used: first-order RM (16, 5) linear block code coding in split mode and second-order M code subcode (32, 10) linear block code coding in normal mode. The decoding method is further explained.
对应正常模式的二阶 RM码子码( 32, 10) TFCI编码的译码实施方 法参考图 2。 因为 (32, 10) TFCI编码增加了掩码, 所以需去掩码以 后再结合应用本发明进行 TFCI译码。  Refer to Figure 2 for the decoding implementation method of the second-order RM code subcode (32, 10) TFCI code in normal mode. Because (32, 10) TFCI encoding adds a mask, it needs to be unmasked and then combined with the present invention to perform TFCI decoding.
首先在步骤 11、 从 TFCS里搜索得到 10进制的 TFCI集, 记为 , tx, ...J„-i , 其中"为 TFCS表里 TFC的个数。 接着在步骤 12用 c0, cl5...c„— 1记录 TFCI右移 6位后得到的掩码,此时得到的掩码集可能 有重复,删除重复的掩码,得到有效的掩码集,重新记为 CQ, First, in step 11, search TFCI set to give 10 decimal in the TFCS, referred to as a, t x, ... J "-i , which" is the number of TFCS a TFC table. Then in step 12, use c 0 , c l5 ... c „-1 to record the mask obtained by shifting the TFCI right by 6 bits. At this time, the mask set obtained may be duplicated. Delete the duplicated mask to obtain a valid mask. Code set, re-recorded as CQ,
其中 为有效掩码的个数。 在步骤 13緩存 32个接收的 TFCI待译码数 据并变换为正常顺序, 原第 30个数据调为现第 0个数据, 原第 31个数 据调为现第 16个数据, 原第 0—14个数据调为现第 1—15个数据, 原笫 15— 29个数据调为现第 17— 31个数据, 记为^二^。, ,… )。 在步驟 14 给哈达码变换值全局最大值变量 max_value赋初值 ,给掩码计数器赋 初值^ ^0。 在步驟 15, 32个 TFCI待译码数据去掩码 后作 32阶哈达码 变换, 记录 32个变换值, 记为 Ao, h j31。 在步骤 16截取 TFCI的低 5比特( &31J = 0,1,…"- 1) , 得到在当前掩码 下需参与比较判决 的变换值下标, 并根据第 5位(从第 0位开始计数) 的 1比特调整变换 值符号, 如果第 5位为 1, 则调整变换值为其相反数, 如果第 5位为 0, 则不调整。 然后 只在下标为( &31, = 0,l,J- 1)的已调整过符号 的哈达码变换值中搜索最大值, 例如下标为 ( &31)的变换值 , ·&Μ)
Figure imgf000012_0001
& 3 更新全局最 大值 max— va 1 ue并更新、 保存对应的下标 。
Where is the number of valid masks. In step 13, the 32 received TFCI data to be decoded are buffered and transformed into the normal order. The original 30th data is transferred to the current 0th data, the original 31st data is transferred to the current 16th data, and the original 0-14 These data are adjusted to the current 1-15 data, and the original 15-29 data are adjusted to the current 17-31 data, denoted as ^ 2 ^. ,, ...). At step 14, an initial value is assigned to the global maximum value variable max_value of the Hada code transformation value, and an initial value ^ ^ 0 is assigned to the mask counter. In step 15, the 32 TFCI data to be decoded are demasked and subjected to a 32-level Hada code transformation, and 32 transformation values are recorded, which are denoted as Ao, hj 31 . In step 16, the lower 5 bits of the TFCI are intercepted (& 31J = 0,1,… "-1) to obtain the index of the transform value that needs to participate in the comparison decision under the current mask, and count according to the 5th bit (counting from the 0th bit) 1) adjusts the sign of the transformation value. If the 5th bit is 1, the transformation value is adjusted to the opposite number. If the 5th bit is 0, the adjustment is not performed. Then only the subscript is (& 31, = 0, l, J -1) Search for the maximum value of the adjusted Hada code transformation value of the symbol, for example, the transformation value of the subscript (& 3 1), · & Μ)
Figure imgf000012_0001
& 3 Update the global maximum value max— va 1 ue and update and save the corresponding index.
在步驟 17判断掩码集是否已遍历, 若没有则掩码计数器递增 1, 即 重复步骤 15, 16; 若已遍历完则执行步骤 18输出译码的 TFCI值即最后一次去掩码处理后步骤 16的哈达码变换最大值的下标 。  In step 17, it is judged whether the mask set has been traversed. If not, the mask counter is incremented by 1, that is, steps 15 and 16 are repeated; if it has been traversed, the decoded TFCI value of step 18 is output, that is, the step after the last demasking process. The subscript of the maximum of the Harda code of 16.
对应分裂模式一阶(16, 5) TFCI编码的本发明译码方法, 先在 第 1步, 从 TFCS里搜索得到 10进制的 TFCI集, 记为 , ti, … ―!, 其 中"为 TFCS表里 TFC的个数。第 2步将接收到 TFCI 编码后经过无线信道 的信息序列
Figure imgf000012_0002
调整顺序,将最后一个数据放到最前面, 即原第 15个数据 V15调为现第 0个数据 ν。,原第 0 ~ 14个数据 VQ〜vu调为 现第 Γ15个数据 vi~v15。 由于编码矩阵的最后一列全 1, 所以在第 3 步可降阶对
Figure imgf000012_0003
进行 16阶快速哈达码变换得到结果 Η=( ,...^。 在第 4步 截取 TFCI的低 4比特 ( &15, = 0,1,..."-1) 得到需参与比较判决的变换值下标,并 居 TFC I的最高位即第 4位(从 第 0位开始计数)的 1比特调整变换值符号, 如果第 4位为 1, 则调整变 换值为其相反数, 如果第 4位为 0, 则不调整, 调整符号后的变换值仍 以 …^5)表示。 在第 5步缩小搜索范围, 只在下标为 ( &15, = 0,1,—"-1 ) 的哈达码变换值 (已调整过符号)里搜索最 大值 , 设下标为 ( ) 的 变换值 h 5、最大 , 即 , 0<j≤n-l
The decoding method of the present invention corresponding to the first-order (16, 5) TFCI encoding of the split mode, first searches for the TFCI set in base 10 from the TFCS, and records it as ti,…! Where "" is the number of TFCs in the TFCS table. Step 2 will receive the TFCI-encoded information sequence through the wireless channel.
Figure imgf000012_0002
Adjust the order, put the last data first, that is, the original 15th data V15 is adjusted to the current 0th data ν. , 0 to 14 of the original data is now adjusted VQ~vu Γ15 data of vi ~ v 15. Since the last column of the encoding matrix is all 1, we can reduce the order pair in step 3.
Figure imgf000012_0003
Perform the 16th-order fast Hada code transformation to get the result Η = (, ... ^. In step 4, intercept the lower 4 bits of TFCI (& 15, = 0,1, ... "-1) to obtain the transformation that needs to participate in the comparison decision Value subscript, and the highest bit of TFC I, which is the 4th bit (counting from 0th bit), adjusts the sign of the transformation value. If the 4th bit is 1, the transformation value is adjusted to the opposite number. If the 4th If the bit is 0, it will not be adjusted, and the transformed value after adjusting the sign will still be represented by ... ^ 5 ). In step 5, the search range is narrowed down, and only the Hada code with the subscript (& 15, = 0,1, — "-1) Search for the maximum value in the transformation value (adjusted sign), and set the transformation value h 5 with the subscript () to the maximum value, that is, 0 <j≤nl
Figure imgf000012_0004
。 最后在第 6步获取第 5步得到的 最大值的下标 就是 10进制的译码结果 TFCI值。 图 3是本发明所述装置的实施例框图。图 3所示的传输格式组合指 示数据的译码装置包括 RAKE接收机的解调 TFCI信息序列的模块 103, 以及 TFCI搜索器 101、 比特移位截位处理器 102、 位置调换器 104、 去 掩码选择开关 105、 掩码处理器 106、 哈达码变换器 107、 最大值搜索 器 108和比较判决器 109, 其中:
Figure imgf000012_0004
. Finally, the subscript of the maximum value obtained in step 6 in step 6 is the TFCI value of the decimal decoding result. Fig. 3 is a block diagram of an embodiment of the device according to the present invention. The decoding device for the transmission format combination indication data shown in FIG. 3 includes a module 103 for demodulating the TFCI information sequence of the RAKE receiver, and a TFCI searcher 101, a bit shift truncation processor 102, a position switch 104, and a demasking. The code selection switch 105, the mask processor 106, the Hada code converter 107, the maximum value searcher 108, and the comparison decision device 109, wherein:
TFCI搜索器 101, 用于从网络层配置给物理层的 TFCS表中搜索, 得到实际可能发送的 10进制的 TFCI值,该值被送到比特移位截位处理 器 102 , 根据当前 TFCI的编码情况决定是否要对 TFCI作提取掩码的预 处理, 当 TFCI编码时利用了掩码, 则从 TFCI值里提取掩码送给掩码处 理器 106以去除掩码; 比特移位截位处理器 102还从 TFCI值中提取符号 控制信息, 送给最大值搜索器 108, 以调整哈达码变换值的符号; The TFCI searcher 101 is configured to search from a TFCS table configured by the network layer to the physical layer, and obtain a decimal TFCI value that may actually be sent, and the value is sent to the bit-shift interception processor 102, according to the current TFCI The encoding situation determines whether to pre-process the TFCI extraction mask. When the TFCI encoding is used, the mask is extracted from the TFCI value and sent to the mask processor 106 to remove the mask. Bit shift truncation processing The processor 102 also extracts symbol control information from the TFCI value and sends it to the maximum value searcher 108 to adjust the sign of the Hada code transformation value;
RAKE接收机的解调 TFCI信息序列的模块 103, 用于从无线信道接 收丁?^编码经过无线信道的解调后的信息序列1^ ^1,… -!), 将 该序列送给位置调换器 104 , 由位置调换器 104将信息序列 ν=(ν。,νι,···ν«_ι)按下述公式扩充得到信息序列 " = ("。,^,..1^—0:A module 103 for demodulating the TFCI information sequence of a RAKE receiver, for receiving Ding from a wireless channel? ^ Encode the demodulated information sequence 1 ^ ^ 1 , ...- !) Of the wireless channel, and send the sequence to the position translator 104, and the position translator 104 sends the information sequence ν = ( ννι , ... · Ν «_ι) is expanded according to the following formula to obtain the information sequence" = ("., ^, .. 1 ^ —0:
∑ Vi Aj Φ空集∑ Vi Aj Φ empty set
Uj = { 0 =空集 式中^ = { 6(^)= } ' y = 0,l,2...2A-l, 表示将二进制列向量 转化为一个 10进制值; Uj = { 0 = in the empty set ^ = {6 (^) =} 'y = 0, l, 2 ... 2 A -l, which means that the binary column vector is converted into a decimal value;
去掩码选择开关 105, 用于根据 TFCI编码方式判断是否需要对 信息序列" = ("Q,"1, 2M)进行去掩码处理, 如需要, 将从位置调换 器 104中接收到的信息序列 Μ = ("Ο,"Ι,.·Μ2Μ)送给掩码处理器 106,由 掩码处理器 106 采用比特移位截位处理器送来的掩码对需要进行去 掩码处理的信息序列 "= (MG,"1, 2 )进行去掩码处理, 然后将去除 掩码的信息序列" = ("0,"1,··Μ2 )送给哈达码变换器 107;否则将该信 息序列直接送给哈达码变换器 107。 哈达码变换器 107 对信息序列 "^(^,^,^^—^进行^阶快速哈达码变换得到结果 ^/ ,^,…/?^), 该结果被送到最大值搜索器 108, 最大值搜索器 108在哈达码变换器 输出的变换结果 =( i, )中的下标为 TFCI 的哈达码变换值里 搜索最大值, 将搜索结果送给比较判决器, 判决输出 10进制译码结 果 TFCI值。 The demasking selection switch 105 is used to judge whether the information sequence "= (" Q, "1, 2M) needs to be demasked according to the TFCI encoding mode, and if necessary, the information received from the position changer 104 The sequence M = ("Ο," Ι,. · Μ2Μ) is sent to the mask processor 106, The mask processor 106 uses the mask sent by the bit shift truncation processor to demask the information sequence that needs to be masked "= (MG," 1, 2), and then removes the masked The information sequence "= (" 0, "1, ·· M2) is sent to the Hada code converter 107; otherwise, the information sequence is directly sent to the Hada code converter 107. The Hada code converter 107 pairs the information sequence" ^ (^, ^, ^^ — ^ perform a ^ -order fast Hada code transformation to obtain the result ^ /, ^, ... /? ^), And the result is sent to the maximum value searcher 108, and the maximum value searcher 108 transforms the output of the Hada code converter Result = (i,) searches for the maximum value in the Hada code transform value of the subscript TFCI, sends the search result to the comparison judger, and judges and outputs the TFCI value of the decimal decoding result.

Claims

权 利 要 求 Rights request
1、 一种传输格式组合指示数据的译码方法, 包括:  1. A decoding method for transmission format combination indication data, including:
(1 )传输格式组合指示(TFCI )译码装置从网絡层配置给物理 层的传输格式组合集(TFCS)表中搜索, 得到实际可能发送的 10进 制的 TFCI值, 用符号记为 , , ...J„-i , 其中 "为 TFCS表里 TFC的 个数;  (1) The transmission format combination indication (TFCI) decoding device searches from a transmission format combination set (TFCS) table configured to the physical layer by the network layer, and obtains a decimal TFCI value that may actually be sent. ... J „-i, where" is the number of TFCs in the TFCS table;
( 2 )TFCI译码装置接收到 RAKE接收机送来的 TFCI 编码后经过 无线信道的解调后的信息序列 二 ,^,… - 后, 按下述公式扩充 得到信息序列 " = (Uo,U :U2k-l): (2) After receiving the TFCI code sent by the RAKE receiver, the TFCI decoding device demodulates the information sequence II of the wireless channel, ^, ...-and then expands to obtain the information sequence according to the following formula "= (Uo, U : U 2 kl):
∑ Vi Aj≠空集  ∑ Vi Aj ≠ empty set
Uj = {o =空集 U j = { o = empty set
式中
Figure imgf000015_0001
表示将二进制列向量 转化为一个 10进制值;
Where
Figure imgf000015_0001
Represents a binary column vector into a decimal value;
( 3)判断 TFCI 编码中是否存在掩码, 如果存在, 对信息序列
Figure imgf000015_0002
然后执行步骤(4 ), 否则不进行 去掩码处理, 直接执行步骤 4;
(3) Determine whether there is a mask in the TFCI encoding, and if it exists, the information sequence
Figure imgf000015_0002
Then step (4) is performed, otherwise no demasking processing is performed, and step 4 is directly performed;
(4)对信息序列 " = OQ,WI,..M2 )进行 2阶快速哈达码变换得 到结果 ; (4) The result is obtained by performing a second-order fast Hada code transformation on the information sequence "= OQ, WI, .. M 2 );
( 5 )缩小搜索范围, 只在下标为 TFCI的哈达码变换值中搜索最 (5) Narrow the search range, and search only the Hada code transformation values subscripted as TFCI.
T hti = max hti, 0≤j≤n-l 大值, 设下标为 ^的变换值^最大, 即 0≤·≤«- 1 ; ( 6 )获取步驟 05得到的最大值的下标 作为 10进制的译码结 果 TFCI值。 2、 一种传输格式组合指示数据的译码装置, 包括 TFCI搜索器、 比特移位截位处理器、 位置调换器、 去掩码选择开关、 掩码处理器、 哈达码变换器、 最大值搜索器和比较判决器, 其中: T h ti = max h ti , a large value of 0≤j≤nl, and set the transformation value of the subscript ^ max, that is, 0≤ · ≤ «-1; (6) obtain the subscript of the maximum value obtained in step 05 as Decoded TFCI value in decimal. 2. A decoding device for transmission format combination instruction data, including a TFCI searcher, a bit shift truncation processor, a position translator, a demask selection switch, a mask processor, a Hada code converter, and a maximum search And a comparison decider, wherein:
TFCI搜索器, 用于从网络层配置给物理层的 TFCS表中搜索, 得 到实际可能发送的 10进制的 TFCI值;  A TFCI searcher, configured to search from a TFCS table configured by the network layer to the physical layer, and obtain a decimal TFCI value that may actually be sent;
比特移位截位处理器,用于接收 TFCI搜索器送出 10进制的 TFCI 值,根据当前 TFCI的编码情况决定是否要对 TFCI作提取掩码的预处 理, 当 TFCI编码时利用了掩码, 则从 TFCI值里提取掩码送给掩码处 理器以去除掩码; 还用于从 TFCI值中提取符号控制信息, 送给最大 值搜索器, 以调整哈达码变换值的符号;  A bit shift truncation processor is used to receive the decimal TFCI value sent by the TFCI searcher, and decide whether to pre-process the extraction mask of TFCI according to the current TFCI encoding situation. When TFCI encoding is used, Extract the mask from the TFCI value and send it to the mask processor to remove the mask; it is also used to extract the symbol control information from the TFCI value and send it to the maximum value searcher to adjust the sign of the Hada code transformation value;
位置调换器, 用于将 RAKE 接收机解调后的 TFCI 信息序列 ν=( 。,νι,···ν『 1)按下述公式扩充得到信息序列 "二^。," .." —):A position switcher is used to demodulate the TFCI information sequence ν = (νι , ... ν 『1) after the RAKE receiver is demodulated to obtain the information sequence“ 二 ^., ”..” —) :
∑ vt Aj Φ空集 ∑ v t Aj Φ empty set
Uj = { 0 4 =空集 Uj = { 0 4 = empty set
式中 4 = {Z ': ' ; = 0,1,2...2^-1, 表示将二进制列向量 转化为一个 10进制值, 并根据编码矩阵的特点适当调换数据流的 顺序; In the formula, 4 = { Z ':'; = 0,1,2 ... 2 ^ -1, which means that the binary column vector is converted into a decimal value, and the order of the data streams is appropriately switched according to the characteristics of the encoding matrix;
去掩码选择开关, 用于根据 TFCI编码方式判断是否需要对信息 序列" = ("0,^, ..2^·— 进行去掩码处理, 如需要, 将信息序列  Demasking selection switch, used to judge whether the information sequence is required according to the TFCI encoding mode "= (" 0, ^, .. 2 ^ · — perform demasking processing, and if necessary, the information sequence
U = {Uo,U 2M)送给掩码处理器, 否则将该信息序列直接送给哈达 码变换器; U = {Uo, U 2M) is sent to the mask processor, otherwise the information sequence is directly sent to the Hada code converter;
掩码处理器,用于采用比特移位截位处理器送来的掩码对需要进 行去掩码处理的信息序列" = Οθ,Μΐ, 进行去掩码处理, 然后将 去除掩码的信息序列 " = ("Q,"1, 2 )送给哈达码变换器; Mask processor, which is used to use the mask pair sent by the bit-shift truncation processor. De-masking information sequence "= θθ, Μΐ, perform de-masking processing, and then send the de-masking information sequence" = ("Q," 1, 2) to the Hada code converter;
哈达码变换器,用于对信息序列 " = ("0, "1, j2M)进行 2 介快速哈 达码变换得到结果 = (ho, h j2M); Hada code converter, used to perform 2 fast Hada code transformations on the information sequence "= (" 0, "1, j 2M ) = (ho, hj 2M );
最大值搜索器, 用于在哈达码变换器输出的变换结果 Maximum value searcher, used for transforming the output of Hada code converter
H^/^/^JsM)中的下标为 TFCI 的哈达码变换值里搜索最大值, 将 搜索结果送给比较判决器, 判决输出 10进制译码结果 TFCI值。 H ^ / ^ / ^ JsM), the maximum value is searched in the Hada code transform value of TFCI, and the search result is sent to the comparison judger, and the TFCI value of the decimal decoding result is output.
PCT/CN2003/000058 2002-02-04 2003-01-23 Method and apparatus for decoding transport format combination indicator data WO2003069819A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003211811A AU2003211811A1 (en) 2002-02-04 2003-01-23 Method and apparatus for decoding transport format combination indicator data

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB021036535A CN1181633C (en) 2002-02-04 2002-02-04 Decoding method and device for transmission format combination indicating data
CN02103653.5 2002-02-04

Publications (1)

Publication Number Publication Date
WO2003069819A1 true WO2003069819A1 (en) 2003-08-21

Family

ID=27627903

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2003/000058 WO2003069819A1 (en) 2002-02-04 2003-01-23 Method and apparatus for decoding transport format combination indicator data

Country Status (3)

Country Link
CN (1) CN1181633C (en)
AU (1) AU2003211811A1 (en)
WO (1) WO2003069819A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005048564A1 (en) * 2003-11-17 2005-05-26 Nokia Corporation A method and a device for reporting the number of correctly decoded transport blocks in a wireless system

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1667988B (en) * 2005-04-18 2010-06-09 中兴通讯股份有限公司 A method for implementing analysis from combined transmission format computational value to transmission format indication
CN100433863C (en) * 2005-08-27 2008-11-12 华为技术有限公司 Method for increasing decoding speed of base station
CN101136657B (en) * 2007-07-06 2014-03-12 中兴通讯股份有限公司 Transformat combined indication decoding device and method thereof
CN101159444B (en) * 2007-11-08 2012-05-09 重庆重邮信科通信技术有限公司 Decoding method of transformat combined indication
CN101567744B (en) * 2008-04-25 2012-10-03 卓胜微电子(上海)有限公司 Method for analyzing system information symbols in DTMB system
WO2013095662A1 (en) * 2011-12-23 2013-06-27 Intel Corporation Systems, apparatuses, and methods for performing vector packed unary encoding using masks

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998044670A2 (en) * 1997-03-30 1998-10-08 D.S.P.C. Technologies Ltd. A code synchronization unit and method
WO2001003366A1 (en) * 1999-07-06 2001-01-11 Samsung Electronics Co., Ltd. Apparatus and method for encoding/decoding transport format combination indicator in cdma mobile communication system
WO2001017283A2 (en) * 1999-08-27 2001-03-08 Telefonaktiebolaget Lm Ericsson (Publ) Transport format combination indicator mapping for telecommunications
WO2001097394A1 (en) * 2000-06-12 2001-12-20 Samsung Electronics Co., Ltd Apparatus and method for encoding and decoding tfci in a mobile communication system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998044670A2 (en) * 1997-03-30 1998-10-08 D.S.P.C. Technologies Ltd. A code synchronization unit and method
WO2001003366A1 (en) * 1999-07-06 2001-01-11 Samsung Electronics Co., Ltd. Apparatus and method for encoding/decoding transport format combination indicator in cdma mobile communication system
WO2001017283A2 (en) * 1999-08-27 2001-03-08 Telefonaktiebolaget Lm Ericsson (Publ) Transport format combination indicator mapping for telecommunications
WO2001097394A1 (en) * 2000-06-12 2001-12-20 Samsung Electronics Co., Ltd Apparatus and method for encoding and decoding tfci in a mobile communication system

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005048564A1 (en) * 2003-11-17 2005-05-26 Nokia Corporation A method and a device for reporting the number of correctly decoded transport blocks in a wireless system
KR100813682B1 (en) * 2003-11-17 2008-03-14 노키아 코포레이션 A method and a device for reporting the number of correctly decoded transport blocks in a wireless system
US8310933B2 (en) 2003-11-17 2012-11-13 Core Wireless Licensing S.A.R.L. Method and a device for reporting the number of correctly decoded transport blocks in a wireless system
US8982821B2 (en) 2003-11-17 2015-03-17 Core Wireless Licensing S.A.R.L. Method and a device for reporting the number of correctly decoded transport blocks in a wireless system

Also Published As

Publication number Publication date
AU2003211811A1 (en) 2003-09-04
CN1437342A (en) 2003-08-20
CN1181633C (en) 2004-12-22

Similar Documents

Publication Publication Date Title
CN1256819C (en) System and orthogonal coding in a telecommunications environment using orthogonal and near-orthogonal codes
JP2007507989A5 (en)
CN108184252B (en) Fog wireless access network asynchronous request code caching method
WO2002025848A1 (en) Method for multiple time slot power control
JP2007536834A (en) File download and streaming system
CN1630996A (en) Method and apparatus for determining a reverse link transmission rate in a wireless communication system
CA2393689A1 (en) Apparatus and method for coding/decoding tfci bits in an asynchronous cdma communication system
CN111917512A (en) High-efficiency coding design method based on BATS code in multi-hop transmission system
CN110351780B (en) Communication method, system and storage medium based on coding cache
RU2343632C2 (en) Decision-feedback equaliser with combined encoding-decoding of csos in feedback filtration
WO2003069819A1 (en) Method and apparatus for decoding transport format combination indicator data
CN109450594B (en) Rate-free code degree distribution optimization method for uplink of cloud access network
WO2002063818A1 (en) Error correcting/decoding method
US20190312602A1 (en) Channel coding method, channel coding apparatus, chip system, and storage medium
CN109361492B (en) High-performance decoding method combining physical layer network coding and polarization code
WO2010135857A1 (en) Method and device for encoding by linear block code, and method and device for generating linear block code
CN111314349B (en) Code caching method based on joint maximum distance code division and cluster cooperation in fog wireless access network
CN107222284A (en) A kind of fountain coding anti-eavesdropping transmission method in Internet of Things based on channel feedback
CN114077605A (en) Data processing method and device
WO2014177041A1 (en) Decoding method and device for transmission format combination
WO2011137745A1 (en) Method and device for transmitting iq data
WO2018228589A1 (en) Encoding method, wireless device, and chip
CN104540147B (en) One kind cooperation compressed sensing quantifies retransmission method
US20220021477A1 (en) Encoding and decoding source information using a distribution channel encoder and decoder
CN111988114A (en) On-line fountain code coding and decoding method with unequal error protection strategy

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP