KR100736476B1 - Method for generating indication code of rate indicator channel in a mobile communication and apparatus thereof - Google Patents

Abstract

The present invention relates to a mobile communication system. In particular, the reverse rate indicator channel (Reverse Rate Indicator Channel), in order to minimize the rate indication error rate in the 1xEV-DV Reverse Link Channel under discussion for wireless communication channel recognition The present invention relates to a coding method and apparatus for generating a code suitable for R-RICH).

The present invention provides a mobile communication system having an identifier for identifying a communication channel,

A coding unit which receives a reverse direction (RI) symbol having a predetermined range and generates an orthogonal code having a predetermined length; A puncturing unit puncturing a symbol generated in the coding unit for a predetermined range of RI; A sequence repeater for repeating N times the symbols generated by the puncturing; A symbol repeater for repeating symbols by a predetermined range and / or a rule on the output symbol of the sequence; Characterized in that consists of.

Mobile communication, reverse direction, code recognition, code generation, supplementary channel

Description

Method and generating indication code of rate indicator channel in a mobile communication and apparatus Technical Field             

 1 is a reverse connection channel structure

 2 shows the channel shapes of the directional connection and the maximum number of channels per user.

       FIG. 3 shows a data rate transmitted on an I channel of a reverse rate indication channel in FIGS. 11 and 12 and an RRI symbol obtained by binarizing the data rate.

       4 is a channel structure illustrating a conventional reverse rate indication channel.

       5 is a channel structure illustrating a reverse rate indication channel of the present invention.

       FIG. 6 is a detailed block diagram of two orthogonal coding of FIG. 5; FIG.

7 is a view illustrating a puncturing pattern in the puncturing pattern portion of FIG. 5.

8 is a diagram illustrating a repeating pattern in the symbol repeating unit of FIG. 5.

9 is a diagram illustrating a minimum hamming distance in RRI coding using FIG. 5.

FIG. 10 is a diagram showing the performance comparison in AWGN (Additive White Gaussign Noise) channel using the conventional R-RICH structure when the information string is (384, 7). FIG.                 

FIG. 11 is a view showing a performance comparison in an additive white gauge noise (AWGN) channel using the conventional R-RICH structure and the R-RICH structure of the present invention when the information string is (384, 4). FIG.

12 illustrates a conventional R-RICH channel structure for a second embodiment.

13 shows an R-RICH channel structure of the present invention for the second embodiment

FIG. 14 is a diagram showing a detailed block of a 2-orthogonal encoder unit having a length of 64 in FIG. 13 (all one principal component is at the end)

FIG. 15 is a detailed block diagram of a bi-orthogonal encoder unit having a length of 64 in FIG. 13 (with all 1 principal components first)

FIG. 16 is a view showing a minimum hamming distance by RRI coding according to the second embodiment of the present invention. FIG.

FIG. 17 shows the word error rate of RRI coding when one R-SCH is used in the second embodiment, AWGN (when using the conventional R-RICH structure and when using the R-RICH structure of the present invention). Additive White Gaussign Noise) shows the performance comparison in the channel.

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a mobile communication system, and in particular, a reverse rate indicator channel for minimizing a rate indication error rate in a 1xEV-DV reverse link channel, which is currently discussed for wireless communication channel recognition. The present invention relates to a coding method and apparatus for generating a code suitable for R-RICH.

In the present invention, two embodiments are described. The performance and effect (hamming distance, etc.) of one supplemental channel (SCH) correspond to the information strings 384 and 7, and the performance and effects of the two supplemental channels are determined by the information. Columns 384 and 4 correspond to the time of entry into the encoder section.

1xEV-DV (Evolution-Data and Voice) is a new standard of mobile communication for transmitting data and voice as well as packet switch high-speed data to the same carrier. In other words, various proposals and standards are being discussed and enacted in the 3rd generation mobile communication system. Among them, the standard of 1xEV-DV is the same as the evolution of cdma2000 standard, one of the CMT IMT-2000 standards. It is a new standard that can support not only packet switched high speed data but also circuit switched voice data in frequency.

Hereinafter, with reference to the accompanying drawings will be a general description of the conventional CDMA technology and 1xEV-DV currently being promoted.

1 shows a reverse connection channel structure.

The 1xEV-DV standard also has the Reverse Rate Indicator Channel (hereinafter referred to as R-RICH) of the Reverse Link Channel, which is used by the mobile station to transmit on the Reverse Traffic Channel. Used to indicate the data rate (rate).

The reverse link in the 1xEV-DV standard provides data rates up to 1.024Mbps. Improvements in other aspects over cdma2000 include the addition of channels to support the F-PDCH, fast ACK / NACK, fast channel feedback, rate adaptation, and fast cell selection.

2 shows the channel shapes of the directional connection and the maximum number of channels per user.

Each code channel of FIG. 2 is spread by quadrature pairs of PN sequences at a fixed chip rate of 1.2288 Mcps.

The above 1.2288 Mcps is a final value to satisfy the bandwidth used in the reverse CDMA system. More specifically, the bandwidth is 1.2288 Mcps (chip per second, where chip is a symbol-like concept), where 32 chips are later multiplied into a symbol, resulting in 768 * 32 = 24576 chips. Since the 24576 chips are sent for 20 ms, it becomes 24576/20 ms = 1.2288 Mcps.

These code channels are each spread by an appropriate set of orthogonal Walsh functions.

Each code channel is spread by a quad pair of PN sequences at a fixed chip rate of 1.2288 Mcps.

As shown in the figure, the 1xEV-DV system mostly uses the reverse channel structure of the CDMA-2000, and several channels have been introduced to support the FPDCH. That is, the Reverse ACK Channel (R-ACKCH) is for fast feedback of the forward link packet transmitted on the F-PDCH, and the Reverse Rate Indicator Channel (R-RICH) is transmitted to the mobile station. Is used to indicate the data rate transmitted on the Reverse Supplemental Code Channel (R-SCH). The Reverse Channel Quality Indicator Channel (R-CQICH) is used to indicate the data rate. The mobile station is used to indicate the channel quality measurement from the best served sector to the network, which is best represented by Walsh code spreading in the R-CQICH. The network then calculates the data rate that can be supported on the forward link.

The data frame size is transmitted for 20 ms, and each frame consists of 16 slots. Also, 24576 chips are sent for 20ms, and 1536 chips are transmitted for 1.25ms.

FIG. 3 shows a data rate transmitted on an I channel of a reverse rate indication channel shown in FIGS. 1 and 2 and an RRI symbol obtained by binarizing the data rate. In addition, the RRI symbol is used as an input of a channel structure indicating a reverse rate indication channel of FIG.

4 shows a channel structure indicating a reverse rate indication channel (R-RICH), where R-RICH is used to indicate the data rate transmitted in the reverse state by the mobile station at 1xEV-DV.

If there is one active supplemental channel, the data rate is indicated by a 4-bit RRI indicator. If two active supplemental channels are present, the data rate is indicated by a 7-bit RRI indicator.

Therefore, when two supplemental channels exist, the possible transmission rate for 20msec is 77 cases.

More specifically, referring to FIG. 4, RRI symbols, that is, RL (Reverse Link) Rate Information, 4 per 16 slots (if one supplementary channel is used by a mobile station) or 7 (by a mobile station) for 20 ms. Bit is transmitted when two supplemental channels are used). The four or seven bits generate 24-bit RRI codewords (24, 4) and (24, 7) per slot via a simplex encoder.

The generated 24 bits generate 384 bits for 20ms by repeating 16 times for data reliability, and spread with 64 chip Walsh function after Signal Point Mapping (0-> + 1, 1->-1) It is transmitted at 1.2288Mcps through the rate indication channel.

The following are the (24 * 4) and (24 * 7) generator metrics for the (24,4) and (24,7) RRI coding of FIG. 4 above.

As described above with reference to FIG. 4, the block encoded 24 symbols are repeated 16 times, resulting in 384 symbols per frame, which corresponds to (equal to) the encoding of the codewords (384, 4) and (384, 7). will be.

In the above (384,4) block encoding RRI information string (Codeword), the minimum hamming distance of the length 384 information string is 192, and in the (384,7) block encoding RRI information string (Codeword), the minimum hamming of the length 384 information string The distance is 160.

However, in the above RRI coding method, if the RRI information is decoded in the wrong state, the packet data transmitted from the mobile station (MS) for 20 msec will be decoded in the wrong state, and the base station (BS) will require retransmission of the packet data. .

This will increase the overall inference, which will reduce the system capacity of the CDMA system.

For example, when two supplementary channels are used, the reverse data rate is higher than when one supplementary channel is used, so incorrect decoding of the reverse indicator may cause more serious interference. This will reduce system performance.

Moreover, mobile stations will consume more power due to frequent packet retransmissions.

Therefore, the present invention proposes a new R-RICH structure and coding method of the Reverse Link Channel of 1xEV-DV under discussion to solve the above problems.

That is, it proposes a new R-RICH structure and coding method for the information string (384, k) including the conventional information string (384,4) and (384,7) RRI coding method.

K represents k = 1,2,3,4,5,6,7.

384 denotes the length of the information string after the repetition, and from now on, the (384, k) RRI coding notation is used instead of the conventional (24, k).

A channel recognition code generation in a mobile communication system of the present invention, comprising: a coding unit for generating a orthogonal code of a predetermined length by receiving a reverse direction (RI) symbol in a predetermined range; A puncturing unit puncturing a symbol generated in the coding unit for a predetermined range of RI; A sequence repeater for repeating N times the symbols generated by the puncturing; A symbol repeater for repeating symbols by a predetermined range and / or a rule on the output symbol of the sequence; Characterized in that consists of.

In addition, the present invention comprises the steps of inputting and coding a range of RI symbols; Symbol puncturing and repeating the symbols generated in the coding step for a predetermined range of RI; And transmitting the information generated by the symbol repetition.

In addition, the present invention provides a telecommunications system for transmitting transport channel information provided in 7 bits or less through a specific channel, comprising: a coding step of generating 64 binary symbols through quadrature coding having a length of 64; And a repeating step of repeating the binary symbol by a predetermined number.

Preferably, the 64 orthogonal coding of length 64 uses Walsh codes.

Preferably, the repetition step is characterized in that the number of repetitions is six times.

Preferably, when the transport channel information is information on two channels, the repetition step is characterized in that the number of repetitions is three times.

Preferably, the puncturing step of puncturing the 64 binary symbols by a predetermined number after the coding step, if the transport channel information is not 7 bits; And a supplementary step of generating a code sequence having a length of 384 by supplementing a binary bit with the repeated binary symbol after the repeating step.

Preferably, when the transport channel information is 4 bits, the predetermined number of puncturing steps is 4, and the number of bits to be supplemented in the replenishment step is 24.

Preferably, the present invention is characterized in that the specific channel is a reverse rate indication channel.

Preferably, the present invention is characterized in that the transport channel is a reverse supplemental channel. Other objects and features of the present invention will become apparent from the following detailed description of embodiments with reference to the accompanying drawings.

Hereinafter, a first embodiment of an apparatus and method for generating a channel recognition code in a mobile communication system according to the present invention will be described with reference to the accompanying drawings.

5 is a structure of a new R-RICH of the present invention.

As shown in the figure, k = 1-7 RI (Rate Indication) symbols are input to a Bi-orthogonal coding of length 64 having a length of 64 every 20 seconds to generate 64 binary symbols every 20 seconds.

Subsequently, the symbol puncturing unit punctures the symbols for k = 1 to 6 except for k = 7 to generate a binary symbol for each k value.

That is, 32 binary symbols for k = 1, 48 binary symbols for k = 2, 56 binary symbols for k = 3, 60 binary symbols for k = 4, and 62 binary symbols for k = 5 The symbol generates 63 binary symbols when k = 6 and 64 binary symbols when k = 7.

Thereafter, the generated binary symbol is repeated six times, and symbol repeats are generated for 20 msec for 20 msec to increase the minimum hamming distance for k = 1 to 6 except k = 7.

In other words, if k = 1, the last 192 binary symbols are repeated; if k = 2, the last 96 binary symbols are repeated; if k = 3, the last 48 binary symbols are repeated; and k = 4. Repeat the last 24 binary symbols, repeat the last 12 binary symbols if k = 5, and repeat the last 6 binary symbols if k = 6. However, when k = 7, the binary symbol is not repeated.

It is spread with Signal Point Mapping (0-> + 1, 1->-1) and 64 chip Walsh function and transmitted to 1.2288Mcps through reverse rate indication channel.

Referring to FIG. 5 again, the number of information bits every 20 msec may exist within a range of k = 1-7.

The k = 1-7 RI (Rate Indication) bits are encoded using a two orthogonal code having a length of 64.

The minimum hamming distance of 64 codewords is 32. It should be noted that there is no loss of minimum hamming distance after symbol puncturing.

A detailed block of the two orthogonal coding of FIG. 5 is shown in FIG. 6.

The puncture pattern in the puncturing pattern portion of FIG. 5 is illustrated in FIG. 7.

Also, the punctured sequence is repeated six times, at which point some sequence symbols are repeated to be 384 symbols.

However, in case of k = 7, no symbol puncturing and symbol repetition are performed. That is, if k = 1, the last 192 binary symbols are repeated; if k = 2, the last 96 binary symbols are repeated; if k = 3, the last 48 binary symbols are repeated; Repeat the last 24 binary symbols, repeat the last 12 binary symbols if k = 5, repeat the last 6 binary symbols if k = 6. However, when k = 7, the binary symbol is not repeated.

The repetition pattern is listed in FIG. 8, and in FIG. 9, the RRI coding of the present invention.

The minimum hamming distance at time is shown.

The Walsh code applied to the detailed block of the two orthogonal coding shown in FIG. 6 is shown as follows.

형태로 나타내고, 상기 도 6의 길이 64인 2 직교코드를 생성하기 위해 다음과 같은 생성기 메트릭스를 정의한다.Meanwhile, the two orthogonal information strings having a length of 64 output from the two orthogonal coding units in FIG.

In order to generate two orthogonal codes having a length of 64 in FIG. 6, the following generator matrix is defined.

로 주어진다.Therefore, a two orthogonal information string having a length of 64 is formed by using the above equation generator matrix.

Is given by

이다.here

to be.

In the present invention, the minimum hamming distance is the most important parameter in designing channel coding.

As described above, the RRI coding method proposed in the present invention shows a better minimum hamming distance than the conventional RRI coding method.

For example, in the case of information string (384,7) RRI coding, the minimum hamming distance in the present invention is d _min = 192, and the conventional minimum hamming distance is d _{min =} 160.

Further, in the case of the information string (384, 4) RRI coding, the minimum hamming distance in the present invention is d _min = 204, and the conventional minimum hamming distance is d _{min =} 192.

Therefore, if the minimum hamming distance is the information strings 384 and 7, there are 32 differences, and in the case of the information strings 384 and 4, there are 12 differences.

In conclusion, it can be seen that the RRI coding method of the present invention is optimized for the minimum hamming distance.

FIG. 10 shows a comparison of performance in AWGN (Additive White Gaussign Noise) channel using the conventional R-RICH structure and the information string of (384, 7).

FIG. 11 shows the performance comparison in the AWGN (Additive White Gaussign Noise Channel) when the information string is (384, 4), when using the conventional R-RICH structure and when using the R-RICH structure of the present invention.

From the results of FIGS. 10 and 11, it can be seen that the RRI coding structure proposed by the present invention exhibits much better performance.

That is, in the case of the information strings 384 and 7 of FIG. 10, there is about 0.5 dB performance gain, and in the case of the information strings 384 and 4 of FIG.

The 0.5dB performance gain is of great value.

As described in the first embodiment of the present invention, the proposed R-RICH device (structure) and the RRI coding method of length 64 of FIG. 5 are different from the two orthogonal coding methods of FIG. 4.

In other words, the conventional two orthogonal coding method is followed by a Walsh code after every " 1 " principal component. On the other hand, in the present invention, every "1" principal component is followed by every Walsh code basis to avoid loss of minimum hamming distance after puncturing.

In the present invention, as shown in FIG. 5, the sequence is repeated six times after puncturing, and the symbol is repeated to increase the minimum hamming distance.                     

As shown in FIG. 10, the simulation result to which the present invention is applied has a 0.5 dB performance improvement over the conventional method. If two supplemental channels are used and a code structure of (384,7) is used, if the user is concerned about increased interference when the user wants to transmit high data, the above (384,7) RRI coding The performance improvement of is very important.

Accordingly, the present invention is a RRI coding method based on Walsh code, and can be used for fast Hadamard Transformation (FHT) decoding method to reduce decoding complexity.

For convenience of explanation, the second embodiment of the present invention will also be described herein.

That is, it is intended to provide a new RRI coding scheme when one or two reverse supplemental channels (R-SCHs) are used by the mobile station (MS).

First, FIG. 12 is a conventional R-RICH channel structure proposed by Q Company.

As shown in the figure, one 7-bit indicator is used for each R-SCH. The 7-bit consists of a 4-bit rate indicator and a 3-bit packet sequence number from the mobile station.

Unlike in FIG. 12, if a single 7-bit symbol is transmitted every 20 msec if configured with one R-SCH, if two 7-bit symbols are configured every 20 msec as shown in FIG. Is transmitted

The operation of FIG. 12 generates 24 binary symbols every 20 msec through an encoder where the rate and sequence number (one 7-bit symbol per 20 msec) for R-SCH [1] is R = 7/24.

If there are a plurality of encoders, 384 bits are repeated for 20 ms by repeating 16 times (1 supplementary channel) or 8 times (2 supplementary channels) according to the number of supplementary channels (SCH) after multiplexing at a mux for data reliability. After generation, Signal Point Mapping (0-> + 1, 1->-1) is spread with 64 chip Walsh function and transmitted to 1.2288Mcps through R-RICH.

Also, a conventional RRI coding scheme will be described.

First, an information sequence (24,7) block coding structure using the generator matrix of Equation 6 below will be described.

As shown in FIG. 12, when one supplemental channel (SCH) is used, an encoded information string of length 24 repeats 16 times, resulting in 384 symbols. The minimum hamming distance is 160.

On the other hand, when two supplemental channels (SCH) are used, two encoded information strings of length 24 for the first SCH and the second SCH are each 192 symbols if repeated eight times.                     

Now, when the RRI coding for one SCH is called non-split mode RRI coding, and the RRI coding for two SCHs is called split mode RRI coding, The minimum hamming distance of the length 384 information string is 160, and the minimum hamming distance of the length 384 information string is 80 in the separation mode.

Hereinafter, a second embodiment of the present invention will be described.

13 is an R-RICH channel structure proposed in the present invention.

The operation of FIG. 13 is two orthogonal coding (Bi) in which a rate and sequence number for R-SCH [1] (one 7-bit symbol per 20 msec) is 64 in length. -orthogonal coding of length 64) generates 64 binary symbols every 20 msec.

If the two orthogonal codings of length 64 are plural, they are multiplexed in MUX. If one channel is used, 64 binary symbols are generated every 20 msec, and in case of two channels, 128 binary symbols are generated every 20 msec. .

Then, for reliability of the data, 384 bits are generated for 20 ms by repeating 6 times (1 supplementary channel) or 3 times (2 supplementary channels) according to the number of supplementary channels (SCH), and Signal Point Mapping (0-> + After 1, 1->-1), it is spread with 64 chip Walsh function and transmitted to 1.2288Mcps through R-RICH.

Referring to FIG. 13 again, two orthogonal coding having a length of 64 is used instead of the R = 7/24 block coding of FIG.

가 6번 반복되어져 20 msec마다 384 심벌이 생성된다.In FIG. 13, when there is one SCH, a two orthogonal encoded information string having a length of 64

Is repeated six times, generating 384 symbols every 20 msec.

및

이다. If there are two SCHs, the two two orthogonal encoded information strings of each SCH are respectively

And

to be.

을 생성한다.Since two orthogonal codings having a length of 64 are plural in the above, 128 binary symbols every 20 msec after being multiplexed in MUX

Create

Thereafter, if the 128 binary symbols are repeated three times, 384 symbols are generated.

Also described is an RRI coding scheme (Scheme) of the second embodiment of the present invention.

First, coding according to a general number of supplementary channels (SCH) will be described in general.

In the case of one supplemental channel (SCH), the encoded information string is 384 symbols every 20 msec. This is equivalent to the (384,7) encoding for one channel.

In the case of two supplemental channels (SCH), the two encoded information strings for the first SCH and the second SCH are 192 symbols each.

Hereinafter, an RRI coding method for an information string 384, 7 based on bi-orthogonal coding having a length of 64 will be described.

A detailed block of the lengthwise 64 quadrature encoder unit of FIG. 13 is illustrated in FIG. 14.

As shown in the figure, the Walsh code basis is followed by all "1" basis.

The Walsh code applied to the sub-block of the orthogonal coding shown in FIG. 13 is shown as follows.

Two orthogonal codes can also be generated by generator metrics, such as

When one supplemental channel (SCH) is used, a length of 64 encoded information strings is repeated 384 times. The minimum hamming distance is 160.

On the other hand, when two supplemental channels (SCH) are used, two encoded information strings of length 64 for the first SCH and the second SCH are each 192 symbols if repeated three times.

Now, when the RRI coding for one SCH is called non-split mode RRI coding, and the RRI coding for two SCHs is called split mode RRI coding, The minimum hamming distance of the length 384 information string is 192, and in the separation mode, the minimum hamming distance of the length 384 information string is 96.                     

FIG. 15 also shows another two orthogonal encoder for FIG. 14, and the performance of two two orthogonal coding schemes is the same as in FIG. However, as shown in the figure, all "1" principal components are followed by Walsh codes.

Two orthogonal codes may also be generated by generator metrics, such as

은 상기의 수학식을 이용하여

로 주어진다.Thus, two orthogonal information strings of length 64

Using the above equation

Is given by

이다.here

to be.

16 shows the minimum hamming distance when RRI coding according to the second embodiment of the present invention.

The second performance of the present invention is compared by comparing the non-isolated mode (one SCH) with the isolated mode (two SCHs).

In the present invention, the minimum hamming distance is the most important parameter in designing channel coding.

As described above, the second proposed RRI coding method in the present invention shows a better minimum hamming distance than the conventional RRI coding method.

For example, in the non-isolated mode, the minimum hamming distance proposed in the present invention is d _min = 192 and the conventional minimum hamming distance is d _{min =} 160.

Also, in the separation mode, the minimum hamming distance proposed in the present invention is d _min = 96, and the conventional minimum hamming distance is d _min = 80.

Therefore, there are 32 differences in the minimum hamming distance difference in the non-isolated mode and 16 differences in the isolated mode.

In conclusion, it can be seen that the RRI coding method of the present invention is optimized for the minimum hamming distance.

FIG. 17 shows the word error rate of RRI coding when one R-SCH is used, and the AWGN (Additive White Gaussign Noise) when using the conventional R-RICH structure and the R-RICH structure of the present invention. ) Shows performance comparison in channel.

From the results of FIG. 17, it can be seen that the RRI coding structure proposed by the present invention exhibits much better performance.

That is, when one R-SCH of FIG. 17 is used, there is about 0.5 dB performance gain, and the above 0.5 dB performance gain is of great value.

As shown in FIG. 17, simulation results in the new isolated mode and the non-isolated mode, which is the second embodiment of the present invention, have a 0.5 dB performance improvement over the conventional method.

Therefore, since the present invention is an RRI coding method based on Walsh code, the present invention can also be used in a fast Hadamard Transformation (FHT) decoding method to reduce decoding complexity.

Although the preferred embodiment of the present invention has been described above, the present invention may use various changes, modifications, and equivalents. It is clear that the present invention can be applied in the same manner by appropriately modifying the above embodiments.

Accordingly, the above description does not limit the scope of the invention as defined by the limitations of the following claims.

The present invention proposes a coding method and apparatus for generating a code suitable for a reverse rate indicator channel (hereinafter referred to as R-RICH) in order to minimize the rate indication error rate in the 1xEV-DV Reverse Link Channel under discussion. According to the present invention, the minimum hamming distance can be increased, and even in the performance comparison in the Additive White Gaussign Noise Channel (AWGN), when the information strings (384, 7) are about 0.5 dB, the user gains high data. It can also be used for fast Hadamard Transformation (FHT) decoding methods to reduce decoding complexity by reducing interference when trying to transmit.

Claims (10)

In a mobile communication system supporting voice and data, A coding unit which receives a reverse direction (RI) symbol having a predetermined range and generates an orthogonal code having a predetermined length; A puncturing unit puncturing a symbol generated in the coding unit for a predetermined range of RI; A sequence repeater for repeating N times the symbols generated by the puncturing; A symbol repeater for repeating symbols by at least one of a predetermined range and a rule of the output symbol of the sequence; An indication code generator of a reverse rate indication channel for code generation, characterized in that consisting of. Coding a range of backward indication (RI) symbols by using orthogonal codes; Symbol puncturing and repeating the symbols generated in the coding step for a range of backward indication (RI); And transmitting the information generated by the symbol repetition. A telecommunications system for transmitting transport channel information provided in 7 bits or less through a specific channel, comprising: a coding step of generating a 64 binary symbol through a 64 orthogonal coding having a length of 64 bits; And repeating the binary symbol by a predetermined number. 2. 4. The method of claim 3, wherein the quadrature coding of length 64 uses a Walsh code. 4. The method of claim 3, wherein the repetition step comprises six repetitions. 4. The method of claim 3, wherein when the transmission channel information is information on two channels, the repetition step is three repetitions. 4. The method of claim 3, further comprising: puncturing a 64 binary symbol by a predetermined number after the coding step if the transport channel information is not 7 bits; And a replenishment step of generating a code sequence having a length of 384 by replenishing the binary bits in the repeated binary symbols after the repetition step. 8. The method of claim 7, wherein when the transmission channel information is 4 bits, the predetermined number of puncturing steps is 4, and the number of bits to be supplemented in the replenishment step is 24. 4. The method of claim 3, wherein the specific channel is a reverse rate indication channel. 4. The method of claim 3, wherein the transport channel is a reverse supplemental channel.

Images