AU2003252889B2 - Apparatus for generating codes in communication system - Google Patents

Description

AUSTRALIA

Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Applicant(s): SAMSUNG ELECTRONICS CO., LTD.

Invention Title: APPARATUS FOR GENERATING CODES IN COMMUNICATION

SYSTEM

The following statement is a full description of this invention, including the best method of performing it known to me/us: APPARATUS FOR GENERATING CODES IN COMMUNICATION SYSTEM BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates generally to code generation in a data communications system, and in particular, to an apparatus and method for generating complementary turbo codes, considering the characteristics of turbo codes in a packet communications system or a general communications system that employs a retransmission scheme. The present application is a divisional application of parent application No. 2002233774 which is directed to methods.

2. Description of the Related Art In general, a system using a retransmission scheme HARQ: Hybrid Automatic Repeat Request) performs soft combining to improve transmission throughput. The soft combining techniques are divided into packet diversity combining and packet code combining. These two combining schemes are usually called soft packet combining. Although the packet diversity combining scheme is sub-optimal in performance relative to the packet code combining scheme, it is favorable due to easy implementation when performance loss is low.

A packet transmission system uses the packet code combining scheme to improve transmission throughput. A transmitter transmits a code with a different code rate at each packet transmission. If an error is detected from the received packet, a receiver requests a retransmission and performs soft combining between the original packet and a retransmitted packet. The retransmitted packet may have a different code from the previous packet. The packet code combining scheme is a process of combining received N packets with a code rate R to a code 3 0 with an effective code rate of R/N prior to decoding, to thereby obtain a coding 1 gain.

With regard to the packet diversity combining scheme, on the other hand, the transmitter transmits the same code with a code rate R at each packet transmission. If an error is detected from the received packet, the receiver requests a retransmission and performs soft combining between the original packet and the retransmitted packet. The retransmitted packet has an identical code to that in the previous packet. In this sense, the packet diversity combining scheme can be considered the received symbol energy averaging on a random channel. The packet diversity combining scheme reduces noise power by averaging the soft outputs of the received input symbols and achieves such a diversity gain as offered by a multi-path channel because the same code is repeatedly transmitted on a fading channel. However, the packet diversity combining scheme does not provide such an additional coding gain as obtained according to a code structure in the packet code combining scheme.

In the meanwhile, a turbo encoder generating the turbo code will be described hereinbelow. In the case of a turbo encoder with R=1/5, the turbo encoder generates information symbols X, first parity symbols Yo, Yo' 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. In detail, the Yo is a row of first parity symbols generated from a first constituent encoder, and the Y 0 is a row of second parity symbols generated from the first constituent encoder.

Due to implementation simplicity, most packet communication systems have used the packet diversity combining scheme, which is under study for 2 03/11 2004 17:08 FAX 61 3 92438333 GRIFFITH HACK IPAUSTRALIA 1[006 application to the synchronous IS-2000 system and asynchronous UNITS system.

The reason is that the existing packet communication systems have Jsed convolutional codes and even packet code combining does not offer i great gain when convolutional codes with a low data rate are used. If a system with R=1/3 supports retransmission, there is not a wide difference in performance between the packet code combining scheme and the packet diversity combiniAg scheme.

Thus, the packet diversity combining scheme is selected considering! implementation complexity. However, use of turbo codes as forward error correction codes (FEC) requires a different packet combining mechatism because the turbo codes are designed as error correction codes to hav performance characteristics very close to the "Shannon Channel Cap4city Limit" and their performance varies obviously with the coding rates unlike convolutional codes. Therefore, it can be concluded that packet codde combining is desirable for a packet communication system using turbo codes in a retransmission scheme to achieve the goal of optimum performance.

SUMMARY OF THE INVENTION According to the invention there is provided a QCTC (Quasi- Complementary Turbo Code) generating apparatus comprising: 1 a turbo encoder having a plurality of constituent encoders, wherein an information symbol sequence and a plurality of parity symbol sequences are generated according to a given code rate by encoding the input information bits, each of the constituent encoders generate at least one parity symbl sequence, whereby at least one parity symbol sequence from one constitunt encoder corresponds to the at least one parity symbol sequence from anotheg constituent encoder, a channel interleaver wherein the information symbol sequepce and the parity symbol sequences are individually interleaved, the interleaved symbols of the corresponding parity symbol sequences are alternately arranged, and serial 3 a\B3 c 3/11 X.Ms&st a\ew&spoilrni5 iPS nesndcdpveci.dte 1/1/04 COMS ID No: SBMI-00982680 Received by IP Australia: Timne 17:21 Date 2004-11-03 03/11 2004 17:09 PAX 61 3 92438333 GRIFFITH HACK IPAUSTRALIA Z007 0 0 ,1 concatenation of the interleaved information symbol sequence and ihe arranged 0 parity symbol sequences is performed; and Z a QCTC generator wherein a sub-code of a QCTC is generated by en o repeating the serially concatenated symbol sequence and selecting a predetermined number of symbols from the repeated symbol sequence according 0^ to code rate and selection information. 00 00 According to another aspect there is provided an interleaving apparatus en including a turbo encoder for generating an information symbol secquence and a plurality of parity symbol sequences by encoding the information symbol sequence, for generating QCTC, comprising: I an interleaver for individually interleaving the information symbol sequence and the parity symbol sequences;a multiplexer for generating a new parity symbol sequence by multiplexing the interleaved symbols of the corresponding parity symbol sequences; and a symbol concatenator for serially concatenating the interleaved information symbol sequence and the new parity symbol sequence.

According to another aspect there is provided a QCTC (Quasi- 2 o Complementary Turbo Code) generating apparatus comprising: a turbo encoder wherein an information symbol sequence and a plurality of parity symbol sequences are generated by encoding the information symbol sequence; i a channel interleaver wherein the information symbol sequence and the parity symbol sequences are individually interleaved, by multiplexin the symbols of parity symbol sequences with the same priority levels, and serially concatenating the information symbol sequence and the new parity symbol sequences; and a QCTC generator wherein a sub-code of a QCTC with a givdn code rate is generated by recursively selecting a predetermined number of symtol from the -4I Ri\IIOIJa\Xsep\S lpccisr~ 0990~Andhedinlpe Ci.tv 3/21/04 COMS ID No: SBMI-00982680 Received by [P Australia: Time 17:21 Date 2004-11-03 03/11 2004 17:09 FAX 61 3 92438333 GRIFFITH HACK IPAUSTRALIA U 008 o 1 o CI serially concatenated symbol sequence at a given starting position according to the code rate.

z e¢n 0j BRIEF DESCRIPTION OF THE DRAWINGS 00 00 Objects, features and advantages of the present invention will become N i tt more apparent from the following detailed description when taken in] conjunction M with the accompanying drawings in which: o 10 FIG 1 is a schematic block diagram of a QCTC (Quasi-Cotiplementary Turbo Code) generating apparatus according to an embodiment oi the present invention; FIG 2 is a block diagram of an embodiment of the QCTC generating apparatus according to the present invention; and FIG. 3 is a block diagram of another embodiment of the QCTS generating apparatus according to the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMIENTS .j Preferred embodiments of the present invention will be described hereinbelow with reference to the accompanying drawings. In tle following description, well-known functions or constructions are not descrinted in detail since they would obscure the invention in unnecessary detail.

n,.\cte31a\KngcI\nal\pS s13 .wndd ulpee±.A 3 :/1/0-4 COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 03/11 920 0 1 7 n V nn I o oj GRIFFITH HACK e IPAUSTRALIA

O

The present invention provides a QCTC generating method for a ystem using channel interleaving and a method of generating QCTCs in a predetermined way irrespective of a variable code length in a system req iring 8 QCTCs with a variety of code rates. A QCTC is defined as a coplemn tary o0 generated using a turbo The QCTC is not a perfect complemintary 00 ci code as noted from the term "quasi" because a sub-code includes reea ci symbols and has a different characteristic such as error correcting cabiy from 0 another sub-code, 1 0 FIG. 1 is a schematic block diagram of a QCTC generating alaratus according to one embodiment of the present invention. The QCTC generating apparatus shown in FGI. 1 is characterized by carrying out symbol secuence repetition and puncturing after channel interleaving when generating sub-codes.

Referring to FIG 1, an encoder 101 generates code symbols by edJcoding an input encoder packet A convolutional encoder or a turbo encoder can e used as the encoder 101. The encoder 101 has a code rate of, for example, 1 For the input of 3,072 information bits, the encoder 101 outputs 15,36 code symbols. A channel interleaver 102 interleaves the code symbols accordidg to a Predetermined rue. If the encoder 101 is a turbo encoder, the interleav 102 iterleaves information symbols X, and parity symbols

Y

0 Y, y an Y separately. A QCTC generator 103 generates sub-codes by puncturin and repeating the interleaved symbols. The channel interleaver 102 and the QCTC generator 103 perform the QCTC generation process.

If the number of interleaved code syinbols is 15,360 and the data rate (or code rate) of sub-codes is given as 307.2kbps, the QCTC generator 103 geneates the first sub-code having 21,504 symbols by taking the 15,360 interleaved "ode symbols and repeating part of the first half of the interleaved code symbol. If the data rate is 614.4kbps, the QCTC generator 103 generates the first sub- ode -6- 009 COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 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.

To generate a QCTC (or sub-codes), the channel interleaver 102 should take particular characteristics because the five symbols X, Y 0

Y

1 Yo', and YI' are distributed through channel interleaving and the distributed code symbols are not suitable for the input of the QCTC generator 103 and because it is not easy to generate sub-codes satisfying the characteristics of a QCTC with the mixed symbols of X, Y 0

Y

1

Y

0 and Y 1 In this context, the present invention provides a method of generating a QCTC in a predetermined way irrespective of the code rate of each sub-code.

FIG. 2 is a block diagram of the QCTC generating apparatus according to an embodiment of the present invention.

Referring to FIG. 2, an encoder 201 generates code symbols by encoding input information symbols input encoder packet). The encoder 201 uses a mother code with R=1/5 or with any other code rate. A mother code is determined by the system used. A turbo code with R=1/5 is used herein as a mother code by way of example. Then, 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 Yo and Yo' are output from a first constituent encoder and the second parity symbols Y 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 Yo 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 7 03/11 2004 17:10 FAX 61 3 92438333 GRIFFITH HACK SIPAUSTRALIA @010

O

O

Z A demultiplexer (DEMUX) 202 groups the code symbols received from 0 .the encoder 201 into information symbols X 203, parity symbols Yo 23, parity symbols Y 223, parity symbols Yo' 233, and parity symbols

Y

1 243 and outputs the five symbol groups to corresponding respective interleavers 204, J14, 224, 00 00 5 234 and 244.

c Interleavers 204, 214, 224,234 and 244 randomly permute the s equences 0 of the input code symbols by interleaving. Various interleaving meods are available as long as the following condition is satisfied.

i (Condition) Interleaved code symbols are partially punctured id 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 code jsymbol groups X, Yo, Y 1

Y

0 and Y 1 are punctured in the same number of code symbol positions, the distance between punctured code symbol positions in me code symbols before interleaving must be equal to achieve optimum turbp code performance. In other words, when puncturing is applied to turbo codes, uniformity is a significant factor that determines the performance of th9 turbo codes. In accordance with the preferred embodiment, sub-block interleaving, applies independently to the code symbols X, Yo, Yo',Y, and Uniform puncturing in each interleaver output maintains an equal distance be ven punctured code symbols in encoder output. Therefore, it can be conclude# that channel interleaving must be chosen so that puncturing in interleaved code symbols can maintain a uniform puncturing distribution in channel en oder ouput.

Such channel interleaving methods include bit reversal order

(PRO)

interleaving and partial bit reversal order (PBRO) interleaving. The IBRO interleaving is practicable only if the number of input information symbols to an COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 03/11 2004 17:10 FAX 61 3 92438333 GRIFFITH BACK IPAUSTRALIA l011 block interleaver such as block size N2i 0 0 Senodeutputr and the number of each code symbobo set X, Yo,, Y, and Y' are not powers of 2 in rder to powers of 2, that is, 2nterl, wherein m is a parameter to make a block sizn of sub block interleaver such as block size N-2implemented*J. i as it satisfies The PBRO interleaving was designed to satisfy the aore-stated ton Seven if he number of informleaved co ation symbols and the number of each encoder e output symbol set nterl, Yeaver', Y204 and Y' are not powers of 2 in arder .to S overcome the limitation of he BRO interleaving. A detailed descriptiohe of this sub-block channe interleaver 214 aing will be avoided here and it is to be noted that any channel interleaving method can be implemented in the present inventionjas long The interleaved cocode symbols X 206 (shown as a block for convtena 2ce) output from the first interleaver 204 are applied directly to the input of a iymbol concatenator 207. The interleaved code symbols Y 0 and Y 1 from the secqnd and third interleavers 214 and 224 are input to a first multiplexer (MUX) 205 lmd the interleaved code symbols Ye' and Y 1 from the fourth and fifth interleavirs 234 and 244, to a second MUX 215. That is, the first MUX 205 receives the rimary parity symbols and the second MUX 215 receives the secondary parity synbols.

The first MUX 205 multiplexes the interleaved parity symbols Yo und Y, 216 and feeds the output to the symbol concatenator 207. The second M{X 215 multiplexes the interleaved parity symbols Yo' and Y 1 226 and feeds its output to the symbol concatenator 207. That is, the MUXes 205 and 215 multip ex the parity symbol sequences by priority level. With the aid of the MUXes 205 and 215, the interleaver outputs are rearranged and then divided into threi subgroups, 206, 216 and 226.

The above-described process, which is essential to generation of Q(bTCs according to embodiments of the present invention, will be described in more detail. As shown in

I

Q COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 FIG. 2, information symbols X form an independent sub-group without passing through multiplexing after sub-block interleaving. Let the sub-block interleaved symbols be Sbi_X, which can be expressed as Sb, Sb, Sb, Sb, (1) where Sbi_X(1) indicates the first code symbol output from the first interleaver 204. Sbi_X is referred to as sequence A.

Then, the interleaved code symbols Yo and Y 1 output from the second and third interleavers 214 and 224 are grouped into one sub-group. If the code symbols Yo are Sbi Yo, SbiYo can be expressed as Sbi Sbi Sb, (2) where Sbi_Yo(1) indicates the first code symbol output from the second interleaver 214. If the code symbols Y 1 are Sbi_Yi, Sbi_Yi can be expressed as Sb,_Y Sb,_Y Sb,_Y Sb,_Y (3) where Sbi_Yi(1) and Sbj_Yi(2) indicate the first and second code symbols respectively, output from the third interleaver 224. After multiplexing the code symbols Yo and Yi Sbi Sb,_Y Sb, Sb,_Y Sb (4) These multiplexed symbols are referred to as sequence B.

10 The reason for multiplexing the interleaved code symbols Sbi Yo and Sbi_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 SbjYo is equal to that of punctured symbols in Sbi_Yi only if M is an even number. If M is an odd number, the difference between the numbers of punctured symbols in SbiYo and in Sbi_Yi is only 1. The multiplexing always satisfies the QCTC characteristic that the number of punctured parity symbols Yo is equal to that of punctured parity symbols Y 1 In the same manner, the interleaved code symbols Yo' and YI' output from the fourth and fifth interleavers 234 and 244 are grouped into one subgroup. If the code symbols Yo' and Y 1 are Sbi_Yo' and Sbi_YI', respectively, Sbi_Yo' and Sbi_Y 1 can be expressed as Sbi Sbi Sb, Sb, and Sbi Sbi Sbi Sbi (6) Then, the output of the second MUX 215 is Sb Sb, Sb,_ Sb, Sb,_ Sb,_ (7) These multiplexed symbols are referred to as sequence C.

The reason for multiplexing the interleaved code symbols SbiYo' and Sbi_Y' 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 11 punctured symbols in Sbi_Yo' is equal to that of punctured symbols in Sbi_Y 1 only if M is an even number. If M is an odd number, the difference between the numbers of punctured symbols in Sbi_Yo' and in Sbi_Y 1 is only 1. The multiplexing always satisfies the QCTC characteristic that the number of punctured parity symbols Yo' is equal to that of punctured parity symbols Y 1 The symbol concatenator 207 sequentially concatenates the sequences A, B and C of the first, second, and third sub-groups and generates a symbol sequence B Sb_ Sb [Sb, Sb, Sb,_ Y(2), Sb [Sb_ Sb Sb Sb, (8) As seen from the above formula, information symbols are placed first, followed by alternating parity symbols Yo and Y 1 and then by alternating parity symbols Yo' and Y 1 in the sequence This symbol arrangement assumes a very significant meaning in QCTC generation, which will be described below.

Puncturing should be carried out to generate a sub-code with a code rate from the turbo code of The puncturing is defined by a "QCTC". The QCTC should have the following characteristics.

Information symbols precede all other code symbols in transmission.

Especially, as the code rate of sub-codes is close to 1, this characteristic becomes more important.

12 A puncturing pattern is formed so that the number of parity symbols output from each constituent encoder (a first constituent encoder and a second constituent encoder) is equal or their difference in number is minimum.

The number of punctured symbols in the parity symbols Y 0 and Y 0 is determined such that the code rate of the first constituent encoder is always less than 1. That is, the performance of turbo codes is ensured when at least one parity symbol Y 0 or Y 0 exists.

The distance between punctured symbols in a QCTC resulting from puncturing is equal.

A turbo code produced by combining sub-codes of QCTCs assumes the characteristics of a quasi-complementary code.

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 satisfies the above five characteristics. In other words, an intended subcode of a QCTC is generated by repeating and puncturing as many symbols as needed in the symbol sequence 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. Alternatively, a higher layer 13 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.

In other words, 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.

Returning to FIG. 1, assuming a mother code rate R=1/5 and 3,072 input information bits, the channel encoder 101 outputs 15,360 code symbols.

Hereinbelow, there will be a description of generating QCTCs with different code rates (or data rates), for example, a first QCTC Coj at 307.2kbps, a second QCTC Cj at 614.4kbps, and a third QCTC C3j at 1288.8kbps, from the code symbols.

As described before, the 15,360 code symbols are classified into five subgroups, interleaved, and then rearranged as the symbol sequence of Eq. Then, the 15,360 code 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.

14 For a data rate of 307.2kbps, if the sub-codes of the first QCTC Coj are 21,504 bits in length, the first sub-code Coo is generated by selecting the first 21,504 symbols from the interleaved and repeated symbol sequence. The second sub-code Col is generated by selecting 21,504 symbols starting with the symbol following the first sub-code Coo from the repeated symbol sequence. The third sub-code C 02 is generated by selecting the following 21,504 symbols.

Similarly, for a data rate of 614.4kbps, if the sub-codes of the second QCTC Clj are 10,752 bits in length, the first sub-code C 10 is generated by selecting the first 10,752 symbols from the repeated symbol sequence. In other words, the first sub-code CI 0 is generated by pruning all subsequent symbols following the first 10,752 symbols in the repeated 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 CIO from the repeated symbol sequence. The third sub-code C 1 2 is generated by selecting the 10,752 symbols following the second sub-code CI,.

Similarly, for a data rate of 1228.8kbps, if the sub-codes of the third QCTC C 2 j are 5,376 bits in length, the first sub-code C 20 is generated by selecting the first 5,376 symbols from the repeated symbol sequence. The second subcode C 21 is generated by selecting 5,376 symbols starting with the symbol following the first sub-code C 2 0 o from the repeated 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. When a data rate (or code rate) for retransmission is determined, the system selects a QCTC corresponding to the data rate and generates a sub-code by selecting a predetermined number of 15 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 case, sub-codes are generated by repeating a block of interleaved symbols. To do so, a storing area is needed to store the repeated blocks.

Alternaively, the interleaved symbols can be 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 sequence repeater 208 can be omitted since the circular buffer memory functions as the symbol sequence repeater 208.

The above embodiment of the present invention describes twodimensional QCTCs. In the two-dimensional QCTC scheme, a QCTC corresponding to each code rate is generated independently and the sub-codes of the QCTC are sequentially transmitted. However, the two-dimensional QCTCs are not optimum for the reasons described below.

As shown in FIG. 2, it is assumed that the first sub-code Coo of the first QCTC Coj is used for initial transmission, the first sub-code C 10 of the second QCTC Cj is used for the next transmission, and the first sub-code C 20 of the third QCTC C2j is used for the third transmission. Then, a receiver decodes data by combining the three sub-codes (Coo, C 10

C

20 In this case, however, 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 not to optimize decoding performance. This implies that there is a problem with the transmission order of the sub-codes, that is, selection of the sub-codes. To overcome the problem, adaptive QCTCs are proposed. In the adaptive QCTC scheme, the 3 0 number of code symbols to be selected is determined according to the code rate 16 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 embodiment 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.

It is assumed that transmission starts at time k, a sub-code transmitted at time is expressed as Cij(k+h), and the code symbols of a mother code with are Cm(0), Cm(N-1). The number of the code symbols, N, is defined as L_INFx5 since the mother code rate is 1/5. Here, 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.

For an initial transmission, one Cio of the first sub-codes C 00

C

10

C

2 0 of available QCTCs is selected according to a given code rate and the length of the 17 selected sub-code Cio is stored as a variable L_SC. The code rate or length LSC 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 the number of sub-codes is not limited.

Step 2: a sub-code for initial transmission is selected and transmitted.

After the length of a sub-code to be transmitted is determined, C(L_SC-1) are selected among the code symbols of the mother code. IfL_SC exceeds N, Cm(O), Cm(N) are transmitted P times and then Cm(O), Cm(1), Cm(q-1) are transmitted. Here, P and q are the quotient and remainder of L_SC/N, respectively and P and q are calculated by L_SC mod N. Then, 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.

For the next transmission, 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. The length L_SC and the code rate R SC is in the relation of L_SC L_INFx(1/ (9) A higher layer system transmits the sub-code length LSC and the sub-code code rate R_SC to the symbol puncturer 309 for each transmission.

Step 4: a sub-code for the next transmission is selected and transmitted.

18 After the length LSC of the sub-code to be transmitted is determined, Cm(q), C(q+L_SC-1) 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 Cm(q) are selected recursively and transmitted P times and then the remaining q' code symbols are sequentially transmitted. Here, P and q' are the quotient and remainder of (LSC)/N, respectively and P and q are calculated by (q+LSC) mod N. Then, 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.

After the generated sub-code is transmitted, the procedure returns to step 3.

The transmission of adaptive QCTCs will be made clear with cases shown in FIG. 3. Referring to FIG. 3, a low rate sub-code with a code rate of 1/7 is initially transmitted in Case 1, and a high rate sub-code with a code rate of 4/7 is initially transmitted in Case 2. As seen from the cases, 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 from the repeated mother code symbols, at each transmission.

In real implementation, a buffer is not used to store times repeatedmother 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.

19 While the invention has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

It is to be understood that, if any prior art publication is referred to herein, such reference does not constitute an admission that the publication forms a part of the common general knowledge in the art, in Australia or any other country.

In the claims which follow and in the preceding description of the invention, except where the context requires otherwise due to express language or necessary implication, the word "comprise" or variations such as "comprises" or "comprising" is used in an inclusive sense, i.e. to specify the presence of the stated features but not to preclude the presence or addition of further features in various embodiments of the invention.

20

Claims (12)

1. 2. The QCTC generating apparatus of claim 1, wherein the channel interleaver comprises: a plurality of interleavers wherein the information symbol siquence and 2 5 the plurality of parity symbol sequences are individually interleaved; a multiplexer wherein a new parity symbol sequence is generated by multiplexing the interleaved symbols of the corresponding paiity symbol sequences; and a symbol concatenator the interleaved information symbol slquence and the new parity symbol sequence are serially concatenated. 21 -1 Xt\etella\Kteqepeti\HTB\(sosBsiuin~ frrec±.elc311 COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 03/11 2004 17:11 FAX 61 3 92438333 GRIFFITH BACK [PAtISTRALIA [M013 0 i 0 o c
2. 3. The QCTC generating apparatus of claim 1, wherei the QCTC 0 generator comprises: Z a symbol repeater wherein the serially concatenated symbol! sequence is o repeated; and a symbol selector wherein the sub-code is generated by: selecting a predetermined number of symbols from the repeated symbol sequence at a given 00 00 starting position according to a given code rate. i e
3. 4. The QCTC generating apparatus of claim 3, wherein the given 0 s,~o 0 10 starting position is the position of a symbol following the last syibol selected for the previous transmission. The QCTC generating apparatus of claim 1, wherein the QCTC generator comprises: a circular buffer memory wherein the serially concatenated symbol sequence is stored; and a symbol selector wherein the sub-code is generated by: selecting a predetermined number of symbols from the serially concatenated symbol sequence at a given starting position according to a given code rate.
4. 6. The QCTC generating apparatus of claim 5, whereif the given starting position is the position of a symbol following the last symbol selected for the previous transmission. i
5. 7. The QCTC generating apparatus of claim 1, wherein the QCTC generator generates the sub-code by selecting a predetermined number of symbols from the repeated symbol sequence according to a given code rate, starting with a symbol following the last symbol selected for the previous transmission. 22 B a E B s amenje dc 3/11J0 COMS ID No: SBMI-040982680 Received by IP Australia; Time 17:21 Date 2004-11-03 03/11 2004 17:12 FAX 61 3 92438333 GRIFFITH HACK IPAUSTRALIA @|014 o C1 8. The QCTC generating apparatus of claim 1, whereinJ the channel interleaver individually interleaves the information symbol sequ nce and the Z plurality of parity symbol sequences by PBRO (Partial Bit Reversal Order) o interleaving. 011 9. The QCTC generating apparatus of claim 1, wherein the sub-code 00 7 00 of QCTC is selected from the serially concatenated symbol sequence according try) the code rate and selection information. o 10 10. An interleaving apparatus including a turbo encoder fqr generating an information symbol sequence and a plurality of parity symbol sequences by encoding the information symbol sequence, for generating QCTC, comprising: an interleaver for individually interleaving the information syrhbol sequence and the parity symbol sequences; a multiplexer for generating a new parity symbol squence by multiplexing the interleaved symbols of the corresponding parity symbol sequences; and a symbol concatenator for serially concatenating the interleaved information symbol sequence and the new parity symbol sequence.
6. 11. The interleaving apparatus of claim 10, wherein the interleaver individually interleaves the information symbol sequence and the iplurality of parity symbol sequences by PBRO (partial Bit Reversal Order) interl aving.
7. 12. The interleaving apparatus of claim 10, wherein a starting position is the position of a symbol following the last symbol selected for he previous transmission. 23 I\tl«te-2a\%wep\apeolrB\psC9g3 umeded apeci.doc 3/11/01 COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 03/11 2004 17:12 FAX 61 3 92438333 GRIFFITH HACK IPAUSTRALIA Q]015 0 C'l
8. 13. A QCTC (Quasi-Complementary Turbo Code) generatng o apparatus comprising: a turbo encoder wherein an information symbol sequence and a plurality en of parity symbol sequences are generated by encoding the informatio symbol sequence; a channel interleaver wherein the information symbol sequence and the 00 parity symbol sequences are individually interleaved, by multiplexin4 the in symbols of parity symbol sequences with the same priority levels, ani serially en concatenating the information symbol sequence and the new parity s bol o 10 sequences; and a QCTC generator wherein a sub-code of a QCTC with a given code rate is generated by recursively selecting a predetermined number of synmol from the serially concatenated symbol sequence at a given starting position according to the code rate.
9. 14. The QCTC generating apparatus of claim 13, wherein the turbo encoder comprises a plurality of constituent encoders, each constit4ent encoder generating at least one parity symbol sequence, and at least onel interleaver, wherein a primary parity symbol sequence from each constituent eticoder has a 2 0 higher priority level. The QCTC generating apparatus of claim 13, wherein the given starting position is the position of a symbol following the last symol selected for the previous transmission.
10. 16. The QCTC generating apparatus of claim 13, whereiO the QCTC generator generates a sub-code of a QCTC at a given starting positiin according to the code rate.
11. 17. The QCTC generating apparatus of any one of claims i1 to 9 and 2 4 1 COMS ID No: SBMI-00982680 Received by IP Australia: Time 17:21 Date 2004-11-03 03/11 2004 17:12 FAX 61 3 92438333 GRIFFITH HACK IPAIISTRALIA O 0 0 cN 0 eO en ci 13 to 16, and substantially as herein described with refer(nce to the accompanying drawings.
12. 18. An interleaving apparatus as claimed in any one of claims 10 to 12, and substantially as herein described with reference to the adcompanying drawings. Dated this 3rd day of November 2004 SAMSUNG ELECTRONICS CO LTD By their Patent Attorneys GRIFFITH HACK Fellows Institute of Patent and Trade Mark Attorneys of Australia 25 Il\stslllK.p\Epeci\'aB\lp59eB auledsd Speoi.doc 3/11/04 COMS ID No SBMI-00982680 Received by JP Australia: Time 17:21 Date 2004-11-03