KR20070057369A - Method and apparatus for de-rate matching in 3gpp umts downlink receiver - Google Patents

Abstract

A method for performing de-rate matching without buffering of a transport channel and a device therefor are provided to partially perform primary de-interleaving and de-rate matching processes for every one of data within one radio frame, during channel decoding and de-multiplexing processes, thus data buffering in transport time interval unit is not necessary. A baseband receiver(500) comprises the followings. A physical channel processor(501) sequentially processes symbols included in one radio frame, conducts a de-interleaving process until positions of a series of data are found after channel-coding the symbols, and partially carries out a de-rate matching process. A transport channel processor(502) channel-decodes the symbols whose de-rate matching is completed.

Description

METHOD AND APPARATUS FOR DE-RATE MATCHING IN 3GPP UMTS DOWNLINK RECEIVER}

1 is a view for explaining channel coding and multiplexing processing of a 3GPP UMTS system base station.

FIG. 2 is an exemplary diagram for describing a channel coding and multiplexing process of FIG. 1. FIG.

3 is a rate matching pattern determination method of a 3GPP UMTS system base station.

4 is a channel decoding processing unit of a receiver of a 3GPP UMTS terminal

5 is a block diagram illustrating a channel decoding processing unit of a 3GPP UMTS terminal receiver according to an embodiment of the present invention.

6 is a process flow diagram of a physical channel processing unit according to an embodiment of the present invention.

7 is a flowchart illustrating a method of determining a rate matching pattern according to a preferred embodiment of the present invention.

The present invention relates to wireless communication, and more particularly, to a derate matching method of a 3GPP UMTS terminal (UE) and a terminal to which the method is applied.

Data of the upper layer of the 3GPP UMTS base station system is channel encoded to be reliably transmitted through a wireless communication environment. The channel encoding structure includes error detection, error correction, rate matching, interleaving and converting a transport channel (TrCH) into a physical channel.

1 illustrates a process 102 in which an asynchronous 3GPP UMTS system base station receives upper layer data and forms a physical channel through channel coding and multiplexing.

The data structure of the upper layer 101 is composed of one or more transport channels (TrCHs). Each transport channel may transmit new data at each transmission time interval (TTI). The transmission time interval of each transport channel is independently determined by one of 10ms (milliseconds), 20ms, 40ms, and 80ms, and has a multiple relationship with 10ms of radio frames of a physical channel. The channel coding multiplexer 102 of FIG. 1 is a transport channel processor 104 that processes data within one transmission time interval of each transport channel, and a physical channel processor 105 that processes 10 ms radio frame data. Can be divided.

The transport channel processor 104 may include a CRC adder 106, a code block generator 107, a channel coding unit 108, a rate matcher 109, a primary DTX (Discontinuous Transmission) inserter 110, A primary interleaving unit 111 and a radio frame divider 112. The CRC adder 106 receives the transport channels of the upper layer 101, respectively, and calculates the CRCs in transport block units within each transport channel and adds them to the end of each transport block for error detection. The code block generator 107 attaches one or more transport blocks of each transport channel into a series of data and divides the data blocks into code blocks. The channel coding unit 108 performs convolutional coding, turbo coding, or no coding. The rate matching unit 109 adds or deletes data by repetition of some of the data in order to match the data amount of all coded transport channels to the data amount that the radio frame physical channel can transmit. In some cases, transmission and reception of some sections may be impossible in one radio frame. In this case, additional data may be deleted more than normal in the rate matching step, and the primary DTX inserting unit 110 may be further deleted. Temporarily display the amount of data collected. The primary interleaving unit 111 blocks and interleaves the transport channel data within the transmission time interval. The radio frame dividing unit 112 divides the data of each transport channel into equal amounts of data that can be transmitted in one radio frame.

The physical channel processing unit 105 includes a transport channel mulplexing unit 113, a secondary DTX insertion / physical channel separation unit 114, a secondary interleaving unit 115, and a physical channel forming unit 116. The transport channel multiplexer 113 multiplexes only the amount of data that can be transmitted in one radio frame in each transport channel. The secondary DTX insertion / physical channel separator 114 temporarily displays the insufficient data amount when the data amount of the transport channel cannot fill all the data amounts of one radio frame, and when there is more than one physical channel, one radio frame. The multi-channel is generated by dividing the data in the equal number of physical channels. The secondary interleaving unit 115 interleaves data in each physical channel. The physical channel forming unit 116 adapts the physical channel data to a predetermined physical channel format. In the above, DTX is temporarily inserted in order to adjust the amount of data in order to perform the following process, and is not transmitted in actual transmission.

The physical channel formed through the above process is transmitted through the spread / modulation processor 103 and the RF signal processor (not shown).

FIG. 2 is a diagram illustrating an example of a coding and multiplexing structure of a channel, and illustrates the process of forming three physical channels in one radio frame with three transport channels.

201 illustrates a signal form transmitted from 101 of FIG. 1. New data may be formed in three transport channels TrCH1, TrCH2, and TRCH3 at predetermined transmission time intervals, respectively. For example, if the transport channel TrCH1 can transmit new data every 20ms, the transport channel TrCH2 can transmit new data every 40ms and TrCH3 every 10ms. As shown in 201, the transport channel TrCH1 is composed of three transport blocks having an A1 size. In this way, the data of each transport channel is configured as a specific transport block and a transport block number.

The CRC adder 106 (see FIG. 1) adds a CRC to the end of the transport block by calculating the transport block of each transport channel as shown in 202. Transport blocks added with CRC are connected with serial data, which is equal to 203. The data to which the CRC is added is divided into code blocks for channel coding again as shown in 204. The coding method determines the maximum size of one code block. If the size of the connected transport block data (or the output data size at 203) exceeds the maximum size of the code block, two or more codes may not be exceeded. Divided into blocks The code block generator 107 of FIG. 1 performs the connection of the transport blocks to which the CRC is added and the generation of the code block. Next, channel coding is performed in units of code blocks, and a coding method is determined independently for each transport channel and includes one of convolution coding, turbo coding, and no coding. After channel coding, such as 205, the data is connected again to a series of data, all of which are performed in the channel coding unit 108 of FIG.

After channel coding, rate matching to match the amount of data on all transport channels to the size of data accommodated in one radio frame is done, such as 206 and 207. The weight between each transport channel is determined for each transport channel so that the rate matching pattern (determined by data addition, amount added, e _ini , e _plus , and e _minus values) of each transport channel is determined differently. do.

3 shows a method of determining a pattern of rate matching. The data of each channel coded transport channel i has Xi size. For example, X1 = 2 * Y1 for TrCH1 in FIG. 2, X2 = Y2 for TrCH2 in FIG. 2, and X3 = Y3 for TrCH3 in FIG. 2. Depending on the characteristics of each transport channel, e _ini , e _plus , e _minus, and whether to reduce (or delete) / extend (or repeat) data are values determined for each.

Entering the rate matching (step 370) of the transport channel i using the already determined data addition and e _ini , e _plus , e _minus , Xi value. M representing the index of the series of input data starts at 1 and the e value is initialized to e _ini (step 371). The rate matching pattern is determined by determining whether to delete / repeat the data corresponding to all m while increasing the index m of the input data one by one until it does not exceed Xi representing the size of the input data. More specifically, the following operation is repeated whenever m increases by one.

If the value after subtracting the e _minus in the e value which is less than or equal to zero (step 375) to m delete the second input data, or (step 377), repeating (step 378) and after it has performed adds as e _plus the value of e. If the value e is greater than zero, the value of m is increased by one (step 380), and the operation is repeated again by subtracting the value of e by e _minus (step 374). After the process of determining whether to delete / repeat each input data as described above, if the m value is greater than Xi, the rate matching operation is completed (step 381). The above operation is performed by the rate matching processing unit (109 in FIG. 1).

Referring again to FIG. 2, 206 is a case where the amount of data is reduced by deleting during rate matching, and 207 is a case where the amount of data is increased by repetition. After rate matching, it may occur through additional data deletion during the rate matching phase when it is necessary to temporarily reduce the amount of data in a radio frame for some reason (eg when a part of the radio frame cannot be transmitted or received for handover or other measurement). In this case, the deleted data amount is temporarily displayed as an arbitrary value to adjust the input data amount in the first step, the first interleaving, in the same manner as in the normal case. Of 110). Therefore, the data size (gi of 206) at the first interleaving is matched. The Fi required for primary interleaving is a value determined by the transmission time interval (transmission time interval) of transport channel i, which is Fi = transmission time interval / 10, which means that the required radio frame transmits one transmission time interval. Means number. For example, since the transmission time interval of TrCH1 is 20ms, F1 = 2, that is, it is transmitted over two radio frames, F2 = 4 of TrCH2 and F3 = 1 of TrCH3. When the data size after the first DTX insertion is Gi, put a block with Fi as the number of columns and Gi / Fi as the number of rows to write all the columns in each row. Block interleaving in the form of column-level reading by changing the order of each column unit by reading the first interleaving column permutation pattern (P1) determined according to the transmission time interval specified in the specification. Primary interleaving is performed (111 in FIG. 1). As shown in 209, each transport channel is multiplexed and transmitted in one radio frame. To this end, a radio frame segmentation process (Vi = Gi / Fi) is performed by dividing the amount of data in transmission time interval units of each transport channel into radio frames. 208 or 112 in FIG. 1.

Like the primary interleaving, the radio frame division process is performed according to the transmission time interval. For example, since TrCH1 has a transmission time interval of 20 ms, the information in one transmission time interval is transmitted over two radio frames, and the input data G1 is V1. Since TrCH2 has a 40ms transmission time interval, the input data G2 is divided into four V2 sizes. Transport channel mulplexing such as 209 takes the amount allocated to one radio frame (= Vi) in each transport channel and connects it to a series of data to be transmitted within 10ms. In this case, when the data amount of one radio frame cannot be filled, a secondary DTX is inserted to indicate a lacking portion. When the amount of data in one radio frame exceeds the amount that can be transmitted on one physical channel (= U), the data is divided into multiple channels and 210 is divided into three physical channels. After secondary interleaving of data of each physical channel, the data is divided into 15 slots and multiplexed in each slot with control information indicating characteristics of other physical and transport channels to form a physical channel as shown in 212.

The UE receives a reverse process of the channel coding multiplexer (102 in FIG. 1) for data recovery. The structure thereof will be described in detail with reference to FIG. 4. Since the digital data coming through the physical channel demodulator 401 must be buffered for the reverse process of secondary interleaving, the physical channel buffer is essential. The physical channel buffer 404 must be able to buffer data within 10 ms, i.e., one radio frame. The secondary deinterleaver 405 performs the reverse process of the secondary interleaving and may be achieved by controlling the read and write addresses of the physical channel buffer 404. If there is more than one physical channel, secondary deinterleaving is performed for each physical channel, and then the multichannels are connected to one channel. The secondary DTX is also removed, which is handled by the multi-channel processing unit / 2 secondary DTX processing unit 406. The transport channel separator 407 separates data of each transport channel from consecutive secondary deinterleaved data in one radio frame. Up to this point, the physical channel processing unit 417 processes the physical channel data in one radio frame, and the subsequent operation is performed by the transport channel processing unit 418 processing the transmission time interval data for each transport channel.

Transmission time interval data processing must be performed by collecting data on one transmission time interval of a transport channel transmitted over several radio frames. This requires a transport channel primary buffer 408 that buffers all data within one transmission time interval of each transport channel.

When all data within the transmission time interval for each transport is received, the primary deinterleaver 409 performs a reverse process of primary interleaving, and the derate matching unit 410 performs a reverse process of rate matching. The derate matching unit 410 inserts the data into the deleted data portion in reverse in order to match the amount of data after channel coding with the amount of data in one radio frame during transmission, and collects the repeated data into one channel during transmission. The data amount after coding (X1, X2, X3 in Fig. 2) is restored again. For reference, since the primary deinterleaving is simple to implement, the transport channel primary buffer 408 may be selectively placed after or before the primary deinterleaving.

Derate matched data should be decoded through the channel decoder 412, but secondary buffering of the transport channel is required for the following two reasons. The first reason for the second buffering is that it is difficult to match the timing between the point of taking the input signal and the signal output from the derate matching unit 410 according to the internal operation of the channel decoder 412. The second reason is that the same data may need to be repeatedly decoded more than once for the performance of error correction. For this reason, each derate matched transport channel data is stored in the transport channel secondary buffer 411 for each channel. When convolutional coding is performed on the stored channel data, error correction is performed through a Viterbi decoder, and channel corrections other than convolutional coding including turbo coding are performed through the turbo decoder. The error corrected data is determined by the error detection unit 413 using the CRC added for each transport block. The decoded transport channel data needs to be buffered so that the upper layer can be taken at any time, and the channel data buffer 414 is provided for this purpose.

In the above, three types of buffers are required in the transport channel processor and the physical channel processor of the terminal receiver. The necessary buffer is collected by buffering transport channel data in transmission time intervals from a physical channel buffer 404 buffering a physical channel in a radio frame, a primary deinterleaver, or a physical channel of a continuous radio frame at a stage before derate matching. The transport channel primary buffer 408 is a transport channel secondary buffer 411 for buffering transport channel data in units of transmission time intervals necessary for channel decoding. All of these buffers are sized depending on the data processing speed supported by the terminal receiver. In other words, the higher the data, the larger the buffer size is required. In addition, since the transport channel primary buffer 408 buffers the rate matched data, it depends on the maximum limit of the repetition of the data in the rate matching step, the transmission time interval value of the transport channel, and the amount of data of the supported physical channel. Since the repetition of data in the rate matching step may be up to 6.6 times, the buffer size of the transport channel primary buffer 408 is up to 6.6 times larger than the buffer size of the transport channel secondary buffer 411. Make sure you need a buffer. In addition, when the transport channel primary buffer 408 and the transport channel secondary buffer 411 support one or more than eight transport channels, the buffer size is affected by how the boundary between transport channels is handled. You can get

However, there is a limit to the data processing capacity of all terminals, which can be expressed as the sum of the data amounts of all the transport channels at any point in time. To support this, having a buffer large enough for each transport channel is also a huge burden in terms of large hardware size. The required buffer size is largely determined depending on whether the high-speed data support described above, the maximum increase in the rate matching stage of each transport channel, and one or more transport channel management methods in the buffer are determined. Considering the recent trend of support, the hardware portion of the buffer size in the terminal receiver becomes increasingly large.

Not only in terms of the hardware burden of the terminal receiver due to the buffer, but also because the data decoding of one or more to eight transport channels must be performed in a limited time, the hardware for processing them must be optimized.

In order to solve the above problems of the prior art, the present invention discloses a method and structure for minimizing the buffer size required by the receiver of the terminal. Primary deinterleaving and derate in every symbol unit of secondary deinterleaved data in one radio frame instead of separate buffering of transport channels for primary deinterleaving and derate matching in transmission time interval units Discuss methods and structures that can be matched.

In addition, the present invention discloses a method and structure for sequentially performing one or more transport channels using the same resource (or hardware), and also proposes a buffer structure that minimizes the input signal processing time of the channel decoder. An optimized structure in terms of hardware and processing time is disclosed.

In addition, an object of the present invention is to prevent the additional increase of the buffer by allowing the channel-to-channel boundary in the buffer portion of the transport channel to be managed flexibly according to the actual data size.

In order to achieve the above objects, according to a preferred aspect of the present invention, the symbols included in one radio frame are sequentially processed to perform deinterleaving until the position in the series of data after channel coding is found. Thereafter, a baseband receiver including a physical channel processor that partially performs derate matching and a transport channel processor that decodes the derate matching completed symbols is provided.

Here, the physical channel processing unit controls a processing of all data included in the radio frame by updating a physical channel buffer buffering data of the physical channels in the radio frame and rate matching parameter values required for the radio frame processing. A secondary deinterleaver for extracting symbols in the order of deinterleaving in the physical channel buffer, a transport channel separation unit for determining whether the symbol is a secondary DTX (Discontinuous Transmission), and after the first deinterleaving of the symbols A first deinterleaver unit for finding an index and a derating matching unit for finding the position of the symbol after derate matching by partially performing rate matching using the index.

The transport channel processor may further include a transport channel buffer for storing the symbol at a position corresponding to the index, a channel decoder for channel decoding the stored symbol, a channel data buffer for storing the channel decoded data, and An error detection unit for detecting an error and a traffic channel manager for providing whether or not decoding is completed for each transport channel and stored position information of the decoded data in the channel data buffer may be included.

Here, the size of the transport channel buffer is determined according to the sum of the data amounts of all transport channels that can be supported at any time, and the number may be plural. In addition, the channel decoder may be plural in accordance with the type of decoding method, and is coupled to each of the plurality of transport channel buffers.

According to another aspect of the present invention, in the method of sequentially derate matching physical channel data without buffering of transmission time interval units, when a new radio frame data is input, a symbol counter value and a multichannel counter for secondary deinterleaving are input. Resetting a value, a rate matching parameter value, sorting the data in a second deinterleaved order, a position after the first deinterleaving of a current symbol using the transmission time interval, the number of radio frames, and the symbol counter value And calculating a position after channel coding of the second deinterleaved symbol by performing rate matching at the position after the first deinterleaving. Here, in the case of a multi-channel having one or more physical channels, after processing all one physical channel, the next physical channel may be sequentially processed.

Meanwhile, the derate matching method may further include separating transport channels by sequentially processing all transport channels in the multi-channel. Here, the separation of the transport channel counts the number of data for which derate matching is completed, the sum of the amount of data when the channel multiplexing of the derate matching is completed, and the amount of data when the channel multiplexing of the current transport channel is performed. By calculating the sum of the sum, the count value and the sum may be compared to obtain a boundary ending in the multiplexing of the current transport channel.

In the rate matching, different rate matching parameters may be applied to all transport channels belonging to one radio frame, or the same rate matching parameter may be applied to all transport channels belonging to one radio frame.

In addition, the rate matching inserts an arbitrary data value into the position after the channel coding if there is deletion of data at the position of the current symbol, and stores the secondary deinterleaved data continuously at the next position, and If there has been a repetition of data at the position, symbol combining with a value already stored at the position after the channel coding may be performed.

Hereinafter, with reference to the accompanying drawings, it will be described in detail preferred embodiments of the present invention. However, this is only to aid the understanding of the present invention, and is not intended to limit the scope of the present invention by the embodiments disclosed in the detailed description. The scope of the present invention can be determined only by the appended claims.

The configuration of the present invention can be described in detail with reference to FIG. 5 is a block diagram showing a channel decoding processing unit of the receiver of the 3GPP UMTS terminal of the present invention.

The physical channel buffer unit 518 buffers data of physical channels in a demodulated radio frame. The physical channel processor 501 includes a secondary deinterleaver 503, a multichannel processor 504, a transport channel separator 505, a primary deinterleaver 506, a derate matching unit 507, and a symbol. The control unit 508 is included. The physical channel processing unit 501 operates the secondary deinterleaving unit 503 to the derate matching unit 507 without intermediate buffering every time one data is read from the physical channel buffer unit 518 to perform derate matching. A process of finding the position of the currently read data in the series of data (or corresponding to the series of data of the channel coding unit 108 of FIG. 1) is performed.

In more detail, the control of the physical channel processing unit 501 will be described with reference to FIG. 6.

When the physical channel buffer 518 completes the buffering of data of a new radio frame (step 650), the symbol control unit 508 of the physical channel processing unit 501 carries a transport channel index i, a symbol index n, and a physical channel index. p, the accumulated transport channel boundary values ACC_Vi are all initialized to 0 (step 651). i = 0 means process first transport channel, n = 0 indicates first deinterleaved symbol, p = 0 means process first physical channel if one or more multichannels Where ACC_Vi = 0 represents the first start in the transport channel multiplexing step (see 209 of FIG. 2) and transports by accumulating Vi of the transport channel immediately before it is incremented each time the transport channel index i is increased by one. Show the channel boundaries (step 660).

As n increases, the secondary deinterleaver 503 obtains n + 1 th data, that is, symbols, based on the order of deinterleaving from the physical channel buffer 518 (step 652).

It is determined whether or not secondary DTX is applied to the n + 1 second secondary deinterleaved data (step 670), and the DTX is at the end of 209 of FIG. 2 or at the end of each transport channel according to the transport channel multiplexing method. The location is known using the data size after interleaving and the multiplexing method. In case of DTX, it can be ignored, so increase n by one and read the next data. Control of this is performed by the transport channel separator 505.

If the n + 1th second deinterleaved data is not the second DTX, a process of finding an index after the first deinterleaving (step 653) is performed in the primary deinterleaver 506. The primary deinterleaver 506 determines the index (= f) of the current radio frame, the transmission time interval (= Fi), the data index value n '= n- ACC_Vi in the current transport channel, and the transmission time interval. The index value gi (216 of FIG. 2) after the first deinterleaving is found by using the first interleaving permutation pattern P1.

gi (n ') = n' * Fi + P1 (f% Fi)

gi is obtained from Equation 1, where% is a modulo function, P1 is an interleaving permutation pattern specified in the specification, and ACC_Vi is the rate of another transport channel that has already been rate matched in one radio frame. The amount of data.

After knowing the position value gi (n ') after the first deinterleaving of the n symbols of the f radio frame by primary deinterleaving, the function of finding the position value after the derate matching through rate matching (step 654) is derate matching. In section 507. In the conventional rate matching method of FIG. 3, if the Xi size data of the transport channel i is buffered and then rate matching is performed at a time, the derate matching unit 507 determines gi ( n ') repeats the rate matching process only by Fi every time a value is entered.

The rate matching method of the present invention will be described in detail with reference to FIG.

When gi (n ') of the transport channel i is obtained from the primary deinterleaving unit, the derate matching unit operates immediately (step 750). First, the transport channel index i in FIG. 6 is incremented by one each time the transport channel is changed in a radio frame, and it is determined whether or not a new channel should be processed by comparing this value with current_i in step 751. . Thus, step 752 is performed to initialize rate matching when processing the first data at the start of a radio frame or when processing the first data of a new transport channel. In the case of successive rate matching of the transport channel i which has been initialized already, step 754 is performed to continuously perform rate matching at the last values of the previous step.

Completion of rate matching of transport channel i (step 756) is the point in time when the value of m exceeds the Xi value, which is the same condition as in FIG. However, every time one gi (n ') values come in, part of rate matching by Fi is performed, which is controlled in step 757.

After that, the rate matching method is the same as in FIG. 3, but the data deleted in step 377 of FIG. 3 should be inserted with arbitrary data instead of the data deleted in step 763. In step 764, the data repeatedly processed is processed to collect the data into one data. Through these steps, a position value after actual channel coding or a position value ei after derate matching is obtained.

During the rate matching, the ei value at the time when the m value matches the position value gi (n ') after the first deinterleaving (step 767) becomes the position value after the derate matching of the actual current n' symbol. Stored as an ei (gi) value (step 768). After the rate matching by Fi is performed, all the parameters related to the current rate matching are stored so that they can be used for the next rate matching (step 758), and the rate matching is stopped. The partial progress rate matching as described above is repeated whenever the first deinterleaved gi (n ') is obtained to find the corresponding pun_flag and ei (gi) values.

Referring back to FIG. 6, in step 655, the data read in the second deinterleaving is stored in the ei (gi) position obtained from the rate matching. This is done in the transport channel buffers 511 and 512 of FIG. When the derate matching step is completed for one secondary deinterleaving data, n is incremented by one in step 656 to repeat the next data, which is performed by the symbol controller 508. Since the increased n value is accumulated in the multi-channel, this value is the amount of data in the physical channel (p + 1) * U (where U = amount of data in one physical channel, p = processing to the present of the physical channels). If the number of physical channels is completed (step 657), the data processing of the current physical channel is finished, and thus p value indicating the number of processed physical channels is increased by one (step 661).

If the increased physical channel p value is equal to the number of multi-channels P currently supported (step 662), it means that the current 10 ms, i.e., all the multi-channels in the radio frame have been processed, and waits for processing the next radio frame (step 658). . The multichannel control described above is performed by the multichannel processing unit 504. Although it is determined that there is more to be processed in the physical channel even if n is increased, it is determined whether processing of the current transport channel is finished by using the boundary value Vi between the transport channels (see FIG. 2).

Since the transport channels are sequentially connected in the physical channel, the transport channels may be sequentially processed from the first transport channel (see 209 of FIG. 2). In other words, by sequentially processing according to the value of n and comparing whether the processing of the amount Vi allocated to one transport channel i is finished (step 659), if it is finished, increase the transport channel index i by one to the next transport channel. Prepare to process i + 1 (step 660), otherwise continue processing of the current transport channel i (step 659). The above function is repeatedly performed for every symbol of every 10ms of physical channel.

Unlike buffering at a transmission time interval unit and then derate matching at once, as in the derate matching unit of FIG. 3, in the present invention, derate matching is performed for each piece of data in a radio frame. There is no need for a separate buffer such as buffer portion 308. Then, the processing of one or more transport channels is configured to be sequentially performed on the same hardware using the continuous property (209 of FIG. 2) in the structure of multiplexing.

Referring to FIG. 5 again, the symbol values output from the physical channel processor 501 and the position values ei (gi) and pun_flag of the symbols are stored in the transport channel buffers 311 and 312. Each transport channel is subjected to convolutional coding or turbo coding according to the characteristics of the channel, and decoded by the Viterbi decoder 513 and the turbo decoder 514 respectively from the decoder's point of view. Decoding is performed as soon as buffering of the derate matched transmission time interval unit data of each transport channel is completed. However, in case of supporting the processing speed of the decoder and the high data rate, the worst case occurs over the limited processing time (<10ms) when decoding all the transport channels sequentially. In order to reduce the processing time, it is a big burden in terms of hardware to have hardware as many as the number of channels to simultaneously process all buffered channels in transmission time interval units. In order to improve the processing speed and efficiently solve the hardware size problem, in the present invention, the dual transport channel processor 502 is provided.

According to the decoding method, one or more transport channels are classified into transport channels that should use a Viterbi decoder and transport channels that do not, and written to two transport channel buffers 1,2 (511, 512), respectively, as shown in FIG. do. Here, the separation between transport channels using the same decoding scheme in each buffer is used because the maximum coding data amount max (Xi) of each transport channel can be known in advance through transport channel information. For example, in a channel consisting of five transport channels, if transport channel i, transport channel i + 2, and transport channel i + 3 used convolutional coding, the data after derate matching of these transport channels is Both are stored in transport channel buffer 1 511 and the data of the remaining two transport channels are stored in transport channel buffer 2 512.

The transport channel buffer 1 511 uses the pun_flag and ei (gi) values generated while the derate matching is performed on the first transport channel i. When the pun_flag is off, the second channel at the position of ei (gi) is used. The interleaved data is stored, and if pun_flag is on, ei (gi) stores arbitrary data instead of deleted data, and stores second deinterleaved data at ei (gi) +1. If the derate matching of another channel i + 2 of the same decoding method is performed after the derate matching of the first transport channel i is completed, the maximum size max of the previous transport channel i at the first position of the transport channel buffer 1 511 Start saving at the position with (Xi) free space. Similarly, if the derate matching of another channel i + 3 of the same decoding method is performed after the derate matching of the transport channel i + 2 is completed, the previously derate matching is performed at the first position of the transport channel buffer 1 511. Start recording at a position with a maximum size max (Xi) + max (Xi + 1) of the channels. This is possible because the derate matching is used sequentially in units of channels. In this way, the boundaries between the transport channels in the transport channel buffers 1,2 (511, 512) are flexibly applied, so that the size of the transport channel buffers 1,2 (511, 512) is arbitrary. It is determined by the sum of the amount of data of all transport channels that can be supported at that time, and the change of the amount of data in each transport channel is irrelevant.

The storage of channel decoded data is also dualized into channel data buffer 1 515 for buffering channels using Viterbi decoding and channel data buffer 2 516 for buffering channels using other decoding methods. Within each of the channel data buffers 1,2 and 515 and 516, the channel divisions are made based on the actual data size. Thus, the data of all transport channels that can support the buffer size at any point in time. It can be determined according to the sum of the amounts and is independent of the change in the amount of data in each transport channel. The transport channel manager 517 provides information indicating whether or not decoding is completed for each transport channel and information indicating a stored position of the decoded data in the channel data buffer so that the upper layer can take the decoded result and appropriate data. Even if the boundary of the transport channel in the data buffer part is flexible according to the data size, there is no problem in the upper layer taking data.

As described above, the transport channel processing unit 502 processes the dual channel according to the decoding method, but transport channels processing the same decoding method can be sequentially processed to minimize the processing speed and maximize the resource sharing.

In addition, since the transport channel buffers 1,2 and 511 and 512 of FIG. 5 have a function of providing input data of a channel decoder, the structure of the buffer may be modified to receive an input signal from the channel decoder and write the data directly without additional processing. It is possible to catch enough. For example, if the channel decoder requires code rate unit symbols in parallel, the transport channel buffers can be classified and stored in the code rate unit so that they can be read at the same time. You don't have to have hardware to keep incoming data in parallel and at the code rate. In particular, since the turbo decoder needs to repeatedly decode a large amount of data many times, minimizing the time to take the input data in the transport channel buffers 1,2 and 511 and 512 by the method shown in the above example may reduce the processing time. Make a big contribution

In the present invention, as shown in FIG. 5, the necessary buffers are reduced to two types. Compared to FIG. 4, a modified form of the transport channel buffer 2 511 is the first and second transport channel buffers 411 of FIG. 4. The transport channel primary buffer of 4 has become unnecessary by the method proposed in the present invention. In addition, the two types of buffers required by the present invention can be modified into a buffer structure that the channel decoder is easy to use as a buffer for the channel decoder and the upper layer, and a structure that allows the upper layer to process data without additional buffering.

In the present invention, in the channel decoding and demultiplexing process of the terminal receiver, the first deinterleaving and the derate matching are not performed after buffering the transmission time interval unit data, but rather for each data in one radio frame. By presenting the method and structure, buffering of data in transmission time intervals is unnecessary.

In addition, by using a structure that sequentially performs the processing of one or more transport channels multiplexed on the physical channels in a radio frame, it is possible to process one or more transport channels in one hardware.

In addition, the transport channel processing unit uses a dual structure according to the decoding method of the channel decoder to minimize the burden of decoding processing time, and one or more transport channels using the same coding scheme in each dual structure are sequentially decoded. This minimizes the redundancy of the same hardware.

In addition, the transport channel management in each memory is flexibly adjusted by using the transport channel information, so that there is no additional memory for channel separation.

In addition, it is possible to minimize the processing time to take the input data of the channel decoder by limiting the structure of the buffer to the channel decoder so that the channel decoder can immediately use the data stored in the transport channel buffer.

In addition, there is no restriction in fitting the structure of the buffer to the upper layer so that the upper layer can easily process the decoded channel data stored in the channel data buffer.

In addition, the upper layer has a structure that makes it easy to know the decoded channel and related information, so that even if the transport channel boundary in the channel data buffer is flexible depending on the data size, the upper layer has no problem in taking the data.

By the above method and structure, the hardware size of the terminal receiver can be optimized.

Claims (13)

A physical channel processor which sequentially processes symbols included in one radio frame, deinterleaves until a position in a series of data after channel coding is found, and then performs derate matching; And a transport channel processor configured to channel decode the symbols for which the derate matching has been completed. The method of claim 1, wherein the physical channel processing unit A physical channel buffer for buffering data of the physical channels in the radio frame A symbol control unit for controlling processing of all data included in the radio frame by updating rate matching parameter values required for the radio frame processing Secondary deinterleaver unit for extracting symbols in the order of deinterleaving in the physical channel buffer Transport channel separation unit for determining whether the symbol is a secondary DTX (Discontinuous Transmission) A primary deinterleaver unit for finding an index after the primary deinterleaving of the symbol; And a derating matching unit which performs the rate matching using the index to find the position of the symbol after derate matching. The method of claim 2, wherein the transport channel processing unit Transport channel buffer for storing the symbol in the position corresponding to the index Channel decoder for channel decoding the stored symbols A channel data buffer for storing the channel decoded data An error detector for detecting an error in the data; A baseband receiver including a transport channel management unit for providing information on whether the decoding is completed for each transport channel and stored position information of the decoded data in the channel data buffer. 4. The baseband receiver of claim 3, wherein the size of the transport channel buffer is determined according to the sum of the data amounts of all transport channels that can be supported at any point in time. 4. The baseband receiver of claim 3 wherein the transport channel buffers are plural. 6. The baseband receiver of claim 5 wherein the channel decoder is plural and coupled to each of the plurality of transport channel buffers. A method of sequentially derate matching physical channel data without buffering the transmission time interval unit, Resetting symbol counter values, multichannel counter values, and rate matching parameter values for secondary deinterleaving when data of a new radio frame is input; Sorting the data in a secondary deinterleaved order Calculating a position after the first deinterleaving of a current symbol by using the transmission time interval, the number of radio frames, and the symbol counter value; Performing rate matching at the position after the first deinterleaving to calculate the position after channel coding of the second deinterleaved symbol. The derate matching method according to claim 7, wherein in the case of a multi-channel having one or more physical channels, the next physical channel is sequentially processed after all one physical channels are processed. 9. The method of claim 8, further comprising the step of separating all transport channels by sequentially processing all transport channels in the multi-channel. The method of claim 9, wherein the separating of the transport channel comprises: Counting the number of derate matching data Calculating a sum of the data amount when the channel multiplexing of the transport channels having completed derate matching and the data amount when the channel multiplexing of the current transport channel is performed; Comparing the count value with the sum to obtain a boundary ending in multiplexing of a current transport channel. 8. The method of claim 7, wherein the rate matching applies different rate matching parameters to all transport channels belonging to one radio frame. 8. The method of claim 7, wherein the rate matching applies the same rate matching parameter to all transport channels belonging to one radio frame. 8. The method of claim 7, wherein the rate matching is If there was deletion of data at the position of the current symbol, an arbitrary data value is inserted at the position after the channel coding and the secondary deinterleaved data is continuously stored at the next position, And a symbol combining with a value already stored at the position after the channel coding if there is repetition of data at the position of the current symbol.

Images