WO2014090045A1 - Td-scdma uplink transmission channel processing method - Google Patents

Td-scdma uplink transmission channel processing method Download PDF

Info

Publication number
WO2014090045A1
WO2014090045A1 PCT/CN2013/085827 CN2013085827W WO2014090045A1 WO 2014090045 A1 WO2014090045 A1 WO 2014090045A1 CN 2013085827 W CN2013085827 W CN 2013085827W WO 2014090045 A1 WO2014090045 A1 WO 2014090045A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
transmission channel
processing method
uplink transmission
coding
Prior art date
Application number
PCT/CN2013/085827
Other languages
French (fr)
Chinese (zh)
Inventor
徐琪
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2014090045A1 publication Critical patent/WO2014090045A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end

Definitions

  • the present invention relates to the field of wireless mobile communication and signal processing systems, and in particular to a TD-SCDMA (Time Division Duplex-Synchronous Code Division Multiple Access) uplink transmission channel processing.
  • the method is applied to the processing of an uplink transmission channel of a TD-SCDMA baseband chip processing system.
  • an uplink is a signal transmission link from a terminal UE to a base station NodeB, and for the uplink, its main processing includes processing of a transmission channel portion and processing of a physical channel portion.
  • the transmission channel processing mainly includes Cyclic Redundancy Code (CRC) addition, channel coding, first interleaving, rate matching, and transmission channel multiplexing.
  • CRC Cyclic Redundancy Code
  • the physical channel performs second interleaving, physical channel mapping, QPSK debugging, Data spreading, Data scrambling, I&Q separation operation on the data sent by the transmission channel, and the processed data and the midamble Midamble, uplink pilot physics
  • the channel UpPTS uplink synchronization code SYNCJJL constructs an uplink burst in chronological order.
  • the data of each transport channel is transmitted in units of transport blocks and transmitted according to a Transmit Time Interval (abbreviated as ⁇ ).
  • Transmit Time Interval
  • different lengths can be used. According to 3GPP, they can be one of 10ms, 20ms, 40ms and 80ms respectively.
  • CRC addition and channel coding are performed at the transmitting end in units of data blocks.
  • the channel coding may be convolutional coding or turboscopic Turbo coding.
  • the encoded data stream is subjected to radio frame length equalization, for example, the dummy bits are padded at the end of the last frame so that the number of data bits of each frame in one frame is equal.
  • the data stream that has been subjected to radio frame length equalization is interleaved for the first time, that is, inter-frame interleaving.
  • the main purpose of interleaving is to turn the burst error into a random error to facilitate the decoder to correct the error, thereby improving the ability to resist fading.
  • a ⁇ is greater than 10 ms, the data bit sequence needs to be segmented to be mapped to multiple radio frames for transmission.
  • the uplink rate matching method adopted by the method is: first, performing transmission channel coding; then dividing the data into multiple sequences to generate an interleaved image; and determining a position in the data that needs to be punched and repeated according to the calculated data bit shift value, Therefore, the data required for subsequent processing is selected and stored in the memory for subsequent processing.
  • the logic complexity of this method is relatively large.
  • Chinese Patent CN200610138212 (The invention patent name is a method for uplink transmission channel multiplexing)
  • the published patent document provides a method for uplink transmission channel multiplexing, which mainly includes the following implementation steps: First, current All transport blocks of multiple transport channels that need to be transmitted simultaneously in a 10 ms time interval are sequentially completed in order of TTI, including cyclic redundancy check code addition, concatenation of transport blocks, and coding block segmentation, coding processing, The channel-encoded data word stream is sequentially written into the first interleaved random access memory.
  • the data of each transport channel is taken out from the first interleaved random memory in the order of the original serial number of the transport channel, and the interleaving and rate matching are performed, and the multiplexing of the transport channel is implemented, and the processed data is written to the first Secondary interleaved random access memory.
  • the technical solution stores all the data of the transmission channel into a large memory, and after all the transmission channels complete the storage, the 10 ms data after the completion of the interleaving is selected and processed for subsequent processing, so that the implementation of the one-time interleaving is compared.
  • a TD-SCDMA uplink transmission channel processing method includes:
  • Cyclic redundancy check code CRC addition and cascading of transport blocks are sequentially performed in the order of trcW trchl ... trch(Nl) for all transmission time intervals TTI in the current N transmission channels to be processed. And the segmentation processing of the coding block, if there is no transmission block to be processed at this time, and the first interleaved memory RAM (on-chip random access memory) has data to be processed, directly execute step E;
  • step B Transmitting the processed coding block, suspending the operation of the step B after each time the data stream of one coding block is transmitted, performing step ⁇ and waiting for the appearance of the coding completion flag signal of the channel coding of the coding block fed back in step C After the above code completion flag appears, the data stream of the next code block is transmitted, and so on, until all the code blocks are transmitted;
  • step C channel coding the data stream of the coding block formed in step B, after completion, generating a data word stream and generating an encoding completion flag, and feeding back the coding completion flag step B;
  • D. Determine whether the channel-coded data stream needs to be selected according to the TTI size. If ⁇ is 5ms or 10ms, the data stream is directly stored in the first interleaving RAM. Otherwise, according to the channel coding type of the data stream. The data is selected by a 24-bit mobile register, and then the data stream is stored in the first interleaved RAM;
  • the data is sequentially read out in the order in which the data is stored in the first interleave RAM, and rate matching and multiplexing of the transport channels are performed, and then the processed data is written into the second interleave RAM.
  • the N Preferably, in the step A, the N ⁇ 8.
  • the ⁇ is one of 5 ms, 10 ms, 20 ms, 40 ms or 80 ms.
  • the channel coding comprises convolutional coding and turboscopic turbo coding.
  • the data writing sequence of storing the data stream into the first interleaving RAM is consistent with the serial processing sequence of the transmission channel in step A until the data of the last transmission channel is written. flow.
  • the first interleaved RAM has a storage space of 10 ms.
  • the 24 bit mobile register adopts a ping-pong buffer structure.
  • the data is selected by the 24-bit mobile register according to the channel coding type of the data stream: using two 24-bit shift registers, the coded data is cross-written into the two shift registers.
  • the uplink transmission channel processing method provided by the embodiment of the present invention sequentially performs processing for each 10 ms of each transmission channel, and does not need to sort the TTIs of the eight transmission channels according to the size. Reduce the complexity of processing logic.
  • the uplink transmission channel processing method provided by the embodiment of the present invention utilizes the characteristics of one-time interleaving processing: it is performed in units of 10 ms, so that it is not necessary to store all the transmission channel data in one large memory to select 10ms for processing, but directly store only one 10ms of data to be processed, and use memory to complete the selection of data, which is not only intuitive and convenient to implement, but also reduces the logical processing difficulty of data storage location judgment, and reduces
  • the requirement of interleaving the memory storage space is optimized, so that the optimized area is achieved for the entire uplink area.
  • 1 is a schematic diagram of an operation sequence of an uplink transmission channel in an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of an implementation of an uplink hardware module in an embodiment of the present invention
  • FIG. 3 is a schematic diagram of selecting the number of bits to be processed when the size of the UI is 40 ms in the embodiment of the present invention.
  • the embodiment of the present invention does not need to sort the 8 transmission channels according to the size, but sequentially completes each 10 ms processing of each transmission channel.
  • the embodiment of the present invention utilizes the characteristics of one-time interleaving processing: That is, it is performed in units of 10ms each, so it is not necessary to store all the data of the transmission channel in one large memory and select 10ms for processing, and directly store only one 10ms of data to be processed currently, which will be the first time.
  • the capacity of the interleaved memory is reduced from the original data of the eight transport channels to the capacity of storing only one 10ms of data in one transport channel.
  • the first deposit is required.
  • an embodiment of the present invention sequentially performs CRC attaching and encoding operations on data to be processed on a transport channel, and determines which data needs to be performed in the next step after performing an interleaving according to the size of the ⁇ and the interleaving rule, and then takes a 10 ms operation.
  • the data is pre-selected and stored in a small RAM that can be stored in 10ms of data, and then subjected to subsequent rate matching operations.
  • the selection of each 10ms data is similar until the processing of all the data of the transmission channel is completed.
  • the implementation steps of the uplink transmission channel processing method provided by the embodiment of the present invention specifically include the following steps: Step 1. All TTIs in the eight transmission channels to be processed are according to trch0, t rc hl .. . The order of trch7, in turn CRC addition, cascading of transport blocks and segmentation of coded blocks. If no transport block needs to be processed at this time, and there is data to be processed in the first interleaved RAM, step 5 is directly executed.
  • Step 2 transmitting the processed coding block, suspending the step 2 after each transmission of the data stream of the coding block, performing step 3, waiting for the occurrence of the coding completion flag signal of the channel coding of the coding block fed back in step 3, After the above-mentioned coding completion flag appears, the data stream of the next coding block is transmitted, and so on, until all the coding blocks have been transmitted.
  • Step 3 Perform channel coding on the data stream of the coding block formed in step 2. After completion, generate a data word stream and generate a code completion flag, and feedback the above code completion flag to step 2.
  • Step 4 According to whether the TTI size needs to be selected through the 24-bit mobile register, if it is 5ms or 10ms, it is directly stored in the first interleaving RAM, wherein, in this embodiment, the first interleaved RAM has 10ms storage. space. If the above two cases are not used, that is, the TTI is not 5ms or 10ms, the data needs to be selected according to the channel coding type and stored in the first interleaved RAM. The order in which data is written to the first interleaved RAM is the same as the serial processing sequence of the transport channel in step 1, until the data word stream of the last transport channel is written.
  • Step 5 sequentially read out the data stored in the first interleave RAM, perform rate matching, implement multiplexing of the transmission channel, and write the processed data to the second interleave RAM.
  • the uplink transmission channel processing method in the embodiment of the present invention can still process data streams of up to eight transmission channels in the same manner as the TD-SCDMA uplink transmission channel processing method in the prior art, but unlike the prior art, in the present invention
  • it is first determined which are the 10ms data of the interleaved output, and the timing diagram thereof is shown in FIG. 1.
  • the implementation architecture of the entire hardware module is shown in FIG. 2, wherein the data selection process needs to be based on the size of the ⁇ and the channel coding manner. determine.
  • the optimization scheme uses the feature to directly select a number of bits belonging to the same frame from the encoded data.
  • Table 1 Inter-column permutation mode of the first interleaving
  • each coding enables 2/3 output bits corresponding to each other, and then combines them into one word data and stores them in the first interleaving RAM. After all coding blocks are encoded, Data is read from the RAM for rate matching scrambling processing.
  • TTI 20/40/80ms
  • the reason why the size of 24bit is selected is based on: Whether it is 1/2 or 1/3 encoding, the number of encodings can always be guaranteed, and the data can just fill the register; whether it is 20, 40, 80ms, 24 bits There must be an integer number of bits belonging to the same wireless.
  • the specific implementation can be implemented by a counter.
  • the time characteristics of the write or read-out 24Bit shift register include: number of write cycles, determined by the encoding type, enable type output; The number of cycles, determined by the size of ⁇ , the read/write time characteristics are shown in Table 2, expressed in the format of the number of write cycles/read cycles, as follows: Table 2 shift register read and write time characteristics
  • TD-SCDMA uplink transmission channel processing method provided by an embodiment of the present invention has the following beneficial effects: It is not only intuitive and convenient to implement, but also reduces the logical processing difficulty of data storage location judgment, and reduces The requirement of interleaving the memory storage space is optimized, so that the optimized area is achieved for the entire uplink area.

Abstract

Disclosed is a TD-SCDMA uplink transmission channel processing method. An uplink transmission channel processing method provided by the present invention sequentially completes processing of every 10 ms for each transmission channel and does not need size-based ordering processing for TTIs of 8 transmission channels, thereby reducing the complexity of processing logic. By adopting the present invention, data of all transmission channels do not need to be saved in a large memory to choose 10 ms for processing, and instead only data of 10 ms that needs to be processed currently is directly stored, and the memory is used to choose data, so that the implementation not only is visual and convenient, but also reduces the logic processing difficulty of determining a data storage position, and lowers the requirement for the storage space of a primary interleaved memory, thereby achieving an optimization effect for an entire uplink area.

Description

TD-SCDMA上行传输信道处理方法  TD-SCDMA uplink transmission channel processing method
技术领域 本发明涉及无线移动通信及信号处理系统领域, 具体而言,涉及一种 TD-SCDMA (Time Division Duplex-Synchronous Code Division Multiple Access, 时分复用-码分多 址接入) 上行传输信道处理方法, 其应用于 TD-SCDMA基带芯片处理系统上行链路 传输信道的处理。 背景技术 无线移动通信及信号处理系统中, 上行链路是终端 UE到基站 NodeB的信号传输 链路, 对于上行链路而言, 其主要的处理包括传输信道部分处理与物理信道部分的处 理。 其中, 传输信道处理主要包括循环冗余校验码 (Cyclic Redundancy Code, 简称 CRC) 附加、 信道编码、 第一次交织、 速率匹配和传输信道复用。 物理信道对传输信 道送过来的数据进行第二次交织、物理信道映射、 QPSK调试、 Data扩频、 Data扰码、 I&Q分离操作, 并将处理过的数据和中导码 Midamble、 上行导频物理信道 UpPTS上 行同步码 SYNCJJL按照时间的先后顺序构造上行突发。 下面重点介绍与本发明密切 相关的传输信道处理的过程, 其相关的内容在第三代移动通信系统国际标准 3GPP TS25.221-TS25.224 (TDD)、 TS25.306、 TS34.108 等章节有具体阐述。 首先, 各个传输信道的数据以传输块为单位, 按照发射时间间隔 (Transmit Time Interval, 简称 ΤΉ)进行传输的。对于具有不同时延要求的业务, 可以使用不同的 ΤΉ 长度, 3GPP规定, 分别可以是 10ms, 20ms, 40ms和 80ms中的一种。 然后, 为了提供数据传输的可靠性,在发送端以数据块为单位进行 CRC附加和信 道编码。 其中, 信道编码可以是卷积编码或特博 Turbo编码。 编码后的数据流, 进行 无线帧长均衡, 例如在最后一帧的尾部填充虚拟比特, 以使一个 ΤΉ内的各帧的数据 比特数相等。 再次, 将经过无线帧长均衡的的数据流进行第一次交织, 即帧间交织。 交织的主 要目的是将突发错误打乱变成随机错误, 以利于译码器进行纠错, 从而提高抗衰落的 能力。 最后, 当一个 ΤΉ大于 10ms时, 需要将数据比特序列进行分段以映射到多个无 线帧进行传输。 在上行链路中, 当比特数在不同的 ΤΉ之间变化时, 数据比特将被重 传或者打孔, 以确保在传输信道复用后的总比特速率与分配的专用物理信道的总比特 速率相同。 经过上述处理后, 从各个传输信道取出一帧数据, 复用成一个编码复合传输信道, 通过第二次交织即帧内交织处理后映射到一个或多个物理信道上进行发送。 美国专利 US2006251001 (发明专利名称为 Rate matching method in mobile communication system)公开的专利文献提供了这样一种方法, 该方法适用于上行速率 匹配, 其包括 turbo 编码与卷积编码的各种编码方式后的速率匹配, 该方法采用的上 行速率匹配方式是: 首先进行传输信道编码; 然后把数据分成多重序列, 产生一次交织图像; 再根据计算数据比特移动值来确定数据中需要打孔和重复的位置, 从而挑选出后 续需要的数据存入存储器中进行后续的处理。 但通过研究发现, 此方法实现起来逻辑复杂度比较大。 中国专利 CN200610138212 (发明专利名称为一种上行链路的传输信道复用的方 法) 公开的专利文献提供了一种上行链路的传输信道复用的方法, 其主要包括以下实 施步骤: 首先对当前 10ms 时间间隔内需要同时传输的多个传输信道的所有传输块按照 TTI 由大到小的次序, 依次完成包括循环冗余校验码附加、 传输块的级联和编码块分 段, 编码处理, 将信道编码后的数据字流依次写入第一次交织随机存储器。 然后按照传输信道的原始序号的顺序从第一次交织随机存储器中一次取出各个传 输信道的数据, 进行一次交织和速率匹配, 同时实现传输信道的复用, 并将处理后的 数据写入到第二次交织随机存储器。 该技术方案将所有传输信道的数据都存到一个大的存储器里, 等所有传输信道完 成存储以后, 再从中挑选出进行完一次交织以后的 10ms数据进行后续的处理, 这样 对一次交织的实现比较方便和直观, 然而其仍然存在这样一个缺点: 即其没有考虑到 一次交织实际是以每个 10ms 为单位进行的, 采用该技术方案, 无疑增加了存储器的 开销, 此外, 该方案在实施时, 需要对数据的具体存放位置进行多次判断, 从而一定 程度上也增加了硬件的逻辑处理难度。 发明内容 为了减少存储器开销, 以及降低硬件逻辑处理难度, 本发明实施例提供了一种 TD-SCDMA上行传输信道处理方法。 本发明实施例采用以下技术方案实现: 一种 TD-SCDMA上行传输信道处理方法, 包括: TECHNICAL FIELD The present invention relates to the field of wireless mobile communication and signal processing systems, and in particular to a TD-SCDMA (Time Division Duplex-Synchronous Code Division Multiple Access) uplink transmission channel processing. The method is applied to the processing of an uplink transmission channel of a TD-SCDMA baseband chip processing system. BACKGROUND OF THE INVENTION In a wireless mobile communication and signal processing system, an uplink is a signal transmission link from a terminal UE to a base station NodeB, and for the uplink, its main processing includes processing of a transmission channel portion and processing of a physical channel portion. The transmission channel processing mainly includes Cyclic Redundancy Code (CRC) addition, channel coding, first interleaving, rate matching, and transmission channel multiplexing. The physical channel performs second interleaving, physical channel mapping, QPSK debugging, Data spreading, Data scrambling, I&Q separation operation on the data sent by the transmission channel, and the processed data and the midamble Midamble, uplink pilot physics The channel UpPTS uplink synchronization code SYNCJJL constructs an uplink burst in chronological order. The following focuses on the process of transport channel processing closely related to the present invention, and its related content is in the third generation mobile communication system international standard 3GPP TS25.221-TS25.224 (TDD), TS25.306, TS34.108, etc. Specific explanation. First, the data of each transport channel is transmitted in units of transport blocks and transmitted according to a Transmit Time Interval (abbreviated as ΤΉ). For services with different delay requirements, different lengths can be used. According to 3GPP, they can be one of 10ms, 20ms, 40ms and 80ms respectively. Then, in order to provide reliability of data transmission, CRC addition and channel coding are performed at the transmitting end in units of data blocks. The channel coding may be convolutional coding or turboscopic Turbo coding. The encoded data stream is subjected to radio frame length equalization, for example, the dummy bits are padded at the end of the last frame so that the number of data bits of each frame in one frame is equal. Again, the data stream that has been subjected to radio frame length equalization is interleaved for the first time, that is, inter-frame interleaving. The main purpose of interleaving is to turn the burst error into a random error to facilitate the decoder to correct the error, thereby improving the ability to resist fading. Finally, when a ΤΉ is greater than 10 ms, the data bit sequence needs to be segmented to be mapped to multiple radio frames for transmission. In the uplink, when the number of bits varies between different turns, the data bits will be retransmitted or punctured to ensure the total bit rate after the transport channel multiplexing and the total bit rate of the assigned dedicated physical channel. the same. After the above processing, one frame of data is taken out from each transmission channel, and multiplexed into one coded composite transmission channel, and then mapped to one or more physical channels for transmission by the second interleaving, that is, the intraframe interleaving process. The patent document disclosed in US Patent No. US2006251001 (Rate matching method in mobile communication system) provides a method suitable for uplink rate matching, which includes various encoding methods of turbo coding and convolutional coding. Rate matching, the uplink rate matching method adopted by the method is: first, performing transmission channel coding; then dividing the data into multiple sequences to generate an interleaved image; and determining a position in the data that needs to be punched and repeated according to the calculated data bit shift value, Therefore, the data required for subsequent processing is selected and stored in the memory for subsequent processing. However, through research, it is found that the logic complexity of this method is relatively large. Chinese Patent CN200610138212 (The invention patent name is a method for uplink transmission channel multiplexing) The published patent document provides a method for uplink transmission channel multiplexing, which mainly includes the following implementation steps: First, current All transport blocks of multiple transport channels that need to be transmitted simultaneously in a 10 ms time interval are sequentially completed in order of TTI, including cyclic redundancy check code addition, concatenation of transport blocks, and coding block segmentation, coding processing, The channel-encoded data word stream is sequentially written into the first interleaved random access memory. Then, the data of each transport channel is taken out from the first interleaved random memory in the order of the original serial number of the transport channel, and the interleaving and rate matching are performed, and the multiplexing of the transport channel is implemented, and the processed data is written to the first Secondary interleaved random access memory. The technical solution stores all the data of the transmission channel into a large memory, and after all the transmission channels complete the storage, the 10 ms data after the completion of the interleaving is selected and processed for subsequent processing, so that the implementation of the one-time interleaving is compared. Convenient and intuitive, however, it still has such a disadvantage: it does not take into account that one interleaving is actually carried out in units of 10ms. With this technical solution, the memory is undoubtedly increased. Overhead, in addition, when the solution is implemented, it is necessary to make multiple judgments on the specific storage location of the data, thereby increasing the logical processing difficulty of the hardware to some extent. SUMMARY OF THE INVENTION In order to reduce memory overhead and reduce hardware logic processing, embodiments of the present invention provide a TD-SCDMA uplink transmission channel processing method. The embodiment of the present invention adopts the following technical solutions: A TD-SCDMA uplink transmission channel processing method includes:
A、 对当前待处理的 N 个传输信道里的所有的发射时间间隔 TTI 按照 trcW trchl ...... trch(N-l)的次序依次进行循环冗余校验码 CRC附加、 传输块的级联以及编码 块的分段处理, 如果此时没有传输块需要处理, 而第一次交织存储器 RAM (Random Access Memory, 片内随机存储器) 中有数据需要处理, 则直接执行步骤 E; A. Cyclic redundancy check code CRC addition and cascading of transport blocks are sequentially performed in the order of trcW trchl ... trch(Nl) for all transmission time intervals TTI in the current N transmission channels to be processed. And the segmentation processing of the coding block, if there is no transmission block to be processed at this time, and the first interleaved memory RAM (on-chip random access memory) has data to be processed, directly execute step E;
B、 传送经过处理的编码块, 每次传送完一个编码块的数据流后便暂停该步骤 B 的操作, 执行步骤^ 并等待步骤 C反馈的该编码块的信道编码的编码完成标志信号 的出现, 上述编码完成标志出现后, 便接着传送下一个编码块的数据流, 依次类推, 直到所有的编码块传送完毕; B. Transmitting the processed coding block, suspending the operation of the step B after each time the data stream of one coding block is transmitted, performing step ^ and waiting for the appearance of the coding completion flag signal of the channel coding of the coding block fed back in step C After the above code completion flag appears, the data stream of the next code block is transmitted, and so on, until all the code blocks are transmitted;
C、 对步骤 B中形成的编码块的数据流进行信道编码, 完成后生成数据字流并产 生一个编码完成标志, 并将该编码完成标志反馈步骤 B; C, channel coding the data stream of the coding block formed in step B, after completion, generating a data word stream and generating an encoding completion flag, and feeding back the coding completion flag step B;
D、 根据 TTI大小判断是否需要对经过信道编码后的数据流进行挑选, 如果 ΤΉ 为 5ms或 10ms, 则将数据流直接存入第一次交织 RAM中, 否则, 则根据数据流的信 道编码类型通过 24bit的移动寄存器对数据进行挑选,之后再将数据流存入第一次交织 RAM中; D. Determine whether the channel-coded data stream needs to be selected according to the TTI size. If ΤΉ is 5ms or 10ms, the data stream is directly stored in the first interleaving RAM. Otherwise, according to the channel coding type of the data stream. The data is selected by a 24-bit mobile register, and then the data stream is stored in the first interleaved RAM;
E、按照数据存入第一次交织 RAM的顺序从中依次读出数据, 且进行速率匹配以 及传输信道的复用, 之后将处理后的数据写入第二次交织 RAM中。 优选地, 在所述步骤 A中, 所述 N≤8。 优选地, 在所述步骤 A中, 所述 ΤΉ为 5ms、 10ms, 20ms, 40ms或 80ms中的 一种。 优选地, 在所述步骤 B中, 当信道编码的编码类型为 cotw 1/3卷积编码, 且 ΤΉ 为 20ms时, 在编码控制模块中增加一个变量选择器 CyCle_sel, 且在编码控制模块中 的状态机处于非初始状态时, 自动翻转。 更为优选地, 当变量选择器 cyCle_sel为高时, 程序中其他相关变量才在原来的机 制上变化。 优选地, 在所述步骤 C中, 信道编码包括卷积编码以及特博 turbo编码。 优选地, 在所述步骤 D中, 将数据流存入第一次交织 RAM中的数据写入顺序与 步骤 A中传输信道的串行处理顺序是一致的, 直到写完最后一个传输信道的数据流。 优选地, 在所述步骤 D中, 第一次交织 RAM具有 10ms存储空间。 优选地, 在所述步骤 D中, 24bit的移动寄存器采用乒乓缓存结构。 优选地, 在所述步骤 D中, 根据数据流的信道编码类型通过 24bit的移动寄存器 对数据进行挑选的方法为: 使用两个 24bit的移位寄存器,将编码数据交叉写入两个移位寄存器之中, 当写满 任意一个移位寄存器 24bit后,则从该移位寄存器中按照一次交织图样选取属于同一帧 的比特数据。 通过上述本发明实施例的技术方案可以看出, 本发明实施例提供的上行传输信道 处理方法依次完成各个传输信道每个 10ms的处理, 不需要对 8个传输信道的 TTI按 照大小进行排序处理, 减少了处理逻辑的复杂性。 具体地,本发明实施例提供的上行传输信道处理方法利用了一次交织处理的特点: 是以每个 10ms 为单位进行的, 因此不需要将所有传输信道的数据都存到一个大存储 器中以挑选出 10ms进行处理, 而是直接只存储当前所要处理的一个 10ms的数据, 并 利用存储器完成数据的挑选, 其实现起来不仅直观和方便, 并且减少了对数据存放位 置判断的逻辑处理难度, 以及降低了一次交织存储器存储空间的要求, 从而对整个上 行的面积达到了优化的效果。 附图说明 图 1是本发明实施例中上行传输信道的工作时序; 图 2是本发明实施例中上行硬件模块实现的架构示意图; 图 3是本发明实施例中 ΤΉ大小为 40ms时挑选待处理比特数示意图。 下面将结合具体实施例以及附图做进一步的说明。 具体实施方式 下面结合附图和具体实施例对本发明所述技术方案作进一步的详细描述, 以使本 领域的技术人员可以更好的理解本发明并能予以实施, 但所举实施例不作为对本发明 的限定。 本发明实施例的核心思路是: E. The data is sequentially read out in the order in which the data is stored in the first interleave RAM, and rate matching and multiplexing of the transport channels are performed, and then the processed data is written into the second interleave RAM. Preferably, in the step A, the N≤8. Preferably, in the step A, the ΤΉ is one of 5 ms, 10 ms, 20 ms, 40 ms or 80 ms. Preferably, in the step B, when the coding type of the channel coding is cotw 1/3 convolutional coding, and ΤΉ is 20 ms, a variable selector C y C l e _sel is added to the coding control module, and When the state machine in the code control module is in the non-initial state, it automatically flips. More preferably, when the variable selector cy C l e _sel is high, other related variables in the program change in the original mechanism. Preferably, in the step C, the channel coding comprises convolutional coding and turboscopic turbo coding. Preferably, in the step D, the data writing sequence of storing the data stream into the first interleaving RAM is consistent with the serial processing sequence of the transmission channel in step A until the data of the last transmission channel is written. flow. Preferably, in the step D, the first interleaved RAM has a storage space of 10 ms. Preferably, in the step D, the 24 bit mobile register adopts a ping-pong buffer structure. Preferably, in the step D, the data is selected by the 24-bit mobile register according to the channel coding type of the data stream: using two 24-bit shift registers, the coded data is cross-written into the two shift registers. Among them, when any one of the shift registers 24 bits is written, the bit data belonging to the same frame is selected from the shift register according to the one-time interleaving pattern. As shown in the foregoing technical solution of the embodiment of the present invention, the uplink transmission channel processing method provided by the embodiment of the present invention sequentially performs processing for each 10 ms of each transmission channel, and does not need to sort the TTIs of the eight transmission channels according to the size. Reduce the complexity of processing logic. Specifically, the uplink transmission channel processing method provided by the embodiment of the present invention utilizes the characteristics of one-time interleaving processing: it is performed in units of 10 ms, so that it is not necessary to store all the transmission channel data in one large memory to select 10ms for processing, but directly store only one 10ms of data to be processed, and use memory to complete the selection of data, which is not only intuitive and convenient to implement, but also reduces the logical processing difficulty of data storage location judgment, and reduces The requirement of interleaving the memory storage space is optimized, so that the optimized area is achieved for the entire uplink area. 1 is a schematic diagram of an operation sequence of an uplink transmission channel in an embodiment of the present invention; FIG. 2 is a schematic structural diagram of an implementation of an uplink hardware module in an embodiment of the present invention; FIG. 3 is a schematic diagram of selecting the number of bits to be processed when the size of the UI is 40 ms in the embodiment of the present invention. Further description will be made below in conjunction with the specific embodiments and the accompanying drawings. The technical solutions of the present invention are further described in detail below in conjunction with the accompanying drawings and specific embodiments, so that those skilled in the art can understand the present invention and can be practiced, but the embodiments are not Limitation of the invention. The core idea of the embodiment of the present invention is:
(1) 本发明实施例不需要对 8个传输信道的 ΤΉ按照大小进行排序处理, 而是依 次完成各个传输信道每个 10ms的处理; (2) 本发明实施例利用了一次交织处理的特点: 即以每个 10ms为单位进行, 因此 不需要将所有传输信道的数据都存到一个大存储器中挑选出 10ms进行处理, 而是直 接只存储当前所要处理的一个 10ms 的数据, 将原来第一次交织存储器的容量由原来 的需要存储八个传输信道的数据, 减少到只存储一个传输信道中的一个 10ms数据的 容量, 此外, 在本发明实施例的实施过程中, 需要增加对存入第一次交织存储器比特 数的选择逻辑。 以下详细阐述本发明实施例 TD-SCDMA上行传输信道处理方法的设计思路。 参考图 1,本发明实施例将传输信道待处理的数据依次进行 CRC附加,编码操作, 并且根据 ΤΉ大小以及交织规律判断进行一次交织完成后哪些数据需要先进行下一步 操作,然后把一个 10ms的数据预先挑选出来并存到一个 10ms数据能存储的较小 RAM 中去, 再进行后续的速率匹配等操作。 每个 10ms数据的挑选类似, 直到处理完成全 部的传输信道的数据。 具体来说, 本发明实施例提供的上行传输信道处理方法的实施步骤具体包括下述 几步; 步骤①, 对当前待处理的 8个传输信道里的所有的 TTI按照 trch0,trchl ....... trch7 的次序, 依次进行 CRC附加, 传输块的级联和编码块的分段。如果此时没有传输块需 要处理, 而第一次交织 RAM中有数据需要处理, 则直接执行步骤⑤。 步骤②, 传送经过处理的编码块, 每次传送完一个编码块的数据流后便暂停该步 骤②, 执行步骤③, 等待步骤③反馈的该编码块的信道编码的编码完成标志信号的出 现, 上述编码完成标志出现后, 便接着传送下一个编码块的数据流, 依次类推, 直到 所有的编码块传送完毕。 步骤③: 对步骤②中形成的编码块的数据流, 进行信道编码, 完成后生成数据字 流并产生一个编码完成标志, 将上述编码完成标志反馈步骤②。 步骤④: 根据 TTI大小是否需要经过 24bit的移动寄存器进行挑选, 如果 ΤΉ为 5ms或者 10ms, 则直接存入第一次交织 RAM中, 其中, 在本实施例中, 第一次交织 RAM具有 10ms存储空间。 如果不为以上两种情况, 即 TTI不为 5ms或者 10ms, 则 需要根据信道编码类型将数据进行挑选再存入第一次交织 RAM。其中,将数据写入第 一次交织 RAM的顺序与步骤①中传输信道的串行处理顺序是一致的, 直到写完最后 一个传输信道的数据字流。 步骤⑤: 按照存入第一次交织 RAM中的数据依次读出, 并且进行速率匹配, 同 时实现传输信道的复用, 并将处理后的数据写入到第二次交织 RAM中去。 本发明实施例中上行传输信道处理方法和现有技术中 TD-SCDMA上行传输信道 处理方法的一样, 仍然能最多处理 8个传输信道的数据流, 但与现有技术不同的是, 在本发明实施例中, 先要判断哪些是一次交织输出的 10ms数据, 其时序图见图 1, 整 个硬件模块的实现架构如图 2所示, 其中, 数据的挑选过程需要根据 ΤΉ大小以及信 道编码方式来确定。 根据表 1, 对于组合成串行数据的编码后输出, 属于同一个无线帧的比特之间的 间隔不会超过八个 bit, BP : TTI=20ms, 间隔为 2 的比特必然属于同一个无线帧, 等 等, 所以本发明实施例提供的优化方案利用该特点从编码后数据直接挑选属于同一帧 的若干比特。 表 1 第一次交织的列间置换模式 (1) The embodiment of the present invention does not need to sort the 8 transmission channels according to the size, but sequentially completes each 10 ms processing of each transmission channel. (2) The embodiment of the present invention utilizes the characteristics of one-time interleaving processing: That is, it is performed in units of 10ms each, so it is not necessary to store all the data of the transmission channel in one large memory and select 10ms for processing, and directly store only one 10ms of data to be processed currently, which will be the first time. The capacity of the interleaved memory is reduced from the original data of the eight transport channels to the capacity of storing only one 10ms of data in one transport channel. In addition, in the implementation of the embodiment of the present invention, the first deposit is required. The selection logic of the number of sub-interleaved memory bits. The design of the TD-SCDMA uplink transmission channel processing method in the embodiment of the present invention is described in detail below. Referring to FIG. 1, an embodiment of the present invention sequentially performs CRC attaching and encoding operations on data to be processed on a transport channel, and determines which data needs to be performed in the next step after performing an interleaving according to the size of the ΤΉ and the interleaving rule, and then takes a 10 ms operation. The data is pre-selected and stored in a small RAM that can be stored in 10ms of data, and then subjected to subsequent rate matching operations. The selection of each 10ms data is similar until the processing of all the data of the transmission channel is completed. Specifically, the implementation steps of the uplink transmission channel processing method provided by the embodiment of the present invention specifically include the following steps: Step 1. All TTIs in the eight transmission channels to be processed are according to trch0, t rc hl .. ..... The order of trch7, in turn CRC addition, cascading of transport blocks and segmentation of coded blocks. If no transport block needs to be processed at this time, and there is data to be processed in the first interleaved RAM, step 5 is directly executed. Step 2: transmitting the processed coding block, suspending the step 2 after each transmission of the data stream of the coding block, performing step 3, waiting for the occurrence of the coding completion flag signal of the channel coding of the coding block fed back in step 3, After the above-mentioned coding completion flag appears, the data stream of the next coding block is transmitted, and so on, until all the coding blocks have been transmitted. Step 3: Perform channel coding on the data stream of the coding block formed in step 2. After completion, generate a data word stream and generate a code completion flag, and feedback the above code completion flag to step 2. Step 4: According to whether the TTI size needs to be selected through the 24-bit mobile register, if it is 5ms or 10ms, it is directly stored in the first interleaving RAM, wherein, in this embodiment, the first interleaved RAM has 10ms storage. space. If the above two cases are not used, that is, the TTI is not 5ms or 10ms, the data needs to be selected according to the channel coding type and stored in the first interleaved RAM. The order in which data is written to the first interleaved RAM is the same as the serial processing sequence of the transport channel in step 1, until the data word stream of the last transport channel is written. Step 5: sequentially read out the data stored in the first interleave RAM, perform rate matching, implement multiplexing of the transmission channel, and write the processed data to the second interleave RAM. The uplink transmission channel processing method in the embodiment of the present invention can still process data streams of up to eight transmission channels in the same manner as the TD-SCDMA uplink transmission channel processing method in the prior art, but unlike the prior art, in the present invention In the embodiment, it is first determined which are the 10ms data of the interleaved output, and the timing diagram thereof is shown in FIG. 1. The implementation architecture of the entire hardware module is shown in FIG. 2, wherein the data selection process needs to be based on the size of the 以及 and the channel coding manner. determine. According to Table 1, for the encoded output combined into serial data, the interval between the bits belonging to the same radio frame does not exceed eight bits, BP : TTI = 20 ms, and the bits with interval 2 must belong to the same radio frame. Therefore, the optimization scheme provided by the embodiment of the present invention uses the feature to directly select a number of bits belonging to the same frame from the encoded data. Table 1 Inter-column permutation mode of the first interleaving
Figure imgf000008_0001
对于 TTI=5/10ms, 此时实质上无一次交织的过程, 而且编码速率有可能有 1/2,1/3 的分别,所以如何从编码结果数据中选取数据以及保证数据的有效性, 需要考虑如下:
Figure imgf000008_0001
For TTI=5/10ms, there is essentially no interleaving process at this time, and the encoding rate may have 1/2, 1/3 respectively, so how to select data from the encoded result data and ensure the validity of the data requires Consider the following:
( 1 ) TTI=5/10ms 对于无一次交织的特殊情况, 每一次编码使能对应的 2/3个输出比特, 依次组合 成一个字数据存入第一次交织 RAM,所有编码块编码结束后从该 RAM读取数据进行 速率匹配加扰处理。 (1) TTI=5/10ms For the special case without one interleaving, each coding enables 2/3 output bits corresponding to each other, and then combines them into one word data and stores them in the first interleaving RAM. After all coding blocks are encoded, Data is read from the RAM for rate matching scrambling processing.
(2) TTI=20/40/80ms 此时需要从编码输出数据中选取属于同一帧的比特数据, 由于有若干 TTI和编码 率的组合, 如果考虑从每次编码后的 2到 3个比特选取一个 bit, 则对于所有的 ΤΉ组 合而言, 该选取过程无特别强的规律可循, 所以这里考虑使用两个 24bit的移位寄存器,采用乒乓操作,编码数据交叉写入两 个移位寄存器,写满任意一个寄存器 24bit后则从中按照一次交织图样选取属于同一帧 的比特数据。 之所以选择 24bit的大小, 是基于: 不管是 1/2还是 1/3编码, 总能保证整数个编 码次后, 数据可以刚好填充该寄存器; 无论 ΤΉ为 20, 40, 80ms, 24个比特中必然 有属于同一个无线的整数个比特。 以 TTI=40ms为例, 实现交织后挑选比特过程的示意图如 3所示, Frm_vld代表某 个无线帧对应的在 24bit中有效位, 直接对应交织图样表 1, 可见属于同一个无线帧的 比特间隔为 4, 具体实现可以通过计数器实现。 TTI=20/80ms时, 规律与上例类似, 都 是直接对应交织图样表 1。 对于 ΤΉ不等于 5ms或者 10ms的情况,编码后的数据不能直接存到只开了 10ms 空间的第一次交织 RAM中去, 而是先依次存入 24bit的移位寄存器里, 然后再根据交 织规律与 ΤΉ大小, 选出首先处理的 10ms。 对于乒乓操作, 需要考虑读写操作的时间特性, 以防止数据的溢出或者丢失, 写 满或者读空 24Bit移位寄存器时间特性包括: 写周期数, 由编码类型, 使能类型输出 决定; 读取周期数, 由 ΤΉ大小决定, 读写时间特性如表 2所示, 以写周期数 /读周期 数的格式表示, 如下: 表 2 移位寄存器读写时间特性 (2) TTI=20/40/80ms At this time, it is necessary to select bit data belonging to the same frame from the coded output data. Since there are several combinations of TTI and coding rate, if considering 2 to 3 bits after each encoding, One bit, then for all combinations of ΤΉ, the selection process has no special strong rules to follow, so consider using two 24-bit shift registers, using ping-pong operation, the coded data is cross-written into two shift registers, After writing 24 bits of any one of the registers, the bit data belonging to the same frame is selected from one interleaving pattern. The reason why the size of 24bit is selected is based on: Whether it is 1/2 or 1/3 encoding, the number of encodings can always be guaranteed, and the data can just fill the register; whether it is 20, 40, 80ms, 24 bits There must be an integer number of bits belonging to the same wireless. Taking TTI=40ms as an example, the schematic diagram of the process of selecting a bit after interleaving is shown in FIG. 3, Frm_vld represents a valid bit in 24 bits corresponding to a certain radio frame, and directly corresponds to the interleaving pattern table 1, and the bit interval belonging to the same radio frame can be seen. For 4, the specific implementation can be implemented by a counter. When TTI=20/80ms, the law is similar to the above example, which is directly corresponding to the interleaving pattern table 1. For the case where ΤΉ is not equal to 5ms or 10ms, the encoded data cannot be directly stored in the first interleaved RAM that has only opened 10ms of space, but is first stored in the 24-bit shift register, and then according to the interleaving rule. With the size of ΤΉ, select the first 10ms to process. For ping-pong operations, you need to consider the time characteristics of the read and write operations to prevent data overflow or loss. The time characteristics of the write or read-out 24Bit shift register include: number of write cycles, determined by the encoding type, enable type output; The number of cycles, determined by the size of ΤΉ, the read/write time characteristics are shown in Table 2, expressed in the format of the number of write cycles/read cycles, as follows: Table 2 shift register read and write time characteristics
Figure imgf000010_0001
Figure imgf000010_0001
由表 2可以看见对于乒乓操作的挑选过程, 除了 1/3 conv并且 TTI=20ms—种情 况外, 都能满足乒乓操作快写慢读的过程。 因此在编码控制模块需要对这种情况进行 额外的考虑。 解决方法是在编码控制模块增加一个变量选择器 cyCle_sel, 在编码控制 模块中的状态机非初始状态时, 自动翻转。 程序中其它相关变量只有当 cyCle_sel为高 时, 才在原来的机制上变化, 这就形成了处理周期为 2的循环。 以上所述仅为本发明的优选实施例, 并非因此限制本发明的专利范围, 凡是利用 本发明说明书及附图内容所作的等效结构或等效流程变换, 或直接或间接运用在其他 相关的技术领域, 均同理包括在本发明的专利保护范围内。 工业实用性 如上所述,本发明实施例提供的一种 TD-SCDMA上行传输信道处理方法具有 以下有益效果: 实现起来不仅直观和方便, 并且减少了对数据存放位置判断的逻辑 处理难度, 以及降低了一次交织存储器存储空间的要求, 从而对整个上行的面积达 到了优化的效果。 It can be seen from Table 2 that the selection process for the ping-pong operation, except for 1/3 conv and TTI=20ms, can satisfy the process of ping-pong operation fast write slow reading. Therefore, additional considerations need to be made in this case in the coding control module. The solution is to add a variable selector cy C l e _sel in the encoding control module, which automatically flips when the state machine in the encoding control module is not in the initial state. Other related variables in the program change only in the original mechanism when cy C l e _sel is high, which forms a loop with a processing period of 2. The above description is only the preferred embodiment of the present invention, and is not intended to limit the scope of the invention, and the equivalent structure or equivalent flow transformation made by the specification and the drawings of the present invention may be directly or indirectly applied to other related The technical field is equally included in the scope of patent protection of the present invention. INDUSTRIAL APPLICABILITY As described above, a TD-SCDMA uplink transmission channel processing method provided by an embodiment of the present invention has the following beneficial effects: It is not only intuitive and convenient to implement, but also reduces the logical processing difficulty of data storage location judgment, and reduces The requirement of interleaving the memory storage space is optimized, so that the optimized area is achieved for the entire uplink area.

Claims

权 利 要 求 书 、 一种 TD-SCDMA上行传输信道处理方法, 包括: A request for rights, a TD-SCDMA uplink transmission channel processing method, including:
A、对当前待处理的 N个传输信道里的所有的发射时间间隔 TTI按照 trcW trchl ...... trch(N-l)的次序依次进行循环冗余校验码 CRC附加、 传输块的级联以 及编码块的分段处理, 如果此时没有传输块需要处理, 而第一次交织存储器 RAM中有数据需要处理, 则直接执行步骤 E;  A. Cyclic redundancy check code CRC addition and cascading of transport blocks are sequentially performed in the order of trcW trchl ... trch(Nl) for all transmission time intervals TTI in the current N transport channels to be processed. And the segmentation processing of the coding block, if there is no transmission block to be processed at this time, and the first interleave memory RAM has data to be processed, directly perform step E;
B、 传送经过处理的编码块, 每次传送完一个编码块的数据流后便暂停该 步骤 B的操作, 执行步骤 C, 并等待步骤 C反馈的该编码块的信道编码的编码 完成标志信号的出现, 上述编码完成标志出现后, 便接着传送下一个编码块的 数据流, 依次类推, 直到所有的编码块传送完毕;  B. The processed coded block is transmitted, and the operation of the step B is suspended every time the data stream of one coded block is transmitted, step C is performed, and the coded completion flag signal of the channel code of the coded block fed back in step C is awaited. Appears, after the above code completion flag appears, the data stream of the next code block is transmitted, and so on, until all the code blocks are transmitted;
C、 对步骤 B中形成的编码块的数据流进行信道编码, 完成后生成数据字 流并产生一个编码完成标志, 并将该编码完成标志反馈步骤 B;  C, channel encoding the data stream of the coding block formed in step B, after completion, generating a data word stream and generating a code completion flag, and feeding back the code completion flag to step B;
D、 根据 TTI大小判断是否需要对经过信道编码后的数据流进行挑选, 如 果 TTI为 5ms或 10ms, 则将数据流直接存入第一次交织 RAM中, 否则, 则根 据数据流的信道编码类型通过 24bit 的移动寄存器对数据进行挑选, 之后再将 数据流存入第一次交织 RAM中;  D. Determine whether the channel-coded data stream needs to be selected according to the TTI size. If the TTI is 5ms or 10ms, the data stream is directly stored in the first interleaved RAM. Otherwise, according to the channel coding type of the data stream. The data is selected by a 24-bit mobile register, and then the data stream is stored in the first interleaved RAM;
E、按照数据存入第一次交织 RAM的顺序从中依次读出数据, 且进行速率 匹配以及传输信道的复用, 之后将处理后的数据写入第二次交织 RAM中。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 A中, 所述 N≤8。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 A中, 所述 TTI为 5ms、 10ms, 20ms, 40ms或 80ms中的一种。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法,其中,在所述步骤 B 中, 当信道编码的编码类型为 conv 1/3卷积编码, 且 ΤΉ为 20ms时, 在编码 控制模块中增加一个变量选择器 cyCle_sel, 且在编码控制模块中的状态机处于 非初始状态时, 自动翻转。 、 如权利要求 4所述的 TD-SCDMA上行传输信道处理方法, 其中, 当变量选择 器 CyCle_sel为高时, 程序中其他相关变量才在原来的机制上变化。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法,其中,在所述步骤 C 中, 信道编码包括卷积编码以及特博 turbo编码。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 D中, 将数据流存入第一次交织 RAM中的数据写入顺序与步骤 A中传输信道 的串行处理顺序是一致的, 直到写完最后一个传输信道的数据流。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 D中, 第一次交织 RAM具有 10ms存储空间。 、 如权利要求 1所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 D中, 24bit的移动寄存器采用乒乓缓存结构。 、 如权利要求 9所述的 TD-SCDMA上行传输信道处理方法, 其中, 在所述步骤 D中,根据数据流的信道编码类型通过 24bit的移动寄存器对数据进行挑选的方 法为- 使用两个 24bit的移位寄存器, 将编码数据交叉写入两个移位寄存器之中, 当写满任意一个移位寄存器 24bit后, 则从该移位寄存器中按照一次交织图样 选取属于同一帧的比特数据。 E. The data is sequentially read out in the order in which the data is stored in the first interleave RAM, and rate matching and multiplexing of the transport channels are performed, and then the processed data is written into the second interleave RAM. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step A, the N is ≤ 8. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step A, the TTI is one of 5 ms, 10 ms, 20 ms, 40 ms or 80 ms. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step B, when the coding type of the channel coding is conv 1/3 convolutional coding, and the ΤΉ is 20 ms, the coding control A variable selector cy C l e _sel is added to the module, and the state machine in the code control module is automatically flipped when it is in a non-initial state. The TD-SCDMA uplink transmission channel processing method according to claim 4, wherein when the variable selector C y C l e _sel is high, other related variables in the program change in the original mechanism. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step C, the channel coding comprises convolutional coding and turboscopic turbo coding. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step D, the data stream is stored in the data interleaving sequence in the first interleave RAM and the transmission channel sequence in step A The row processing order is consistent until the data stream of the last transport channel is written. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step D, the first interleaved RAM has a storage space of 10 ms. The TD-SCDMA uplink transmission channel processing method according to claim 1, wherein in the step D, the 24-bit mobile register adopts a ping-pong buffer structure. The TD-SCDMA uplink transmission channel processing method according to claim 9, wherein in the step D, the method of selecting data by using a 24-bit mobile register according to a channel coding type of the data stream is: using two 24 bits The shift register cross-writes the encoded data into two shift registers. When any of the shift registers 24 bits is written, the bit data belonging to the same frame is selected from the shift register according to the one-time interleaving pattern.
PCT/CN2013/085827 2012-12-11 2013-10-23 Td-scdma uplink transmission channel processing method WO2014090045A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210532075.5 2012-12-11
CN201210532075.5A CN103873186B (en) 2012-12-11 2012-12-11 TD-SCDMA uplink transport channel processing methods

Publications (1)

Publication Number Publication Date
WO2014090045A1 true WO2014090045A1 (en) 2014-06-19

Family

ID=50911347

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/085827 WO2014090045A1 (en) 2012-12-11 2013-10-23 Td-scdma uplink transmission channel processing method

Country Status (2)

Country Link
CN (1) CN103873186B (en)
WO (1) WO2014090045A1 (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11153875B2 (en) 2014-05-19 2021-10-19 Qualcomm Incorporated Apparatus and method for inter-band pairing of carriers for time division duplex transmit- and receive-switching and its application to multiplexing of different transmission time intervals
US11432305B2 (en) 2014-05-19 2022-08-30 Qualcomm Incorporated Apparatus and method for synchronous multiplexing and multiple access for different latency targets utilizing thin control
US10164659B2 (en) 2016-05-12 2018-12-25 Mediatek Inc. QC-LDPC coding methods and apparatus
US10581457B2 (en) 2017-01-09 2020-03-03 Mediatek Inc. Shift coefficient and lifting factor design for NR LDPC code
US10432227B2 (en) * 2017-01-24 2019-10-01 Mediatek Inc. Location of interleaver with LDPC code
US10630319B2 (en) 2017-01-24 2020-04-21 Mediatek Inc. Structure of interleaver with LDPC code
US10484013B2 (en) 2017-05-12 2019-11-19 Mediatek Inc. Shift-coefficient table design of QC-LDPC code for smaller code block sizes in mobile communications
US10484011B2 (en) 2017-05-12 2019-11-19 Mediatek Inc. Shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications
US10567116B2 (en) 2017-05-12 2020-02-18 Mediatek Inc. Wireless communication using codebooks from a QC-LDPC code for shorter processing latency and improved decoder throughput efficiency
CN109150413B (en) * 2017-06-16 2021-06-15 华为技术有限公司 Method and device for sending and receiving feedback information

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060251001A1 (en) * 1999-07-14 2006-11-09 Lg Information & Communications, Ltd. Rate matching method in mobile communication system
CN101174937A (en) * 2006-11-03 2008-05-07 中兴通讯股份有限公司 Method for transmission channel multiplexing of ascending link route
CN101889399A (en) * 2007-10-04 2010-11-17 三星电子株式会社 Method and apparatus for interleaving data in a mobile communication system
US20120069915A1 (en) * 2010-09-17 2012-03-22 Electronics And Telecommunications Research Institute Rate matching apparatus and rate matching method thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102064910A (en) * 2009-11-13 2011-05-18 傲世通科技(苏州)有限公司 Method and device of bit collection and interlacing for mixed automatic retransmission request

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060251001A1 (en) * 1999-07-14 2006-11-09 Lg Information & Communications, Ltd. Rate matching method in mobile communication system
CN101174937A (en) * 2006-11-03 2008-05-07 中兴通讯股份有限公司 Method for transmission channel multiplexing of ascending link route
CN101889399A (en) * 2007-10-04 2010-11-17 三星电子株式会社 Method and apparatus for interleaving data in a mobile communication system
US20120069915A1 (en) * 2010-09-17 2012-03-22 Electronics And Telecommunications Research Institute Rate matching apparatus and rate matching method thereof

Also Published As

Publication number Publication date
CN103873186B (en) 2018-07-13
CN103873186A (en) 2014-06-18

Similar Documents

Publication Publication Date Title
WO2014090045A1 (en) Td-scdma uplink transmission channel processing method
CN101183875B (en) Velocity matching method for limited longness circulation caching of Turbo code
US7509557B2 (en) De-interleaver, mobile communication terminal, and de-interleaving method
CN101119182B (en) Bit priority selection method of high-order modulation
TWI363540B (en) Turbo interleaver for high data rates
US8958330B2 (en) De-rate matching method and device for downlink traffic channel in long term evolution
JP4377363B2 (en) Physical layer processing for wireless communication systems using code division multiple access
CN101217352B (en) A buffering setting method of phase rate matching
TW201031157A (en) Software parameterizable control blocks for use in physical layer processing
WO2019062861A1 (en) Design scheme for redundancy versions in communication system
CN101087181B (en) A method for removing interweaving and speed match
US7814388B2 (en) System and method for interleaving data in a wireless transmitter
CN103312442A (en) Method and device for transmitting data based on finite-length circular buffer rate matching
WO2011069277A1 (en) Method for high-efficient implementation of de-rate matching including harq combining for lte
JP2007525912A (en) Efficient multi-symbol deinterleaver
US9444494B2 (en) Systems and methods for network coding using convolutional codes
TW200849878A (en) Method and apparatus for coding a communication signal
JP4821771B2 (en) HS-PDSCH decoder and mobile radio communication apparatus equipped with the same
US10110349B2 (en) Rate dematching method, apparatus and receiving-side device
WO2011095115A1 (en) Method and device for de-interleaving
US7385949B1 (en) System and method for de-interleaving data in a wireless receiver
WO2002062001A1 (en) Error correcting communication method and communication apparatus to which this communication method is applied
US8977913B2 (en) Method, device and baseband chip for receiving service data in a communication system
JP2003256246A (en) Storage device and storage method
TW201832505A (en) High code-rate iterative decoding methods and apparatus with limited harq

Legal Events

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

Ref document number: 13863653

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13863653

Country of ref document: EP

Kind code of ref document: A1