WO2000048353A1 - Optimized rate-compatible turbo encoding - Google Patents

Optimized rate-compatible turbo encoding Download PDF

Info

Publication number
WO2000048353A1
WO2000048353A1 PCT/US1999/002995 US9902995W WO0048353A1 WO 2000048353 A1 WO2000048353 A1 WO 2000048353A1 US 9902995 W US9902995 W US 9902995W WO 0048353 A1 WO0048353 A1 WO 0048353A1
Authority
WO
WIPO (PCT)
Prior art keywords
rate
code
puncturing
encoder
turbo
Prior art date
Application number
PCT/US1999/002995
Other languages
French (fr)
Inventor
A. Roger Hammons, Jr.
Mustafa Eroz
Original Assignee
Hughes Electronics Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hughes Electronics Corporation filed Critical Hughes Electronics Corporation
Priority to EP99906939A priority Critical patent/EP1072122A1/en
Priority to AU26732/99A priority patent/AU2673299A/en
Priority to KR1020007011264A priority patent/KR100347501B1/en
Priority to PCT/US1999/002995 priority patent/WO2000048353A1/en
Publication of WO2000048353A1 publication Critical patent/WO2000048353A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • 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/0056Systems characterized by the type of code used
    • H04L1/0064Concatenated codes
    • H04L1/0066Parallel concatenated codes
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/29Coding, 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/2957Turbo codes and decoding
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/63Joint error correction and other techniques
    • H03M13/635Error control coding in combination with rate matching
    • H03M13/6362Error control coding in combination with rate matching by puncturing
    • H03M13/6368Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6381Rate compatible punctured turbo [RCPT] codes
    • 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
    • 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/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • H04L1/0068Rate matching by puncturing
    • H04L1/0069Puncturing patterns
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/35Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/63Joint error correction and other techniques
    • H03M13/6306Error 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy

Definitions

  • the present invention relates to error correction in data communications, and more particularly, to forward error correction (FEC) . Even more particularly, the present invention relates to the selection and use of optimal Turbo Codes in high performance data communication systems, such as emerging third generation terrestrial cellular mobile radio and satellite telephone systems, for which flexibility in supporting a wide range of system requirements with respect to transmission data rates, channel coding rates, quality of service measures (e.g., latency, bit-error rate, frame error rate), and implementation complexity is highly desirable.
  • FEC forward error correction
  • FEC Forward error correction
  • RF propagation channel which induces signal waveform and spectrum distortions, including signal attenuation (freespace propagation loss) and multi-path mduced fading.
  • These impairments drive the design of the radio transmission and receiver equipment, the design ob]ect ⁇ ve which is to select modulation formats, error control schemes, demodulation and decoding techniques and hardware components that together provide an efficient balance between system performance and implementation complexity.
  • Differences in propagation channel characteristics, such as between terrestrial and satellite communication channels naturally result in significantly different system designs.
  • existing communication system continue to evolve in order to satisfy increased system requirements for new higher rate or higher fidelity communication services .
  • Analog Mobile Phone System is an exemplary first generation system
  • the U.S. IS-136 and European GSM time-division multiple-access (TDMA) standards and the U.S. IS-95 code-division multiple-access (CDMA) standard are second generation systems
  • the wideband CDMA standards currently under development e.g., CDMA 2000 in the U.S. and UTRA in Europe
  • CDMA 2000 in the U.S. and UTRA in Europe are third generation systems.
  • Desirable features include the ability to perform rate adaptation and to satisfy a multiplicity of quality-of-service (QOS) requirements.
  • QOS quality-of-service
  • FEC forward error correction
  • Turbo Codes are a relatively new class of block codes that have been demonstrated to yield bit error rate (BER) performance close to theoretical limits on important classes of idealized channels by means of an iterative soft-decision decoding method.
  • BER bit error rate
  • a Turbo encoder consists of a parallel concatenation of typically two systematic, recursive convolutional codes ("constituent codes”) separated by an mterleaver that randomizes the order of presentation of information bits to a second constituent encoder with respect to a first constituent encoder.
  • the performance of a Turbo Code depends on the choice of constituent codes, mterleaver, information block size (which generally increases with higher data rates), and number of decoder iterations. For a particular Turbo Code, which the constituent codes are fixed, one can ideally adjust the block size and number of decoder iterations to tradeoff performance, latency and implementation complexity requirements. As the block size changes, however, a new mterleaver matched to that block size is required.
  • forward link channels can be designed to be orthogonal, using, for example, alsh- Hadamand spreading sequences. This is generally not possible, however, for reverse link channels (from user terminal to base station) , which therefore operate asynchronously usmg spreading sequences that are only quasi-orthogonal.
  • the reverse links in a synchronous CDMA network typically experience more interference and therefore may require stronger FEC (via lower rate codes) than the forward link channels do.
  • the forward and reverse link channels are more similar m terms of interference leveis, so it is possible to use a common FEC scheme (or at least more similar FEC schemes) on the two links.
  • the present invention advantageously addresses the above and other needs by providing methods for designing and using universally optimized Turbo Codes and rate-compatible punctur gs to support incremental redundancy schemes sucn as automatic repeat request (ARQ) .
  • the invention can be characterized, m one embodiment as a method of processing data, in data services, with a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code, the Turbo Codes having compatible puncturing patterns.
  • the method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
  • a method of processing data m data services uses a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent co ⁇ e, the Turbo Codes having similar constituent codes and compatible puncturing patterns, and comprises: encoding a signal with a best rate 1/3 constituent code at a first and a second encoder, each encoder producing a respective plurality of parity bits for each data bit; puncturing the plurality of parity bits with the a higher rate best puncturing pattern; and puncturing the plurality of parity bits with a lower rate best puncturing pattern.
  • a method of rate-compatible Turbo encoding uses a set of rate-compatible Turbo Codes, the set optimized for code rate 1/4, comprising Turbo Codes with differing code rates and rate-compatible puncturing patterns.
  • the method comprises: encoding a signal at a first and second encoder using a best rate 1/4 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
  • an encoding system uses a set of rate-compatible Turbo Codes derived from a best universal rate 1/2 constituent code, the set having compatible puncturing patterns, and comprises: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the adders m a configuration corresponding to the best universal rate 1/2 constituent code; and a puncturer configured with the first and second encoder to puncture a plurality of data outputs from each of the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns .
  • an encoding system uses a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent code, the rate compatible Turbo Codes having similar constituent codes and compatible puncturing patterns, and comprises: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders, each of the adders coupled to a selected portion of the adders in a configuration corresponding to the rate 1/3 constituent code of; and a puncturer configured with the first and second encoder such to puncture a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns.
  • Yet another variation of the system uses a set of rate- compatible Turbo Codes comprising Turbo Codes having a universal constituent code and rate-compatible puncturing patterns for different code rates, and comprises: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the plurality of adders in a configuration corresponding to the universal constituent code; and a puncturer configured with the first and second encoder for puncturing a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of compatible puncturing patterns .
  • a set of rate- compatible Turbo Codes comprising Turbo Codes having a universal constituent code and rate-compatible puncturing patterns for different code rates, and comprises: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the plurality of adders in a configuration corresponding to the universal constituent code; and a puncturer configured with the first and second encoder for puncturing a plurality of data outputs from the first
  • FIG. 1 is a diagram of a code-division multiple-access (CDMA) digital cellular mobile radio system hardware;
  • CDMA code-division multiple-access
  • FIG. 2 is a diagram of a CDMA digital cellular mobile radio system hardware which can implement an embodiment of the present invention
  • FIG. 3 is a functional block diagram of a Turbo Code encoder modified for use with the present invention.
  • Figure 4 is a functional block diagram of a generic turbo decoder
  • Figures 5, 6, 7, 8 illustrate the Bit Error Rate (BER) performance against signal to noise ratio (SNR) for Turbo Code rates 1/2 and rate 1/3 at Interleaver sizes 1000, 512 and 1024 bits when the Turbo Codes use a candidate constituent code represented by d(D) and n(D);
  • BER Bit Error Rate
  • SNR signal to noise ratio
  • Figure 9 illustrates the puncturing schemes studied for optimizing the rate 1/4 Turbo Codes
  • Figures 10, 11, 12 illustrate the BER/FER performance of Constituent Codes #1-3 at a frame size of 512 bits
  • Figure 13 illustrates the BER/FER performance of Constituent Code #1, wherein Constituent Code #1 is at a frame size of 1024 bits, and with consistent results found at sizes 2048 and 3072 bits, respectively;
  • Figure 14 illustrates the BER/FER performance of selected rate 1/4 Turbo Codes at frame size 512, with consistent results found at sizes 1024, 2048 and 3072 bits, respectively;
  • Figure 15 is a comparison of preferred Turbo Code B against other puncturing schemes at frame size 512 bits;
  • Figure 16 is a lay-out of candidate puncturing patterns for Turbo Codes of rate 1/3 and 1/2 when the constituent codes have rate 1/3;
  • Figure 17 illustrates a comparison of rate 1/3 puncturing schemes at frame size 512 bits
  • Figure 18 illustrates rate 1/2 puncturing schemes at frame size 512 bits, with consistent results found at 1024, 2048 and 3072 bits, respectively;
  • Figure 19 illustrates a block diagram of a preferred universal constituent encoder for Turbo Codes optimized at code rate 1/2 and rate 1/3 of varying Interleaver depths;
  • Figure 20 is a functional block diagram for rate 1/4 Turbo Codes optimized at code rate 1/2 and rate 1/3, including interleaving and puncturing, (rate 1/3, and rate 1/2 use analogous processing) ;
  • Figure 21 illustrates puncturing patterns for rate 3/8 Turbo Codes
  • Figure 22 illustrates rate 3/8 Turbo Codes optimized at co ⁇ e rate 1/2 and rate 1/3 at frame size 512 bits, wherein results are consistent at 1024, 2048 and 3072 bits, respectively;
  • Figure 23 illustrates puncturing patterns for rate 4/9 Turbo Codes
  • Figure 24 illustrates rate 4/9 Turbo Codes optimized code rate 1/2 and rate 1/3 using frame size 512 bits
  • Figure 25 is a functional block diagram of a preferred constituent encoder for a Turbo Codes optimized at code rate 1/4;
  • F gure 26 illustrates a functional block diagram of a rate 1/4 Turbo Codes optimized at rate 1/4, including interleaving and puncturing, (rate 1/3 and rate 1/2 use analogous processing) ;
  • Figure 27 illustrates puncturing patterns for rate 2/9 Turbo Codes
  • Figure 28 illustrates rate 2/9 Turbo Codes optimized at code rate 1/4 using frame size 512 bits
  • Figure 29 illustrates initial puncturing patterns for rate 3/8 Turbo Codes
  • Figure 30 illustrates rate 3/8 Turbo Codes optimized at code rate 1/4 using frame size 512 bits
  • Figure 31 is a functional block diagram of a preferred universal constituent encoder for rate 1/2 and rate 1/3 Turbo Codes of varying Interleaver depths.
  • Figure 32 illustrates a performance comparison of rate 1/4 FER-optimized Turbo Codes with convolutional codes, at frame size 512 bits, wherein results are consistent at 1024, 2048 and 3072 bits.
  • Appendix A is a compilation of figures collectively referred to herein as Analogous' figures, curves or simulations or the equivalent.
  • Turbo Codes are particularly well-suited to data applications because of their excellent error correction capabilities at low signal-to-no se (SNR) ratios and their flexibility in trading off bit error rate (BER) and frame error rate (FER) performance for processing delay.
  • SNR signal-to-no se
  • BER bit error rate
  • FER frame error rate
  • the universal Turbo Codes specified herein are also applicable to data services in other cellular mobile radio systems (e.g., the European Time-Division Multiple Access (TDMA) standard used in GSM) as well as other systems, such as satellite or other wireless communications systems.
  • TDMA European Time-Division Multiple Access
  • GSM Global System for Mobile communications
  • Several specific Turbo Codes are therefor identified that provide different optimizations regarding these requirements. Others would also be possible.
  • FIG. 1 an exemplary conventional digital cellular mobile radio system using Direct Sequence Code Division Multiple Access (CDMA) Mobile-station-to-base- station (or reverse) link is shown using a convolutional encoder and a Viterbi decoder.
  • CDMA Direct Sequence Code Division Multiple Access
  • This basic coding and interleaving can be applied, equally well, to other multiple access systems such as the Time Division Multiple Access (TDMA) used in a well-known GSM standard.
  • TDMA Time Division Multiple Access
  • Figure 1 also represents a base-station-to-mobile-station (or forward) .link in a cellular mobile radio system.
  • the system comprises a segmentation processor 104 where user information bits from a data terminal equipment (not shown) are assembled into fixed length frames of N bits per frame 106 which are input to a convolutional encoder 108, (of rate r) .
  • Convolutional encoder 108 is coupled to a synchronization and framing processor 104 which produces N/r code symbols 110 at an input of a Channel Interleaver 112 coupled to the convolutional encoder 108.
  • the channel interleaver 112 performs pseudo-random shuffling of code symbols 110 and outputs the code symbols 110 to a Spread Spectrum modulator 114 coupled to the channel interleaver 112.
  • the Spread Spectrum modulator 114 uses a user specific Transmit PN-code generated by a PN converter 116 coupled to the Spread Spectrum modulator 114 to produce a spread spectrum signal carried on a RF carrier to a mobile RF transmitter 118.
  • Mobile RF transmitter 118 is also coupled to the Spread Spectrum modulator 114, where a high power amplifier (not shown) coupled to a transmit antenna 120 radiates a signal to a base station.
  • a high power amplifier (not shown) coupled to a transmit antenna 120 radiates a signal to a base station.
  • the techniques of spread spectrum modulation and RF transmission are well known art to one familiar with spread spectrum communication systems.
  • the demodulated symbols are de-interleaved by a Channel De- Interleaver 130 and input to a ⁇ Viterbi decoder 132.
  • the decoded information bits are reconstructed into receive data blocks 136 and forwarded to the data terminal equipment at the receive end of the system.
  • FIG. 2 a hardware system for a digital cellular mobile radio system is shown which implements an embodiment of the present invention.
  • a reverse link is illustrated although the same block diagram represents a forward link.
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • Transmit data blocks 202 from data terminal equipment is segmented and framed at a Segmentation Processor 204 into fixed frame length and applied to a Turbo Code encoder 208.
  • An output from the encoder 208 is fed to a Channel Interleaver 212 to pseudo-randomize the code symbols.
  • the Channel Interleaver 212 provides output to a Spread Spectrum Modulator 214 which uses a user specific PN-code from a PN Generator 216 to create a spread spectrum signal, carried on a RF carrier to a mobile RF transmitter 218.
  • the channel interleaver 212 is distinguished from a Turbo Code interleaver (not shown) which is a component of the encoder 208.
  • the mobile RF Transmitter 218, coupled to a Transmit Antenna 220, uses a high power amplifier (not shown) at the Transmit Antenna 220 to radiate the signal to the base station.
  • a signal from the mobile station received at a base receive antenna 222 is amplified a base RF receiver 224 and demodulated m a spread Spectrum demodulator 228, which uses the same PN-code as used by the mobile RF transmitter 218, to de-spread the signal.
  • the demodulated symbols are de- mterleaved by the Channel DE-Interleaver 230, and input to the Turbo Code decoder 232.
  • Decoded information bits from Turbo Code decoder 232 are reconstructed at a Reconstruction Processor 234 into receive data blocks 236 and forwarded to the data terminal equipment at the receive end.
  • the basic structure of a Turbo Code is characterized by the parallel concatenation of two simpler constituent codes at encoder #1 306 and encoder #2 308.
  • Both constituent encoders i.e., encoder #1 306 and encoder #2 308 process the same information bit stream 302, but the encoder #2 308 processes information bits 302 in a different order than the order in which encoder #1 306 processes the information bits 302, since the Interleaver 304 reorders the information bits in a pseudo-random manner before they reach encoder #2 308 (the constituent encoder 308) .
  • This arrangement reduces the likelihood that a sequence of information bits 302 causing encoder #1 306 to produce a low- Hamming weight output 310 would also cause encoder #2 308 to do the same with its output 314, which makes possible the excellent performance of Turbo Codes.
  • Both encoders 306, 308 produce, in addition to the information bits 302 (also referred to as systematic bits 302), parity bits 310, 314 which are punctured by puncturer 312 to achieve a desired overall Turbo Code rate. It is also possible to puncture systematic bits.
  • the constituent codes of a Turbo Code are usually systematic, recursive convolutional codes.
  • the simplest and most widely known recursive convolutional codes have rate 1/2 and transfer function:
  • n(D) and d(D) are binary polynomials specifying the feed forward and feedback connections of the encoder, respectively .
  • the rate of a Turbo Code is changed by changing the selection of output bits 310, 314 for puncturing or transmitting. In all the cases herein, a "1" indicates transmitting; a "0" indicates puncturing.
  • G(D) [1, n_(D)/d(D), n 2 (D)/d(D)]. ⁇ sing two such constituent codes provides any Turbo Code rate between 1/5 and 1 through puncturing, or deleting.
  • Each of the constituent codes are decoded separately using likelihood estimates of the other constituent decoder 406 or 416 as A priori' information.
  • the constituent decoder 406, 416 must be of a soft-mput/soft-output type, such as the Maximum A Posteriori (MAP) algorithm, the sub-optimal Soft- Output Viterbi Algorithm (SOVA) , or variations. After both constituent decoders have processed the data, the process can be repeated.
  • MAP Maximum A Posteriori
  • SOVA sub-optimal Soft- Output Viterbi Algorithm
  • turbo decoders 406, 416 are usually limited to a fixed number of iterations consistent with the implementation complexity and performance objectives of the system.
  • Figure 4 is a general block diagram of a turbo decoder.
  • Soft information regarding the information bits 404, parity bits for the first encoder 402, and parity bits of the secon ⁇ encoder 402' are received from the demodulator.
  • a first decoder 406 uses received information bits 404 and received parity bits 402 to produce a soft decision 408 on information bits.
  • the soft decision 408 is interleaved by an interleaver 412, the output of which s soft decision 414.
  • Soft decision 414 is fed to a second decoder 416 as a priori information.
  • the second decoder 416 accepts the soft decision 414 described above and produces an improved soft decision 420 on information bits which are then interleaved by an mterleaver 422 and fed to the first decoder 406 as a priori information. The whole process is repeated as many times as desired. Final output 420 is obtained by making hard decisions or the soft decisions out of the first or second decoder.
  • a single mother Turbo Code and various puncturing patterns are sought to derive uniformly good codes for various code rates and information block sizes.
  • a methodology for determining universal constituent codes is developed by first limiting the initial pool of possible universal constituent codes in accordance with trade-off studies between performance and implementation complexity.
  • performance studies using different state codes have shown that eight-state constituent codes provide a good performance trade-off.
  • Universal constituent codes are first optimized according to the primary code rate of the targeted application. For example, in the case of CDMA data communications, separate optimizations can be done for the forward and reverse links since the reverse links usually requires lower code rates for higher coding gain.
  • G(D) [1, n(D)/d(D)], where d(D) is a primitive polynomial and n(D) starts with 1 and ends with D ;
  • Table 1 lists the determined denominator polynomials d(D) and numerator polynomials n(D) in octal notation. There are twelve constituent code candidates considered for initial screening purposes . Table 1. Candidate 8-State Constituent Encoders of Rate 1/2
  • Each of the twelve (12) polynomials is expressed in octal form in Table 1, and has a corresponding binary and polynomial notation.
  • the binary equivalent, for example of octal 13, is binary 1011.
  • Binary 1011 corresponds to a polynomial
  • the candidate Turbo Codes are simulated with an interleaver size of 1000 bits and three decoder iterations.
  • the preliminary screening which results are shown in Figure 5 and Figure 6, evaluates the Bit Error Rate (BER) versus Ebi/No performance of all candidate Turbo Codes of rate 1/2 and rate 1/3 as it is described above. Measurement of Ebi/No is equivalent to a relative SNR.
  • Table 2 shows the approximate SNR loss for simulated data due to using a non-optimized code at rates 1/2 and 1/3 and Interleaver depths of 512, 1024, 2048, and 3072 bits .
  • pairs denoted as 31-33 and 31-27 are also shown in sample Figures 7 and 8 using four (4) decoder iterations for each sixteen-state code in order to provide similar complexity comparison with the eight-state codes using eight (8) decoder iterations.
  • Eight-state codes with eight iterations out perform sixteen state codes with four iterations significantly.
  • This constituent code is thus selected as the basis for Turbo Code designs where higher code rates such as 1/2 and 1/3 are dominant .
  • rate 1/3 constituent codes are determined. Similar to the rate 1/2 constituent codes, rate 1/3 constituent code candidates are identified in Table 3 below for building near optimal Turbo Code rates of 1/4 and 1/5. For this case, the constituent code candidates for a Turbo Code must have three (3) polynomials instead of two (2).
  • the puncturing patterns of Figure 9, namely 910, 920, 930 and 940 are selected based upon the previously mentioned design principles, to meet stipulated code rates.
  • each of the three (3) code triads of Table 3 is combined with the four (4) puncturing patterns 910, 920, 930 and 940, of Figure 9 to produce twelve (12) possible Turbo Codes to be evaluated with simulated data shown in Figure 10 through 12 for a fixed Interleaver depth of 512, for example.
  • Turbo Code B Constituent Code No. 2 with puncturing Pattern No. 1
  • Turbo Code C Constituent Code No. 3 with puncturing Pattern No. 1.
  • One of the Turbo Codes of Codes A through C is next selected for further evaluation using simulated data at various additional Interleaver frame sizes to verify that the puncturing patterns are also good at other Interleaver depths.
  • Figure 14 shows the BER/FER performance of simulated data using the three rate 1/4 Turbo Code Candidates A through C at an Interleaver depth of 512 bits. Consistent results are also achieved at Interleaver sizes 1024, 2048 and 3072 bits.
  • a rate 1/4 Turbo Code candidate is selected from Candidate Turbo Codes A through C which provides the best overall performance at all Interleaver depths, m the simulation resulting m Figure 14 and analogous figures, such as those depicted in Appendix A.
  • rate 1/4 Turbo Code optimization based on BER performance gives a different result than optimization based on FER performance.
  • Turbo Code B has the best overall FER performance and Turbo Code C the best overall BER performance, for the simulated data.
  • Figure 15 shows the performance of Turbo Code B as compared to other puncturing schemes .
  • FER optimized Turbo Code B is selected as the basis for the design since FER performance is usually the more important criteria for data services.
  • Turbo Code A can be punctured to give the same universal Turbo Code identified previously as optimal for rate 1/3 (by puncturing all parity bits from the n 2 (D) polynomial) .
  • Turbo Code A is the preferred choice for the forward lm ⁇ rate 1/4 codes in order to have a single universal mother code to implement all of the different code rates.
  • rate 1/3 and rate 1/2 channel coding may be required for some of the highest rate data channels.
  • a universal Turbo Code for rate 1/4, rate 1/3 and rate 1/2 can be designed, wherein the underlying constituent code is the same and only the puncturing pattern used is different. The method for generating the higher rate Turbo Codes from the rate 1/3 constituent code follows.
  • Figure 16 shows seven (7) basic puncturing patterns that can be used to produce a rate 1/3 Turbo Code and four (4) basic puncturing patterns to produce a rate 1/2 Turbo Code.
  • the seven (7) rate 1/3 patterns, 1602 through 1614 in block diagram 1600 show the consecutive information puncturing oit patterns, 1620, 1626, and the four (4) corresponding row parity bit puncturing patterns 1622, 1624, 1628, and 1630, for the two (2) encoder puncturing block patterns 1616 and 1618.
  • the pattern "1111" shown in row 1620 always transmits all the information bits from encoder 1.
  • the pattern "0000" of row 1626 always punctures the information b ts that enter by encoder No. 2. This is because it is not necessary to transmit the information bit twice.
  • Patterns 2 and 5 are selected based upon curves 1710 and 1720, as having the best and next best overall relative FER, respectively.
  • Pattern 2 is then selected as the best performer over the various Interleaver depths from further simulations analogous to that of Figure 17 at additional Interleaver sizes for 1024, 2048 and 3072 bits.
  • Rate 1/2 Codes can also be optimized at lower rate codes fcr similar compatibility as described above.
  • Figure 18 compares the BER and FER simulated performance of all the rate 1/2 Turbo Codes at an Interleaver depth of 512 bits.
  • Figure 18 is generated using Constituent Code No. 2 and the four (4) puncturing patterns shown in Figure 16 for a rate 1/2 Turbo Code. Patterns 1 and 4 are determined to be the best based upon simulated curves 1810 and 1820 for FER performance.
  • Patterns 1 and 4 are interleaver depths of 1024, 2048 and 3072 bits. Based upon the resulting performance/curves Pattern 1 is judged to be the best pattern for FER performance.
  • Figure 19 shows a block diagram for the constituent encoder optimized m accordance with the previously described method for Turbo Code rates 1/2 and 1/3.
  • Figure 20 shows the block diagram for the corresponding Turbo Code punctured to rate 1/4.
  • Information bit stream X(t) 1902 is received at a switch 1922, and is processed in accordance with several modular adders 1904, 1908, 1920, 1910, 1914, 1918, 1919, and several shift registers 1906, 1912 and 1916 which are hard-wired to represent two (2) numerator polynomials and one denominator polynomial .
  • a first numerator polynomial over a denominator polynomial, represented by "1101" is hardwired to return output Y 0 (t) by combining: X(t) 1992 with a result of modulator adder 1920 to create a first bit (t); the modular sum (second bit) of shift register 1906 and W(t) from the modular adder 1908; another zero bit (third bit) indicated by the lack of connection to the register 1912; and the modular sum (fourth bit) of another register 1916 and a result of modular adder 1908 from modular adder 1998.
  • a second numerator polynomial over a denominator polynomial, represented by "1111”, is hardwired to return output Y ⁇ (t) by combining: X(t) 1902 with a result of adder 1920 to create a first bit W(t); adding contents of a further register 1906 to W(t) with the contents of the modular adder 1910 (second bit) ; adding contents of the register 1912 a result of adder 1710 with the modular adder 1914 (third bit) ; and adding contents of the other register 1916 to a result of adder 1914 with modular adder 1919 (fourth bit) .
  • Output Y 0 (t) represents the output from numerator Polynomial No. 1 and the denominator polynomial.
  • Output Y ⁇ (t) represents numerator Polynomial No. 2 and denominator polynomial.
  • the optimal puncturing matrices shows a "1" for transmitted bits and a "0" for punctured bits.
  • Exemplary Figure 20 shows encoder 2000 with incoming bit X(t) and Interleaver 2002 passing interleaved bits X (t) to encoder 2006 to produce output bit X (t) and parity bits Y D (t) , and Yi (t) . None of the interleaved bits x (t) are processed in the rate 1/4 encoder 2004, only in the second rate 1/4 encoder 2006.
  • Block 2010 shows the puncturing pattern matrices. More complicated puncturing patterns can be used to achieve other possible coding rates. For example, it is possible to select optimal puncturing patterns to achieve rate 3/8 and 4/9 for Turbo Codes optimized at rates 1/2 and 1/3; ana to achieve rates 2/9 and 3/8 for Turbo Codes optimized at rate 1/4 using the preferred Turbo Codes identified in the invention.
  • FIG. 10 Similar to Figure 9 the block diagram for an optimal Turbo Code rate 3/8 uses the rate 1/3 mother constituent code of Figure 20.
  • the encoder for the constituent code of Figure 20 is shown in Figure 19.
  • the puncturing pattern of the rate 3/8 Turbo Codes shown Figure 21 punctures 1 out of every 6 bits associated with the first numerator polynomial from both encoders to generate a rate 3/8 Turbo Code.
  • the second pattern is a extension of the first pattern allowing both constituent encoders to have the same rate, namely 6/11.
  • the extension pattern duplicates the same pattern (matrix) for another three (3) bits but moves the location of one transmission bit from one encoder to another, essentially flipping a "1" in one encoder while flipping a "0" in another encoder at the analogous locations .
  • Figure 22 shows the performance of these patterns at an Interleaver depth of 512 bits. Based on these and analogous curves at 1024, 2048 and 3072 Interleaver depths, Pattern 2 is chosen to implement the rate 3/8 Turbo Codes.
  • Figure 23 shows the puncturing patterns selected for rate 4/9 Turbo Codes used with the mother of codes of Figure 20.
  • the second pattern is an extension of tne first, which allows both constituent encodes to have the same rate, namely 8/13. — ⁇ y—
  • Figure 24 snows the corresponding performance curves.
  • Pattern 2 is chosen to implement the rate 4/9 Turbo Codes.
  • the preferred puncturing patterns for various code rates are :
  • This universal Turbo Code design supports a minimum code rate equal to 1/3 (instead of 1/5) .
  • the corresponding preferred set of puncturing patterns are:
  • Rate 1/2 alternately puncturing parity bits nl from both encoders; 3. Rate 3/8 - puncturing one out of every 6 parity bits ni from both encoders; and
  • Figure 26 is an encoder block diagram for the preferred rate 1/4 Turbo Code.
  • the second parity bits are alternately punctured by the two constituent encoders.
  • the preferred puncturing patterns described in earlier section can then be applied to produce rate 1/3 and rate 1/2 Turbo Codes.
  • Figure 27 shows the puncturing patterns for a 2/9 reverse link code.
  • Three (3) different patterns are compared by performance curves in Figure 28 and analogous curves, such as those set forth, for example, in Appendix A, showing performance at various frame Interleaver sizes. From a Pattern 2 FER curve 2810 and analogous curves, Pattern No. 2 is chosen as the optimal FER pattern for rate 2/9.
  • Figure 29 illustrates six (6) initial screening puncturing patterns for optimizing a rate 3/8 reverse link codes.
  • the performance of these patterns is simulated at a fixed Interleaver length of 512 bits . Based on the simulation, Pattern 5 and Pattern 6, are chosen as the optimal puncturing patterns for further review.
  • Two more extension Patterns 7 and 8 of the above Patterns 5 and 6 duplicate the same patterns for another three information bits, but move the location of one of the transmission bits in the parity sequence from one encoder pattern to another.
  • the extension allows both constituent encoders to have the same rate, namely 6/11 at each encoder.
  • Figure 30 shows exemplary performance curves of the above four (4) candidate puncturing Patterns 5, 6, 7 and 8 for rate 3/8 Turbo Codes. Based on these results, a Pattern 8 FER curve 3010 and analogous curves such as those shown, for example, in Appendix A, demonstrate that Pattern 8 is the optimal puncturing pattern for rate 3/8 Turbo Codes.
  • ni represents output bits associated with a first numerator polynomial
  • n 2 represents output bits associated with a second numerator polynomial
  • Rate 3/8 - puncture parity bits ni and one out of every six parity bits n 2 are equivalent.
  • the set of preferred universal Turbo Codes described heretofore in this invention provide a suite of flexible high performance channel codes that are well suited for sophisticated data communication systems requiring a variety of low speed and high speed data services .
  • This suite of preferred universal Turbo Codes allows the crafting of different Turbo encoding schemes to meet the specific requirements of particular data communication systems.
  • either of the following two FEC schemes is well-suited and recommended for a synchronous CDMA data communications network (such as the third generation CDMA 2000 system currently under development) :
  • either of the following FEC schemes is well-suited and recommended for an asynchronous CDMA data communications network (such as the third generation UTRA system currently in development in Europe and Asia) : 1) The preferred universal Turbo Code optimized at code rates 1/2 and 1/3, described above, along with a subset of associated puncturing patterns, on both the forward and reverse links;
  • the universal Turbo Codes identified for high-speed data services are especially suitable for third generation CDMA cellular mobile radio systems but could be easily applied to other systems as well.
  • FOCTC Frame Oriented Convolutional Turbo Coding
  • the exemplary preferred puncturing patterns described herein can be refined or modified m various ways by those skilled m the art. For example, a cyclic shift of a preferred puncturing pattern offers substantially equivalent performance as the preferred puncturing pattern described herein. Furthermore, specific data communication systems may require different and additional puncturing patterns to support rate matching. These puncturing patterns may be designed accordance with the teachings of the present invention.
  • one embodiment includes a set of rate- compatible Turbo Codes at various code rates of 1/5, 1/4, 1/3 and 1/2 and also at various Interleaver depths from 512 to 3072 bits.
  • Another preferred embodiment provides multiple sets of Turbo Codes optimized under different conditions allowing a system designer to trade off degree of universality (and thus, complexity) with performance and vice a versa.
  • the selection of sets of rate-compatible Turbo Codes is based upon the universal constituent encoder described herein below.
  • the universal constituent encoder of the present invention provides optimal or nearly optimal performance over a large range of code rates and Interleaver depths. Different optimization criteria such as reverse link or forward link dominance and degree of universality, result m different sets of rate-compatible Turbo Codes.
  • the sets of rate-compatible codes are especially well suited for use in hybrid ARQ schemes applied m satellite broadcast and telephony.
  • Several preferred embodiments comprise different sets of rate-compatible codes based upon different universal constituent codes and different rate puncturing patterns optimized according to different design criteria.
  • the first two (2) sets are optimized for high-rate Turbo Codes, wherein higher-rates dominate.
  • the second two (2) sets are optimized for lower-rate codes, where lower-rates dominate.
  • the sets are referred to herein as Sets A-D.
  • the first preferred set is derived from a best universal constituent code of rate 1/2.
  • the second set is derived from another best constituent code of rate 1/3 which is also compatible with the universal constituent code of rate 1/2.
  • the first set, "Set A” has two generator polynomials while the second set, “Set B” has three generator polynomials of which two are in common with “Set A”.
  • “Set B” is optimally compatible with "Set A”, reducing the amount of design changes for encoding and decoding.
  • the thir ⁇ polynomial is necessary for the additional encoder parity bits of a rate 1/3 or lower Turbo Code.
  • the second set, "Set B” includes “Set A” and also extends the ramily of Turbo Codes to rate 1/5 and higher.
  • a third and fourth preferred set of rate- compatible Turbo Codes are optimized for lower-rates, in particular for rate 1/4.
  • "Set C” and “Set D”, respectively, also use three generator polynomials which are the same as those in “Set B”, but a different order.
  • Rate-Compatible Set Derived from Universal Constituent Codes of Rate 1/2 Set A (Rates 1/3, 1/2)
  • Rate-compatible Set A comprises generator polynomials corresponding to octal pairs 13-15, wherein a denominator polynomial is 1+D +D (octal 13) and a numerator polynomial is 1+D+D (octal 15) .
  • the puncturing patterns are designed such that all bits transmitted by a rate of 1/2 code (or higher rate) of the set are also transmitted by a rate 1/3 code, or lower rate code of the set.
  • Exemplary preferred patterns as demonstrated by simulations and design principles are:
  • Figure 31 shows a block diagram for the Set A constituent encoder.
  • modular adders 3104, 3108 (connected to shift register 3106) , and 3116 (connected to shift register 3114) comprise the encoding apparatus for a numerator polynomial representing octal 15 or binary 1101.
  • Modular adders 3104, 3108, 3112 and 3116 add the contents of shift registers 3106, 3110 and 3114 and X(t) in an analogous fashion as Figure 19.
  • the Turbo Codes of Set A compare favorably in performance to the best known 256-state convolutional codes, when simulated for the critical performance parameters.
  • Rate-Compatible Set Derived from Universal Constituent Code of Rate 1/3 Set B (Rates 1/2, 1/3, 1/4, 1/5)
  • a second best individual rate 1/2 constituent code is chosen from Table 2.
  • this method results in two (2) octal pairs with an overlap. Both octal pairs, octal 13-15 and octal 13-17 provide uniformly excellent performance.
  • Combining the two (2) pairs together provides three (3) generator polynomials, comprising the triad octal 13-15/17.
  • the denominator polynomial is 1+D+D 3 (octal 13); the first numerator polynomial is 1+D " +D J (octal 15); and the second numerator polynomial is 1+D+D +D (octal 17).
  • the preferred design for Set B comprises these generator polynomials above for all Interleaver depths and for Turbo Code rates 1/2, 1/3, 1/4 and 1/5.
  • the puncturing patterns are designed such that all bits transmitted at any higher rate Turbo Code of Set B are also transmitted at any lower code rate of Set B.
  • Exemplary preferred patterns as demonstrated by simulations and design principles, are:
  • Rate 1/2 always puncture the second numerator parity bits, n 2 and alternately puncture the first numerator parity bits, ni .
  • Turbo Code Set B is the preferred design choice when strict rate- compatibility is required in all code rates.
  • the optimal Turbo Codes for rates 1/4 and 1/5 are selected based upon the candidate constituent codes listed in Table 3 which are selected based upon the results of Table 2 as previously described above.
  • Constituent Code No. 1 of Table 3, or octal 13-15/17 is the basis for code Set A.
  • each three (3) mother Turbo Code triad of Table 3 is considered with each of four (4) different puncturing patterns to obtain a newly optimized 1/4 Turbo Code.
  • Turbo Codes A, B, and C are found optimal from respective performance curves 1010, 1110 and 1210 of Figures 10, 11 and 12 respectively.
  • Figure 14 shows a sample corresponding performance of the triads matched with the selected puncturing patterns at 512 bits. From Figure 14 and analogous results for other Interleaver sizes, the best overall BER performance at all simulated Interleaver depths are used as a final design criterion to determine the optimal candidate.
  • Rate-Compatible Set Derived from Rate 1/4 Turbo Code Set C (Rates 1/5, 1/4, 1/3)
  • Turbo Code Set C implements Code No. 3 and Pattern No. 1 (Turbo Code C) from Figure 9 in accordance with performance curve 1310 of Figure 14 and analogous curves for other Interleaver sizes.
  • Turbo Code Set C comprises a generator polynomial from Table 3 including denominator polynomial 1+D+D +D , first
  • Rate-Compatible Set Derived from Rate 1/4 Turbo Code Set D (Rates 1/5, 1/4)
  • Turbo Code Set D comprises a single constituent code for all Interleaver depths and Turbo Code rates 1/4 and 1/5.
  • Turbo Code Set D implements Code No. 1 with Pattern No. 2 (Turbo Code A) from Figure No. 9 in accordance with performance curve 1420 of Figure 14 and analogous curves at other Interleaver sizes.
  • the set comprises generator polynomials including a denominator polynomial d, 1+D+D , a first numerator polynomial, n x , 1+D +D " and second numerator polynomial, n 2 , 1+D+D +D .
  • More complicated puncturing patterns may be used in convolutional coding to achieve any code rate greater than or equal to that of the base Turbo Code in each rate-compatible Set.
  • rates higher than 1/2 or intermediate rates such as 5/12 can be achieved.
  • puncturing patterns this can often be done in a rate- compatible manner without sacrificing error correction performance .
  • An exemplary application of the rate-compatible turbo codes described herein is for rate matching in which the code rate is selected to match the payload of an available physical channel.
  • the data services use the same basic channel encoding but may not use the same physical channel, especially if the quality of service specifications are different for the different data services.
  • this is accomodated by selecting different puncturing patterns to produce the code rate compatible with the physical channel. If the puncturing patterns are rate-compatible, the selection of code rate does not have to be completed by single decision unit at a single point in time. Instead, the decision can be distributed in time as well as across decisioning units.
  • the turbo encoder first produces the coded output sequence corresponding to the lowest code rate to be supported by the system.
  • all the possible parity bits might be output initially.
  • an initial puncturing might be performed, by one puncturing unit in response to say quality-of-service (QoS) considerations for the given data service.
  • the data service may permit a range of quality-of-service in which, for example, the highest quality within that range does not require the lowest possible code rate available in the system but some intermediate code rate, and the lowest quality within that range can allow an even higher code rate.
  • the first puncturing unit removes coded bits in accordance with the puncturing pattern corresponding to the lowest rate in order to provide the highest quality within the data service's QoS range.
  • the non- punctured coded bits are output to the rest of the system for further processing.
  • a decision might be made to adjust the code rate higher for that message based on dynamic traffic management considerations .
  • a physical channel with smaller payload might be substituted, on a temporary as-needed basis, for the physical channel nominally associated with that data service in order to accomodate messages from a higher priority data service.
  • the higher code rate is achieved by performing a second puncturing in accordance with the puncturing pattern associated with the new code rate. Since the puncturing patterns are rate-compatible, it is not necessary to regenerate coded bits deleted by the first puncturing unit; the second puncturing unit simply deletes those bits specified by the higher rate puncturing pattern that have not already been deleted by the first puncturing unit.
  • a second exemplary application of the rate-compatible turbo codes described herein is for incremental redundancy schemes such as error control based on ARQ protocols.
  • the turbo encoder first produces coded output corresponding to the highest code rate available in the system.
  • the receiver may or may not be able to successfully decode the message. If the message is not successfully decoded, the receiver typically sends a negative acknowledgement (NAK) back to the transmitter to request further transmissions to aide the decoding of that packet.
  • NAK negative acknowledgement
  • the extra encoded bits produced by one of the lower-rate compatible encodings for that packet can be sent to augment the information available to the decoder at the receiver.
  • the decoder uses that new information along with the original information received for that packet to perform the decoding.
  • the effect is as if the packet had been originally encoded with the lower rate code. This process can be repeated until the packet is successfully decoded. By only sending the excess coded bits each retransmission, the traffic loading required for re-transmission is significantly lowered.
  • the criterion for designing a good convolutional code is different from the conventional approach of maximizing minimum Hamming distance, when the convolutional code is used as a constituent code in turbo codes.
  • the systematic, recursive convolutional code should be designed [1] so as to maximize the minimum parity weight corresponding to information sequences of weight two that cause the trellis diverge from the zero state and later remerge to it.
  • THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART.
  • THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRTTTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHEO. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART.
  • THIS LEGEND SHALL BE ⁇ PPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
  • Appendix Fig. A-6 Selected rate 1/2 turbo codes on AWGN channel, 512 bit frame size
  • Appendix Fig. A-7 Selected rate 1 2 turbo codes on AWGN channel, 1024 bit frame size
  • THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPUCATED IN WHOLE OR IN PART.
  • Appendix Fig. A-9 Selected rate 1 2 turbo codes on AWGN channel, 3072 bit frame size
  • Appendix Fig. A- 10 Selected rate 1/3 turbo codes on AWGN channel, 512 bit frame size
  • Appendix Fig. A-12 Selected rate 1 3 turbo codes on AWGN channel, 2048 bit frame size
  • Appendix Fig. A-13 Selected rate 1/3 turbo codes on AWGN channel, 3072 bit frame size
  • THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHA ⁇ NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
  • THIS DOCCMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WR ⁇ TEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT-BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART.
  • THIS LEGEND SHALL BE APPLIED TO AU OOCUMCNTS CONTAINING THIS INFORMATION.
  • THISOOCUMENT CONTAINS PROPRIETARY INFORMATION AND EXCEPT WITH WR ⁇ TEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU. NOT BE PUBUSHED. OR OISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART.
  • Pattern 234 ⁇ -1 CS AUO BO (EACH PAGE UFON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANOS TNESSED) Pattern 1 Pattern 2
  • WITNESS NAME (TYPE) SIGNATURE
  • Pattern 3 Al CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED) Pattern 1 Pattern 2 Pattern 3
  • TWS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU. NOT BE PUBLISHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. TWS LEGEND SHAU BE APPLIEO TO AU DOCUMENTS CONTAINING THIS INFORMATION.

Abstract

A method and apparatus for Turbo encoding uses a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code. The Turbo Codes have rate-compatible puncturing patterns. The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for each information bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing patterns; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern. In a variation, the best rate 1/2 constituent code represents a concatenation of polynomials 1+D2+D3 (octal 13) and 1+D+D3 (octal 15), D data bit. A Turbo Encoder is provided which has hardware to implement the method.

Description

OPTIMIZED RATE-COMPATIBLE TURBO ENCODING
CLAIM FOR PRIORITY
This application claims priority under 35 ϋ.S.C. § 1.119(e) of the filing dates of U.S. Provisional Applications Nos. 60/072,368, filed January 23, 1998, 60/074,932, filed February 17, 1998, 60/075,742, filed February 23, 1998, and 60/076,464, filed March 2, 1998.
BACKGROUND OF THE INVENTION
The present invention relates to error correction in data communications, and more particularly, to forward error correction (FEC) . Even more particularly, the present invention relates to the selection and use of optimal Turbo Codes in high performance data communication systems, such as emerging third generation terrestrial cellular mobile radio and satellite telephone systems, for which flexibility in supporting a wide range of system requirements with respect to transmission data rates, channel coding rates, quality of service measures (e.g., latency, bit-error rate, frame error rate), and implementation complexity is highly desirable.
Forward error correction (FEC) is required in terrestrial and satellite ratio systems to provide high quality communication over the RF propagation channel, which induces signal waveform and spectrum distortions, including signal attenuation (freespace propagation loss) and multi-path mduced fading. These impairments drive the design of the radio transmission and receiver equipment, the design ob]ectιve which is to select modulation formats, error control schemes, demodulation and decoding techniques and hardware components that together provide an efficient balance between system performance and implementation complexity. Differences in propagation channel characteristics, such as between terrestrial and satellite communication channels, naturally result in significantly different system designs. Likewise, existing communication system continue to evolve in order to satisfy increased system requirements for new higher rate or higher fidelity communication services .
In the case of terrestrial cellular mobile radio telephony, Analog Mobile Phone System (AMPS) is an exemplary first generation system; the U.S. IS-136 and European GSM time-division multiple-access (TDMA) standards and the U.S. IS-95 code-division multiple-access (CDMA) standard are second generation systems; and the wideband CDMA standards currently under development (e.g., CDMA 2000 in the U.S. and UTRA in Europe) are third generation systems.
In the third generation systems the development of flexible, high-speed data communication services is of particular interest. Desirable features include the ability to perform rate adaptation and to satisfy a multiplicity of quality-of-service (QOS) requirements.
Traditional forward error correction (FEC) schemes for communication systems include use of convolutional codes, block codes such as Reed-Solomon or BCH codes, and/or concatenated coding scnemes.
Turbo Codes are a relatively new class of block codes that have been demonstrated to yield bit error rate (BER) performance close to theoretical limits on important classes of idealized channels by means of an iterative soft-decision decoding method.
A Turbo encoder consists of a parallel concatenation of typically two systematic, recursive convolutional codes ("constituent codes") separated by an mterleaver that randomizes the order of presentation of information bits to a second constituent encoder with respect to a first constituent encoder. The performance of a Turbo Code depends on the choice of constituent codes, mterleaver, information block size (which generally increases with higher data rates), and number of decoder iterations. For a particular Turbo Code, which the constituent codes are fixed, one can ideally adjust the block size and number of decoder iterations to tradeoff performance, latency and implementation complexity requirements. As the block size changes, however, a new mterleaver matched to that block size is required.
In a CDMA network with synchronized base stations, forward link channels (from base station to user terminal) can be designed to be orthogonal, using, for example, alsh- Hadamand spreading sequences. This is generally not possible, however, for reverse link channels (from user terminal to base station) , which therefore operate asynchronously usmg spreading sequences that are only quasi-orthogonal. Thus, the reverse links in a synchronous CDMA network typically experience more interference and therefore may require stronger FEC (via lower rate codes) than the forward link channels do.
In an asynchronous CDMA network, the forward and reverse link channels are more similar m terms of interference leveis, so it is possible to use a common FEC scheme (or at least more similar FEC schemes) on the two links.
The flexibility and high performance of Turbo Codes make them a potentially attractive technology for sophisticated data communications services. It is therefore desirable ro identify Turbo Codes and Turbo coding FEC schemes that best match diverse service requirements with respective data rates and coding rates while minimizing implementation complexity.
The present invention advantageously addresses the above and other needs by providing methods for designing and using universally optimized Turbo Codes and rate-compatible punctur gs to support incremental redundancy schemes sucn as automatic repeat request (ARQ) .
SUMMARY OF THE INVENTION
In its most basic form, the invention can be characterized, m one embodiment as a method of processing data, in data services, with a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code, the Turbo Codes having compatible puncturing patterns. The method comprises: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
In a variation, a method of processing data m data services uses a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent coαe, the Turbo Codes having similar constituent codes and compatible puncturing patterns, and comprises: encoding a signal with a best rate 1/3 constituent code at a first and a second encoder, each encoder producing a respective plurality of parity bits for each data bit; puncturing the plurality of parity bits with the a higher rate best puncturing pattern; and puncturing the plurality of parity bits with a lower rate best puncturing pattern.
In another variation, a method of rate-compatible Turbo encoding uses a set of rate-compatible Turbo Codes, the set optimized for code rate 1/4, comprising Turbo Codes with differing code rates and rate-compatible puncturing patterns.
The method comprises: encoding a signal at a first and second encoder using a best rate 1/4 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
In another embodiment, an encoding system uses a set of rate-compatible Turbo Codes derived from a best universal rate 1/2 constituent code, the set having compatible puncturing patterns, and comprises: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the adders m a configuration corresponding to the best universal rate 1/2 constituent code; and a puncturer configured with the first and second encoder to puncture a plurality of data outputs from each of the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns .
In a further variation, an encoding system uses a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent code, the rate compatible Turbo Codes having similar constituent codes and compatible puncturing patterns, and comprises: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders, each of the adders coupled to a selected portion of the adders in a configuration corresponding to the rate 1/3 constituent code of; and a puncturer configured with the first and second encoder such to puncture a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns.
Yet another variation of the system uses a set of rate- compatible Turbo Codes comprising Turbo Codes having a universal constituent code and rate-compatible puncturing patterns for different code rates, and comprises: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the plurality of adders in a configuration corresponding to the universal constituent code; and a puncturer configured with the first and second encoder for puncturing a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of compatible puncturing patterns . BRIEF DESCRIPTION OF THE DRAWINGS
The above and other aspects, features and advantages of the present invention will be more apparent from the following more particular description thereof, presented in conjunction with the following drawings wherein:
Figure 1 is a diagram of a code-division multiple-access (CDMA) digital cellular mobile radio system hardware;
Figure 2 is a diagram of a CDMA digital cellular mobile radio system hardware which can implement an embodiment of the present invention;
Figure 3 is a functional block diagram of a Turbo Code encoder modified for use with the present invention;
Figure 4 is a functional block diagram of a generic turbo decoder;
Figures 5, 6, 7, 8 illustrate the Bit Error Rate (BER) performance against signal to noise ratio (SNR) for Turbo Code rates 1/2 and rate 1/3 at Interleaver sizes 1000, 512 and 1024 bits when the Turbo Codes use a candidate constituent code represented by d(D) and n(D);
Figure 9 illustrates the puncturing schemes studied for optimizing the rate 1/4 Turbo Codes;
Figures 10, 11, 12 illustrate the BER/FER performance of Constituent Codes #1-3 at a frame size of 512 bits;
Figure 13 illustrates the BER/FER performance of Constituent Code #1, wherein Constituent Code #1 is at a frame size of 1024 bits, and with consistent results found at sizes 2048 and 3072 bits, respectively;
Figure 14 illustrates the BER/FER performance of selected rate 1/4 Turbo Codes at frame size 512, with consistent results found at sizes 1024, 2048 and 3072 bits, respectively; Figure 15 is a comparison of preferred Turbo Code B against other puncturing schemes at frame size 512 bits;
Figure 16 is a lay-out of candidate puncturing patterns for Turbo Codes of rate 1/3 and 1/2 when the constituent codes have rate 1/3;
Figure 17 illustrates a comparison of rate 1/3 puncturing schemes at frame size 512 bits;
Figure 18 illustrates rate 1/2 puncturing schemes at frame size 512 bits, with consistent results found at 1024, 2048 and 3072 bits, respectively;
Figure 19 illustrates a block diagram of a preferred universal constituent encoder for Turbo Codes optimized at code rate 1/2 and rate 1/3 of varying Interleaver depths;
Figure 20 is a functional block diagram for rate 1/4 Turbo Codes optimized at code rate 1/2 and rate 1/3, including interleaving and puncturing, (rate 1/3, and rate 1/2 use analogous processing) ;
Figure 21 illustrates puncturing patterns for rate 3/8 Turbo Codes;
Figure 22 illustrates rate 3/8 Turbo Codes optimized at coαe rate 1/2 and rate 1/3 at frame size 512 bits, wherein results are consistent at 1024, 2048 and 3072 bits, respectively;
Figure 23 illustrates puncturing patterns for rate 4/9 Turbo Codes;
Figure 24 illustrates rate 4/9 Turbo Codes optimized code rate 1/2 and rate 1/3 using frame size 512 bits;
Figure 25 is a functional block diagram of a preferred constituent encoder for a Turbo Codes optimized at code rate 1/4; F gure 26 illustrates a functional block diagram of a rate 1/4 Turbo Codes optimized at rate 1/4, including interleaving and puncturing, (rate 1/3 and rate 1/2 use analogous processing) ;
Figure 27 illustrates puncturing patterns for rate 2/9 Turbo Codes;
Figure 28 illustrates rate 2/9 Turbo Codes optimized at code rate 1/4 using frame size 512 bits;
Figure 29 illustrates initial puncturing patterns for rate 3/8 Turbo Codes;
Figure 30 illustrates rate 3/8 Turbo Codes optimized at code rate 1/4 using frame size 512 bits;
Figure 31 is a functional block diagram of a preferred universal constituent encoder for rate 1/2 and rate 1/3 Turbo Codes of varying Interleaver depths; and
Figure 32 illustrates a performance comparison of rate 1/4 FER-optimized Turbo Codes with convolutional codes, at frame size 512 bits, wherein results are consistent at 1024, 2048 and 3072 bits.
Appendix A is a compilation of figures collectively referred to herein as Analogous' figures, curves or simulations or the equivalent.
Corresponding reference characters indicate corresponding components through out several views of the drawings.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The following description of the presently contemplated best mode of the invention is not to be taken a limiting sense, but is made merely for the purpose of describing the general principles of the invention. The scope of the invention should be determined with reference to the claims. There are two primary aspects of the current invention: 1) forward error correction (FEC) schemes for data services based on specific 'universal' Turbo Codes demonstrated to provide near-optimal performance over a wide range of information block sizes and code rates; and 2) the method by which specific Turbo Codes having the above mentioned desirable properties can be designed.
Turbo Codes are particularly well-suited to data applications because of their excellent error correction capabilities at low signal-to-no se (SNR) ratios and their flexibility in trading off bit error rate (BER) and frame error rate (FER) performance for processing delay. The data services under consideration in the hereinafter-described embodiments are consistent with third generation Code Division Multiple Access (CDMA) cellular mobile radio standards currently in development and are typically more delay-tolerant than low-rate voice services.
The universal Turbo Codes specified herein (and the method of finding such codes), however, are also applicable to data services in other cellular mobile radio systems (e.g., the European Time-Division Multiple Access (TDMA) standard used in GSM) as well as other systems, such as satellite or other wireless communications systems. Several specific Turbo Codes are therefor identified that provide different optimizations regarding these requirements. Others would also be possible.
In order to optimize the performance of Turbo Codes for data services, it is desirable to have a set of "universal" constituent codes that provide optimal or nearly optimal performance in conjunction with a variety of different Interleaver depths and Turbo Code rates, thus avoiding tailoring each optimization of particular Turbo Codes.
Referring first to Figure 1, an exemplary conventional digital cellular mobile radio system using Direct Sequence Code Division Multiple Access (CDMA) Mobile-station-to-base- station (or reverse) link is shown using a convolutional encoder and a Viterbi decoder. This basic coding and interleaving can be applied, equally well, to other multiple access systems such as the Time Division Multiple Access (TDMA) used in a well-known GSM standard.
Figure 1 also represents a base-station-to-mobile-station (or forward) .link in a cellular mobile radio system. At a transmitting system 100, the system comprises a segmentation processor 104 where user information bits from a data terminal equipment (not shown) are assembled into fixed length frames of N bits per frame 106 which are input to a convolutional encoder 108, (of rate r) . Convolutional encoder 108 is coupled to a synchronization and framing processor 104 which produces N/r code symbols 110 at an input of a Channel Interleaver 112 coupled to the convolutional encoder 108. The channel interleaver 112 performs pseudo-random shuffling of code symbols 110 and outputs the code symbols 110 to a Spread Spectrum modulator 114 coupled to the channel interleaver 112.
The Spread Spectrum modulator 114 uses a user specific Transmit PN-code generated by a PN converter 116 coupled to the Spread Spectrum modulator 114 to produce a spread spectrum signal carried on a RF carrier to a mobile RF transmitter 118.
Mobile RF transmitter 118 is also coupled to the Spread Spectrum modulator 114, where a high power amplifier (not shown) coupled to a transmit antenna 120 radiates a signal to a base station. The techniques of spread spectrum modulation and RF transmission are well known art to one familiar with spread spectrum communication systems.
A signal from a mobile station (^mobile signal-) ^mobile signal= received at a base station Receive antenna 122 is amplified in a Base RF receiver 124 and demodulated in a spread Spectrum demodulator 128 using the same PN-code used by the mobile RF transmitter 118 to de-spread the signal. The demodulated symbols are de-interleaved by a Channel De- Interleaver 130 and input to a~ Viterbi decoder 132. The decoded information bits are reconstructed into receive data blocks 136 and forwarded to the data terminal equipment at the receive end of the system.
Referring next to Figure 2, a hardware system for a digital cellular mobile radio system is shown which implements an embodiment of the present invention. As before, a reverse link is illustrated although the same block diagram represents a forward link. Further, while the CDMA system is used as an example, one familiar with the art would consider the present invention applicable to other systems such as TDMA as well.
Transmit data blocks 202 from data terminal equipment is segmented and framed at a Segmentation Processor 204 into fixed frame length and applied to a Turbo Code encoder 208. An output from the encoder 208 is fed to a Channel Interleaver 212 to pseudo-randomize the code symbols. The Channel Interleaver 212 provides output to a Spread Spectrum Modulator 214 which uses a user specific PN-code from a PN Generator 216 to create a spread spectrum signal, carried on a RF carrier to a mobile RF transmitter 218. The channel interleaver 212 is distinguished from a Turbo Code interleaver (not shown) which is a component of the encoder 208. The mobile RF Transmitter 218, coupled to a Transmit Antenna 220, uses a high power amplifier (not shown) at the Transmit Antenna 220 to radiate the signal to the base station.
A signal from the mobile station received at a base receive antenna 222 is amplified a base RF receiver 224 and demodulated m a spread Spectrum demodulator 228, which uses the same PN-code as used by the mobile RF transmitter 218, to de-spread the signal. The demodulated symbols are de- mterleaved by the Channel DE-Interleaver 230, and input to the Turbo Code decoder 232. Decoded information bits from Turbo Code decoder 232 are reconstructed at a Reconstruction Processor 234 into receive data blocks 236 and forwarded to the data terminal equipment at the receive end.
Referring to Figure 3, the basic structure of a Turbo Code is characterized by the parallel concatenation of two simpler constituent codes at encoder #1 306 and encoder #2 308. Both constituent encoders, i.e., encoder #1 306 and encoder #2 308 process the same information bit stream 302, but the encoder #2 308 processes information bits 302 in a different order than the order in which encoder #1 306 processes the information bits 302, since the Interleaver 304 reorders the information bits in a pseudo-random manner before they reach encoder #2 308 (the constituent encoder 308) . This arrangement reduces the likelihood that a sequence of information bits 302 causing encoder #1 306 to produce a low- Hamming weight output 310 would also cause encoder #2 308 to do the same with its output 314, which makes possible the excellent performance of Turbo Codes.
Both encoders 306, 308 produce, in addition to the information bits 302 (also referred to as systematic bits 302), parity bits 310, 314 which are punctured by puncturer 312 to achieve a desired overall Turbo Code rate. It is also possible to puncture systematic bits.
The constituent codes of a Turbo Code are usually systematic, recursive convolutional codes. The simplest and most widely known recursive convolutional codes have rate 1/2 and transfer function:
G(D) - [1, n(D)/d(D)],
where n(D) and d(D) are binary polynomials specifying the feed forward and feedback connections of the encoder, respectively .
The rate of a Turbo Code is changed by changing the selection of output bits 310, 314 for puncturing or transmitting. In all the cases herein, a "1" indicates transmitting; a "0" indicates puncturing.
Figure 3 also shows how two possible puncturing patterns result from puncturer 312. Alternately puncturing the parity bits between encoder 306 and 308 result m a Turbo Code rate r=l/2. Transmitting all of the parity bits at the two encoders 306, 308 produce a code rate r=l/3.
It is not possible to achieve lower Turbo Code rates lower than 1/3 without either increasing the number of constituent encoders or increasing the number of output parity bits per constituent encoder. The latter is usually preferred in order to reduce implementation complexity. In this case, one considers a rate 1/3 systematic, recursive convolutional code with transfer function:
G(D) = [1, n_(D)/d(D), n2(D)/d(D)]. ϋsing two such constituent codes provides any Turbo Code rate between 1/5 and 1 through puncturing, or deleting.
Turbo Codes are decoded using iterative decoding methods as shown the block diagram of Figure 4.
Each of the constituent codes are decoded separately using likelihood estimates of the other constituent decoder 406 or 416 as A priori' information. The constituent decoder 406, 416 must be of a soft-mput/soft-output type, such as the Maximum A Posteriori (MAP) algorithm, the sub-optimal Soft- Output Viterbi Algorithm (SOVA) , or variations. After both constituent decoders have processed the data, the process can be repeated.
In practice, the turbo decoders 406, 416 are usually limited to a fixed number of iterations consistent with the implementation complexity and performance objectives of the system.
Figure 4 is a general block diagram of a turbo decoder. Soft information regarding the information bits 404, parity bits for the first encoder 402, and parity bits of the seconα encoder 402' are received from the demodulator. First, a first decoder 406 uses received information bits 404 and received parity bits 402 to produce a soft decision 408 on information bits. The soft decision 408 is interleaved by an interleaver 412, the output of which s soft decision 414. Soft decision 414 is fed to a second decoder 416 as a priori information.
The second decoder 416 accepts the soft decision 414 described above and produces an improved soft decision 420 on information bits which are then interleaved by an mterleaver 422 and fed to the first decoder 406 as a priori information. The whole process is repeated as many times as desired. Final output 420 is obtained by making hard decisions or the soft decisions out of the first or second decoder.
In accordance with the present invention, a single mother Turbo Code and various puncturing patterns are sought to derive uniformly good codes for various code rates and information block sizes.
A methodology for determining universal constituent codes is developed by first limiting the initial pool of possible universal constituent codes in accordance with trade-off studies between performance and implementation complexity. In accordance with the present invention, performance studies using different state codes have shown that eight-state constituent codes provide a good performance trade-off.
Universal constituent codes are first optimized according to the primary code rate of the targeted application. For example, in the case of CDMA data communications, separate optimizations can be done for the forward and reverse links since the reverse links usually requires lower code rates for higher coding gain.
The following steps, more fully described below, are used to produce Turbo Codes optimized for rate 1/2 and 1/3:
1) select candidate systematic rate 1/2 constituent encoders with transfer function of the form
G(D) = [1, n(D)/d(D)], where d(D) is a primitive polynomial and n(D) starts with 1 and ends with D ;
2) determine a Turbo Code rate 1/2 and rate 1/3 test puncturing pattern to apply to output data encoded by two rate 1/2 constituent encoders;
3) form all possible rate 1/2 and 1/3 Turbo Codes by combining each rate 1/2 constituent code pair with the test patterns ; 4) evaluate a relative BER performance of all possible rate 1/2 and 1/3 Turbo Codes at a fixed Interleaver length;
5) select from the group of mother pairs, a subgroup of candidate pairs for building optimized Turbo Codes based upon a best overall BER performance;
6) evaluate another relative BER performance of a Turbo Code group comprising the subgroup of candidate pairs punctured with the rate 1/2 and rate 1/3 puncturing patterns at a plurality of other Interleaver depths;
7) select from the Turbo Code group, a universal code pair which has another best overall relative BER for the Interleaver depths; and
8) encode data with a rate 1/2 or rate 1/3 Turbo Code comprising the selected universal code pair, at a first and a second encoder, the encoders similar, and an Interleaver feeding bits into the second encoder, wherein the bits are ordered differently before entering each encoder.
Once generated, best Turbo Codes of lower rates such as 1/4, which are compatible with the rate 1/2 and 1/3 Turbo Codes determined by the above steps, can also be determined.
Rate 1/2 Constituent Codes
The following describes how rate 1/2 constituent codes are determined in one embodiment.
First, a list of candidate eight-state, rate 1/2 constituent code polynomials are determined.
Table 1 lists the determined denominator polynomials d(D) and numerator polynomials n(D) in octal notation. There are twelve constituent code candidates considered for initial screening purposes . Table 1. Candidate 8-State Constituent Encoders of Rate 1/2
Figure imgf000020_0001
Each of the twelve (12) polynomials is expressed in octal form in Table 1, and has a corresponding binary and polynomial notation. The binary equivalent, for example of octal 13, is binary 1011. Binary 1011 corresponds to a polynomial
d(D) D°(i: + D (0) + D"(l) + d (1) = 1 + D" + D
Next, the candidate Turbo Codes are simulated with an interleaver size of 1000 bits and three decoder iterations. The preliminary screening, which results are shown in Figure 5 and Figure 6, evaluates the Bit Error Rate (BER) versus Ebi/No performance of all candidate Turbo Codes of rate 1/2 and rate 1/3 as it is described above. Measurement of Ebi/No is equivalent to a relative SNR.
The results of Figure 5 and Figure 6 are used to select six (6) code polynomial pairs. The six (6) candidate universal code pairs, d(D)-n(D), are shown in octal representation on the left hand side of Table 2 below.
Next, a corresponding performance of the eight-state Turbo Codes, using simulated data with the candidate universal codes at each rate and Interleaver depth, is used to construct Table 2. A sample performance study or simulation is shown in Figures 7 and 8 showing selected Turbo Codes at an Interleaver depth of 512 bits for rate 1/2 and rate 1/3.
Table 2 below shows the approximate SNR loss for simulated data due to using a non-optimized code at rates 1/2 and 1/3 and Interleaver depths of 512, 1024, 2048, and 3072 bits .
Table 2. Approximate SNR Loss due to Use of Non-Optimized Codes
Figure imgf000021_0001
In a similar simulation using sixteen-state codes, pairs denoted as 31-33 and 31-27 are also shown in sample Figures 7 and 8 using four (4) decoder iterations for each sixteen-state code in order to provide similar complexity comparison with the eight-state codes using eight (8) decoder iterations. Eight-state codes with eight iterations out perform sixteen state codes with four iterations significantly.
With separate simulations, the difference performance amongst the different terleavers using the above six (6) candidate pairs is observed to be with 0.05 dB .
Finally, the results of Table 2 show that the following rate 1/2 constituent code pair provides the best overall performance across the ranges of rates and Interleaver sizes studied: d(D)=l+D2+D3; n (D) =1+D+D3, which represents octal 13 and octal 15 respectively.
In each tabulated case, the performance of Codes 13-15 is withm 0.05 dB to the best performing code for that rate and Interleaver size.
This constituent code is thus selected as the basis for Turbo Code designs where higher code rates such as 1/2 and 1/3 are dominant .
Rate 1/3 Cons xtuent Code
The following describes how rate 1/3 constituent codes are determined. Similar to the rate 1/2 constituent codes, rate 1/3 constituent code candidates are identified in Table 3 below for building near optimal Turbo Code rates of 1/4 and 1/5. For this case, the constituent code candidates for a Turbo Code must have three (3) polynomials instead of two (2).
Table 3. Candidate Constituent Codes for Optimized
Lower-Rate Turbo Codes
Figure imgf000022_0001
Figure imgf000023_0001
Optimal Rate 1/4 Turbo Codes
In order to build an overall rate 1/4 Turbo Code, various puncturing schemes must be considered in combination with each constituent codes of Table 3.
The various puncturing schemes of Figure 9 are first considered. For a rate 1/4 code, a common input information bit or systematic bit, is transmitted by one encoder, along with three (3) of four (4) parity bits produced for that input bit, by the two encoders.
The puncturing patterns of Figure 9, namely 910, 920, 930 and 940 are selected based upon the previously mentioned design principles, to meet stipulated code rates.
Next, each of the three (3) code triads of Table 3 is combined with the four (4) puncturing patterns 910, 920, 930 and 940, of Figure 9 to produce twelve (12) possible Turbo Codes to be evaluated with simulated data shown in Figure 10 through 12 for a fixed Interleaver depth of 512, for example.
Next, the performance of the twelve (12) Turbo Codes above is used to select three (3) best Turbo Code candidates for a more detailed evaluation. Based on the simulation results shown in Figures 10 through 12, the three (3) best Turbo Code candidates from the twelve (12) are:
Turbo Code A - Constituent Code No. 1 with puncturing Pattern No. 2;
Turbo Code B - Constituent Code No. 2 with puncturing Pattern No. 1; and Turbo Code C - Constituent Code No. 3 with puncturing Pattern No. 1. (Puncturing patterns are selected from Figure 9, Patterns 910, 920, 930 and 940) .
One of the Turbo Codes of Codes A through C is next selected for further evaluation using simulated data at various additional Interleaver frame sizes to verify that the puncturing patterns are also good at other Interleaver depths.
To confirm the basic methodology, the performance of a Turbo Code based upon Constituent Code No. 1 (for example) is simulated for frame sizes of 1024, 2048 and 3072 bits. Sample results for BER/FER performance of Code #1 at 1024 bits is shown in Figure 13 and confirms the basic methodology.
Next, Figure 14 shows the BER/FER performance of simulated data using the three rate 1/4 Turbo Code Candidates A through C at an Interleaver depth of 512 bits. Consistent results are also achieved at Interleaver sizes 1024, 2048 and 3072 bits.
Next, a rate 1/4 Turbo Code candidate is selected from Candidate Turbo Codes A through C which provides the best overall performance at all Interleaver depths, m the simulation resulting m Figure 14 and analogous figures, such as those depicted in Appendix A. In the case of the rate 1/4 Turbo Code, optimization based on BER performance gives a different result than optimization based on FER performance. Turbo Code B has the best overall FER performance and Turbo Code C the best overall BER performance, for the simulated data. Figure 15 shows the performance of Turbo Code B as compared to other puncturing schemes .
Thus, FER optimized Turbo Code B is selected as the basis for the design since FER performance is usually the more important criteria for data services. On the other hand, Turbo Code A can be punctured to give the same universal Turbo Code identified previously as optimal for rate 1/3 (by puncturing all parity bits from the n2 (D) polynomial) . Hence, Turbo Code A is the preferred choice for the forward lmκ rate 1/4 codes in order to have a single universal mother code to implement all of the different code rates.
Although current third generation CDMA encoding primarily concerns rate 1/4 channel encoding on the reverse link, rate 1/3 and rate 1/2 channel coding may be required for some of the highest rate data channels. A universal Turbo Code for rate 1/4, rate 1/3 and rate 1/2 can be designed, wherein the underlying constituent code is the same and only the puncturing pattern used is different. The method for generating the higher rate Turbo Codes from the rate 1/3 constituent code follows.
Rate 1/3 Turbo Codes Optimized at Rate 1/4
Using the constituent codes derived from the rate 1/4 optimized Turbo Codes above, namely Turbo Code B, the rate 1/3 and rate 1/2 Turbo Code can be designed to be compatible thereto. Thus, Constituent Code No. 2 (from Code B) is used as the basis.
Figure 16 shows seven (7) basic puncturing patterns that can be used to produce a rate 1/3 Turbo Code and four (4) basic puncturing patterns to produce a rate 1/2 Turbo Code. The seven (7) rate 1/3 patterns, 1602 through 1614 in block diagram 1600, show the consecutive information puncturing oit patterns, 1620, 1626, and the four (4) corresponding row parity bit puncturing patterns 1622, 1624, 1628, and 1630, for the two (2) encoder puncturing block patterns 1616 and 1618. As before, the pattern "1111" shown in row 1620 always transmits all the information bits from encoder 1. The pattern "0000" of row 1626, always punctures the information b ts that enter by encoder No. 2. This is because it is not necessary to transmit the information bit twice. The four (4) rate 1/2 puncturing patterns, 1 through 4, identified m Figure 16 as element numbers 1640, 1642, 1644, and 1646, follow the same notation.
Next, n Figure 17 the BER and FER performance of all possible rate 1/3 Turbo Codes simulated with the preferred Constituent Code No. 2 at an Interleaver depth 512 are compared.
Then the two (2) best patterns are selected for further consideration. Next, the performance of these two (2) patterns are compared at further Interleaver depths 1024, 2048 and 3078 bits.
In Figure 17, for example, showing the rate 1/3 puncturing patterns at 512 bits, Patterns 2 and 5 are selected based upon curves 1710 and 1720, as having the best and next best overall relative FER, respectively.
Pattern 2 is then selected as the best performer over the various Interleaver depths from further simulations analogous to that of Figure 17 at additional Interleaver sizes for 1024, 2048 and 3072 bits.
Rate 1/2 Turbo Codes Optimized at Rate 1/4
Rate 1/2 Codes can also be optimized at lower rate codes fcr similar compatibility as described above. Figure 18 compares the BER and FER simulated performance of all the rate 1/2 Turbo Codes at an Interleaver depth of 512 bits. Figure 18 is generated using Constituent Code No. 2 and the four (4) puncturing patterns shown in Figure 16 for a rate 1/2 Turbo Code. Patterns 1 and 4 are determined to be the best based upon simulated curves 1810 and 1820 for FER performance.
As in the rate 1/3 case optimized at rate 1/4, similar simulation curves to Figure 18 are done for Patterns 1 and 4 for Interleaver depths of 1024, 2048 and 3072 bits. Based upon the resulting performance/curves Pattern 1 is judged to be the best pattern for FER performance.
Preferred Universal Turbo Codes Optimized for Rate 1/2 and 1/3
Figure 19 shows a block diagram for the constituent encoder optimized m accordance with the previously described method for Turbo Code rates 1/2 and 1/3. Figure 20 shows the block diagram for the corresponding Turbo Code punctured to rate 1/4.
Information bit stream X(t) 1902 is received at a switch 1922, and is processed in accordance with several modular adders 1904, 1908, 1920, 1910, 1914, 1918, 1919, and several shift registers 1906, 1912 and 1916 which are hard-wired to represent two (2) numerator polynomials and one denominator polynomial .
In Figure 19, the denominator polynomial d(D), represented in octal 13, is hardwired by the return feedback connection to modular adder 1920 and 1904. Before computing, three shift registers 1906, 1912 and 1916 are first zeroed.
A first numerator polynomial over a denominator polynomial, represented by "1101" is hardwired to return output Y0(t) by combining: X(t) 1992 with a result of modulator adder 1920 to create a first bit (t); the modular sum (second bit) of shift register 1906 and W(t) from the modular adder 1908; another zero bit (third bit) indicated by the lack of connection to the register 1912; and the modular sum (fourth bit) of another register 1916 and a result of modular adder 1908 from modular adder 1998. The result is Yc (t ) = ( t) +S0 ( t) + S2(t) .
In Figure 19 a second numerator polynomial over a denominator polynomial, represented by "1111", is hardwired to return output Yι(t) by combining: X(t) 1902 with a result of adder 1920 to create a first bit W(t); adding contents of a further register 1906 to W(t) with the contents of the modular adder 1910 (second bit) ; adding contents of the register 1912 a result of adder 1710 with the modular adder 1914 (third bit) ; and adding contents of the other register 1916 to a result of adder 1914 with modular adder 1919 (fourth bit) . The result is Yj. (t ) =W ( t ) +SC (t ) +Sι ( t ) +S2 (t ) .
In Figure 19, the denominator polynomial connections sum the result of the register 1912 with register 1916 at adder 1920 and then adds it to X(t) 1902 at adder 1904. Thus, if modular adder 1904 is the value W(t), register 1906 holds S0(t), register 1912 holds Sι(t) and register 1916 holds S2(t), and adder 1904 produces W (t) =X (t) +S_ (t) +S2 (t) ;
Yo(t)= (t)+S0(t)+S2(t) ; and Y,.(t)= W(t)+So(t)+S.(t)+S2(t) . Thus, the adding is cumulative.
The result of a modular adder is a "1" if the two bits are different, and a "0" if the two bits are the same. Output Y0(t) represents the output from numerator Polynomial No. 1 and the denominator polynomial. Output Yι(t) represents numerator Polynomial No. 2 and denominator polynomial.
Initially, S0=Sι=S2=0 and the values of the registers 1906, 1912, 1916 are shifted from left to right after each clock cycle increment. Thus, S0 (t+1 ) =W (t ) ; Si (t+1) =S0 (t ) , and S2(t+l)=Sι(t) .
The optimal puncturing matrices, shown in Figure 20, for example, shows a "1" for transmitted bits and a "0" for punctured bits. Exemplary Figure 20 shows encoder 2000 with incoming bit X(t) and Interleaver 2002 passing interleaved bits X (t) to encoder 2006 to produce output bit X (t) and parity bits YD (t) , and Yi (t) . None of the interleaved bits x (t) are processed in the rate 1/4 encoder 2004, only in the second rate 1/4 encoder 2006. Block 2010 shows the puncturing pattern matrices. More complicated puncturing patterns can be used to achieve other possible coding rates. For example, it is possible to select optimal puncturing patterns to achieve rate 3/8 and 4/9 for Turbo Codes optimized at rates 1/2 and 1/3; ana to achieve rates 2/9 and 3/8 for Turbo Codes optimized at rate 1/4 using the preferred Turbo Codes identified in the invention.
Similar to Figure 9 the block diagram for an optimal Turbo Code rate 3/8 uses the rate 1/3 mother constituent code of Figure 20. The encoder for the constituent code of Figure 20 is shown in Figure 19. The puncturing pattern of the rate 3/8 Turbo Codes shown Figure 21 punctures 1 out of every 6 bits associated with the first numerator polynomial from both encoders to generate a rate 3/8 Turbo Code.
The second pattern is a extension of the first pattern allowing both constituent encoders to have the same rate, namely 6/11. The extension pattern duplicates the same pattern (matrix) for another three (3) bits but moves the location of one transmission bit from one encoder to another, essentially flipping a "1" in one encoder while flipping a "0" in another encoder at the analogous locations .
Figure 22 shows the performance of these patterns at an Interleaver depth of 512 bits. Based on these and analogous curves at 1024, 2048 and 3072 Interleaver depths, Pattern 2 is chosen to implement the rate 3/8 Turbo Codes.
Figure 23 shows the puncturing patterns selected for rate 4/9 Turbo Codes used with the mother of codes of Figure 20. Similarly, the second pattern is an extension of tne first, which allows both constituent encodes to have the same rate, namely 8/13. — Δ y—
Figure 24 snows the corresponding performance curves. Pattern 2 is chosen to implement the rate 4/9 Turbo Codes.
Thus, one exemplary Turbo Code design, optimized for Turbo Code rates 1/2 and 1/3, and universal for all
Interleaver depths, has the preferred generator polynomials
Figure imgf000031_0001
The preferred puncturing patterns for various code rates are :
1) Rate 1/4 - alternately puncturing parity bits ni from one encoder and n2 from the same encoder;
2) Rate 1/3 - puncturing parity bits n2 from both encoders ;
3) Rate 1/2 - puncturing parity bits n2 and alternately puncturing parity bits
Figure imgf000031_0002
from both encoders;
4) Rate 3/8 - puncturing parity bits n2 and one out of every 6 parity bits ni from both encoders; and
5) Rate 4/9 - puncture parity bits n2 and uniformly 3 out of every 8 parity bits n_ from both encoders.
A simplified version of this code is the universal Turbo Code design consisting of two constituent encoders having generator polynomials d(D)=l+D2+D3 and N, (D) =1+D+D3. (The third polynomial n2(D) is not used, so the corresponding output is not generated and the encoder block diagram is simplified by removing the corresponding connections.) This universal Turbo Code design supports a minimum code rate equal to 1/3 (instead of 1/5) . The corresponding preferred set of puncturing patterns are:
1. Rate 1/3 - no puncturing
2. Rate 1/2 - alternately puncturing parity bits nl from both encoders; 3. Rate 3/8 - puncturing one out of every 6 parity bits ni from both encoders; and
4. Rate 4/9 - puncturing uniformly 3 out of every 8 parity bits nl from both encoders.
Preferred Universal Turbo Codes Optimized for Code Rate 1/4
The basic block diagram for a preferred constituent encoder is shown in Figure 25.
Figure 26 is an encoder block diagram for the preferred rate 1/4 Turbo Code. In this case, the second parity bits are alternately punctured by the two constituent encoders. The preferred puncturing patterns described in earlier section can then be applied to produce rate 1/3 and rate 1/2 Turbo Codes.
Other rates can also be supported by identifying further puncturing patterns. This is illustrated by considering rates 2/9 and 3/8.
Figure 27 shows the puncturing patterns for a 2/9 reverse link code. Three (3) different patterns are compared by performance curves in Figure 28 and analogous curves, such as those set forth, for example, in Appendix A, showing performance at various frame Interleaver sizes. From a Pattern 2 FER curve 2810 and analogous curves, Pattern No. 2 is chosen as the optimal FER pattern for rate 2/9.
Next, Figure 29 illustrates six (6) initial screening puncturing patterns for optimizing a rate 3/8 reverse link codes. The performance of these patterns is simulated at a fixed Interleaver length of 512 bits . Based on the simulation, Pattern 5 and Pattern 6, are chosen as the optimal puncturing patterns for further review.
Two more extension Patterns 7 and 8 of the above Patterns 5 and 6 duplicate the same patterns for another three information bits, but move the location of one of the transmission bits in the parity sequence from one encoder pattern to another. The extension allows both constituent encoders to have the same rate, namely 6/11 at each encoder.
Figure 30 shows exemplary performance curves of the above four (4) candidate puncturing Patterns 5, 6, 7 and 8 for rate 3/8 Turbo Codes. Based on these results, a Pattern 8 FER curve 3010 and analogous curves such as those shown, for example, in Appendix A, demonstrate that Pattern 8 is the optimal puncturing pattern for rate 3/8 Turbo Codes.
Thus, one preferred Universal Turbo Code design optimized for Rate 1/4 uses two constituent codes having polynomials d(D)=l+D+D3, n,=l+D2+D3 and n2=l+D+D2+D3.
The below puncturing patterns are associated optimized patterns as previously discussed for Turbo Code rate 1/4 and FER performance for most commonly used Turbo Code rates, where ni represents output bits associated with a first numerator polynomial, and n2 represents output bits associated with a second numerator polynomial:
1) Rate 1/4 - alternately puncture parity bits n2 from both constituent encoders.
2) Rate 1/3 - puncture parity bits ni from both constituent encoders;
3) Rate 1/2 - puncture parity bits n2 and every other parity bits ni from both encoders;
4) Rate 2/9 - puncture every one out of every four parity bits in ni from both encoders; and
5) Rate 3/8 - puncture parity bits ni and one out of every six parity bits n2. These preferred puncturing patterns can also be cyclically shifted without affecting performance. The cyclically shifted patterns are equivalent.
Turbo Coding FEC Schemes for CDMA Data Services
The set of preferred universal Turbo Codes described heretofore in this invention provide a suite of flexible high performance channel codes that are well suited for sophisticated data communication systems requiring a variety of low speed and high speed data services . This suite of preferred universal Turbo Codes allows the crafting of different Turbo encoding schemes to meet the specific requirements of particular data communication systems.
As a first example, either of the following two FEC schemes is well-suited and recommended for a synchronous CDMA data communications network (such as the third generation CDMA 2000 system currently under development) :
1) A preferred universal Turbo Code optimized at codes rates 1/2 and 1/3, along with a subset of associated preferred puncturing patterns, on a forward link; and a preferred universal Turbo Code optimized at code rate 1/4, along with a subset of the associated preferred puncturing patterns, on a reverse link; and
2) The preferred universal Turbo Code optimized at code rates 1/2 and 1/3, along with a subset of associated preferred puncturing patterns, on both the forward and reverse links.
As a second example, either of the following FEC schemes is well-suited and recommended for an asynchronous CDMA data communications network (such as the third generation UTRA system currently in development in Europe and Asia) : 1) The preferred universal Turbo Code optimized at code rates 1/2 and 1/3, described above, along with a subset of associated puncturing patterns, on both the forward and reverse links;
2) The preferred universal Turbo Code optimized at code rate 1/4, described above, along with a subset of the associated preferred puncturing patterns, on both the forward and reverse links; and
3) The simplified version of the universal Turbo Code, described above, along with a subset of the associated preferred puncturing patterns, on both the forward and reverse links; and
The choice of which option to implement depends on the expected dominant code rate, minimum code rate, and implementation complexity constraints as well as other system requirements. Of course, additional puncturing patterns could be designed accordance with the teachings of this invention to provide other Turbo Coding rates .
Other Variations
The universal Turbo Codes identified for high-speed data services are especially suitable for third generation CDMA cellular mobile radio systems but could be easily applied to other systems as well.
Well known variations such as Frame Oriented Convolutional Turbo Coding (FOCTC) could also be used in conjunction with the preferred universal constituent codes and universal Turbo Codes of this invention. The design methodology for selecting universal constituent codes and universal Turbo Codes can also be applied to alternate Turbo Code structures such as those involving more than two constituent encoders, and those involving serial concatenation instead of or in addition to parallel concatenation .
The exemplary preferred puncturing patterns described herein can be refined or modified m various ways by those skilled m the art. For example, a cyclic shift of a preferred puncturing pattern offers substantially equivalent performance as the preferred puncturing pattern described herein. Furthermore, specific data communication systems may require different and additional puncturing patterns to support rate matching. These puncturing patterns may be designed accordance with the teachings of the present invention.
Sets of Rate-Compatible Universal Turbo Codes
In accordance with the present invention, it is possible to provide sets of rate-compatible Turbo Codes that are uniformly optimal or nearly optimal over a AWGN channel for various code rates and various Interleaver depths by assuring that any given higher rate Turbo Code of a set transmits the same bit positions as transmitted by any other lower rate Turbo Code of a same set.
In particular, one embodiment includes a set of rate- compatible Turbo Codes at various code rates of 1/5, 1/4, 1/3 and 1/2 and also at various Interleaver depths from 512 to 3072 bits.
Another preferred embodiment provides multiple sets of Turbo Codes optimized under different conditions allowing a system designer to trade off degree of universality (and thus, complexity) with performance and vice a versa. The selection of sets of rate-compatible Turbo Codes is based upon the universal constituent encoder described herein below.
The universal constituent encoder of the present invention provides optimal or nearly optimal performance over a large range of code rates and Interleaver depths. Different optimization criteria such as reverse link or forward link dominance and degree of universality, result m different sets of rate-compatible Turbo Codes.
The sets of rate-compatible codes are especially well suited for use in hybrid ARQ schemes applied m satellite broadcast and telephony.
Several preferred embodiments comprise different sets of rate-compatible codes based upon different universal constituent codes and different rate puncturing patterns optimized according to different design criteria.
Consistent with general methodologies of the present invention, four (4) different preferred sets of rate- compatible Turbo Codes are described herein. The first two (2) sets are optimized for high-rate Turbo Codes, wherein higher-rates dominate. The second two (2) sets are optimized for lower-rate codes, where lower-rates dominate. The sets are referred to herein as Sets A-D.
The first preferred set is derived from a best universal constituent code of rate 1/2.
The second set is derived from another best constituent code of rate 1/3 which is also compatible with the universal constituent code of rate 1/2.
The first set, "Set A" has two generator polynomials while the second set, "Set B" has three generator polynomials of which two are in common with "Set A". Thus, "Set B" is optimally compatible with "Set A", reducing the amount of design changes for encoding and decoding. As before, the thirα polynomial is necessary for the additional encoder parity bits of a rate 1/3 or lower Turbo Code.
The second set, "Set B" includes "Set A" and also extends the ramily of Turbo Codes to rate 1/5 and higher.
A third and fourth preferred set of rate- compatible Turbo Codes are optimized for lower-rates, in particular for rate 1/4. "Set C" and "Set D", respectively, also use three generator polynomials which are the same as those in "Set B", but a different order.
Rate-Compatible Set Derived from Universal Constituent Codes of Rate 1/2: Set A (Rates 1/3, 1/2)
From Table 2, it is determined that the rate 1/2 constituent code providing the best overall performance is octal pair 13-15. Thus, this constituent code pair is used as the mother constituent code pair for Set A.
Rate-compatible Set A comprises generator polynomials corresponding to octal pairs 13-15, wherein a denominator polynomial is 1+D +D (octal 13) and a numerator polynomial is 1+D+D (octal 15) .
The puncturing patterns are designed such that all bits transmitted by a rate of 1/2 code (or higher rate) of the set are also transmitted by a rate 1/3 code, or lower rate code of the set.
Exemplary preferred patterns as demonstrated by simulations and design principles are:
1) For rate 1/3 there is no puncturing; and
2) For rate 1/2, the parity bits are alternately punctured between encoders. (Note that there is no second numerator polynomial encoding m this case.) Figure 31 shows a block diagram for the Set A constituent encoder. In Figure 31, modular adders 3104, 3108 (connected to shift register 3106) , and 3116 (connected to shift register 3114) comprise the encoding apparatus for a numerator polynomial representing octal 15 or binary 1101.
Modular adders 3104, 3108, 3112 and 3116 add the contents of shift registers 3106, 3110 and 3114 and X(t) in an analogous fashion as Figure 19.
Simulated performances of the rate 1/2 Turbo Code and the rate 1/3 Turbo Code show that the eight-state convolutional codes designed herein (with 8 decoder iterations) have a performance gain (BER) of about 1.6 dB at rate 1/2 and about 2.0 dB at rate 1/3 with respect to the best 256-state convolutional codes known, according to simulation data produced by the Applicant.
Thus, the Turbo Codes of Set A compare favorably in performance to the best known 256-state convolutional codes, when simulated for the critical performance parameters.
Rate-Compatible Set Derived from Universal Constituent Code of Rate 1/3: Set B (Rates 1/2, 1/3, 1/4, 1/5)
As in the case of determining universal constituent codes of rate 1/3 an additional output numerator polynomial is required for the rate-compatible generator polynomials of "Set B" derived from the best constituent code of rate 1/3.
Therefore, a second best individual rate 1/2 constituent code is chosen from Table 2. As before, this method results in two (2) octal pairs with an overlap. Both octal pairs, octal 13-15 and octal 13-17 provide uniformly excellent performance. Combining the two (2) pairs together provides three (3) generator polynomials, comprising the triad octal 13-15/17. The denominator polynomial is 1+D+D3 (octal 13); the first numerator polynomial is 1+D"+DJ (octal 15); and the second numerator polynomial is 1+D+D +D (octal 17). The preferred design for Set B comprises these generator polynomials above for all Interleaver depths and for Turbo Code rates 1/2, 1/3, 1/4 and 1/5.
In Set B the rate 1/3 and rate 1/2 Turbo Codes built from the rate 1/3 constituent encoder are the same 1/3 and 1/2 Turbo Codes in Set A built from the universal rate 1/2 constituent encoder, preserving the compatibility between Set A and Set B.
The puncturing patterns are designed such that all bits transmitted at any higher rate Turbo Code of Set B are also transmitted at any lower code rate of Set B.
Exemplary preferred patterns, as demonstrated by simulations and design principles, are:
1) Rate 1/5 - no puncturing;
2) Rate 1/4 - alternately puncture the second numerator parity bits, n2;
3) Rate 1/3 - always puncture the second numerator parity bits, n2; and
4) Rate 1/2 - always puncture the second numerator parity bits, n2 and alternately puncture the first numerator parity bits, ni .
For the rate 1/4 pattern the weaker of the two (2) output arms of the constituent encoders are alternately punctured.
For the rate 1/3 pattern, the weaker of the two (2) constituent encoder outputs is always punctured.
For rate 1/2 the weaker of the two (2) constituent encoder outputs is always punctured for both encoders and the stronger output is alternately punctured. Rate-Compatible Set Optimized for Lower Turbo Code Rates
When higher code rates are the dominant modes Turbo Code Set B is the preferred design choice when strict rate- compatibility is required in all code rates.
Turbo Code Set C and Set D, both optimized at the lower Turbo Code rates, are useful when rate-compatibility between lower rate and higher rate Turbo Codes is not necessary.
The optimal Turbo Codes for rates 1/4 and 1/5 are selected based upon the candidate constituent codes listed in Table 3 which are selected based upon the results of Table 2 as previously described above.
Constituent Code No. 1 of Table 3, or octal 13-15/17, is the basis for code Set A. However, disbanding the requirement that the rate 1/4 puncturing pattern be rate- compatible with that of the rate 1/2 or 1/3 codes, in the event that lower rates are not used with higher rates, each three (3) mother Turbo Code triad of Table 3 is considered with each of four (4) different puncturing patterns to obtain a newly optimized 1/4 Turbo Code.
As described before, Turbo Codes A, B, and C are found optimal from respective performance curves 1010, 1110 and 1210 of Figures 10, 11 and 12 respectively.
As before, these puncturing patterns are also verified at other Interleaver depths by simulating the performance of the Turbo Codes based on mother code triad No. 1 for additional other Interleaver frame sizes of 1024, 2048 and 3072. Figure 13 shows a sample result of the simulation and confirms the basic methodology at 1024 bits.
Next, Figure 14 shows a sample corresponding performance of the triads matched with the selected puncturing patterns at 512 bits. From Figure 14 and analogous results for other Interleaver sizes, the best overall BER performance at all simulated Interleaver depths are used as a final design criterion to determine the optimal candidate.
Rate-Compatible Set Derived from Rate 1/4 Turbo Code: Set C (Rates 1/5, 1/4, 1/3)
Turbo Code Set C implements Code No. 3 and Pattern No. 1 (Turbo Code C) from Figure 9 in accordance with performance curve 1310 of Figure 14 and analogous curves for other Interleaver sizes.
Turbo Code Set C comprises a generator polynomial from Table 3 including denominator polynomial 1+D+D +D , first
2 3 numerator polynomial, nx, 1+D +D , and second numerator polynomial n2 1+D+D . The optimal puncturing patterns from the simulation, as previously described and consistent with the methodology, are:
1) For rate 1/5 - no puncturing;
2) For rate 1/4 - alternately puncturing the second numerator polynomial; and
3) For rate 1/3 - always puncturing the second numerator polynomial .
Rate-Compatible Set Derived from Rate 1/4 Turbo Code: Set D (Rates 1/5, 1/4)
Turbo Code Set D comprises a single constituent code for all Interleaver depths and Turbo Code rates 1/4 and 1/5.
Turbo Code Set D implements Code No. 1 with Pattern No. 2 (Turbo Code A) from Figure No. 9 in accordance with performance curve 1420 of Figure 14 and analogous curves at other Interleaver sizes. The set comprises generator polynomials including a denominator polynomial d, 1+D+D , a first numerator polynomial, nx, 1+D +D" and second numerator polynomial, n2, 1+D+D +D .
The optimal puncturing patterns from the simulation previously described and consistent with the methodology is:
1) For rate 1/5 - no puncturing; and
2) For rate 1/4 - alternately puncture output 1/2. Performance of the rate 1/4 FER optimized Turbo
Code at selected Interleaver depths of 512 through 3072 bits are compared against convolutional codes in sample Figure 32 and analogous studies .
More complicated puncturing patterns may be used in convolutional coding to achieve any code rate greater than or equal to that of the base Turbo Code in each rate-compatible Set.
For example, rates higher than 1/2 or intermediate rates such as 5/12 can be achieved. With the appropriate choice of puncturing patterns this can often be done in a rate- compatible manner without sacrificing error correction performance .
Applications of Rate-Compatible Turbo Codes
An exemplary application of the rate-compatible turbo codes described herein is for rate matching in which the code rate is selected to match the payload of an available physical channel. In rate matching schemes, the data services use the same basic channel encoding but may not use the same physical channel, especially if the quality of service specifications are different for the different data services. In accordance with the present invention, this is accomodated by selecting different puncturing patterns to produce the code rate compatible with the physical channel. If the puncturing patterns are rate-compatible, the selection of code rate does not have to be completed by single decision unit at a single point in time. Instead, the decision can be distributed in time as well as across decisioning units. The turbo encoder first produces the coded output sequence corresponding to the lowest code rate to be supported by the system. For example, all the possible parity bits might be output initially. Subsequently, an initial puncturing might be performed, by one puncturing unit in response to say quality-of-service (QoS) considerations for the given data service. In this scenario, the data service may permit a range of quality-of-service in which, for example, the highest quality within that range does not require the lowest possible code rate available in the system but some intermediate code rate, and the lowest quality within that range can allow an even higher code rate. The first puncturing unit removes coded bits in accordance with the puncturing pattern corresponding to the lowest rate in order to provide the highest quality within the data service's QoS range. The non- punctured coded bits are output to the rest of the system for further processing. In the subsequent processing, a decision might be made to adjust the code rate higher for that message based on dynamic traffic management considerations . For example, a physical channel with smaller payload might be substituted, on a temporary as-needed basis, for the physical channel nominally associated with that data service in order to accomodate messages from a higher priority data service. The higher code rate is achieved by performing a second puncturing in accordance with the puncturing pattern associated with the new code rate. Since the puncturing patterns are rate-compatible, it is not necessary to regenerate coded bits deleted by the first puncturing unit; the second puncturing unit simply deletes those bits specified by the higher rate puncturing pattern that have not already been deleted by the first puncturing unit.
A second exemplary application of the rate-compatible turbo codes described herein is for incremental redundancy schemes such as error control based on ARQ protocols. In these schemes, the turbo encoder first produces coded output corresponding to the highest code rate available in the system. When the coded output is transmitted across the communication channel, the receiver may or may not be able to successfully decode the message. If the message is not successfully decoded, the receiver typically sends a negative acknowledgement (NAK) back to the transmitter to request further transmissions to aide the decoding of that packet. With rate-compatible channel encoding, the extra encoded bits produced by one of the lower-rate compatible encodings for that packet can be sent to augment the information available to the decoder at the receiver. The decoder uses that new information along with the original information received for that packet to perform the decoding. The effect is as if the packet had been originally encoded with the lower rate code. This process can be repeated until the packet is successfully decoded. By only sending the excess coded bits each retransmission, the traffic loading required for re-transmission is significantly lowered. While the invention herein disclosed has been described by means of specific embodiments and applications thereof numerous modifications in variations could be made thereto by a skilled artisan and without departing from the scope of the invention set forth in the claims .
APPENDIX A
Info bits
Parity
Constituent Bits
-* Puncture Encoder # 1
Parity
Constituent Bits
Interleaver Encoder #2
Generic Turbo Code Encoder Block Diagram
Appendix Fig. A-l
HUGHES PROPRIETARY
THIS DOCUMENT CONTAJNS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY SUCH INFORMATION SHAUL NOT BE PUOUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO ALL DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000048_0001
SIGNATURE INVENTOR DATE
READ ANO UNDERSTOOD BY
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE) SIGNATURE DATE
236 Λ-1 CS AUO 80 (EACH PAGE UPON WHICH INFORMATION IS ENTE ED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000048_0002
extrinsic extrinsic a priori — - Constituent De- Constituent
Interleaver received Decoder // ! intericaver Decoder #2 soft values son output
Appendix Fig. A-2 Generic Turbo Decoder Clock Diagrnr
The criterion for designing a good convolutional code is different from the conventional approach of maximizing minimum Hamming distance, when the convolutional code is used as a constituent code in turbo codes. In this case. the systematic, recursive convolutional code should be designed [1] so as to maximize the minimum parity weight corresponding to information sequences of weight two that cause the trellis diverge from the zero state and later remerge to it.
Due to the nature of the Turbo code construction, this design criterion depends in an essential way on the Turbo code's interleaver and puncturing scheme, thus requiring that the optimization be done for a specific interleaver depth and code rate. In the next section, we look at designing "universal" constituent codes that provides optimal or nearly optimal performance in conjunction with a variety of different interleaver depths and Turbo code rates.
Search for "Universal" Constituent Codes
In searching for universal constituent codes, we limit ourselves to 8-state constituent codes, since previous work has demonstrated that they provide the best trade-off between performance and implementation complexity. For the
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO ALL DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000049_0001
SIGNATURE INVENTOR READ ANO UNOERSTOOO BY.
WITNESS NAME (TYPE)
WITNESS NAME (TYPE) SIGNATURE DATE
Wβ A-1 CS AUG 80 (EACH PACE UPON WHICH 1NFOKMΛVON IS ENTERED SHOULD BE SICNED ANO WITNESSED)
Figure imgf000049_0002
Pattern 1 Pattern 2 Pattern 3 Pattern 4 Pattern 5 Pattern 6 Pattern 7
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i l
1 1 1 1 0000 1010 1 1 10 1 1 1 1 1 1 10 0001
0000 1 1 1 1 0101 0001 D o o_or, ^ 0001 1 1 10
0000 0000 0000 0000 0000 0000 0000
1 11 1 0000 1010 0001 0000 1 1 10 0001
0000 1 1 1 1 0101 1 11 1 1 1 1 1 0001 1 1 10
(a) Turbo Code Rate = 1/3
Pattern 1 Pattern 2 Pattern 3 Pattern 4
1 1 1 1 1 11 1 1 1 1 1 1 1 11 1010 0000 1000 1010 0000 1010 0010 0000
0000 0000 0000 0000 0101 0000 0001 0000 0000 0101 0100 0101
(b) Turbo Code Rate = 1/2
Appendix Fig. A-3 Essential Puncturing Patterns for Rate 1/3 Constituent Codes
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRTTTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHEO. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE ΛPPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000050_0001
SIGNATURE INVENTOR
READ ANO UNOERSTOOO BY-
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
233 A-l CS AJJG 80 (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED ANO WITNES
Figure imgf000050_0002
Figure imgf000051_0001
Ebi/No (dB)
Appendix Fig. A- Rate-1/2 turbo codes on A GN channel. (1000 bit interleaver, 3 iterations)
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHALL NOT BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGENO SHALL BE APPUED TO ALL DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000051_0002
SIGNATURE INVENTOR READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE) SIGNATURE DATE
WITNESS NAME (TYPE) SIGNATURE
23β Λ-1 CS ALK5 SO (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000052_0001
0.60 0.80 1.00 1.20
Ebi/No (dB)
Appendix Fig. A-5 Rate-1/3 turbo codes on AWGN channel. (1000 bit interleaver, 3 iterations)
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPUEO TO AU DOCUMENTS CONTAINING THIS INFORMATION.
PATENT DOCKET NO.
Figure imgf000052_0002
SIGNATURE INVENTOR OATE READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE) SIGNATURE OATE
238 Λ-1 CS AUG 80 (EACH PAGE UPON WHICH INFORUA TIO IS ENTERED SHOULD BE SIGNED ANO WI TNESSED)
Figure imgf000052_0003
Figure imgf000053_0004
Figure imgf000053_0001
1.20 1.30 1.40 1.50 1.60 1.70 1.80 1.90 2.00
Ebi/No (dB)
Appendix Fig. A-6 Selected rate 1/2 turbo codes on AWGN channel, 512 bit frame size
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE Af THE DOCUMENT SHALL NOT CS DUPUCATTD IN WHOLE OR IN PART. THIS LEGENO SHALL BE APPUED TO ALL DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000053_0002
SIGNATURE INVENTOR OATE READ ANO UNDERSTOOD BY.
WITNESS NAME (TYPE)
WITNESS NAME (TYPEl SIGNATURE
I3β Λ-1 CS AUQ SO (EACH PAGE VON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED ANO VΛTNESSED)
Figure imgf000053_0003
Figure imgf000054_0001
Figure imgf000054_0003
1.00 1.10 1.20 1.30 1.40 1.50 1.60 1.70 1.80
Ebi/No (dB)
Appendix Fig. A-7 Selected rate 1 2 turbo codes on AWGN channel, 1024 bit frame size
HUGHES PROPRIETARY
Figure imgf000054_0002
Figure imgf000055_0001
Figure imgf000055_0004
0.80 0.90 1.00 1.10 1.20 1.30 1.40 1.50
Ebi/No (dB)
Appendix Fig. A-S Selected rate 1 2 turbo codes on AWGN channel, 204S bit frame size
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPUCATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO ALL DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000055_0002
READ ANO UNOERSTOOO BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
239 Λ-1 CS AUQ 90 (EACH PAGE UPON WHICH INFORUAVON IS ENTERED SHOULD BE SIGNED ANO VΛTNES
Figure imgf000055_0003
Figure imgf000056_0001
0.70 0.80 0.90 1.00 1.10 1.20 1.30 1.40 Ebi/No (dB)
Appendix Fig. A-9 Selected rate 1 2 turbo codes on AWGN channel, 3072 bit frame size
HUGHES PROPRIETARY
Figure imgf000056_0002
READ AND UNDERSTOOD BY.
Figure imgf000056_0003
Figure imgf000057_0001
0.50 0.60 0.70 0.80 0.90 1.00 1.10 1.20 1.30
EbF/No (dB)
Appendix Fig. A- 10 Selected rate 1/3 turbo codes on AWGN channel, 512 bit frame size
HUGHES PROPRIETARY
Figure imgf000057_0002
Figure imgf000058_0001
0.20 0.30 0.40 0.50 0.60 0.70 0.80 0.90 1.00
Ebi/No (dB)
Appendix Fig. A-l 1 Selected rate 1 3 turbo codes on AWGN channel, 1024 bit frame size
HUGHES PROPRIETARY
Figure imgf000058_0002
Figure imgf000059_0001
0.10 0.20 0.30 - 0.40 0.50 0.60 0.70 0.80
Ebi/No (dB)
Appendix Fig. A-12 Selected rate 1 3 turbo codes on AWGN channel, 2048 bit frame size
HUGHES PROPRIETARY
Figure imgf000059_0002
Figure imgf000060_0001
0.00 0.10 0.20 0.30 0.40 0.50 0.60 0.70
Ebi/No (dB)
Appendix Fig. A-13 Selected rate 1/3 turbo codes on AWGN channel, 3072 bit frame size
HUGHES PROPRIETARY
Figure imgf000060_0002
Figure imgf000061_0001
1.20 .1.30 1.40 1.50 1.60 1.70 1.80 1.90 2.00
Ebi/No (dB)
Appendix Fig. A- 14 Performance impact of different interleavers, rate=0.5,. frame: 512 bits
HUGHES PROPRIETARY
Figure imgf000061_0002
Figure imgf000062_0001
0.80 0.90 1.00 1.10 1.20 1.30 1.40 1.50
Ebi/No (dB)
Appendix Fig. A- 15 τlιe effect of different Interleavers, rate=0.5, frame: 2048 bits
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPUCD TO ALL DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000062_0002
SIGNATURE INVENTOR
READ AND UNDERSTOOD BY
23β A-1 CS AUG BO (EACH PAGE UPON MIC* INFORMATION IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000062_0003
Figure imgf000063_0001
0.70 0.80 0.90 1.00 1.10 1 .20 1 .30 1 .40
Ebi/No (dB)
Appendix Fig. A- 16 The effect of different interleavers, rate=l/2, frame: 3072 bits
HUGHES PROPRIETARY
Figure imgf000063_0002
READ AND UNDERSTOOD BY:
Figure imgf000063_0003
Figure imgf000064_0001
Puncturing Schemes Studied for Optimizing the Rate 1/4 Turbo Code
Appendix Fig. A- 17
HUGHES PROPRIETARY
WITNESS NAME (TYPE)
Figure imgf000064_0002
Figure imgf000065_0001
0.2 .0,3 0.4 0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
Appendix Fig. A-18 Performance of Code #1, Frame Size=512
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAα NOT BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPUCD TO A DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000065_0002
SIGNATURE INVENTOR
READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE)
23β Λ-1 CS AUO SO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000065_0003
Figure imgf000066_0001
0.2 ' 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
Appendix Fi". A- 19 Performance of Code #2, Frame Size=512
HUGHES PROPRIETARY
Figure imgf000066_0002
Figure imgf000067_0001
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
Appendix Fig. A-20 Performance of Code U3, Frame Size=512
HUGHES PROPRIETARY
Figure imgf000067_0002
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
WtTNESS NAME (TYPE)
Figure imgf000067_0003
Figure imgf000068_0001
Ebi/No (dB)
Appendix Fig. A-21 BER/FER Performance of Code #1, Frame SLze=l 024
HUGHES PROPRIETARY
( / SIGNATURE INVENTOR
Figure imgf000068_0002
Figure imgf000069_0001
-0.1 0.0 0.1 0.2 0.3 Ebi/No (dB)
Appendix Fig. A-22 BER FER Performance of Code #1, Frame Size=2048
HUGHES PROPRIETARY
Figure imgf000069_0002
Figure imgf000070_0001
-0.2 -0.1 0.0 0.1 0.2 0.3
Ebi/No (dB)
Appendix Fig. A-23 BER/FER Performance of Code #1, Frame Size=3072
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAα NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000070_0002
READ AND UNDERSTOOD BY.
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
23S A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED AND WITNESSED)
Figure imgf000070_0003
Figure imgf000071_0001
0.2 0.3 0.4 0.5 0.6 0.7 0.8
Ebi/No (dB)
Appendix Fig. A-24 BER/FER Performance of Selected Rate-1 4 Turbo Codes, Frame Sizc=512
HUGHES PROPRIETARY
Figure imgf000071_0002
Figure imgf000072_0001
o.o 0.1 0.2 0.3 0.4 0.5
Ebi/No (dB)
Appendix Fig. A-25 BER/FER Performance of Selected Rate-1 4 Turbo Codes, Frame Size=1024
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRTTTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION
SIGNATURE INVENTOR
SIGNATURE INVENTOR
READ AND UNDERSTOOD BY-
WITNESS NAME (TYPO SIGNATURE DAT!
23β Λ.1 CSAUQ BO (EACH PAGE UPON MUC INFORMATION IS ENTERED SHOULD BE S1GNEO ANO WTTNESSEO)
Figure imgf000072_0002
-61 -
Figure imgf000073_0001
-0.1 0.0 0.1 0.2 0.3 0.4
Ebi/No (dB)
Appendix Fig. A-26 BER/FER Performance of Selected Rate-1/4 Turbo Codes, Frame SLze=2048
HUGHES PROPRIETARY
Figure imgf000073_0002
Figure imgf000074_0001
-0.2 -0.1 0.0 0.1 0.2 0.3
Ebi/No (dB)
Appendix Fig. A-27 BER FER Performance of Selected Rate-14 Turbo Codes, Frame Sizc=3072
HUGHES PROPRIETARY
Figure imgf000074_0002
Figure imgf000075_0001
0.2 0.3 0.4 0.5 0.6 0.7 0.8
Ebi/No (dB)
Appendix Fig. A-28 Comparison against other puncturing schemes, frame= 512.
HUGHES PROPRIETARY
THIS OOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WP TTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT EE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000075_0002
SIGNATURE INVENTOR
READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE) SIGNATURE
23S A-1 CS AUO BO (EACH PACE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000075_0003
Figure imgf000076_0001
Ebi/No (dB)
Appendix Fig. A-29 Comparison of rate 1/3 puncturing schemes, frame = 512
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000076_0002
SIGNATURE INVENTOR
READ ANO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPED
J3β Λ-1 CS AUG βO (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED ANO HI
Figure imgf000076_0003
Figure imgf000077_0001
0.2 0.3 0.4 0.5 0.6 0.7 0.8
Ebi/No (dB)
Appendix Fig. A-30 Rate 1/3 Puncturing Schemes, frarae=1024
HUGHES PROPRIETARY
Figure imgf000077_0002
SIGNATURE
Figure imgf000077_0003
Figure imgf000078_0001
0.0 0.1 0.2 0.3 0.4 0.5 0.6
Ebi/No (dB)
Appendix Fig. A-31 Rate 1/3 Puncturing Comparison, frame=2048
HUGHES PROPRIETARY
Figure imgf000078_0002
Figure imgf000079_0001
Ebi/No (dB)
Appendix Fig. A-32 Rate 1 3 Puncturing Comparison, framc=3072 HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY SUCH INFORMATION SHAU NOT BE PUBLISHED. OR DISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART THIS LEGENO SHALL BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000079_0002
Figure imgf000080_0001
Ebi/No (dB)
Appendix Fig. A-33 Rate 1/2 Puncturing Comparison, frame=512
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PL'BUSHEO. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT EE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE ΛPPUCD TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Uu.≠^jfi^
Figure imgf000080_0002
READ ANO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
239 Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000080_0003
Figure imgf000081_0001
Ebi/No (dB)
Appendix Fig. A-34 Ra e 1/2 Puncturing Comparison, frame=1024
HUGHES PROPRIETARY
Figure imgf000081_0002
Figure imgf000082_0001
Appendix Fig. A-35 Rate 1 2 Puncturing Comparison, frame=2048 HUGHES PROPRIETARY
Figure imgf000082_0002
Figure imgf000083_0001
0.6 0.7 0.8 0.9 1.0 1.1 1.2
Ebi/No (dB)
Appendix Fig. A-36 Rate 1 2 Puncturing Comparison, frame=3072 HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAα NOT BE PUBLISHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000083_0002
SIGNATUR- VENTOR OATE
READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE)
23β Λ-1 CSAUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000083_0003
Figure imgf000084_0001
Appendix Fig. A-37 Universal Constituent Encoder Recommended for Forward Link Turbo Codes of Varying Interleaver Depth
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WTTH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS OR USEO FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000084_0002
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
Figure imgf000084_0003
Figure imgf000085_0001
Appendix Fig. A-3 S Forward Link Turbo Code of Rate 1/4 (Mother code in Figure 37)
HUGHES PROPRIETARY
Figure imgf000085_0002
SIGNATURE
Figure imgf000085_0003
Figure imgf000086_0001
Appendix Fig. A-39 Forward Link Turbo Code of Rate 1/3 (Mother code in Figure 37)
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT BE PUBUSHED, OR D1SCLOSEO TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000086_0002
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
736 Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED AND WITNES
Figure imgf000086_0003
Figure imgf000087_0001
Appendix Fig. A-40 Foπvard Link Turbo Code of Rate 1 2 (Mother code in Figure 37)
HUGHES PROPRIETARY
Figure imgf000087_0002
Figure imgf000088_0001
0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2 2.4 2.6 2.8 3.0
Ebi/No (dB)
Appendix Fig. A-41 Comparison of Universal Turbo Code and Optimal Convolutional Code at Rate 1/2
HUGHES PROPRIETARY
Figure imgf000088_0002
Figure imgf000089_0003
Figure imgf000089_0001
0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2 2.4
Ebi/No (dB)
ADDendix Fi" A-42 Comparison of Universal Turbo Code and Optimal Convolutional Code at Rate 1/3
HUGHES PROPRIETARY
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
Figure imgf000089_0002
Figure imgf000090_0001
Appendix Fig. A-43 Constituent Encoder for Reverse-Link Turbo Code
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBLISHED. OR OISCLOSCO TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED O AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000090_0002
SIGNATURE INVENTOR READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
Mβ A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000090_0003
Puncturing
Figure imgf000091_0001
Appendix Fig. A- 4 Reverse-Link Turbo Code of Rate 1/4 (Mother code in Figure 43)
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBLISHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000091_0002
SIGNATURE INVENTOR OATE
READ AND UNDERSTOOD BY.
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE)
23β A-1 CSAUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000091_0003
Puncturing
Figure imgf000092_0001
Appendix Fig. A-45 Reverse Link Turbo Code of Rate 1/3 (Mother code in Figure 43)
HUGHES PROPRIETARY
Figure imgf000092_0002
Puncturing
Figure imgf000093_0001
Appendix Fig. A-46 Reverse Link Turbo Code of Rate '/. (Mother code in Figure 43)
HUGHES PROPRIETARY
Figure imgf000093_0002
Figure imgf000094_0001
0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2
Ebi/No (dB)
Appendix Fig. A-47 Comparison of Ratc-1/4 FER-Optimized Turbo Code vs Convolutional Code, Frame Size=512
HUGHES PROPRIETARY
Figure imgf000094_0002
ra C
L cU Φ
E ra
"-
0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2
Ebi/No (dB)
Appendix Fig. A-48 Comparison of Rate-1/4 FER-Optimized Turbo Code vs Convolutional Code, Frame Size=»1024
HUGHES PROPRIETARY
Figure imgf000095_0002
Figure imgf000096_0001
-0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1 .6 1.8 2.0 2.2
Ebi/No (dB) appendix Fig. A-49 Comparison of Ratc-1/4 FER-Optimized Turbo Code vs Convolutional Code, Frame Size=2048
HUGHES PROPRIETARY
Figure imgf000096_0002
Figure imgf000097_0001
2
Ebi/No (dB)
-eπdix Fig. A-50 Comparison of Rate-1/4 FER-Optimized Turbo Code vs Convolutional Code, Frame Size=3072
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBLISHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUEO TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000097_0002
SIGNATURE INVENTOR READ ANO UNDERSTOOD BY.
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE) SIGNATURE
23β A-1 CS ΛUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANOW
Figure imgf000097_0003
Figure imgf000098_0001
3.0 4.0 5.0 6.0 7.0 8.0 9.0
Ebi/No (dB)
Appendix Fig. A-51 Rayleigh fading channel, 30 mph, frame ■= 512.
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSCO TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART. THIS LEGEND S>tAU BE APPLIED TO ALL DOCUMENTS CONTAINING THIS INFORMATIOtL
Figure imgf000098_0002
SIGNATURE INVENTOR OATE
READ ANO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
TM A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO MTNESSED)
Figure imgf000099_0001
3.0 4.0 5.0 6.0 7.0 8.0 9.0
Ebi/No (dB)
Appendix Fig. A-52 Rayleigh fading, 30 kph, frame <= 1024. , .UGHES PROPRIETARY
Figure imgf000099_0002
Figure imgf000100_0001
Ebi/No (dB)
Appendix Fig. A-53 Rayleigh, 30 kph, frame = 2048.
, .LJ HES PROPRIEΞTARY
Figure imgf000100_0002
I — »— Recommended Turbo Code (coda B) BER —o— Recommended Turbo Coda (code B) FER -*-g1(D) 63. g2(D)=535. g3(0)=733 g4(D)=745. BER -Λ-βl(D) 63. g2(0)=S3S. g3(D)=733. g4(0)=745. FER
Figure imgf000101_0001
3.0 4.0 5.0 6.0 7.0 8.0 9.0
Ebi/No (dB) pendix Fig. A-54 Raylei h, 30 kph, frame - 3072. ..-JHES PROPRIETARY
THIS DOCCMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT-BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO AU OOCUMCNTS CONTAINING THIS INFORMATION.
Figure imgf000101_0002
READ ANO UNDERSTOOD BY.
733 A-1 CS AUG 80 (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO
Figure imgf000101_0003
Pattern 1 Pattern 2
111 mm 111 111110
000 oooooo
000 oooooo 110 110111 000 oooooo ppendix Fig. A-55 Puncturing patterns for rate 3/S forward link codes
HUGHES PROPRIETARY
Figure imgf000102_0001
Figure imgf000103_0004
Figure imgf000103_0001
0.7 0.8 0.9 1.0 1.1 1.2 1.3
Ebi/No (dB)
Appendix Fig. A-56 Rate 3/8 Forward Link Turbo Codes, Frame=S12, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR N PART. THIS LEGEND SHAU BE APPUED TO ALL DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000103_0002
SIGNATURE INVENTOR READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE) SIGNATURE
239 A-1 CSAUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000103_0003
Figure imgf000104_0001
0.4 0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
.ppendix Fig. A-57 Rate 3/8 Fonvard Link Turbo Codes, Frame=1024, AWGN channel
HUGHES PROPRIETARY
Figure imgf000104_0002
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
Figure imgf000104_0003
Figure imgf000105_0001
Ebi/No (dB)
Appendix Fig. A-58 Rate 3/8 Fonvard Link Turbo Codes, Frame=2048, AWGN channel
HUGHES PROPRIETARY
THISOOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU. NOT BE PUBUSHED. OR OISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000105_0002
SIGNATURE INVENTOR READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE)
SIGNATURE
TM Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO
Figure imgf000105_0003
Figure imgf000106_0001
0.2 0.3 0.4 0.5 0.6 0.7 0.8
Ebi/No (dB)
Appendix Fig. A-59 Rate 3/8 Forward Link Turbo Codes, Frame=3072, AWGN channel
HUGHES PROPRIETARY
TMS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE ΛPPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000106_0002
READ ANO UNDERSTOOD BY.
WITNESS NAME (TYPE! SIGNATURE
WITNESS NAME (TYPE)
234 Λ-1 CS AUO BO (EACH PAGE UFON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANOS TNESSED)
Figure imgf000106_0003
Pattern 1 Pattern 2
1111 11111111 1101 11011010 000.0 00000000
0000 00000000 1010 10101101 0000 00000000
Dendix Fig. A-60 Puncturing patterns for rate 4/9 forward link codes
HUGHES PROPRIETARY
Figure imgf000107_0001
-Pattern 1. OER →>- Pattern 1. FER ^
-Pallem 2 BER -ft- allem 2 FER ς
Figure imgf000108_0001
1.0 1.1 1.2 1.3 1.4 1.5 1.6
Figure imgf000108_0002
Appendix Fig. A-61 Rate 4/9 Forward Link Turbo Codes, Frame=512, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT BE PUBUSHED. OR OISCLOSCO TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO ALL DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000108_0003
SIGNATURE INVENTOR DATE READ ANO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE) DATE
233 Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMA VON IS ENTERED SHOULD BE SIGNED ANO MTNESSEO)
Figure imgf000108_0004
Figure imgf000109_0001
0.8 0.9 1.0 1.1 1.2 Ebi/No (dB)
Appendix Fig. A-62 Rate 4/9 Fonvard Link Turbo Codes, Frame=1024, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION AND EXCEPT WITH WRTTTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAJX NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUCD TO AU DOCUMEirrS CONTAINING THIS INFORMATION.
Figure imgf000109_0002
SKΪNATURE INVENTOR DATE
READ AND UNOERSTOOO BY
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE) SIGNATURE
*** Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000109_0003
Figure imgf000110_0001
0.6 0.7 0.8 0.9 1.0 1.1 1.2
Ebi/No (dB)
Appendix Fig. A-63 Rate 4/9 Fonvard Link Turbo Codes, Frame=2048, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT BE PUBLISHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMAT10R
Figure imgf000110_0002
READ ΛNO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
238 A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED AND WTTNESSED)
Figure imgf000110_0003
Figure imgf000111_0001
0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
Appendix Fig. A-64 Rate 4/9 Forward Link Turbo Codes, Framc=3072, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED, OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUEO TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000111_0002
SIGNATURE INVENTOR READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE! DATE
WITNESS NAME (TYPE)
236 Al CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000111_0003
Pattern 1 Pattern 2 Pattern 3
Figure imgf000112_0001
0000 0000 0000 1111 1110 1110 1110 1111 1111
ADDendix Fig. A-65 Puncturing patterns for rate 2/9 reverse link codes
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BC DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BEAPPUED TO AU DOCUMENTS CONTAINING THIS ..FORMATION.
( / SIGNATURE ttΛϊNTOR
SIGNATURE INVENTOR
READ AND UNDERSTOOD BY
SIGNATURE
WITNESS NAME (TYPE)
Figure imgf000112_0002
Figure imgf000113_0001
0.1 0.2 0.3 0.4 0.5 0.6 0.7
Ebi/No (dB)
Appendix Fig. A-66 Rate 2/9 Reverse Link Turbo Codes, Frame=512, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU NOT" BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAININO THIS INFORMATION.
Figure imgf000113_0002
SIGNATURE INVENTOR
READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE,
WITNESS NAME (TYPE)
236 Λ-1 CSAUG BO (EACH PAGE UPON WHICH INFOPMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000113_0003
Figure imgf000114_0001
-0.1 0.0 0.1 0.2 0.3 0.4
Ebi/No (dB)
Appendix Fig. A-67 Rate 2/9 Reverse Link Turbo Codes, Frame=1024, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY SUCH INFORMATION SHAU NOT BE PUBUSHED, OR DISCLOSED TO OTHERS, OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000114_0002
READ ANO UNDERSTOOD BY.
WITNESSNAME(TYPE)
WITNESSNAME(TYPE) SIGNATURE
236 A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNE
Figure imgf000114_0003
Figure imgf000115_0001
-0.2 -0.1 0.0 0.1 0.2 Ebi/No (dB)
Appendix Fig. A-68 Rate 2/9 Reverse Link Turbo Codes, Frame=2048, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHALL NOT BE PUBUSHED. OR OISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000115_0002
Figure imgf000116_0001
-0.3 -0.2 -0.1 0.0 0.1 Ebi/No (dB)
Appendix Fig. A-69 Rate 2/9 Reverse Link Turbo Codes, Frame=3072, AWGN channel
HUGHES PROPRIETARY
Figure imgf000116_0002
SIGNATURE INVENTOR READ AND UNDERSTOOD BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
Figure imgf000116_0003
Pattern 1 Pattern 2 Pattern 3 Pattern 4 Pattern 5 Pattern 6
111 111 111 111 111 111
111 110 110 100 100 000
000 001 001 on Oil 111
000 000 000 000 000 000
110 110 010 010 000 000
000 000 100 100 110 110
Appendix Fig. A-70 Initial puncturing patterns for rate 3/8 reverse link codes
HUGHES PROPRIETARY
Figure imgf000117_0001
°
Figure imgf000118_0001
0.7 0.8 0.9 1.0 1.1 1.2 1.3
Ebi/No (dB) ldix Fig. A-71 Rate 3/8 Reverse Link Turbo Codes, Frarae=512, AWGN channel (Initial Screening)
HUGHES PROPRIETARY
TWS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY, SUCH INFORMATION SHAU. NOT BE PUBLISHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPLICATED IN WHOLE OR IN PART. TWS LEGEND SHAU BE APPLIEO TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000118_0002
SIGNATURE INVENTOR DATE AD ANO UNDERSTOOD BY:
WITNESS NAME (TYPE) DATE
WITNESS NAME (TYPE) SIGNATURE
> A-t CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000118_0003
Pattern 5 Pattern 6 Pattern 7 Pattern 8
111 111 111111 111111
100 000 100000 oooooo
Oil 111 011011 111110
000 000 oooooo oooooo
000 000 000100 oooooo
110 110 110110 110111
Appendix Fig. A-72 Puncturing patterns for rate 3/8 reverse link codes
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAα NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SH J. NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000119_0001
SIGNATURE INVENTOR
READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
23β Λ-1 CSΛUG 80 (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000119_0002
Figure imgf000120_0001
0.7 0.8 0.9 1.0 1.1 1.2 1.3
Ebi/No (dB)
Appendix Fig. A-73 Rate 3/8 Reverse Link Turbo Codes, Frame=512, AWGN channel
HUGHES PROPRIETARY
Figure imgf000120_0002
Figure imgf000121_0001
Figure imgf000121_0004
0.4 0.5 0.6 0.7 0.8 0.9 1.0
Ebi/No (dB)
Appendix Fig. A-74 Rate 3/8 Reverse Link Turbo Codes, Frame=1024, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBLISHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000121_0002
SIGNATURE INVENTOR READ AND UNOERSTOOO BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
733 A-1 CS AUG BO rEΛCH PAGE UPOΛI WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000121_0003
Figure imgf000122_0001
0.3 0.4 0.5 0.6 0.7 0.8
Ebi/No (dB)
Appendix Fig. A-75 Rate 3/8 Reverse Link Turbo Codes, Framc=2048, AWGN channel
HUGHES PROPRIETARY
Figure imgf000122_0002
Figure imgf000123_0001
0.2 0.3 0.4 0.5 0.6 0.7
Ebl/No (dB)
Appendix Fig. A-76 Rate 3/8 Reverse Link Turbo Codes, Framc=3072, AWGN channel
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USEO FOR ANY PURPOSE ANO THE DOCUMENT SHALL NOT BE DUPLICATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUED TO AU OOCUMENTS CONTAINING THIS INFORMATION
Figure imgf000123_0002
SIGNATURE INVENTOR
READ ANO UNDERSTOOD BY.
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
TM A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000123_0003
Figure imgf000124_0001
Appendix Fig. A-77 Forward Link Turbo Code of Rate 3/8 (Mother code in Figure 38)
HUGHES PROPRIETARY
Figure imgf000124_0002
Figure imgf000125_0001
Appendix Fig. A-7S Forward Link Turbo Code of Rate 4/9 (Mother code in Figure 38
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION, ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PU3USHEO. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATTD IN WHOLE OR IN PART. THIS LEGEND SHALL BE APPLIED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
Figure imgf000125_0002
SIGNATURE INVENTOR
READΛNOUNOERSTOOO BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE) OATE
236 Λ-t CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000125_0003
Figure imgf000126_0001
Appendix Fig. A-79 Reverse Link Turbo Code of Rate 2/9 (Mother code in Figure 43
HUGHES PROPRIETARY
Figure imgf000126_0002
Figure imgf000127_0001
Appendix Fig. A-80 Reverse Link Turbo Code of Rate 3/8 (Mother code in Figure 43
HUGHES PROPRIETARY
(_A SIGNATURE INVENTOR
Figure imgf000127_0002
Figure imgf000128_0001
Appendix Fig. A-81 Universal Constituent Encoder Recommended for R=l/2 and R=l/3 Turbo Codes of Varying Interleaver Depth
HUGHES PROPRIETARY
Figure imgf000128_0002
Puncturing
Figure imgf000129_0001
Appendix Fig. A-82 Rate-Compatible Turbo Code of Rate 1/3
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFOFtMATIOa AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAα NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LECENO SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
Figure imgf000129_0002
Puncturing
Figure imgf000130_0001
Appendix Fig. A-83 Rate-Compatible Turbo Code of Rate 1/2
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION AND EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHCRS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGENO SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
SIGNATURE INVENTOR
SIGNATURE INVENTOR
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
β Λ-I CS AUO βO (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED AND WITNESSED)
Figure imgf000130_0002
Figure imgf000131_0001
\opendix Fig. A-84 Mother Constituent Code for Universal Turbo Codes of Rates 1/2, 13, L 4, and 1/5
HUGHES PROPRIETARY
TMS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY SUCH INFORMATION SHΛα NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUEO TO AU DOCUMENTS CONTAINING THIS INFORMATION
SIGNATURE INVENTOR
SIGNATURE INVENTOR AD ΛNO UNDERSTOOD BY
WITNESS NAME (TYPE)
WITNESS NAME (TYPE)
It Λ-I CS ΛUO SO (EACH PAGE UPON WHICH INFORMAVON IS ENTEREO SHOULD BE SIGNED ANO WITNESSED) 0°
J Puncturing \
Figure imgf000132_0001
Appendix Fig. A-85 Rate-compatible Turbo Code of Rate 1/5
HUGHES PROPRIET rARY
Figure imgf000132_0002
Figure imgf000133_0001
Appendix Fig. A-86 Rate-compatible Turbo Code of Rate 1/4
HUGHES PROPRIETARY
TMS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT VΛTH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSEO TO OTHERS. OR USED FOR ANY PURPOSE ANO THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAU BE APPUEO TO AU DOCUMENTS CONTAINING TMS INFORMATION.
SIGNATURE INVENTOR
SIGNATURE INVENTOR
READ AND UNOERSTOOO BY:
WITNESS NAME (TYPE) SIGNATURE
WITNESS NAME (TYPE)
234 A-1 CS AUG BO (EACH PAGE UPON WHICH INFORMAVON IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000133_0002
o
Figure imgf000134_0001
Appendix Fig. A-87 Rate-compatible Turbo Code of Rate 1/3
HUGHES PROPRIETARY
Figure imgf000134_0002
Figure imgf000135_0001
Appendix Fig. A-88 Rate-compatible Turbo Code of Rate 1/2
HUGHES PROPRIETARY
Figure imgf000135_0002
Figure imgf000136_0001
0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2
Ebi/No (dB) φendix Fig. A-89 Comparison of Rate-1/4 BER-Optimized Turbo Code vs Convolutiona] Code, Frame Size=512
HUGHES PROPRIETARY
Figure imgf000136_0002
Figure imgf000137_0001
0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2
Ebl/No (dB)
Appendix Fig. A-90 Comparison of Rate-1/4 BER-Optimized Turbo Code vs Convolutional Code, Frame Size=1024
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. AND EXCEPT WITH WRπTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMATION SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OR USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE OUPUCATED IN WHOLE OR IN PART. TMS LEGEND SHAU BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATON.
SIGNATURE INVENTOR
SIGNATURE INVENTOR READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE)
WITNESS NAME (TYPE) SIGNATURE
23β A-1 CSAUO B0 (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE S1GHEO ANO WTTNESSEV)
Figure imgf000137_0002
Figure imgf000138_0001
Figure imgf000138_0003
-0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8" 2.0 2.2
Ebi/No (dB)
Dpendlx Fig. A-91 Comparison of Rate-1/4 BER-Optimized Turbo Codevs Convolutional Code, Frame Size=2048
HUGHES PROPRIETARY
Figure imgf000138_0002
Figure imgf000139_0001
-0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 1.6 1.8 2.0 2.2
Ebi/No (dB) appendix Fig. A-92 Comparison of Rate-1 4 BER-Optimized Turbo Code vs Convolutional Code, Frame Size=3072
HUGHES PROPRIETARY
THIS DOCUMENT CONTAINS PROPRIETARY INFORMATION. ANO EXCEPT WITH WRITTEN PERMISSION OF HUGHES AIRCRAFT COMPANY. SUCH INFORMAnON SHAU NOT BE PUBUSHED. OR DISCLOSED TO OTHERS. OH USED FOR ANY PURPOSE AND THE DOCUMENT SHAU NOT BE DUPUCATEO IN WHOLE OR IN PART. THIS LEGEND SHAα BE APPUED TO AU DOCUMENTS CONTAINING THIS INFORMATION.
SIGNATURE INVENTOR
SIGNATURE INVENTOR DATE READ ANO UNDERSTOOD BY:
WITNESS NAME (TYPE) OATE
WITNESS NAME (TYPE)
23β Λ-1 CS AUG BO (EACH PAGE UPON WHICH INFORMATION IS ENTERED SHOULD BE SIGNED ANO WITNESSED)
Figure imgf000139_0002

Claims

CLAIMSWhat is claimed is:
1. A method of processing data in data services with a set of rate-compatible Turbo Codes optimized at high code rates and derived from a universal constituent code, the Turbo Codes having compatible puncturing patterns, the method comprising the steps of: encoding a signal at a first and second encoder using a best rate 1/2 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
2. The method of Claim 1 wherein the best rate 1/2 constituent code represents a concatenation of polynomial
1+DAD3 (octal 13) and polynomial 1+D+D3 (octal 15), D a data bit.
3. The method of Claim 2 wherein one of the rate- compatible Turbo Codes in the set comprises a rate 1/2 Turbo Code and further wherein one of the puncturings comprises alternately puncturing parity bits between the first and the second encoder.
4. The method of Claim 2 wherein one of the rate- compatible Turbo Codes in the set comprises a rate 1/3 Turbo Code and further wherein one of the punctuπngs comprises transmitting all the parity bits at the first and second encoαer .
5. A method of processing data in data services using a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent code, the Turbo Codes having similar constituent codes and compatible puncturing patterns, the method comprising: encoding a signal with a best rate 1/3 constituent code at a first and a second encoder, each encoder producing a respective plurality of parity bits for each data b t; puncturing the plurality of parity bits with the a higher rate best puncturing pattern; and puncturing the plurality of parity bits with a lower rate best puncturing pattern.
6. The method of Claim 5 wherein the best rate 1/3 constituent code represents a concatenation of polynomial 1+D"+D3, (octal 13), polynomial 1+D+D3 (Octal 15), and polynomial 1+D+D2+D3 (octal 17), D a data bit.
7. The method of Claim 5 wherein the set of Turbo Codes comprises a rate 1/5 Turbo Code wherein at least one of the steps of punctunngs comprises transmitting all the parity bits at the first and the second encoders.
. . .
-140-
8. The method of Claim 5 wherein the set of Turbo Codes comprises a rate 1/4 Turbo Code wherein at least one of the puncturings comprises : alternately puncturing a select group of the plurality of parity bits between the first and the second encoder .
9. The method of Claim 5 wherein the set of Turbo Codes comprises a rate 1/3 Turbo Code wherein at least one of the puncturings comprises : puncturing a select group of the plurality of parity bits at the first and the second encoder.
10. The method of Claim 5 wherein the set of Turbo Codes comprises a rate 1/2 Turbo Code and further wherein at least one of the puncturings comprises: puncturing at the encoders a select group of the plurality of parity bits and alternately puncturing at the encoders another select group of the plurality of parity bits .
11. A method of rate-compatible Turbo encoding using a set of rate-compatible Turbo Codes, the set optimized for code rate 1/4, and comprising Turbo Codes with differing code rates and rate-compatible puncturing patterns, the method comprising the steps of: encoding a signal at a first and second encoder using a best rate 1/4 constituent code universal with higher and lower code rates, the first encoder and the second encoder each producing a respective plurality of parity bits for a data bit; puncturing the respective plurality of parity bits at each encoder with a higher rate best puncturing pattern; and puncturing the respective plurality of parity bits at each encoder with a lower rate best puncturing pattern.
12. The method of Claim 11 wherein the set of rate- compatible Turbo Codes represent a concatenation of polynomials 1+D+D3, 1+D2+D3, and 1+D+D3, D a data bit, and wherein an associated rate-compatible puncturing pattern is selected from a group of patterns including: transmitting all data; alternately puncturing parity bits associated with polynomial 1+D+D ; and puncturing parity bits associated with polynomial 1+D+D for each encoder.
13. The method of Claim 11 wherein the set of rate- compatible Turbo Codes comprise two or more Turbo Codes of differing rates selected from a group of rates including 1/5 and 1/4, the Turbo Codes representing a concatenation of polynomials 1+D+D3, 1+D2+D3, and 1+D+D2+D3, D a data bit, and wherein an associated rate-compatible puncturing pattern is selected from the group of patterns including: transmitting all data; and alternately puncturing parity bits associated with polynomial 1+D+D"+D .
14. An encoding system using a set of rate-compatible Turbo Codes derived from a best universal rate 1/2 constituent code, the set having compatible puncturing patterns, the system comprising: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the adders in a configuration corresponding to the best universal rate 1/2 constituent code; and a puncturer configured with the first and second encoder to puncture a plurality of data outputs from each of the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns.
15. An encoding system using a set of rate-compatible Turbo Codes derived from an optimal universal rate 1/3 constituent code, the rate compatible Turbo Codes having similar constituent codes and compatible puncturing patterns, the system comprising: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders, each of the adders coupled to a selected portion of the adders in a configuration corresponding to the rate 1/3 constituent code of; and a puncturer configured with the first and second encoder such to puncture a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate in accordance with the set of the compatible puncturing patterns.
16. An encoding system using a set of rate-compatible Turbo Codes comprising Turbo Codes having a universal constituent code and rate-compatible puncturing patterns for different coαe rates, the system comprising: a first and second encoder, each encoder comprising: a plurality of shift registers; a plurality of adders each adder coupled to a selected portion of the plurality of adders in a configuration corresponding to the universal constituent code; and a puncturer configured with the first and second encoder for puncturing a plurality of data outputs from the first and second encoder, the puncturing determined by a desired Turbo Code rate m accordance with the set of compatible puncturing patterns.
17. A method of determining a set of rate-compatible Turbo Codes, optimized at high code rates , the set derived from a best universal constituent code of rate 1/2 compatible with higher codes, the Turbo Codes having compatible puncturing patterns, the method comprising the steps of: selecting a group of candidate mother constituent code pairs comprising primitive, irreducible polynomials based upon code pair screening and diversity, the code pair screening comprising simulating relative Bit Error Rate (BER) performance of rate 1/2 and 1/3 Turbo Codes at a fixed Interleaver length; measuring an relative Signal-to-Noise ratio loss of a signal after a plurality of encodings for each candidate pair at both a plurality of different Interleaver depths and two different Turbo Code rates, wherein each encoding has a different combination of candidate pair, Interleaver depth, and rate; selecting a best candidate pair based upon a best relative Signal-to-Noise loss from the measuring; and selecting at least one lower rate and one higher rate best puncturing pattern for the best candidate pair, for each of the two or more rate-compatible Turbo Codes of the set, wherein the at least one higher rate pattern selects transmittal of any parity bits selected for transmittal by the at least one lower rate pattern of the set.
PCT/US1999/002995 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding WO2000048353A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP99906939A EP1072122A1 (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding
AU26732/99A AU2673299A (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding
KR1020007011264A KR100347501B1 (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding
PCT/US1999/002995 WO2000048353A1 (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US1999/002995 WO2000048353A1 (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding

Publications (1)

Publication Number Publication Date
WO2000048353A1 true WO2000048353A1 (en) 2000-08-17

Family

ID=22272169

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/002995 WO2000048353A1 (en) 1999-02-11 1999-02-11 Optimized rate-compatible turbo encoding

Country Status (4)

Country Link
EP (1) EP1072122A1 (en)
KR (1) KR100347501B1 (en)
AU (1) AU2673299A (en)
WO (1) WO2000048353A1 (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1199835A2 (en) 2000-10-21 2002-04-24 Samsung Electronics Co., Ltd. Apparatus and method for generating codes in communications system
KR100438448B1 (en) * 2001-02-13 2004-07-03 삼성전자주식회사 Apparatus and method for generating codes in communication system
KR100678580B1 (en) 2005-10-14 2007-02-02 삼성전자주식회사 Apparatus and method for increasing turbo code performance in communication system
US7346827B2 (en) 1998-01-23 2008-03-18 The Directv Group, Inc. Forward error correction scheme for data channels using universal turbo codes
US7487431B2 (en) 1998-08-27 2009-02-03 The Directv Group, Inc. Method for a general near optimal turbo code trellis termination
US7526687B2 (en) 1998-08-17 2009-04-28 The Directv Group, Inc. Turbo code interleaver with near optimal performance
US7536624B2 (en) 2002-01-03 2009-05-19 The Directv Group, Inc. Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
US8788920B2 (en) 2002-12-16 2014-07-22 Interdigital Technology Corporation Detection, avoidance and/or correction of problematic puncturing patterns in parity bit streams used when implementing turbo codes

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE50213655D1 (en) * 2002-01-07 2009-08-13 Siemens Ag METHOD AND DEVICE FOR DATA TRANSMISSION, WOND RECEIVER IS SIGNALED

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998048517A1 (en) * 1997-04-21 1998-10-29 General Electric Company Turbo-coding with staged data transmission and processing
DE19736653C1 (en) * 1997-08-22 1998-12-10 Siemens Ag Service quality estimation method for channels of digital transmission system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998048517A1 (en) * 1997-04-21 1998-10-29 General Electric Company Turbo-coding with staged data transmission and processing
DE19736653C1 (en) * 1997-08-22 1998-12-10 Siemens Ag Service quality estimation method for channels of digital transmission system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ACIKEL O F ET AL: "High rate turbo codes for BPSK/QPSK channels", ICC '98. 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS. CONFERENCE RECORD. AFFILIATED WITH SUPERCOMM'98 (CAT. NO.98CH36220), ATLANTA, GA, USA, 7-11 JUNE 1998, 1998, New York, NY, USA, IEEE, USA, pages 422 - 427 vol.1, XP002116627, ISBN: 0-7803-4788-9 *
RIEDEL S: "SYMBOL-BY-SYMBOL MAP DECODING ALGORITHM FOR HIGH-RATE CONVOLUTIONALCODES THAT USE RECIPROCAL DUAL CODES", IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 16, no. 2, 1 February 1998 (1998-02-01), pages 175 - 185, XP000741772, ISSN: 0733-8716 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7840869B2 (en) 1998-01-23 2010-11-23 The Directv Group, Inc. Forward error correction scheme for data channels using universal turbo codes
US7346827B2 (en) 1998-01-23 2008-03-18 The Directv Group, Inc. Forward error correction scheme for data channels using universal turbo codes
US7925963B2 (en) 1998-01-23 2011-04-12 Dtvg Licensing, Inc. Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
US7840871B2 (en) 1998-01-23 2010-11-23 The Directv Group, Inc. Forward error correction scheme for data channels using universal turbo codes
US8671324B2 (en) * 1998-08-17 2014-03-11 Dtvg Licensing, Inc. Turbo code interleaver with near optimal performance
US20130061109A1 (en) * 1998-08-17 2013-03-07 The Directv Group, Inc. Turbo code interleaver with near optimal performance
US8321725B2 (en) 1998-08-17 2012-11-27 The Directv Group, Inc. Turbo code interleaver with optimal performance
US7526687B2 (en) 1998-08-17 2009-04-28 The Directv Group, Inc. Turbo code interleaver with near optimal performance
US7657797B2 (en) 1998-08-17 2010-02-02 The Directv Group, Inc. Turbo code interleaver with near optimal performance
US7761750B2 (en) 1998-08-17 2010-07-20 The Directv Group, Inc. Turbo code interleaver with near optimal performance
US7779329B2 (en) 1998-08-27 2010-08-17 The Directv Group, Inc. Method for a general near optimal turbo code trellis termination
US7827465B2 (en) 1998-08-27 2010-11-02 The Directv Group, Inc. Method for a general near optimal turbo code trellis termination
US7487431B2 (en) 1998-08-27 2009-02-03 The Directv Group, Inc. Method for a general near optimal turbo code trellis termination
US8201048B2 (en) 1998-08-27 2012-06-12 The Directv Group, Inc. Method for a general near optimal turbo code trellis termination
US8429490B2 (en) 1998-08-27 2013-04-23 Dtvg Licensing, Inc. Method for a general near optimal turbo code trellis termination
EP1199835A2 (en) 2000-10-21 2002-04-24 Samsung Electronics Co., Ltd. Apparatus and method for generating codes in communications system
EP1199835A3 (en) * 2000-10-21 2006-05-24 Samsung Electronics Co., Ltd. Apparatus and method for generating codes in communications system
KR100438448B1 (en) * 2001-02-13 2004-07-03 삼성전자주식회사 Apparatus and method for generating codes in communication system
US7536624B2 (en) 2002-01-03 2009-05-19 The Directv Group, Inc. Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
US8788920B2 (en) 2002-12-16 2014-07-22 Interdigital Technology Corporation Detection, avoidance and/or correction of problematic puncturing patterns in parity bit streams used when implementing turbo codes
US9065486B2 (en) 2002-12-16 2015-06-23 Interdigital Technology Corporation Detection, avoidance and/or correction of problematic puncturing patterns in parity bit streams used when implementing turbo codes
KR100678580B1 (en) 2005-10-14 2007-02-02 삼성전자주식회사 Apparatus and method for increasing turbo code performance in communication system

Also Published As

Publication number Publication date
EP1072122A1 (en) 2001-01-31
KR100347501B1 (en) 2002-08-03
AU2673299A (en) 2000-08-29
KR20010052246A (en) 2001-06-25

Similar Documents

Publication Publication Date Title
US6370669B1 (en) Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
US9300330B2 (en) Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
US6430722B1 (en) Forward error correction scheme for data channels using universal turbo codes
USRE41498E1 (en) Device and methods for channel coding and rate matching in a communication system
KR100724921B1 (en) Code generating and decoding apparatus and method in communication system
KR100739182B1 (en) Mobile communications terminal for supporting space-time hybrid automatic repeat request techniques and method thereof
WO2001059935A2 (en) A system and method employing a modular decoder for decoding turbo and turbo-like codes in a communications network
WO2000048353A1 (en) Optimized rate-compatible turbo encoding
JP2005506756A (en) Transmission method
EP1064751B1 (en) Forward error correction scheme for data channels using turbo codes
van Wykt et al. A turbo coded DS/CDMA system with embedded Walsh-Hadamard codewords: coder design and performance evaluation
al Frenger et al. Multi-rate Convolutional Codes

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GM HR HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

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

WWE Wipo information: entry into national phase

Ref document number: 1999906939

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020007011264

Country of ref document: KR

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 1999906939

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 1020007011264

Country of ref document: KR

WWG Wipo information: grant in national office

Ref document number: 1020007011264

Country of ref document: KR