Classifications

• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2771—Internal interleaver for turbo codes
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
  • H03M13/271—Row-column interleaver with permutations, e.g. block interleaving with inter-row, inter-column, intra-row or intra-column permutations
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
  • H03M13/2703—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques the interleaver involving at least two directions
  • H03M13/2725—Turbo interleaver for 3rd generation partnership project 2 [3GPP2] mobile telecommunication systems, e.g. as defined in the 3GPP2 technical specifications C.S0002
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
  • H03M13/2957—Turbo codes and decoding
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/63—Joint error correction and other techniques
  • H03M13/635—Error control coding in combination with rate matching
  • H03M13/6362—Error control coding in combination with rate matching by puncturing
  • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
  • H03M13/6381—Rate compatible punctured turbo [RCPT] codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0056—Systems characterized by the type of code used
  • H04L1/0064—Concatenated codes
  • H04L1/0066—Parallel concatenated codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
  • H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/63—Joint error correction and other techniques
  • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
  • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
  • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
  • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
  • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy

Definitions

• This invention generally relates to wireless communications and, more specifically, to channel interleaving for communication systems providing broadcast/multicast services.
• the field of wireless communications has many applications including, e.g., cordless telephones, paging, wireless local loops, personal digital assistants (PDAs), Internet telephony, and satellite communication systems.
• a particularly important application is cellular telephone systems for mobile subscribers.
• the term "cellular" system encompasses both cellular and personal communications services (PCS) frequencies.
• PCS personal communications services
• Various over-the-air interfaces have been developed for such cellular telephone systems including, e.g., Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiplexing (OFDM) modulation, Time Division Multiple Access (TDMA), and Code Division Multiple Access (CDMA).
• FDMA Frequency Division Multiple Access
• OFDM Orthogonal Frequency Division Multiplexing
• TDMA Time Division Multiple Access
• CDMA Code Division Multiple Access
• IS-95 Advanced Mobile Phone Service
• GSM Global System for Mobile
• IS-95A IS-95A
• IS-95B IS-95B
• ANSI J-STD-008 IS-95A
• TIA Telecommunication Industry Association
• ITU International Telecommunications Union
• Cellular telephone systems configured in accordance with the use of the IS-95 standard employ CDMA signal processing techniques to provide highly efficient and robust cellular telephone service.
• Exemplary cellular telephone systems configured substantially in accordance with the use of the IS-95 standard are described in U.S. Patent Nos. 5,103,459 and 4,901,307.
• An exemplary system utilizing CDMA techniques is the cdma2000.
• the standard for cdma2000 is given in Standard IS-2000, which is compatible with IS-95 systems in many ways.
• Another CDMA standard is the WCDMA standard, as embodied in 3 rd Generation Partnership Project "3GPP", Document Nos. 3G TS 25.211, 3G TS 25.212, 3G TS 25.213, and 3G TS 25.214.
• Another CDMA standard is Standard IS-856, which is commonly referred to as a High Data Rate (HDR) system.
• HDR High Data Rate
• the apparatus comprises means for demultiplexing the plurality of systematic bits and parity bits into a plurality of sequences, wherein the plurality of systematic bits and parity bits are sequentially distributed among the sequences; means for reordering the sequences based on an index set; means for grouping the sequences into a plurality of segments and for interleaving each of the segments forming a plurality of matrices having a plurality of elements; means for modulating the elements of the matrices; and means for truncating the modulated elements of each matrix, wherein the output sequence comprises truncated modulating elements from each matrix of the plurality of matrices.
• the demultiplexing occurs by storing the systematic bits and the parity bits into a plurality of rectangular arrays of R rows and C columns forming a first input block U, a second input block Wo, and a third input block Wi, wherein the first input block U comprises the systematic bits, the second input block W 0 is formed by concatenating a first set of the parity bits, and the third input block W 1 is formed by concatenating a second set of the parity bits.
• the systematic bits and the parity bits are written into the arrays of the input blocks U, Wo, and W 1 by rows, and the bits are placed starting from the top row and are placed from left to right.
• the index set may be sorted in an ascending order.
• the reordering may occur by defining the index set as having a plurality of sets; sorting a plurality of elements of each of the sets; and reordering the plurality of sequences in accordance with the rate sets.
• the interleaving may occur by grouping the reordered sequences into segments; and performing matrix interleaving on each of the segments.
• the modulation scheme for the modulating means may be 16-QAM.
• the truncating means may further comprise means for repeating the modulating elements.
• the parameters for the index set may be stored in a look-up table.
• a method for interleaving a plurality of systematic bits and a plurality of parity bits and for generating an output sequence that can be transmitted in multi-slot packets from a base station to a remote station in a wireless communication system is disclosed.
• the method comprises demultiplexing the plurality of systematic bits and parity bits into a plurality of sequences, wherein the systematic bits and parity bits are sequentially distributed among the sequences; reordering the sequences based on an index set; grouping the sequences into a plurality of segments and interleaving each of the segments forming a plurality of matrices having a plurality of elements; modulating the elements of the matrices; and truncating the modulated elements of each matrix, wherein the output sequence comprises truncated modulating elements from each matrix of the plurality of matrices.
• the truncating may be performed in accordance with a desired code symbol rate.
• modulating and truncating may be interchanged without affecting the output sequence of the invention.
• an apparatus for interleaving a plurality of systematic bits and a plurality of parity bits and to generate an output sequence that can be transmitted in multi-slot packets from a base station to a remote station in a wireless communication system is presented.
• This apparatus comprises means for demultiplexing the plurality of systematic bits and parity bits into a plurality of sequences, wherein the plurality of systematic bits and parity bits are sequentially distributed among the sequences; means for reordering the sequences; means for forming a plurality of matrices from the reordered sequences, wherein the forming means is based on an index set; means for permuting the matrices forming a juxtaposed matrix having a plurality of segments, a plurality of columns, and a plurality of elements; means for interleaving the columns; means for modulating the elements in the segments; and means for truncating the modulated elements in the segments of the juxtaposed matrix, wherein the output sequence comprises truncated modulating elements from the segments of the juxtaposed matrix.
• the demultiplexing occurs by storing the systematic bits and the parity bits into a plurality of rectangular arrays of R rows and C columns forming a first input block U, a second input block Wo, and a third input block W 1 , wherein the first input block U comprises of the systematic bits, the second input block Wo is formed by concatenating a first set of the parity bits, and the third input block W 1 is formed by concatenating a second set of the parity bits.
• the systematic bits and the parity bits are written into the arrays of the input blocks U, W 0 , and W 1 by rows, and the bits are placed starting from the top row and are placed from left to right.
• the index set may be sorted in an ascending order.
• the reordering may occur by end-around shifting downward each element in each column of each block; and switching the order of the columns within each block. More specifically, within the first input block U, the symbols in the i-th column may be cyclically shifted by an amount (i mod R); and within the input blocks Wo and W 1 , the symbols in the z-th column may be cyclically shifted by an amount (floor(iYD)mod R), where D is a predetermined parameter based on a rate set and R denotes the number of rows of the rectangular arrays forming the input blocks.
• the forming may occur by defining the index set as having a plurality of sets having parameters that can be specified in a look-up table.
• the permuting may occur by arranging the columns of the matrices in a predetermined way and dividing the juxtaposed matrix into a plurality of segments having a predetermined number of columns.
• the modulation scheme for the modulating means may be 16-QAM.
• the truncating means may further comprise means for repeating the modulating elements. It is further appreciated that the parameters for the index set may be stored in a look-up table.
• Another method for interleaving a plurality of systematic bits and a plurality of parity bits and to generate an output sequence that can be transmitted in multi-slot packets from a base station to a remote station in a wireless communication system comprising demultiplexing the plurality of systematic bits and parity bits into a plurality of sequences, wherein the plurality of systematic bits and parity bits are sequentially distributed among the plurality of sequences; reordering the sequences; forming a plurality of matrices from the reordered sequences, wherein the forming is done based on an index set; permuting the matrices forming a juxtaposed matrix having a plurality of segments, a plurality of columns, and a plurality of elements; interleaving the columns; modulating the elements in the plurality of segments; and truncating the modulated elements in the segments of the juxtaposed matrix, wherein the output sequence comprises truncated modulating elements from the segments of the
• FIG. 1 is a block diagram of an exemplary voice and data communication system
• FIG. 2 is a block diagram of a turbo encoder
• FIG. 3 is a block diagram of an apparatus that uses a turbo encoder to generate forward traffic channels;
• FIG. 4 is a flow chart of an embodiment that reorders the output of a turbo encoder;
• FIG. 5 is a flow chart of another embodiment that reorders the output of a turbo encoder; and
• FIG. 6 is a diagram of a signal constellation for the 16-QAM modulation scheme.
• a wireless communication network 10 which includes a plurality of mobile stations (also called subscriber units or user equipment) 12a-12d, a plurality of base stations (also called base station transceivers (BTSs) or Node B) 14a-14c, a base station controller (BSC) (also called radio network controller or packet control function) 16, a mobile switching center (MSC) or switch 18, a packet data serving node (PDSN) 20 (or internetworking function (IWF)), a public switched telephone network (PSTN) 22 (typically a telephone company), and an Internet Protocol (IP) network 24 (typically the Internet).
• BSC base station controller
• IWF internetworking function
• PSTN public switched telephone network
• IP Internet Protocol
• the wireless communication network 10 is a packet data services network.
• the mobile stations 12a-12d may be any of a number of different types of wireless communication devices such as a portable phone, a cellular telephone that is connected to a laptop computer running IP-based, Web-browser applications, a cellular telephone with associated hands-free car kits, a personal data assistant (PDA) running IP-based, Web-browser applications, a wireless communication module incorporated into a portable computer, or a fixed location communication module such as might be found in a wireless local loop or meter reading system.
• the mobile stations may be any type of communication unit.
• the mobile stations 12a-12d may be configured to perform one or more wireless packet data protocols such as described in, for example, the EIA/TIA/IS-707 standard.
• the mobile stations 12a-12d generate IP packets destined for the IP network 24 and encapsulate the IP packets into frames using a point-to-point protocol (PPP).
• PPP point-to-point protocol
• the IP network 24 is coupled to the PDSN 20, the PDSN
• the BSC 16 is coupled to the base stations 14a-14c via wirelines configured for transmission of voice and/or data packets in accordance with any of several known protocols including but not limited to, e.g., El, Tl, Asynchronous Transfer Mode (ATM), IP, Frame Relay, HDSL, ADSL, or xDSL.
• the BSC 16 is coupled directly to the PDSN 20, and the MSC 18 is not coupled to the PDSN 20.
• the mobile stations 12a-12d communicate with the base stations 14a-14c over an RF interface as defined in the 3 rd Generation Partnership Project 2 "3GPP2," "Physical Layer Standard for cdma2000 Spread Spectrum Systems," 3GPP2 Document No. C.S0002-A, TIA PN-4694, published as TIA/EIA/IS-2000-2-A.
• the base stations 14a-14c receive and demodulate sets of reverse-link signals from various mobile stations 12a-12d engaged in telephone calls, Web browsing, or other data communications. Each reverse-link signal received by a given base station 14a- 14c is processed within that base station 14a-14c. Each base station 14a-14c may communicate with a plurality of mobile stations 12a-12d by modulating and transmitting sets of forward-link signals to the mobile stations 12a-12d. For example, as shown in FIG. 1, the base station 14a communicates with first and second mobile stations 12a, 12b simultaneously, and the base station 14c communicates with third and fourth mobile stations 12c, 12d simultaneously.
• the resulting packets are forwarded to the BSC 16, which provides call resource allocation and mobility management functionality including the orchestration of soft handoffs of a call for a particular mobile station 12a- 12d from one base station 14a-14c to another base station 14a-14c.
• a mobile station 12c is communicating with two base stations 14b, 14c simultaneously. Eventually, when the mobile station 12c moves far enough away from one of the base stations 14c, the call will be handed off to the other base station 14b.
• the BSC 16 will route the received data to the MSC 18, which provides additional routing services for interface with the PSTN 22. If the transmission is a packet-based transmission such as a data call destined for the IP network 24, the MSC 18 will route the data packets to the PDSN 20, which will send the packets to the IP network 24. Alternatively, the BSC 16 will route the packets directly to the PDSN 20, which sends the packets to the IP network 24. [0026] In some exemplary CDMA systems, packets carrying data traffic are divided into subpackets, which occupy "slots" of a transmission channel.
• HDR High Data Rate
• a High Data Rate (HDR) system is used herein and, more specifically, an HDR system providing broadcast/multicast services. It should be appreciated, however, that implementation of the invention is not limited to HDR systems. That is, embodiments of the invention may be implemented in other CDMA systems, such as, e.g., cdma2000, without affecting the scope of the embodiments described herein.
• slot sizes have been designated as 1.66 ms, but it should be understood that slot sizes may vary in the embodiments described herein without affecting the scope of the embodiments.
• the slot size in cdma2000 systems is 1.25 ms in duration.
• data traffic may be transmitted in message frames, which may be 5 ms, 10 ms, 20 ms, 40 ms or 80 ms in duration in IS-95 systems.
• the terms "slots" and "frames" are terms used with respect to different data channels within the same or between different CDMA systems.
• a CDMA system comprises a multitude of channels on the forward and reverse links, wherein some channels are structured differently from others. Hence, the terminology to describe some channels will differ in accordance with channel structure.
• the term "slots" will be used hereafter to describe the packaging of signals propagated over the air.
• Redundant representations of the data payload are packed into frames, or subpackets, which can then be soft-combined at the receiver. Redundancy refers to the substantially similar information carried by each subpacket. Redundant representations may be generated either through repetition or through additional coding.
• the process of soft-combining allows the recovery of corrupted bits. Through the process of soft combining, wherein one corrupted subpacket is combined with another corrupted subpacket, the transmission of repetitious and redundant subpackets can allow a system to transmit data at a minimum transmission rate. The transmission of repetitious and redundant subpackets is especially desirable in the presence of fading.
• Rayleigh fading which is a form of multipath interference, occurs when multiple copies of the same signal arrive at the receiver at different phases, potentially causing destructive interference.
• Substantial multipath interference with very small delay spread can occur to produce flat fading over the entire signal bandwidth. If the remote station is traveling in a rapidly changing environment, deep fades could occur at times when subpackets are scheduled for retransmission. When such a circumstance occurs, the base station requires additional transmission power to transmit the subpacket.
• a scheduler unit within a base station receives a data packet for transmission to a remote station, the data payload is redundantly packed into a plurality of subpackets, which are sequentially transmitted to a remote station.
• the scheduler unit may decide to transmit the subpackets either periodically or in a channel sensitive manner.
• the forward link from the base station to a remote station operating within the range of the base station can comprise a plurality of channels.
• Some of the channels of the forward link may include, but are not limited to a pilot channel, synchronization channel, paging channel, quick paging channel, broadcast channel, power control channel, assignment channel, control channel, dedicated control channel, medium access control (MAC) channel, fundamental channel, supplemental channel, supplemental code channel, and packet data channel.
• the reverse link from a remote station to a base station also comprises a plurality of channels. Each channel carries different types of information to the target destination. Typically, voice traffic is carried on fundamental channels, and data traffic is carried on supplemental channels or packet data channels.
• Supplemental channels are usually dedicated channels, while packet data channels usually carry signals that are designated for different parties in a time- multiplexed manner.
• packet data channels are also described as shared supplemental channels.
• the supplemental channels and the packet data channels are generically referred to as data traffic channels.
• Supplemental channels and packet data channels can improve the average transmission rate of the system by allowing the transmission of unexpected data messages to a target station. Since the data payload can be redundantly packed on these channels, a multi-slot transmission scheduled on the forward link can be terminated early if the remote station can determine that the data payload is recoverable from the subpackets that have already been received. As described above, the data payload that is carried in each slot has undergone various encoding steps wherein the encoded bits are re-ordered into a channel-tolerant format. Hence, in order to accomplish data recovery, the decoder of the remote station must operate on the entire contents of each slot of the multi-slot transmission. [0032] The embodiments described herein allow a minimum transmission rate to be maintained. Determining Data Transmission Rates on the Forward Link
• the rates at which the subpackets are to be transmitted from a base station to a remote station are determined by a rate control algorithm performed by the remote station and a scheduling algorithm at the base station.
• This method to modify the data transmission rate is referred to as an ARQ procedure.
• the system throughput is determined by the rate at which data payload is actually received, which differs from the bit rate of the transmitted subpackets.
• the rate control algorithm is implemented by the remote station in order to determine which base station in the active set can provide the best throughput and to determine the maximum data rate at which the remote station can receive packets with sufficient reliability.
• the active set is the set of base stations that are currently in communication with the remote station.
• a base station transmits a known signal, referred to as a "pilot," at well-defined, periodic intervals.
• the remote station typically monitors the pilot signal of each base station maintained in the active set, and determines the signal-to-noise and interference ratio (SINR) of each pilot signal.
• SINR signal-to-noise and interference ratio
• the remote station Based on past SINR information, the remote station predicts a future value of the SDSfR for each base station, wherein the future value of the SINR will be associated with the next packet duration.
• the remote station picks the base station that is likely to have the most favorable SINR over a period of the near future, and estimates the best data rate at which the remote station can receive the next data packet from this base station.
• the remote station transmits a data rate control message (DRC) carrying this data rate information to the base station. It is understood that the best data rate information carried by the DRC is the data rate at which the remote station requests the next data packet to be transmitted.
• the DRC messages are transmitted on a MAC channel of the reverse link waveform.
• the scheduling algorithm is implemented at the base station to determine which remote station will be the recipient of the next packet.
• the scheduling algorithm takes into account the need to maximize base station throughput, the need to maintain fairness between all remote stations operating within the range of the base station, and the need to accommodate the data transmission rates requested by various remote stations.
• the fast ARQ procedure determines the actual data transmission rate at which each data packet is received, as opposed to the data transmission rate initially determined by the rate control algorithm.
• a scheduling unit in the base station monitors the arrival of DRCs from all remote stations that are operating within its range, and uses the DRC information in the scheduling algorithm to determine which remote station will be the next data packet recipient, in accordance with an optimal forward link throughput level. It should be noted that an optimal forward link throughput takes into consideration the maintenance of acceptable link performances for all remote stations operating within the range of the base station.
• the scheduling unit reassembles the data packet into subpackets with the appropriate bit rate, and generates a transmission schedule for the subpackets on designated slots.
• the forward link data rates vary from 409.6 kbps to 2.4 Mbps.
• the duration of each packet transmission in number of slots as well as other modulation parameters are shown in Table 1.
• code symbols that are transmitted in subpackets at lower data rates are code-extensions or repetitions of the code symbols that are transmitted at certain higher rates.
• the code symbols transmitted in a given subpacket are shifted repetitions of the code symbols transmitted in the earlier slots of the packet.
• the lower data rates require a lower SINE, for a given low probability of packet error.
• the remote station determines that channel conditions are not favorable, then the remote station will transmit a DRC message requesting a low data rate packet, which comprises multiple subpackets.
• the base station will then transmit multi-slot packets in accordance with parameters stored in the scheduling unit.
• the remote station may determine that the data packet can be decoded from only a portion of the subpackets scheduled for transmission. Using the fast ARQ procedure, the remote station instructs the base station to stop the transmission of the remaining subpackets, thereby increasing the effective data transmission rate of the system.
• the ARQ procedure has the potential to significantly increase the forward link throughput of the underlying wireless communication system.
• the requested data transmission rate is determined using the rate control algorithm, which uses past SINR values to predict the SINR value of the near future.
• the rate control algorithm uses past SINR values to predict the SINR value of the near future.
• the SINR of the forward link traffic signal may be very different from the SINR of the pilot signal due to interference from adjacent base stations. It is possible that some of the neighboring base stations may have been idle during the sampling period for the SINR prediction calculations.
• the rate control algorithm provides a lower bound estimate for the actual SBSfR during the next packet duration with high probability, and determines the maximum data transmission rate that can be sustained if the actual SBSfR is equal to this lower bound estimate.
• the rate control algorithm provides a conservative measure of the data transmission rate at which the next packet can be received.
• the ARQ procedure refines this estimate, based on the quality of the data received during the initial stages of the packet transmission. Hence, it is important for the remote station to inform the base station as soon as the remote station has enough information to decode a data packet, so that early termination of transmissions can occur, which enhances the data transmission rate of the data packet.
• Transmissions of the subpackets to the remote station are typically sent in a staggered pattern so that transmission gaps occur between the subpackets.
• the subpackets are transmitted periodically at every 4 th slot. The delay between subpackets provides an opportunity for the target remote station to decode the subpacket before the arrival of the next subpacket. If the remote station is able to decode the subpacket before the arrival of the next subpacket and to verify the Cyclic Redundancy Check (CRC) bits of the decoded result before the arrival of the next subpacket, the remote station can transmit an acknowledgment signal, hereinafter referred to as a FAST-ACK signal, to the base station.
• CRC Cyclic Redundancy Check
• the base station can demodulate and interpret the FAST_ACK signal sufficiently in advance of the next scheduled subpacket transmission, the base station need not send the remaining scheduled subpacket transmissions. The base station may then transmit a new data packet to the same remote station or to another remote station during the slot period that had been designated for the cancelled subpackets.
• the FAST_ACK signal herein described is separate and distinct from the ACK messages that are exchanged between the higher layer protocols, such as the Radio Link Protocol (RLP) and the Transmission Control Protocol (TCP).
• RLP Radio Link Protocol
• TCP Transmission Control Protocol
• ARQ procedure allows for the implementation of a system wherein the initial data transmission can be performed at a high data rate and ramped down as needed.
• a system without ARQ would be forced to operate at a lower data rate, in order to provide a sufficient link budget margin to account for channel variations during packet transmissions.
• the subpackets can be transmitted in a manner that allows the decoder to determine the payload of the partial slot transmissions quickly, while still providing protection from burst errors.
• a channel interleaver may be configured in accordance with this aspect to permute the bits of an encoded symbol and provide incremental redundancy.
• a permutation of the bits is designed so that the systematic bits are sent during a partial transmission of the multi-slot packet.
• the decoder may be able to determine the data payload from the arrival of only a portion of the subpackets. If the payload cannot be decoded, then the remote station transmits a negative acknowledgment on the ARQ channel. The base station receives the NAK and transmits a subsequent subpacket, containing additional parity bits. If the remote station cannot decode the subpackets with the already received systematic bits and the newly received parity bits, then another NAK is transmitted. The base station receives the second NAK and transmits another subpacket, which includes additional parity bits. As further NAKs are received during the ARQ procedure, subsequent subpackets transmitted by the base station contain more parity bits.
• the channel interleaver permutes the systematic bits and the parity bits in a manner such that the systematic bits are loaded at the front of a packet and the parity bits are loaded at the rear of the packet.
• the packet is divided up into portions, and each portion is transmitted sequentially, as needed by the remote station. Hence, if additional information is needed to decode the data payload, only the additional parity bits are transmitted, rather than retransmitting the entire encoder output.
• This process of loading systematic bits at the beginning of the scheduled packet transmission may appear to defeat the purpose of a channel interleaver, but the embodiments described herein can be implemented to provide resilience to burst errors while still allowing the decoder to operate on only a partial transmission of the packet.
• the output of the turbo encoder is scrambled either before or after channel interleaving so that data is randomized prior to modulation. The random scrambling of the turbo encoder output limits the peak-to-average ratio of the envelope of the modulated waveform.
• Turbo encoder 200 comprises a first constituent encoder 210, a turbo interleaver 220, a second constituent encoder 230, and a symbol generation element 240.
• the first constituent encoder 210 and the second constituent encoder 230 are connected in parallel, with the turbo interleaver 220 preceding the second constituent encoder 230.
• the output of the first constituent encoder 210 and the output of the second constituent encoder 230 are input into the symbol generation element 240, wherein the outputs are punctured and repeated in order to form the desired number of turbo encoder output symbols.
• the first and second constituent encoders 210, 230 are recursive, convolutional encoders, each configured in accordance with the transfer function:
• G(D) [1, n o (D)/d(D), ni (D)/d(D)],
• the turbo encoder 200 uses the first and second constituent encoders 210, 230 to generate a plurality of encoded data output symbols and a plurality of encoded tail output symbols, wherein the plurality of encoded data output symbols are subsequently punctured by the symbol generation element 240 and the plurality of encoded tail output symbols are subsequently both punctured and repeated by the symbol generation element 240 as further describes in U.S. Appl. Ser. No. 09/863,196, entitled "Enhanced Channel Interleaving for Optimized Data Throughput," which is assigned to the assignee of the present invention.
• FIG. 3 is a block diagram of an apparatus that uses a turbo encoder to generate forward traffic channels.
• Data packets are input into a turbo encoder 300.
• Turbo encoder 300 may be configured in the manner described in FIG. 2, but alternative configurations may be implemented without affecting the scope of the embodiments.
• a scrambler 310 is used to randomize the output of the turbo encoder 300.
• LFSR linear feedback shift register
• the scrambler 310 may be initialized by information such as the MAC index value and/or the data rate, and is clocked once for every encoder output symbol.
• the output of the scrambler 310 is interleaved by a channel interleaver 320.
• the interleaving is implemented in accordance with the embodiments of the invention as further described below.
• channel interleaver 320 may be used to realize the embodiments described below.
• a channel interleaving element may be produced using at least one memory element and a processor.
• a look-up table of READ addresses or WRITE addresses may be used to permute an array of input symbols to generate an array of interleaved symbols.
• a state machine may be used to generate a sequence of addresses defining the permutation of input symbols.
• Other implementations are known to those of skill in the art, and will not be described herein. The choice of implementation will not affect the scope of the embodiments below.
• the channel interleaver 320 of the invention is capable of operating in HDR systems providing Platinum Broadcast over IxEV-DO. With Platinum Broadcast, a channel interleaver needs to satisfy the following requirements:
• Modulation-friendly sequence repetition The modulation and sequence repetition steps may be interchanged without affecting the final transmit waveform. This property simplifies the demodulation procedure when sequence repetition is involved.
• the output of a turbo encoder may be scrambled and demultiplexed into five subsequences denoted as S, Po, P 0 ', Pi, and P 1 '.
• the S sequence refers to the systematic bits of the turbo encoder.
• the P 0 and Po' sequences refer to the first parity sequences (rate 1/3) from the two constituent encoders of the turbo encoder, and the P 1 and P 1 ' sequences refer to the second parity sequences (rate 1/5) from the two constituent encoders of the turbo encoder.
• P 1 and P 1 ' denote empty sequences.
• the rate sets 1- 5 in Platinum Broadcast are shown in Table 1.
• Each of the five sequences S, Po, Po', Pi and P 1 ' has a length of N symbols.
• a block or sequence U is set equal to S
• a block or sequence Wo is formed by concatenating P 0 and Po'
• a block or sequence W 1 is formed by concatenating P 1 and P 1 '.
• P 1 and P 1 ' and hence block Wi may contain empty sequences.
• the turbo encoder of the invention operating at rate 1/3
• the demultiplexing can be completed using three sequences denoted S, P 0 , and PO.
• the rearrangement or reorganization of the order of Po and P' o results in an equivalent interleaver from the viewpoint of error performance, since the requirement that the first and last sequences remain at the first position and last position has not been violated.
• the channel interleaver will be configured to permute code symbols in three separate interleaver blocks or sequences with the first block or sequence U comprising the sequence of S symbols, the second block or sequence Wo comprising the sequence of Po and PO symbols, and the third block or sequence W 1 comprising the sequence of P 1 and P' ! symbols.
• the channel interleaver will be configured to permute code symbols in two separate blocks or sequences, with the first block or sequence U comprising the sequence of S sequences and the second block or sequence Wo comprising the sequence of Po and PO symbols.
• the above embodiment may still be implemented upon a block or sequence of scrambled S symbols, a block or sequence of scrambled P 0 and PO symbols, and a block or sequence of the scrambled P 1 and P'] symbols.
• FIG. 4 illustrates a flow chart for a series of permutation steps in accordance with the above aspect of the invention.
• sequences S, P 0 , P 0 ', P 1 , and P 1 ' are written into rectangular arrays of R rows and C columns to form a first input block or sequence U, a second input block or sequence Wo is formed by concatenating Po and Po', and a third input block or sequence W 1 is formed by concatenating P 1 and P 1 '.
• the symbols are written into the blocks or sequences by rows, wherein symbols are placed starting from the top row and are placed from left to right.
• the code-symbol sequences are reordered in accordance with the following:
• M is defined as the number of code symbols that can be transmitted in one slot
• N is defined as the length of each of the five sequences S, Po, Po', Pi, and P 1 '.
• a look-up table may be used based on empirical data or other data to determine the values for M 1 , M 2 , and M 3 to generate the index sets and the code- symbol sequences. That is, M 1 , M 2 , and M 3 may be arbitrary values specified by a lookup table.
• index sets .S 1 -S 5 as follows:
• S 1 ⁇ round(i*(2N/M ⁇ )
• S 2 ⁇ round(i* (2NJM 2 )
• 5 3 ⁇ 1 0 ⁇ i ⁇ 22V ⁇ — Si - S 2 ,
• the code-symbol sequences are reordered as: U, W 0 (S 1 ), W 0 (S 2 ), W 0 (S 3 ), W 1 (S 4 ), W 1 (S 5 ).
• the code-symbol sequences are reordered as: U, Wo(S 1 ), W 0 (S 2 ), W 0 (S 3 ).
• the reordered code-symbol sequences from the symbol reordering stage are grouped into several segments of length M each and then each segment is subject to matrix interleaving in accordance with the method described below.
• the interleaver output sequence for the turbo encoder will be the interleaved U symbols followed by the interleaved Wo(S 1 )AVo(S 2 )AVo(S 3 ) symbols.
• the interleaver output sequence for the turbo encoder will be the interleaved U symbols followed by the interleaved Wo(S 1 )AVo(S 2 )AVo(S 3 ) symbols and then the interleaved W 1 (S 4 )AV 1 (S 5 ) symbols.
• the interleaver output sequence for the turbo encoder will be the interleaved U symbols followed by the interleaved Wo(S 1 )AVo(S 2 )AVo(S 3 ) symbols and then the interleaved W 1 (S 4 )AV 1 (S 5 ) symbols.
• a 16-ary Quadrature Amplitude Modulation is used to modulate the reordered and interleaved symbols from the matrix interleaving stage.
• FIG. 6 illustrates a signal constellation for the 16-QAM modulation scheme.
• step 408 if the number of required modulation symbols is more than the number provided in the above embodiments, then the complete sequence of input modulation symbols can be repeated as many full-sequence times as possible followed by a partial transmission of a sequence. If a partial transmission is needed, then the first portion of the input modulation symbol sequence may be used. Similarly, if the number of required modulation symbols is less than the number provided, then only the first portion of the input modulation symbol sequence is used and the rest is truncated.
• the modulation step 406 and the sequence repetition/truncation step 408 may be interchanged without affecting the final outcome of the interleaver.
• the output of a turbo encoder may be scrambled and demultiplexed into five subsequences denoted as S, Po, Po', P 1 , and P 1 '.
• the S sequence refers to the systematic bits of the turbo encoder.
• the P 0 and P 0 ' sequences refer to the first parity sequences (rate 1/3) from the two constituent encoders of the turbo encoder, and the P 1 and P 1 ' sequences refer to the second parity sequences (rate 1/5) from the two constituent encoders of the turbo encoder.
• P 1 and P 1 ' denote empty sequences.
• Each of the five sequences S, P 0 , Po', Pi and P 1 ' has a length of N symbols.
• FIG. 5 illustrates a flow chart for a series of permutation steps in accordance with this aspect of the invention.
• the sequences S, Po, Po', Pi, and P 1 ' are written into rectangular arrays of R rows and C columns to form a first input block or matrix U, a second input block or matrix Wo is formed by concatenating Po and P 0 ', and a third input block or matrix W 1 is formed by concatenating P 1 and P 1 '.
• the symbols are written into the blocks or matrices by rows, wherein symbols are placed starting from the top row and are placed from left to right.
• step 500 the S sequence is written row-wise into a matrix
• the symbols are read into each matrix, with column index incrementing first, followed by row index.
• symbols in the i-th column of the W matrix are cyclically shifted by an amount (i mod R). This is referred to as the end-around-shift operation.
• the symbols in the i-th column are end-around shifted by an amount (floor(?/Z)jmod R), where the parameter D is specified in Table 3.
• the columns of matrix Wo are partitioned into sets S 1 , S 2 and S 3 as follows:
• the index sets Si, S 2 and S 3 are defined as follows:
• index sets Si, S 2 , ..., S 5 the elements are then sorted in increasing order to produce a reordered group of elements.
• the matrices W, Wo and W 1 are then juxtaposed, with the columns arranged as follows:
• the juxtaposed matrix is then segmented into four parts based on their column index L ⁇ , L 2 , and L 3 .
• the first, second and third segments comprise of Lu La and hi columns, respectively, and the fourth segment comprises of the remaining columns of the juxtaposed matrix.
• a 16-QAM is used to modulate the interleaved symbols.
• 16-QAM is discussed above with other aspects of the invention.
• step 512 if the number of required modulation symbols is more than the number provided in the above embodiments, then the complete sequence of input modulation symbols can be repeated as many full- sequence times as possible followed by a partial transmission of a sequence. If a partial transmission is needed, then the first portion of the input modulation symbol sequence can be used. If the number of required modulation symbols is less than the number provided, then only the first portion of the input modulation symbol sequence is used and the rest is truncated.
• the modulation step 510 and the sequence repetition/truncation step 512 may be interchanged without affecting the final outcome of the interleaver.
• higher rate codes such as those used for broadcast/multicast services may be generated simply by discarding or truncating the last few outputs of the interleaver.
• This procedure provides results that approximate optimal or near optimal turbo codes operating at rates such as 4/5, 2/3, 1/2, 1/3, 1/4, and 1/5, with the appropriate puncture patterns, and other rates designed to operate in systems providing Platinum Broadcast over IxEV-DO.
• DSP digital signal processor
• ASIC application specific integrated circuit
• FPGA field programmable gate array
• a general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
• a processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
• the steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two.
• a software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
• An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium.
• the storage medium may be integral to the processor.
• the processor and the storage medium may reside in an ASIC.
• the ASIC may reside in a user terminal.
• the processor and the storage medium may reside as discrete components in a user terminal.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Probability & Statistics with Applications (AREA)
• Theoretical Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Multimedia (AREA)
• Computer Security & Cryptography (AREA)
• Error Detection And Correction (AREA)
• Mobile Radio Communication Systems (AREA)
• Detection And Prevention Of Errors In Transmission (AREA)
• Time-Division Multiplex Systems (AREA)

Priority Applications (1)

Applications Claiming Priority (3)

Publications (2)

Family

ID=37431835

Family Applications (2)

Family Applications After (1)

Country Status (14)

Families Citing this family (13)

Citations (2)

Family Cites Families (8)

• 2006
  • 2006-05-09 AU AU2006247818A patent/AU2006247818A1/en not_active Abandoned
  • 2006-05-09 KR KR1020077029078A patent/KR101022930B1/ko not_active IP Right Cessation
  • 2006-05-09 JP JP2008511294A patent/JP4903790B2/ja not_active Expired - Fee Related
  • 2006-05-09 NZ NZ563210A patent/NZ563210A/en unknown
  • 2006-05-09 RU RU2007146139/09A patent/RU2365035C1/ru not_active IP Right Cessation
  • 2006-05-09 CN CN2006800161204A patent/CN101322317B/zh not_active Expired - Fee Related
  • 2006-05-09 KR KR1020107020770A patent/KR101100483B1/ko not_active IP Right Cessation
  • 2006-05-09 BR BRPI0611236-6A patent/BRPI0611236A2/pt not_active Application Discontinuation
  • 2006-05-09 WO PCT/US2006/017993 patent/WO2006124428A2/en active Search and Examination
  • 2006-05-09 CA CA2609794A patent/CA2609794C/en not_active Expired - Fee Related
  • 2006-05-09 EP EP06752461A patent/EP1900104A4/de not_active Ceased
  • 2006-05-09 NZ NZ584316A patent/NZ584316A/en unknown
  • 2006-05-09 MX MX2007014157A patent/MX2007014157A/es active IP Right Grant
  • 2006-05-09 EP EP10159363A patent/EP2214317A1/de not_active Withdrawn
  • 2006-05-11 MY MYPI20062202A patent/MY144793A/en unknown
• 2007
  • 2007-11-04 IL IL187137A patent/IL187137A0/en unknown
  • 2007-12-11 NO NO20076385A patent/NO20076385L/no not_active Application Discontinuation

Patent Citations (2)

Non-Patent Citations (5)

Also Published As

Similar Documents

Legal Events