EP1233524B1 - Apparatus and method for generating and decoding codes in communication system - Google Patents

Apparatus and method for generating and decoding codes in communication system Download PDF

Info

Publication number
EP1233524B1
EP1233524B1 EP02003682A EP02003682A EP1233524B1 EP 1233524 B1 EP1233524 B1 EP 1233524B1 EP 02003682 A EP02003682 A EP 02003682A EP 02003682 A EP02003682 A EP 02003682A EP 1233524 B1 EP1233524 B1 EP 1233524B1
Authority
EP
European Patent Office
Prior art keywords
symbols
code
symbol
sub
parity
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP02003682A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP1233524A2 (en
EP1233524A3 (en
Inventor
Min-Goo Kim
Jae-Sung Jang
Sang-Hyuck Ha
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Publication of EP1233524A2 publication Critical patent/EP1233524A2/en
Publication of EP1233524A3 publication Critical patent/EP1233524A3/en
Application granted granted Critical
Publication of EP1233524B1 publication Critical patent/EP1233524B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2771—Internal interleaver for turbo codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957—Turbo codes and decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6387—Complementary punctured convolutional [CPC] codes

Definitions

  • the present invention relates generally to code decoding in a data communication system considering a characteristic of turbo codes in an ARQ (Automatic Repeat reQuest) packet communication system or a general communication system supporting ARQ scheme.
  • ARQ Automatic Repeat reQuest
  • a system supporting a hybrid ARQ scheme uses a soft combining technique in order to improve its throughput, and the soft combining technique is divided into a packet diversity combining technique and a packet code combining technique.
  • the two combining techniques are both called "soft packet combining".
  • the packet diversity combining technique is sub-optimal in terms of performance, but frequently used because of its implementation simplicity when performance loss is not significant factor in system design.
  • the packet code combining technique is utilized in a packet transmission system in order to increase its throughput.
  • the packet code combining technique transmits varying codes having a code rate R for each packet transmitted.
  • the receiver Upon a receiver detecting an error in the received packet after decoding, the receiver stores the failed packet rather than discarding it, and then soft-combines the stored packet with a packet retransmitted by the transmitter. .
  • different codes may be used for the retransmitted packet. That is, upon receiving N packets having a code rate R, the packet code combining technique converts the code rate to an effective code rate R/N using the packets before decoding, thereby to obtain a coding gain.
  • the packet diversity combining technique transmits the same codes having a code rate R for each packet transmitted .
  • the receiver Upon detecting at a receiver an error in the received packet after decoding, the receiver stores the failed packet rather than discarding it, and then soft-combines the stored packet with a packet retransmitted from the transmitter .
  • the same codes are used for the retransmitted packet. Therefore, the packet diversity combining technique can be regarded as a Symbol Energy Averaging process in a random channel, and uses only an interference power reduction effect attained by averaging soft output of received symbols, and a diversity gain provided in a diversity channel by transmitting a plurality of symbols in a fading channel.
  • the packet code combining technique has a supplemental coding gain based on a code structure in addition to the diversity gain.
  • turbo encoder generating the turbo code will be described hereinbelow.
  • the turbo encoder generates information symbols X, first parity symbols Y 0 , Y 0 ' and second parity symbols Y 1 , Y 1 ' by encoding input information symbols.
  • the turbo encoder is comprised of two constituent encoders and one interleaver.
  • the first parity symbols Y 0 and Y 0 ' are output from a first constituent encoder by encoding the input information symbols and the second parity symbols Y 1 and Y 1 ' from a second constituent encoder by encoding the information symbols interleaved through the interleaver.
  • the Y 0 is a row of first parity symbols generated from a first constituent encoder
  • the Y 0 ' is a row of second parity symbols generated from the first constituent encoder.
  • turbo codes are designed to have their performance approach the Shannon Channel Capacity Limit by iterative decoding, and have an obvious performance difference according to the code rate, unlike the convolutional codes. It is therefore desirable to utilize the packet code combining technique in a packet communication system that uses turbo codes, in order to improve system performance.
  • EP-A-1 231 735 which was published on 14.08.2002 discloses an apparatus and method for generating Quasi-Complementary Turbo Codes.
  • the object of the present invention to provide an improved apparatus and method for receiving and decoding turbo codes considering the characteristics of turbo codes in a communication system.
  • the present invention provides an apparatus for decoding quasi-complementary turbo codes in a communication system.
  • the decoding apparatus includes a code decoder for generating code symbols according to a code rate transmitted through depuncturing sub-codes of quasi-complementary turbo codes transmitted from a transmitter and soft combining the sub-codes, a deinterleaver for deinterleaving the symbols output from the code decoder, and a turbo decoder for decoding an output of the deinterleaver.
  • the present invention provides a method for utilizing quasi-complementary turbo codes (QCTC) regardless of a variation in a code length in a system that supports channel interleaving using the quasi-complementary turbo codes, or in a system that requires the quasi-complementary turbo codes having a variety of code rates.
  • a QCTC is defined as a complementary code generated using a turbo code.
  • the QCTC is not a perfect complementary code as noted from the term "quasi" because a sub-code includes repeated symbols and has a different characteristic such as error correcting capability from another sub-code.
  • FIG. 1 illustrates a structure of a QCTC generation apparatus, in which symbol repetition and puncturing used in the quasi-complementary turbo codes(QCTC) generation apparatus is performed after channel interleaving.
  • an encoder 101 encodes an input encoder packet into coded symbols.
  • a convolutional encoder or a turbo encoder can be typically used for encoder 101.
  • R 1/5. Therefore, encoder 101 receives 3072 information bits and outputs 15360 coded symbols.
  • a channel interleaver 102 interleaves the coded symbols output from encoder 101 according to a given rule.
  • interleaver 102 independently interleaves a codeword symbol X, and parity symbols Y 0 , Y 1 , Y 0 ', and Y 1 ' based on the property of the turbo encoder.
  • a QCTC generator (or a QCTC puncturing/repetition block) 103 generates quasi-complementary turbo codes by puncturing and repeating the interleaved symbols provided from channel interleaver 102.As above, The channel interleaver 102 and the QCTC generator 103 perform the QCTC generation process.
  • the QCTC generator 103 generates the first sub-code having 21,504 symbols by taking the 15,360 interleaved code symbols and repeating part of the first half of the interleaved code symbols. If the data rate is 614.4kbps, the QCTC generator 103 generates the first sub-code by taking the first 10,752 code symbols from the first half of the interleaved code symbols. And if the data rate is 1228.8kbps or 2457.6kbps, the QCTC generator 103 generates the first sub-code by taking the first 5,376 code symbols from the interleaved code symbols.
  • the channel interleaver must be specifically designed in order to generate the quasi-complementary turbo codes(or sub-codes) This is due to the fact that the 5 symbols, i.e. the codeword symbol X and the parity symbols Y 0 , Y 1 , Y 0 ' and Y 1 ', output from channel encoder 101, are dispersed after being subjected to channel interleaving.
  • the present invention provides a method for generating the quasi-complementary turbo codes by a specific technique regardless of the code rate of the sub-codes.
  • FIG. 2 illustrates a procedure for generating quasi-complementary turbo codes.
  • an encoder 201 encodes an input encoder packet into symbols.
  • the encoder 201 uses mother codes with various code rates.
  • the encoder 201 generates information symbols X, first parity symbols Y 0 and Y 0 ' and second parity symbols Y 1 and Y 1 ' by encoding input information symbols.
  • the first parity symbols Y 0 and Y 0 ' are output from a first constituent encoder and the second parity symbols Y 1 and Y 1 ' from a second constituent encoder.
  • the first and second constituent encoders (not shown) are contained in encoder 201.
  • the primary parity symbols Y 0 and Y 1 from the first and second constituent encoders have a higher transmission priority than the secondary parity symbols Y 0 ' and Y 1 '.
  • a demultiplexer 202 demultiplexes 5 symbols, including a codeword symbol X and parity symbols Y 0 , Y 1 , Y 0 ' and Y 1 ', output from channel encoder 201 into 5 groups. That is, codeword symbols X and the parity symbols Y 0 , symbols Y 1 , symbols Y 0 ' and symbols Y 1 ' are sequentially demultiplexed and then provided to sub-block interleavers 204, 214, 224, 234 and 244, respectively.
  • the sub-block interleavers 204, 214, 224, 234 and 244 randomly permute the sequences output from the demultiplexer 202 by sub-block interleaving.
  • Various sub-block interleaving methods are available as long as the following condition is satisfied.
  • Interleaved code symbols are partially punctured in such a way that the puncturing pattern of code symbols before interleaving has a uniform puncturing distance.
  • the reason for satisfying the above condition is that when a predetermined number of symbols are punctured from the respective codeword symbol sets X, Y 0 , Y 1 , Y 0 ', and Y 1 ', the distance between punctured symbols in the codeword symbols before sub-block interleaving must be equal to achieve optimum turbo code performance. In other words, when puncturing is applied to turbo codes, uniformity is a significant factor that determines the performance of the turbo codes.
  • sub-block interleaving applies independently to the code symbols X, Y 0 , Y 0 ', Y 1 , and Y 1 '. Uniform puncturing in each interleaver output maintains. an equal distance between punctured code symbols in encoder output. Therefore, it can be concluded that channel interleaving must be chosen so that puncturing in interleaved code symbols can maintain a uniform puncturing distribution in channel encoder output.
  • Such channel interleaving methods include (BR) (Bit Reversal Order) interleaving and PBRO (Partial Bit Reversal Order) interleaving.
  • the PBRO interleaving was designed to satisfy the afore-stated condition even if the number of symbols in the respective codeword symbol sets X, Y 0 , Y 0 ', Y 1 , and Y 1 ' is not a power of 2 in order to overcome the limitation of the BRO interleaving.
  • a detailed description of this sub-block channel interleaving will be avoided here and it is to be noted that any channel interleaving method can be implemented in the present invention as long as it satisfies the above condition.
  • the codeword symbols randomized by the sub-block interleaving are applied to associated blocks.
  • the interleaved information symbol set X 206 output from first interleaver 204 is applied directly to a symbol concatenator (or symbol combiner) 207.
  • the interleaved parity symbols Y 0 and Y 1 from the second and third interleavers 214 and 224, respectively, are input to a first multiplexer (MUX) 205 and the interleaved parity symbols Y 0 ' and Y 1 ' from the fourth and fifth interleavers 234 and 244, respectively, are provided to a second MUX 215.
  • MUX multiplexer
  • the first MUX 205 multiplexes the interleaved parity symbols Y 0 and Y 1 , and provides its output to the sequence concatenator 207.
  • the second MUX 215 multiplexes the interleaved parity symbols Y 0 ' and Y 1 ', and provides its output to symbol concatenator 207.
  • the interleaved codeword symbols output from the interleavers are rearranged and then divided into three sub-groups, 206, 216 and 226.
  • information symbols X form an independent sub-group without passing through multiplexing after sub-block interleaving.
  • the sub-block interleaved symbols be Sb i_ X, which can be expressed as S ⁇ b i _ ⁇ X 1 , S ⁇ b i _ ⁇ X 2 , S ⁇ b i _ ⁇ X 3 , S ⁇ b i _ ⁇ X 4 ...
  • Sb i_ X(1) indicates the first symbol output from the first interleaver 204.
  • Sb i_ X is referred to as sequence A.
  • the interleaved codeword symbols Y 0 and Y 1 output from the second and third interleavers 214 and 224 are grouped into one sub-group.
  • Sb i_ Y 0 can be expressed as S ⁇ b i _ ⁇ Y 0 1 , S ⁇ b i _ ⁇ Y 0 2 , S ⁇ b i _ ⁇ Y 0 3 , S ⁇ b i _ ⁇ Y 0 4 ...
  • Sb i_ Y 0 (1) indicates the first code symbol output from the second interleaver 214.
  • Sb i_ Y 1 can be expressed as S ⁇ b i _ ⁇ Y 1 1 , S ⁇ b i _ ⁇ Y 1 2 , S ⁇ b i _ ⁇ Y 1 3 , S ⁇ b i _ ⁇ Y 1 4 ⁇ where Sb i_ Y 1 (1) and Sb i_ Y 1 (2) indicate the first and second code symbols, respectively, output from the third interleaver 224.
  • first MUX 205 After multiplexing the code symbols Y 0 and Y 1 in MUX 205 the output of first MUX 205 would be, S ⁇ b i _ ⁇ Y 0 1 , S ⁇ b i _ ⁇ Y 1 1 , S ⁇ b i _ ⁇ Y 0 2 , S ⁇ b i _ ⁇ Y 1 2 , S ⁇ b i _ ⁇ Y 0 3 , S ⁇ b i _ ⁇ Y 1 3 ...
  • sequence B These multiplexed symbols are referred to as sequence B.
  • the reason for multiplexing the interleaved code symbols Sb i_ Y 0 and Sb i_ Y 1 is that when M successive symbols are punctured in the sequence B irrespective of the first half or second half of the sequence B, the number of punctured symbols in Sb i_ Y 0 is equal to that of punctured symbols in Sb i_ Y 1 only if M is an even number. If M is an odd number, the difference between the numbers of punctured symbols in Sb i_ Y 0 and in Sb i_ Y 1 is only 1.
  • the multiplexing always satisfies the QCTC characteristic that the number of punctured parity symbols Y 0 is equal to that of punctured parity symbols Y 1 .
  • the interleaved code symbols Y 0 ' and Y 1 ' output from the fourth and fifth interleavers 234 and 244 are grouped into one sub-group.
  • Sb i_ Y 0 ' and Sb i_ Y 1 ' can be expressed as S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 1 , S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 2 , S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 3 , S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 4 ... and S ⁇ b i _ ⁇ Y 1 ⁇ ⁇ 1 , S ⁇ b i _ ⁇ Y 1 ⁇ ⁇ 2 , S ⁇ b i _ _
  • the reason for multiplexing the interleaved code symbols Sb i_ Y 0 ' and Sb i_ Y 1 ' is that when M successive symbols are punctured in the sequence C irrespective of the first half or second half of the sequence C, the number of punctured symbols in Sb i_ Y 0 ' is equal to that of punctured symbols in Sb i_ Y 1 ' only if M is an even number. If M is an odd number, the difference between the numbers of punctured symbols in Sb i_ Y 0 ' and in Sb i_ Y 1 ' is only 1.
  • the multiplexing always satisfies the QCTC characteristic that the number of punctured parity symbols Y 0 ' is equal to that of punctured parity symbols Y 1 '.
  • the symbol concatenator 207 sequentially concatenates sequences A, B and C of the first, second, and third sub-groups and generates a symbol sequence [A:B:C].
  • a : B : C S ⁇ b i _ ⁇ X 1 , S ⁇ b i _ ⁇ X 2 , S ⁇ b i _ ⁇ X 3 , ... ⁇ S ⁇ b i _ ⁇ Y 0 1 , S ⁇ b i _ ⁇ Y 1 1 , S ⁇ b i _ ⁇ Y 0 2 , S ⁇ b i _ ⁇ Y 1 2 , ... ⁇ S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 1 , S ⁇ b i _ ⁇ Y 1 ⁇ , S ⁇ b i _ ⁇ Y 0 ⁇ ⁇ 1 , S ⁇ b i _
  • Puncturing should be carried out to generate a sub-code with a code rate from the turbo code of (8).
  • the puncturing is defined by a "QCTC".
  • the QCTC should have the following characteristics.
  • a QCTC with a sub-code code rate which is generated by puncturing or pruning as many symbols as necessary from the end of the symbol sequence [A:B:C], satisfies the above five characteristics.
  • an intended sub-code of a QCTC is generated by repeating and puncturing as many symbols as needed in the symbol sequence [A:B:C] in a symbol sequence repeater 208 and a symbol puncturer 209.
  • the symbol sequence repeater 208 repeats the symbol sequence received from the symbol concatenator in a predetermined way. The repetition method is determined according to the code rate of the sub-code.
  • the symbol puncturer 209 punctures or prunes as many symbols as a predetermined number, starting with the last symbol in the symbol sequence received from the symbol sequence repeater 208, to thereby create the sub-code of the QCTC.
  • the number of punctured symbols depends on the code rate of the sub-code. Therefore, the code rate of the sub-code should be provided to the symbol sequence repeater 208 and the symbol puncturer 209 in order to perform sequence repetition and symbol puncturing.
  • a higher layer controller (not shown) can calculate the number of repeated symbols and the number of punctured symbols according to a mother code rate and a sub-code rate and feed the information to the symbol sequence repeater 208 and the symbol puncturer 209.
  • the symbol puncturer 209 selects a predetermined number of symbols counted from a given symbol position in the symbol sequence received from the symbol sequence repeater 208, thereby generating the sub-code of the QCTC.
  • the given symbol position refers to the symbol next to the last symbol selected for the previous transmission. Therefore, the symbol puncturer 209 can be called a "symbol selector".
  • the interleavers 203, 213, 223, 233 and 243, the MUXes 205 and 215, and the symbol concatenator 207 in FIG. 2 correspond to the channel interleaver 102 in FIG. 1 , and the symbol sequence repeater 208 and the symbol puncturer 209 both correspond to the QCTC generator 103.
  • channel encoder 101 outputs 15,360 codeword symbols.
  • code rates or data rates
  • the 15,360 coded symbols are classified into five sub-groups, interleaved, and then rearranged as the symbol sequence of Equation (8). Then, the 15,360 coded symbols are subject to repetition according to a predetermined rule and puncturing (or pruning) according to a predetermined sub-code code rate. Thus, an intended sub-code is generated.
  • the first sub-code C 00 is generated by selecting the first 21,504 symbols from the interleaved and then repeated symbol sequence.
  • the second sub-code C 01 is generated by selecting 21,504 symbols starting with the symbol following the first sub-code C 00 from the repeated symbol sequence.
  • the third sub-code C 02 is generated by selecting the following 21,504 symbols.
  • the first sub-code C 10 is generated by selecting the first 10,752 symbols from the interleaved symbol sequence.
  • the first sub-code C 10 is generated by pruning all subsequent symbols following the first 10,752 symbols in the interleaved symbol sequence. The pruning is performed in the symbol puncturer 209 as stated before.
  • the second sub-code C 11 is generated by selecting 10,752 symbols starting with the symbol following the first sub-code C 10 from the interleaved and repeated symbol sequence.
  • the third sub-code C 12 is generated by selecting the following 10,752 symbols.
  • the first sub-code C 20 is generated by selecting the first 5,376 symbols from the interleaved symbol sequence.
  • the second sub-code C 21 is generated by selecting 5,376 symbols starting with the symbol following the first sub-code C 20 from the interleaved symbol sequence.
  • the third sub-code C 22 is generated by selecting the following 5,376 symbols. In this manner, the sub-codes of the QCTC at 1228.8kbps are generated.
  • the system stores information about the position of the last symbol in the previous transmitted sub-code for each QCTC.
  • a data rate or code rate
  • the system selects a QCTC corresponding to the data rate and generates a sub-code by selecting a predetermined number of symbols following the stored last symbol for the selected QCTC according to the data rate. If the selected symbols exceed one interleaved symbol block, the remaining symbols are selected from the following block. In this way , sub-codes are generated by repeating a block of interleaved symbols. To do so, a storing area is needed to store the repeated blocks.
  • the interleaved symbols are stored in a circular buffer memory and a sub-code is generated by selecting symbols recursively. That is, if interleaved symbols are all selected, a predetermined number of symbols are selected from the interleaved symbols starting with the first symbol. Then, the symbol repeater 208 can be omitted since the circular buffer memory functions as the symbol repeater 208.
  • the above embodiment of the present invention is about two-dimensional QCTCs.
  • a QCTC corresponding to each code rate is generated independently and the sub-codes of the QCTC are sequentially transmitted.
  • the two-dimensional QCTCs are not optimum for the reasons described below.
  • the first sub-code C 00 of the first QCTC C 0j is used for initial transmission
  • the first sub-code C 10 of the second QCTC C 1j is used for the next transmission
  • the first sub-code C 20 of the third QCTC C 2j is used for the third transmission.
  • a receiver decodes data by combining the three sub-codes (C 00 , C 10 , C 20 ).
  • the code combining does not recover an original code with a code rate of 1/5, only to increase the symbol energy of information symbols and thus to decrease decoding performance. This implies that there is a problem with the transmission order of the sub-codes, that is, selection of the sub-codes.
  • the number of code symbols to be selected is determined according to the code rate of a sub-code and the sub-code is generated by selecting the determined number of symbols starting with the symbol following the last symbol used for the previous transmission.
  • FIG. 3 is a block diagram of another aspect of the QCTC generating apparatus.
  • the structure shown in FIG. 3 is the same as that shown in FIG. 2 except that the symbol sequence repeater and the symbol puncturer operate in different manners. Therefore, the following description is made mainly of the symbol sequence repeater 308 and the symbol puncturer 309.
  • the symbol sequence repeater 308 repeats a symbol sequence received from a symbol concatenator 307 in a predetermined way. The repetition may be carried out according to a given parameter in the symbol sequence repeater 308, or under the control of a higher layer controller (not shown), or upon request of the symbol concatenator 307. The above process is implemented in the same manner as described referring to FIG. 2 . Then, the symbol puncturer 309 punctures symbols received from the symbol sequence repeater 308 according to a different rule from the rule applied in FIG. 2 to generate a sub-code.
  • the puncturing rule is as follows.
  • a sub-code transmitted at time (k+h) is expressed as C ij (k+h)
  • the number of the code symbols, N is defined as L_INF ⁇ 5 since the mother code rate is 1/5.
  • L_INF denotes the size of a sub-block interleaver, or the number of information symbols.
  • Step 1 the length of an initial sub-code is determined.
  • one C 10 of the first sub-codes C 00 , C 10 , C 20 of available QCTCs is selected according to a given code rate and the length of the selected sub-code C i0 is stored as a variable L_SC.
  • the code rate or length L_SC of the sub-code is predetermined in the system according to channel environment including transmission channel condition and input data rate. The description is made in the context of three QCTCs shown in FIG. 3 for better understanding of the present invention, but, that is, the number of sub-codes is not limited to the same number.
  • Step 2 a sub-code for initial transmission is selected and transmitted.
  • C m (0), C m (1), ..., C m (L_SC-1) are selected among the code symbols of the mother code. If L_SC exceeds N, C m (0), C m (1),..., C m (N) are transmitted P times and then C m (0), C m (1),. .., C m (q-1) are transmitted.
  • P and q are the quotient and remainder of L_SC/N, respectively and P and q are calculated by L_SC mod N.
  • the variable q is stored for the next transmission for use in detecting the position of the last symbol of the previous transmitted sub-code with respect to the block of interleaved symbols.
  • Step 3 the starting position of a sub-code for the next transmission and the length of the sub-code are determined.
  • the code rate R_SC of a new sub-code to be transmitted is determined according to channel environment and the length L_SC of the sub-code is determined according to the determined code rate.
  • a higher layer system transmits the sub-code length L_SC and the sub-code code rate R_SC to the symbol puncturer 308 for each transmission.
  • Step 4 a sub-code for the next transmission is selected and transmitted.
  • C m (q), C m (q+1), ..., C m (q+L_SC-1) code symbols are selected among the code symbols of the mother code. In other words, as many symbols as the sub-code length are selected from the mother code symbols starting with the symbol following the last symbol selected for the previous transmission. If q+L_SC exceeds N, a row comprised of N code symbols starting with C m (q) are selected recursively and transmitted P times and then the remaining q' code symbols are sequentially transmitted.
  • P and q' are the quotient and remainder of (L_SC)/N, respectively and the q' is calculated by (q+L_SC) mod N.
  • the next symbol position value of the position of the last selected symbol for the next transmission is stored to the q.
  • the variable q is the next symbol position of the last symbol position among symbols comprised of the last transmitted sub-code.
  • a low rate sub-code with a code rate of 1/7 is initially transmitted in Case 1
  • a high rate sub-code with a code rate of 4/7 is initially transmitted in Case 2.
  • N 15,360
  • successive mother code symbols are repeated and as many code symbols as a size corresponding to the length of a sub-code to be transmitted (or the code rate of the sub-code) are selected sequentially at each transmission from the repeated mother code symbols .
  • a buffer is not used to store (P-1) times repeated-mother codes, but a single circular buffer is employed to store N code symbols and recursively select code symbols to thereby generate a sub-code of an intended length. That is, use of the circular buffer memory obviates the need of sequence repetition. Any reception buffer is available to a receiver as long as it can store N soft metrics for code combining.
  • FIG. 4 illustrates a structure of a receiver for receiving data transmitted by the transmitter of FIG. 1 .
  • data signals 401, 402 and 403 transmitted by the transmitter at their associated data rates are sub-codes C ij of the QCTC.
  • the received data signals 401, 402 and 403 are provided to a QCTC processor (QCTC depuncturing /combining) 411.
  • QCTC processor 411 performs depuncturing on the received signals to convert the received signals to turbo codes with its original code rate R from the sub-codes based on the characteristic of the QCTC, and also performs soft combining on the received sub-codes.
  • the "depuncturing” is a process for inserting erasure symbols in the positions of the punctured symbols.
  • Chase combining may be used for the soft combining of the received sub-codes.
  • the receiver As mentioned with reference to the characteristic of the QCTC, the receiver generates code symbols with a code rate R by soft combining the sub-codes C ij transmitted from the transmitter.
  • the received sub-codes C ij are equally rearranged and soft-combined by the receiver according to the C ij transmission rule. This process will be described in detail herein below.
  • the soft combining has different metric qualities according to the number of bits per received symbol, the present invention regards even the hard combining as soft combining having a 1-bit resolution. Actually, since the performance is not remarkably improved by the hard combining, the soft combining will be described herein. A detailed description of this will be provided along with a description of the respective function blocks in the receiver.
  • the QCTC processor 411 generates N soft-combined codeword symbols originally generated by the encoder by depuncturing and soft combining, and transmits them to a channel deinterleaving block 421.
  • the soft-combined codeword symbols are sample values generated from the received codeword symbols expressed by a plurality of bits or real numbers, and herein, N represents the number of codeword symbols output from the encoder used in the transmitter.
  • the channel deinterleaving block 421 channel-deinterleaves the soft-combined codeword symbols received from the QCTC processor 411, and transmits N deinterleaved, soft-combined codeword symbols to a channel decoder 431.
  • the channel decoder 431 decodes the N deinterleaved, soft-combined codeword symbols, and outputs N ⁇ R information symbols.
  • R is a code rate of the encoder used in the transmitter.
  • FIG. 5 illustrates a functional block diagram of a procedure for processing the received signals in the receiver according to an embodiment of the present invention. A structure and operation of the respective function blocks will be described in detail with reference to FIG. 5 .
  • a reception sub-code buffer (buffering of the received sub-codes C ij ) 501 stores the sub-codes Cij received from the transmitter.
  • a size of the buffer depends on the number N of the codeword symbols, and if Q bits are used per one received symbol, a Q ⁇ N-bit memory is used for the reception sub-code buffer 501.
  • the received symbols are stored in association with the sub-codes by previously transmitting the information to the reception sub-code buffer 501.
  • a method for storing the received symbols in a buffer with N storages will be described in detail with reference to FIG. 7 .
  • a sequence combiner/symbol combiner (sequence combining/symbol combining of the received sub-codes with puncturing) 502 performs a reverse process of the sequence repetition and symbol puncturing performed by the symbol repeater 308 and the symbol puncturer 309 of the transmitter, at the same time when the reception process is performed. That is, the reception sub-code buffer 501 soft-combines the previously received symbols with the symbols received from the current channel. If the number of the received code symbols of the respective sub-codes is less than N, it means that the transmitter has used puncturing. In this case, the reception sub-code buffer 501 inserts erasure symbols in the corresponding positions of the codeword symbols before soft combining.
  • the reception sub-code buffer 501 applies different weights to the codeword of the previously received symbols and the codeword of the symbols received from the current channel, before soft combining. If it is assumed that the weight of the codeword of the previously received symbols stored in the reception sub-code buffer 501 is represented by w1 and the weight of the codeword of the symbols received from the current channel is represented by w2, the weights w1 and w2 are applied to the respective soft metrics for combining. The weights are given by a channel estimator in the receiver.
  • a Chase algorithm for the sequence (or codeword) soft combining is well known, so a detailed description of this will be avoided for simplicity.
  • sequence combiner/symbol combiner 502 generates soft metrics for the N codeword symbols, and transmits them to a codeword separator (codeword sequence de-concatenation or separation into (A:B:C)) 503.
  • codeword separator codeword sequence de-concatenation or separation into (A:B:C)
  • FIG. 5 the soft metrics for the N codeword symbols output by sequence combiner/symbol combiner 502 are represented by 'D', for the sake of convenience.
  • the codeword deconcatenator 503 separates the soft metrics for the N soft-combined codeword symbols into an information symbol part X, a first parity symbol part Y 0 ,Y 1 and a second parity symbol part Y 0 ',Y 1 '.
  • Demultiplexers M1 (515) and M2 (525) demultiplex the first parity symbol part Y 0 ,Y 1 and the second parity symbol part Y 0 ',Y 1 ', respectively, thereby to rearrange them in an information symbol part X, a demultiplexed first parity symbol part Y 0 ,Y 1 , and a demultiplexed second parity symbol part Y 0 ',Y 1 '.
  • This operation can be performed either sequentially or simultaneously.
  • the information symbol part X, the demultiplexed first parity symbol part Y 0 ,Y 1 , and the demultiplexed second parity symbol part Y 0 ',Y 1 ' are separated again into a stream of 5 codeword symbols X, Y 0 , Y 0 ', Y 1 , and Y 1 ', and then transmitted to sub-block deinterleaving blocks 506, 516, 526, 536 and 546, respectively.
  • the sub-block deinterleaving can be realized either such that the 5 codeword symbols can be deinterleaved by deinterleaving one sub-block, or such that the codeword symbols can be independently deinterleaved by as many deinterleavers as the number of the codeword symbols.
  • a description of the present invention is not limited to realization of specific sub-block interleaving, but given on the assumption that a reverse process of the sub-block interleaving generally used in the transmitter is performed by the sub-block deinterleaving blocks in the receiver.
  • the 5 combined/deinterleaved symbols (507, 517, 527, 537 and 547) are subject to multiplexing 508 where they are recombined in a reverse process as performed by DEMUX 302 in the transmitter.
  • a decoder 509 decodes the soft metrics for the N codeword symbols provided from the sub-block deinterleaving blocks, and outputs transmitted information symbols, i.e., an encoded packet.
  • the procedure performed by the respective function blocks in the receiver is shown in FIG. 6 .
  • the sub-codes transmitted up to the present by the transmitter are C 00 , C 10 , C 20 and C 21 . That is, C 00 is a sub-code having 21,504 codeword symbols, C 10 is a sub-code having 10,752 codeword symbols, and C 20 and C 21 are sub-codes each having 5,376 codeword symbols. Therefore, up to the present, the receiver has received a total of 4 sub-codes, all of which were transmitted as sub-codes having different sub-code code rates by one 3,072-bit encoded packet, an information block.
  • the receiver should generate the soft metrics for the N codewords by soft combining the sub-codes in the above manner.
  • the receiver can use N or N ⁇ Q bit buffers to realize a rotational buffer, or use a buffer memory with a fixed size and design a buffer address generator to generate rotational addresses.
  • the received symbols are stored in the buffer by advancing by 10,752 bits from the addr_A. Since it is also the step of storing the symbols after storing the N symbols, the symbols are soft-combined with the previously stored symbols in the above method. Let an address where this part of the soft combining is completed be addr_B. Then, if the C 20 is received next, the received symbols are stored in the buffer by advancing by 5,376 bits from the addr_B. Let an address where the part of the soft combining is completed be addr_C. Then, if the C 21 is received next, the received symbols are stored in the buffer by advancing by 5,376 bits from the addr_C.
  • the receiver continuously performs soft combining on the sub-codes transmitted by one encoded packet in the above method and generates soft metrics for a total of N codeword symbols after completing this process.
  • the codeword separator separates the soft metrics for the N soft-combined codeword symbols into an information symbol part X, a first parity symbol part Y 0 , Y 1 , and a second parity symbol part Y 0 ',Y 1 ', Group Separation.
  • the demultiplexer M1 (515) and M2 (525) demultiplex the first parity symbol part Y 0 , Y 1 and the second parity symbol part Y 0 ', Y 1 ', respectively, thereby to rearrange them in an information symbol part X, a demultiplexed first parity symbol part Y 0 , Y 1 , and a demultiplexed second parity symbol part Y 0 ', Y 1 '.
  • This operation can be performed either sequentially or simultaneously.
  • the information symbol part X, the demultiplexed first parity symbol part Y 0 , Y 1 , and the demultiplexed second parity symbol part Y 0 ', Y 1 ' are separated again into a stream of 5 codeword symbols X, Y 0 , Y 0 ', Y 1 , and Y 1 ', and then transmitted to sub-block deinterleaving blocks 506, 516, 526, 536 and 546, respectively.
  • the sub-block deinterleaving can be realized either such that 5 codeword symbols can be deinterleaved by deinterleaving one sub-block, or such that the codeword symbols can be independently deinterleaved by as many deinterleavers as the number of the codeword symbols.
  • a description of the present invention is not limited to realization of specific sub-block interleaving, but given on the assumption that a reverse process of the sub-block interleaving generally used in the transmitter is performed by the sub-block deinterleaving blocks in the receiver.
  • the decoder decodes the soft metrics for the N codeword symbols provided from the sub-block deinterleaving blocks, and outputs transmitted information symbols, i.e., an encoded packet.
  • the communication system according to the present invention can generate complementary turbo codes and quasi-complementary turbo codes.
  • the communication system can drastically improve its throughput by applying the complementary turbo codes to the ARQ scheme.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Detection And Correction Of Errors (AREA)
EP02003682A 2001-02-16 2002-02-18 Apparatus and method for generating and decoding codes in communication system Expired - Lifetime EP1233524B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR2001007916 2001-02-16
KR1020010007916A KR100724921B1 (ko) 2001-02-16 2001-02-16 통신시스템에서 부호 생성 및 복호 장치 및 방법

Publications (3)

Publication Number Publication Date
EP1233524A2 EP1233524A2 (en) 2002-08-21
EP1233524A3 EP1233524A3 (en) 2003-03-26
EP1233524B1 true EP1233524B1 (en) 2009-04-01

Family

ID=36694105

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02003682A Expired - Lifetime EP1233524B1 (en) 2001-02-16 2002-02-18 Apparatus and method for generating and decoding codes in communication system

Country Status (12)

Country Link
US (1) US7200181B2 (ko)
EP (1) EP1233524B1 (ko)
JP (1) JP3636709B2 (ko)
KR (1) KR100724921B1 (ko)
CN (1) CN1264280C (ko)
AU (1) AU2002233795B2 (ko)
BR (1) BR0204147A (ko)
CA (1) CA2406043C (ko)
DE (2) DE60231765D1 (ko)
GB (1) GB2377351B (ko)
RU (1) RU2236756C2 (ko)
WO (1) WO2002067434A1 (ko)

Families Citing this family (44)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100361033B1 (ko) * 2001-01-16 2003-01-24 한국과학기술원 비균일 반복부호를 바탕으로 한 터보부호를 쓰는다중반송파 직접수열 부호분할 다중접속 시스템
KR100365352B1 (ko) * 2001-03-06 2002-12-18 엘지전자 주식회사 이동통신 시스템에서의 채널 인식 코드 발생 장치 및 방법
KR100860660B1 (ko) * 2002-01-09 2008-09-26 삼성전자주식회사 통신시스템의 인터리빙 장치 및 방법
DE10207146A1 (de) * 2002-02-20 2003-08-28 Infineon Technologies Ag Hardware-Schaltung zur Punktierung und Wiederholungscodierung von Datenströmen und Verfahren zum Betrieb der Hardware-Schaltung
KR100909527B1 (ko) * 2002-11-04 2009-07-27 삼성전자주식회사 고속 패킷데이터 통신시스템에서의 터보 복호 시간 제어방법
EP1542369A1 (en) * 2003-12-09 2005-06-15 STMicroelectronics N.V. Method and system for de-interleaving of data
KR100770902B1 (ko) 2004-01-20 2007-10-26 삼성전자주식회사 고속 무선 데이터 시스템을 위한 가변 부호율의 오류 정정부호 생성 및 복호 장치 및 방법
US7392464B1 (en) * 2004-04-30 2008-06-24 Marvell International Ltd. Universal parity encoder
KR101131323B1 (ko) * 2004-11-30 2012-04-04 삼성전자주식회사 이동통신 시스템에서 채널 인터리빙 장치 및 방법
US20090022079A1 (en) * 2005-05-04 2009-01-22 Fei Frank Zhou Method and apparatus for providing enhanced channel interleaving
KR100723308B1 (ko) * 2005-12-10 2007-05-30 한국전자통신연구원 멀티 캐리어를 이용한 신호 송/수신 장치
KR100746291B1 (ko) * 2006-06-29 2007-08-03 삼성전자주식회사 멀티채널 디지털 방송 시스템의 송수신 방법과 그 장치
KR101015714B1 (ko) * 2006-08-21 2011-02-22 삼성전자주식회사 하이브리드 자동 반복 요구를 사용하는 시스템에서 다수의모부호를 이용한 재전송 방법 및 장치
US7778307B2 (en) * 2006-10-04 2010-08-17 Motorola, Inc. Allocation of control channel for radio resource assignment in wireless communication systems
US20080084853A1 (en) 2006-10-04 2008-04-10 Motorola, Inc. Radio resource assignment in control channel in wireless communication systems
US8356232B2 (en) * 2006-10-06 2013-01-15 Motorola Mobility Llc Method and apparatus for encoding and decoding data
BRPI0717860B1 (pt) * 2006-11-03 2020-01-21 Google Technology Holdings LLC método em um dispositivo de comunicação sem fio e método em uma entidade de infra-estrutura de rede de comunicação sem fio
US20080120530A1 (en) * 2006-11-22 2008-05-22 Yu-Min Chuang Transceiver puncture circuit of wireless communication system
JP2008154246A (ja) * 2006-12-19 2008-07-03 Asustek Computer Inc プロトコルエラー回復方法及び通信装置
KR20080092232A (ko) * 2007-04-11 2008-10-15 삼성전자주식회사 전송스트림 생성 장치 및 터보 패킷 디멀티플렉싱 장치그리고 그 방법
WO2008151061A1 (en) * 2007-05-31 2008-12-11 Interdigital Technology Corporation Channel coding and rate matching for lte control channels
KR101435830B1 (ko) * 2007-06-20 2014-08-29 엘지전자 주식회사 인터리빙 수행 방법
US8233532B2 (en) 2007-09-21 2012-07-31 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Information signal, apparatus and method for encoding an information content, and apparatus and method for error correcting an information signal
US8281211B2 (en) * 2008-05-15 2012-10-02 Nokia Corporation System and method for relay coding
RU2011147727A (ru) * 2009-04-24 2013-05-27 Панасоник Корпорэйшн Устройство беспроводной связи и способ беспроводной связи
US8543884B2 (en) * 2009-06-16 2013-09-24 Qualcomm Incorporated Communications channel parallel interleaver and de-interleaver
US9397699B2 (en) 2009-07-21 2016-07-19 Ramot At Tel Aviv University Ltd. Compact decoding of punctured codes
US8516351B2 (en) 2009-07-21 2013-08-20 Ramot At Tel Aviv University Ltd. Compact decoding of punctured block codes
US8375278B2 (en) 2009-07-21 2013-02-12 Ramot At Tel Aviv University Ltd. Compact decoding of punctured block codes
US8516352B2 (en) 2009-07-21 2013-08-20 Ramot At Tel Aviv University Ltd. Compact decoding of punctured block codes
JP5521722B2 (ja) * 2010-04-14 2014-06-18 沖電気工業株式会社 符号化装置、復号化装置、符号化・復号化システム、及び、プログラム
US8614977B2 (en) 2010-05-11 2013-12-24 Qualcomm Incorporated Method and apparatus for parallel de-interleaving of LTE interleaved data
EP2413530B1 (en) * 2010-07-27 2016-06-29 ADVA Optical Networking SE An apparatus and a method for performing a fractional bit encoding and decoding
KR101362116B1 (ko) 2010-07-29 2014-02-12 한국전자통신연구원 사용자 기기 모뎀을 위한 물리 상향링크 공유 채널 인코더 및 그것의 인코딩 방법
RU2461964C1 (ru) * 2011-08-09 2012-09-20 Государственное казенное образовательное учреждение высшего профессионального образования Академия Федеральной службы охраны Российской Федерации (Академия ФСО России) Способ помехоустойчивого декодирования сигналов, полученных с использованием параллельного каскадного кода проверки на четность с низкой плотностью
KR102139721B1 (ko) * 2013-08-29 2020-07-30 삼성전자주식회사 다중 경로 프로토콜에서 이중으로 네트워크 코딩을 적용하는 방법 및 그 장치
WO2015072905A1 (en) * 2013-11-12 2015-05-21 Telefonaktiebolaget L M Ericsson (Publ) Devices and methods for handling blind (re)transmissions in a network
KR102137730B1 (ko) * 2014-04-17 2020-07-24 삼성전자주식회사 모바일 비디오 애플리케이션을 위한 네트워크 중심의 QoE 프로비저닝 방법 및 장치
KR102191303B1 (ko) * 2014-04-17 2020-12-15 삼성전자 주식회사 부호어를 생성하는 방법 및 장치 그리고 부호어를 복원하는 방법 및 장치
JP2019149589A (ja) * 2016-07-08 2019-09-05 シャープ株式会社 基地局装置、端末装置、通信方法、および、集積回路
CN108400844B (zh) * 2017-02-04 2021-07-20 华为技术有限公司 信息处理的方法、装置、通信设备和通信系统
RU2700398C1 (ru) * 2018-12-29 2019-09-16 Акционерное общество "Концерн "Созвездие" Способ передачи данных в системе цифровой радиосвязи на основе кодов с низкой плотностью проверок на четность и способ перемежения кодовых символов
RU2713573C1 (ru) * 2019-06-03 2020-02-05 Акционерное общество "Концерн "Созвездие" Устройство передачи данных на основе кодов с низкой плотностью проверок на четность
RU2755295C1 (ru) * 2021-01-18 2021-09-14 Акционерное общество "Концерн "Созвездие" Способ перемежения кодовых символов в коде с низкой плотностью проверок на четность

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5381425A (en) * 1992-03-27 1995-01-10 North Carolina State University System for encoding and decoding of convolutionally encoded data
US5784388A (en) * 1996-01-04 1998-07-21 Knox; Gregory D. Methods and apparatus for decoding control signals in dispatch trunked radio system
US6165761A (en) * 1997-12-22 2000-12-26 Novo Nordisk A/S Carbohydrate oxidase and use thereof in baking
US6370669B1 (en) * 1998-01-23 2002-04-09 Hughes Electronics Corporation Sets of rate-compatible universal turbo codes nearly optimized over various rates and interleaver sizes
KR20000008151A (ko) * 1998-07-10 2000-02-07 정선종 터보 부호기 및 복호기의 꼬리비트 첨가방법
CA2243013A1 (en) * 1998-07-14 2000-01-14 Mark Bingeman Parallel concatenated convolutional coding
US6298463B1 (en) * 1998-07-31 2001-10-02 Nortel Networks Limited Parallel concatenated convolutional coding
GB9819689D0 (en) * 1998-09-10 1998-11-04 Nds Ltd Decoding symbols representing digital words
KR100306282B1 (ko) * 1998-12-10 2001-11-02 윤종용 통신시스템의인터리빙/디인터리빙장치및방법
US6202189B1 (en) * 1998-12-17 2001-03-13 Teledesic Llc Punctured serial concatenated convolutional coding system and method for low-earth-orbit satellite data communication
KR100350459B1 (ko) * 1998-12-26 2002-12-26 삼성전자 주식회사 통신시스템의인터리빙/디인터리빙장치및방법
CA2268853C (en) * 1999-04-13 2011-08-02 Wen Tong Rate matching and channel interleaving for a communications system
KR100384098B1 (ko) * 1999-04-27 2003-05-14 휴우즈 일렉트로닉스 코오포레이션 통신 네트워크에서 레이트 매칭 알고리즘을 사용하는시스템 및 방법
US6308294B1 (en) * 1999-11-17 2001-10-23 Motorola, Inc. Adaptive hybrid ARQ using turbo code structure
US6980605B2 (en) * 2000-01-31 2005-12-27 Alan Gatherer MAP decoding with parallelized sliding window processing
WO2001091355A1 (en) * 2000-05-22 2001-11-29 Samsung Electronics Co., Ltd Data transmission apparatus and method for an harq data communication system
KR100442685B1 (ko) * 2000-10-21 2004-08-02 삼성전자주식회사 통신시스템에서 부호 생성장치 및 방법
JP3753694B2 (ja) * 2001-02-07 2006-03-08 サムスン エレクトロニクス カンパニー リミテッド 通信システムにおける符号生成装置及び方法
RU2233541C2 (ru) * 2001-02-13 2004-07-27 Самсунг Электроникс Ко., Лтд. Устройство и способ генерирования кодов в системе связи
KR100770902B1 (ko) * 2004-01-20 2007-10-26 삼성전자주식회사 고속 무선 데이터 시스템을 위한 가변 부호율의 오류 정정부호 생성 및 복호 장치 및 방법

Also Published As

Publication number Publication date
AU2002233795B2 (en) 2004-12-09
DE60231765D1 (de) 2009-05-14
WO2002067434A1 (en) 2002-08-29
CA2406043A1 (en) 2002-08-29
GB2377351A (en) 2003-01-08
DE20202467U1 (de) 2002-07-25
EP1233524A2 (en) 2002-08-21
CN1264280C (zh) 2006-07-12
US7200181B2 (en) 2007-04-03
RU2236756C2 (ru) 2004-09-20
CN1459148A (zh) 2003-11-26
KR20020067382A (ko) 2002-08-22
KR100724921B1 (ko) 2007-06-04
RU2002127723A (ru) 2004-02-27
JP2004519885A (ja) 2004-07-02
US20020114401A1 (en) 2002-08-22
BR0204147A (pt) 2003-02-11
GB0203771D0 (en) 2002-04-03
GB2377351B (en) 2004-07-21
EP1233524A3 (en) 2003-03-26
CA2406043C (en) 2006-07-18
JP3636709B2 (ja) 2005-04-06
AU2002233795A1 (en) 2002-09-04

Similar Documents

Publication Publication Date Title
EP1233524B1 (en) Apparatus and method for generating and decoding codes in communication system
EP1545036B1 (en) Apparatus and method for generating code in a communication system
KR100547857B1 (ko) 이동통신시스템에서 복합 재전송장치 및 방법
US8520496B2 (en) Method and apparatus for rate matching within a communication system
US20020181603A1 (en) Apparatus and method for generating codes in a communication system
WO2002033910A1 (en) Generating codes in a communication system
AU2003252889B2 (en) Apparatus for generating codes in communication system
GB2394153A (en) A Quasi-Complementary Turbo Code (QCTC) generating apparatus

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20020218

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

17Q First examination report despatched

Effective date: 20030709

AKX Designation fees paid

Designated state(s): DE FI FR IT SE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

APBT Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9E

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FI FR IT SE

REF Corresponds to:

Ref document number: 60231765

Country of ref document: DE

Date of ref document: 20090514

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090401

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090701

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20100105

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20101029

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100301

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100901

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20210209

Year of fee payment: 20