KR101024926B1 - Method of transmitting signals and an appratus therefore - Google Patents

Abstract

The present invention relates to a wireless communication system. Specifically, the present invention provides a method for transmitting data by a terminal in a wireless communication system, the method comprising: generating encoded packet data for transmission on an uplink; Establishing distributed resources in a plurality of contiguous subframes; And transmitting at least a portion of the encoded packet data to the base station through the distributed resource, wherein the distributed resource is interleaved in units of subframes according to a permutation pattern, and the permutation pattern is The present invention relates to a data transmission method configured differently for each frame.

Description

Method for transmitting signal in wireless communication system and apparatus therefor {METHOD OF TRANSMITTING SIGNALS AND AN APPRATUS THEREFORE}

The present invention relates to a wireless communication system. Specifically, the present invention relates to a signal transmission method and apparatus therefor in a wireless communication system.

1 illustrates a wireless communication system. Referring to FIG. 1, the wireless communication system 100 includes a plurality of base stations 110 and a plurality of terminals 120. The wireless communication system 100 may include a homogeneous network or a heterogeneous network. Here, the heterogeneous network refers to a network in which different network entities coexist such as a macro cell, a femto cell, a pico cell, a repeater, and the like. A base station is generally a fixed station that communicates with a terminal, and each base station 110a, 110b, and 110c provides services to specific geographic regions 102a, 102b, and 102c. In order to improve system performance, the particular area may be divided into a plurality of smaller areas 104a, 104b and 104c. Each smaller area may be referred to as a cell, sector or segment. In the case of an IEEE 802.16 system, a cell identifier (Cell ID; Cell_ID or IDCell) is assigned based on the entire system. On the other hand, the sector or segment identifier is given based on a specific area where each base station provides a service and has a value of 0 to 2. The terminal 120 is generally distributed in a wireless communication system and can be fixed or mobile. Each terminal may communicate with one or more base stations via uplink (UL) and downlink (DL) at any instant. The base station and the terminal are frequency division multiple access (FDMA), time division multiple access (TDMA), code division multiple access (CDMA), single carrier-FDMA (SC-FDMA), multi carrier-FDMA (MC-FDMA), and OFDMA ( Communication may be performed using Orthogonal Frequency Division Multiple Access) or a combination thereof. In the present specification, uplink refers to a communication link from a terminal to a base station, and downlink refers to a communication link from a base station to a terminal.

2 illustrates a channel change in frequency in a wireless communication system.

Referring to FIG. 2, when the system band is larger than the coherence bandwidth, the channel may show a sudden change in the system band. In this case, a frequency diversity gain can be obtained by widely distributing a signal to be transmitted within the entire or partial bandwidth on the frequency axis. For example, if an appropriate permutation is applied in the process of extracting a frequency resource for transmitting a signal, the transmitted signal may be mixed and spread within a corresponding bandwidth. Therefore, there is a continuous need for a permutation method for effectively distributing transmission signals within a corresponding bandwidth.

The present invention has been made to solve the problems of the prior art as described above, an object of the present invention to provide a signal transmission method and apparatus for the same in a wireless communication system.

Another object of the present invention is to provide a permutation method and apparatus therefor capable of increasing diversity gain in transmitting a signal.

Technical problems to be achieved in the present invention are not limited to the above-mentioned technical problems, and other technical problems not mentioned above will be clearly understood by those skilled in the art from the following description. Could be.

In one aspect of the present invention, a method for transmitting data by a terminal in a wireless communication system, the method comprising: generating encoded packet data for transmission on an uplink; Establishing distributed resources in a plurality of contiguous subframes; And transmitting at least a portion of the encoded packet data to the base station through the distributed resource, wherein the distributed resource is interleaved in units of subframes according to a permutation pattern, and the permutation pattern is There is provided a data transmission method configured differently for each frame.

In another aspect of the present invention, there is provided an RF module comprising: an RF module configured to transmit a signal through a distributed resource to a base station; And a processor configured to generate the signal, wherein the processor generates coded packet data for transmission in uplink; Establishing distributed resources in a plurality of contiguous subframes; And transmitting at least a portion of the encoded packet data to the base station through the distributed resource, wherein the distributed resource is interleaved in units of subframes according to a permutation pattern, and the permutation pattern is A terminal configured to perform a data transmission method set differently for each frame is provided.

In another aspect of the present invention, a method for processing data by a base station in a wireless communication system, comprising: receiving a signal from a terminal through distributed resources set in a plurality of adjacent subframes; De-interleaving distributed resources set in the plurality of contiguous subframes in subframe units based on a permutation pattern; And decoding the data obtained from the de-interleaved distributed resource, wherein the permutation pattern is set differently for each subframe.

In still another aspect of the present invention, there is provided an RF module configured to receive a signal through a distributed resource from a terminal; And a processor configured to process the received signal, wherein the processor receives a signal from a terminal through distributed resources set in a plurality of contiguous subframes; De-interleaving distributed resources set in the plurality of contiguous subframes in subframe units based on a permutation pattern; And decoding data obtained from the de-interleaved distributed resource, wherein the permutation pattern is provided to perform a data processing method in which the permutation pattern is set differently for each subframe.

Herein, the distributed resource may include one or more distributed resource units (DRUs).

Here, interleaving may be performed in units of tiles within a subframe.

Here, the permutation pattern may be set differently for each subframe using the subframe index. In this case, the permutation pattern may be set differently for each subframe using the product of the subframe index and the prime number.

Here, the subframe index may be used as a cyclic shift value or a masking value for the permutation pattern.

Here, the permutation pattern may be obtained using at least one of time variant intra-row permutation and time variant intra-column permutation.

Here, the permutation pattern can be obtained using the following equation:

Equation

Tile (s, n, t) = L _{DRU , FPi} × n + g ( PermSeq (), s, n, t)

From here,

Tiles (s, n, t) indicates the physical tile index for the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe,

L _{DRU , FPi} represents the number of DRUs included in the i -th frequency partition,

g ( PermSeq (), s, n, t) represents the permutation sequence of length L _{DRU , FPi} ,

PermSeq () represents a basic permutation sequence of length L _{DRU , FPi} .

According to the embodiments of the present invention, the following effects are obtained.

First, a method of transmitting a signal in a wireless communication system and an apparatus therefor may be provided.

Second, it is possible to provide a permutation method and apparatus therefor that can increase diversity gain in transmitting a signal.

The effects obtainable in the present invention are not limited to the above-mentioned effects, and other effects not mentioned above may be clearly understood by those skilled in the art from the following description. There will be.

The construction, operation and other features of the present invention will be readily understood by the preferred embodiments of the present invention described with reference to the accompanying drawings. The embodiments described below are examples in which the technical features of the present invention are applied to a system using a plurality of orthogonal subcarriers. For convenience, the present invention is described using an IEEE 802.16 system, but this is exemplified, and the present invention can be applied to various wireless communication systems including a 3rd Generation Partnership Project (3GPP) system.

3 illustrates a block diagram of a transmitter and a receiver for OFDMA and SC-FDMA. In uplink, a transmitter may be part of a terminal and a receiver may be part of a base station. In downlink, a transmitter may be part of a base station and a receiver may be part of a terminal.

Referring to FIG. 3, an OFDMA transmitter includes a serial to parallel converter (202), a sub-carrier mapping module (206), an M-point inverse discrete fourier transform (IDFT) module, and the like. 208, a cyclic prefix (CP) addition module 210, a parallel to serial converter (212), and a Radio Frequency (RF) / Digital to Analog Converter (DAC) module 214. .

Signal processing in the OFDMA transmitter is as follows. First, a bit stream is modulated into a data symbol sequence. The bit stream may be obtained by performing various signal processing such as channel encoding, interleaving, scrambling, etc. on the data block received from the medium access control (MAC) layer. The bit stream is sometimes referred to as a codeword and is equivalent to a block of data received from the MAC layer. The data block received from the MAC layer is also called a transport block. The modulation scheme may include, but is not limited to, Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), and Quadrature Amplitude Modulation (n-QAM). Thereafter, the serial data symbol sequences are converted N by N in parallel (202). The N data symbols are mapped to the allocated N subcarriers among the total M subcarriers, and the remaining M-N carriers are padded with zeros (206). Data symbols mapped to the frequency domain are converted to time domain sequences through M-point IDFT processing (208). Thereafter, in order to reduce inter-symbol interference (ISI) and inter-carrier interference (ICI), an OFDMA symbol is generated by adding a cyclic prefix to the time-domain sequence. The generated OFDMA symbols are converted 212 in parallel to serial. Thereafter, the OFDMA symbol is transmitted to the receiver through the process of digital-to-analog conversion, frequency upconversion, etc. (214). The other user is allocated available subcarriers among the remaining M-N subcarriers. On the other hand, the OFDMA receiver includes an RF / ADC (Analog to Digital Converter) module 216, a serial / parallel converter 218, a remove CP module 220, and an M-point Discrete Fourier Transform (DFT) module ( 224, subcarrier demapping / equalization module 226, parallel / serial converter 228, and detection module 230. The signal processing of the OFDMA receiver consists of the inverse of the OFDMA transmitter.

Meanwhile, the SC-FDMA transmitter further includes an N-point DFT module 204 before the subcarrier mapping module 206 as compared to the OFDMA transmitter. SC-FDMA transmitter can significantly reduce the peak-to-average power ratio (PAPR) of the transmission signal compared to the OFDMA scheme by spreading a plurality of data in the frequency domain through the DFT prior to IDFT processing. The SC-FDMA receiver further includes an N-point IDFT module 228 after the subcarrier demapping module 226 as compared to the OFDMA receiver. The signal processing of the SC-FDMA receiver consists of the inverse of the SC-FDMA transmitter.

The module illustrated in FIG. 3 is for illustrative purposes, and the transmitter and / or receiver may further include necessary modules, some modules / functions may be omitted, or may be separated into different modules, and two or more modules may be one module. It can be integrated into.

4 illustrates a radio frame structure of an IEEE 802.16m system. The radio frame structure may be applied to a frequency division duplex (FDD), a half frequency division duplex (H-FDD), a time division duplex (TDD), and the like.

Referring to FIG. 4, the radio frame structure includes a 20 ms superframe SU0-SU3 supporting a 5 MHz, 8.75 MHz, 10 MHz or 20 MHz bandwidth. The superframe includes four 5ms frames (F0-F3) having the same size and starts with a Superframe Header (SFH). The superframe header carries essential system parameters and system configuration information. The superframe header may be located within the first subframe. Superframe headers may be classified into primary-SFH (P-SFH) and secondary-SFH (S-SFH). P-SFH is transmitted every superframe. S-SFH may be transmitted every superframe. The superframe header may include a broadcast channel.

The frame includes eight subframes SF0-SF7. Subframes are allocated for downlink or uplink transmission. The subframe includes a plurality of OFDM symbols in the time domain and includes a plurality of subcarriers in the frequency domain. The OFDM symbol may be called an OFDMA symbol, an SC-FDMA symbol, or the like according to a multiple access scheme. The number of OFDM symbols included in the subframe may be variously changed according to the channel bandwidth and the length of the CP. A type of a subframe may be defined according to the number of OFDM symbols included in the subframe. For example, the type-1 subframe may be defined to include 6 OFDM symbols, the type-2 subframe includes 7 OFDM symbols, the type-3 subframe includes 5 OFDM symbols, and the type-4 subframe includes 9 OFDM symbols. have. One frame may include all subframes of the same type or different subframes.

The OFDM symbol includes a plurality of subcarriers, and the number of subcarriers is determined according to the fast fourier transform (FFT) size. The types of subcarriers may be divided into data subcarriers for data transmission, pilot subcarriers for channel measurement, null subcarriers for guard bands, and DC components. Parameters that characterize an OFDM symbol are BW, N _used , n, G, and the like. BW is the nominal channel bandwidth. N _used is the number of subcarriers _used for signal transmission. n is a sampling factor and, together with BW and N _used , determines subcarrier spacing and useful symbol time. G is the ratio of CP time to useful time.

Table 1 shows an example of OFDMA parameters.

The subframe includes a plurality of physical resource units (PRUs) in the frequency domain. The PRU is a basic unit for resource allocation and is composed of a plurality of consecutive OFDM symbols in the time domain and a plurality of consecutive subcarriers in the frequency domain. For example, the number of OFDM symbols in the PRU may be the same as the number of OFDM symbols included in the subframe. Thus, the number of OFDM symbols in the PRU may be determined according to the type of subframe. Meanwhile, the number of subcarriers in the PRU may be 18. In this case, the PRU may consist of six OFDM symbols x 18 subcarriers. The PRU may be referred to as a distributed resource unit (DRU) or a continuous resource unit (CRU) according to a resource allocation scheme.

The above structure is merely an example. Accordingly, the length of the superframe, the number of frames included in the superframe, the number of subframes included in the frame, the number of OFDMA symbols included in the subframe, the parameters of the OFDMA symbols, and the like may be variously changed. For example, the number of subframes included in the frame may be variously changed according to a channel bandwidth and a length of a cyclic prepix (CP).

5 shows the structure of a superframe according to the duplex mode in the IEEE 802.16m system. This embodiment assumes an IEEE 802.16m only mode.

Referring to FIG. 5, in the FDD mode, since downlink transmission and uplink transmission are divided by frequency, a frame includes only one of a downlink subframe (D) and an uplink subframe (U). In the FDD mode, an idle time may exist at the end of every frame. On the other hand, since the downlink transmission and the uplink transmission in the TDD mode are separated by time, the subframes in the frame are divided into a downlink subframe (D) and an uplink subframe (U). There is a downtime called TTG (Transmit / receive Transition Gap) during the change from downlink to uplink, and there is a downtime called RTG (Receive / transmit Transition Gap) during the change from uplink to downlink. do. In the IEEE 802.16m system, the downlink synchronization channel includes a main synchronization channel and a floating channel, and is composed of a primary advanced preamble (PA-preamble) and a secondary advanced preamble (SA-preamble), respectively. The PA-preamble is used to obtain information such as time / frequency synchronization and partial cell identifiers, system information, and the like. The SA-preamble is used to obtain the final physical cell identifier, and may also be used for the purpose of measuring Received Signal Strength Indication (RSSI).

Transmission Time Interval (TTI) means a time interval for transmitting a packet encoded in the physical layer through the air interface. If HARQ (Hybrid Automatic Repeat and reQuest) is supported, the encoded packet is transmitted in the form of HARQ subpackets. TTI is defined as one or more subframes. In general, the basic TTI is set to one subframe. Accordingly, the data packet may be transmitted through one subframe or may be transmitted through a plurality of adjacent subframes. In this specification, a short TTI is defined as one subframe, and a long TTI is defined as two or more subframes. For example, a long TTI in FDD may be configured as four subframes in uplink and downlink, respectively. In addition, a long TTI in TDD may be configured as a full downlink subframe and a full uplink subframe within a frame.

6 shows an example of a physical structure of a subframe in the IEEE 802.16m system.

Referring to FIG. 6, a subframe may be divided into at least one frequency partition (FP). 6 illustrates that a subframe is divided into two frequency partitions, but the number of frequency partitions is not limited thereto. Frequency division may be used for purposes such as Fractional Frequency Reuse (FFR).

Each frequency partition includes one or more PRUs. Distributed frequency allocation and / or contiguous resource allocation may be applied to each frequency partition. Logical Resource Unit (LRU) is a basic logical unit for distributed resource allocation and continuous resource allocation. The Logical Distributed Resource Unit (LDRU) includes a plurality of subcarriers Sc distributed in a frequency band. The size of the LDRU is equal to the size of the PRU. LDRU is also referred to as Distributed LRU (DLRU). The Logical Contiguous Resource Unit (LCRU) includes a contiguous subcarrier Sc. The size of the LCRU is equal to the size of the PRU. LCRU is also referred to as Contiguous LRU (CLRU).

7 illustrates a block diagram for a transmission chain in an IEEE 8002.16m system.

Referring to FIG. 7, a medium access control (MAC) block 702 configures MAC data from higher layer data. The size of the MAC data is scheduled in units of transmission time interval (TTI). MAC data may also be referred to as a transport block and correspond to a codeword in a later process. Forward Error Correction (FEC) block 704 performs channel coding on the MAC data. Channel coding may be performed using Turbo Coding (TC), Convolutional Turbo Coding (CTC), Low Density Parity Check (LDPC), and the like, but the present invention is not limited thereto. The coded data may be referred to as codewords or coded packet data. Mod (Modulation) block 706 modulates the coded data. Data modulation may be performed using modulation techniques such as Phase Shift Keying (n-PSK) and Quadrature Amplitude Modulation (n-QAM) (n: integer), but the present invention is not limited thereto. LRU assignment block 708 divides the modulated symbols into segments of LRU size, and then assigns each segment to an LRU. Mapping block 710 maps the LRUs to data bursts. Data bursts are assigned to PRUs in the physical frequency domain. Accordingly, the mapping block 710 performs a function of mapping the modulated data to the subcarriers according to the mapping relationship between the LRU and the PRU. The IFFT / CP block 710 converts a frequency domain signal into an inverse Fourier transform to a time domain signal, and adds a cyclic prefix to the time domain signal to generate an OFDMA symbol.

8 illustrates a process of mapping a resource unit.

Referring to FIG. 8, outer permutation may be performed on a physical frequency resource. External permutation is applied in at least one PRU unit. External permutation may be performed in units of N1 or N2 PRUs (N1> N2), and N1 and N2 may vary according to bandwidth. However, N1 needs to be an integer multiple of N2 for efficient external permutation. External permutation is divided into subband subband (SB) PRU (hereinafter referred to as PRU _SB ) and miniband (MB) PRU (hereinafter referred to as PRU _MB ) such as subband division and miniband permutation. It may mean a process of performing permutation of a PRU unit for the band PRU. The PRU _SB is the PRU to be allocated to the subbands, and the PRU _MB is the PRU to be allocated to the minibands. In the above process, N1 represents the number of PRUs included in the subband, and N2 represents the number of PRUs included in the miniband.

Next, distribute the rearranged PRU into frequency partitions. Each frequency segment is divided into a Logical CRU (LCRU) and a Logical DRU (LDRU). Sector Specific Permutation can be supported, and direct mapping of resources can be supported for consecutive resources. The size of distributed / continuous resources can be set flexibly per sector.

Next, contiguous and distributed groups are mapped to LRUs. Inner permutation defined for distributed resource allocation allows spreading of subcarriers within the entire distributed resource. There is no internal permutation of consecutive resource allocations. PRUs are mapped directly to contiguous resource units within each frequency partition.

Meanwhile, a partial frequency reuse (FFR) technique may be used. The FFR technique is a technique of dividing an entire frequency band into a plurality of frequency partitions (FPs) and allocating a frequency partition to each cell. Different frequency partitions may be allocated between adjacent cells through the FFR scheme, and the same frequency partition may be allocated between distant cells. Therefore, interference between cells can be reduced, and performance of a cell edge terminal can be improved.

9 illustrates a subchannelization process. There are some things to consider for subchannelization. For example, performance of DRUs and CRUs, signaling overhead for resource allocation, channel quality indicator (CQI) feedback overhead, flexibility of the ratio between distributed and contiguous resources, scaling according to bandwidth (BW) Ease of use, ease of resource allocation order design, and ease of FFR setting are factors to be considered for subchannelization. For convenience of description, the total frequency band is 10 MHz, the total number of PRUs is 48, N ₁ = 4, the number of subbands having a granularity of N ₁ (N _N1 ) is 6, and N ₂ = 1 illustrates a case where the number N _N2 of minibands having a granularity of N ₂ is 24.

Referring to FIG. 9, the PRU in the physical region is divided into subband PRUs or miniband PRUs, which are logical regions, through external permutation of the N1 granularity, and the permutation is divided into N2 granularities for the miniband PRU. It is performed (S900).

The subband PRU or miniband PRU is distributed to each frequency partition, and permutation is performed to distinguish continuous resources L and distributed resources D in each frequency partition (S910). The process of distributing the subband PRU or the miniband PRU to each frequency partition may be performed by being included in the external permutation process of step S900 or may be performed independently. When performed independently, it may be performed based on frequency partition information broadcast through SFH or based on a separate distribution rule. Inner permutation is additionally performed to obtain diversity gain for distributed resources (S920).

10A and 10C illustrate an example of performing permutation using block interleaving. Block interleaving includes row-wise index writing, intra-row permutation, intra-column permutation, and column-wise index reading It may include. The order of each step may be changed freely by way of example. Hereinafter, a case of block interleaving of resource indexes 0 to 40 will be described with reference to the drawings. Each resource index indicates a base resource to be interleaved, and each base resource may be adjacent to each other in the frequency domain.

10A shows a result of recording resource indices 0 to 40 in a row-direction in an interleaving matrix. This embodiment has illustrated an 8x5 interleaving matrix, but the invention is not so limited. After row-direction writing, intra-row permutation may be applied to the interleaving matrix. In-row permutation may be performed using a permutation pattern shared between the transmitting and receiving end. 10B (a) shows an example of an intra-row permutation pattern shown in matrix form. As another example, intra-row permutation may be performed using a basic permutation sequence of length 5. In this embodiment, the basic permutation sequence is illustrated as [0, 3, 1, 4, 2]. 10B (a) shows the results of the intra-row permutation. In-row permutation shows that the resource indexes are shuffled within the row.

After intra-row permutation, intra-column permutation may be applied to the interleaving matrix. In-row permutation may be performed using a permutation pattern shared between the transmit and receive ends. 10C (a) shows an example of an intra-column permutation pattern shown in matrix form. As another example, intra-row permutation may be performed using a permutation sequence of length 8. In this embodiment, the basic permutation sequence is illustrated as [0,5,2,7,4,1,6,3]. 10C (a) shows the results of the intra-row permutation performed. Intra-column permutation shows that the resource indexes are intermingled within the column. After intra-column permutation, the resource index recorded in the interleaving matrix is read in the column-direction. As a result, the original resource index [0,1,2,3,4,5,... , 40 is [0,25,11,36,22,8,... [38].

Block interleaving allows resources to be effectively mixed and distributed within a distributed resource domain. Therefore, a frequency diversity gain can be sufficiently obtained when a signal is transmitted using a predetermined resource to which block interleaving is applied. However, conventionally, since the permutation pattern for block interleaving was time independent, the output pattern of block interleaving was always the same. Therefore, according to the conventional block interleaving, frequency resources are effectively distributed in the corresponding domain, but relatively the same frequency resources continue to be adjacent in the time domain. The regular arrangement of resources in the time domain reduces the effects of interference randomization and thus degrades system performance.

Example: Resources Based on Time Parameters Permutation

11 is a flowchart illustrating a method of performing permutation in consideration of time and transmitting data using distributed resources according to an embodiment of the present invention.

Referring to FIG. 11, radio resources may be grouped into a plurality of permutation units for each time unit (S1110). The radio resource may include at least some bands within a system band. The permutation unit may include a subcarrier or a multiple of subcarriers in the frequency domain as a basic unit for interleaving. The unit of time for permutation may include a subframe or a multiple of the subframe. The plurality of permutation units are newly indexed in each time unit (S1120). A plurality of newly numbered permutation units are interleaved according to the permutation pattern. In this case, the block interleaving method illustrated in FIG. 10 may be used. In addition, a permutation sequence for interleaving may be used. However, the permutation pattern for interleaving will vary depending on the time unit (S1130). For example, permutation based on a time parameter may be performed using at least one of a time variant intra-row permutation and a time varying intra-permutation. Accordingly, when data is transmitted using a plurality of frequency resources and a plurality of time resources, the transmitting end may disperse and mix resources for data transmission in a frequency domain in a form changed over time. Thereafter, the transmitting end may transmit data to the receiving end using the interleaved resources (S1140).

12 illustrates an example of performing permutation in consideration of time according to an embodiment of the present invention. Referring to FIG. 12, it can be seen that the block interleaving pattern is changed according to time t. This embodiment exemplifies a case of shifting three spaces downward by the time t in the process of performing intra-row permutation (see hatched portion). As another example, time t may affect in-row permutation or may affect both in-column and in-row permutation. Also, the time t can affect the permutation pattern in various ways, such as shifting, masking, and the like.

Hereinafter, a method of applying an embodiment of the present invention using an internal permutation applied to an uplink DRU will be specifically illustrated.

13 illustrates a structure of an uplink tile. Referring to FIG. 13, an uplink tile includes six consecutive subcarriers x six consecutive OFDMA symbols. Thus, three tiles constitute one resource unit. The number of OFDMA symbols constituting the tile is the same as the number of OFDMA symbols included in the subframe. Therefore, the number of OFDMA symbols included in the tile may vary depending on the subframe type. The tile is used as a basic unit for performing permutation and includes both a pilot subcarrier and a data subcarrier. Note that in the downlink internal permutation, only data subcarriers are interleaved, but in the uplink internal permutation, interleaving is performed based on a tile including a pilot subcarrier.

14 illustrates a flowchart of performing internal permutation in consideration of time and transmitting data using distributed resources according to an embodiment of the present invention.

Referring to FIG. 14, distributed resources may be divided into uplink tiles for each subframe, and a new index may be assigned to all tiles (S1410). The distributed resources may include one or more PRUs (ie, DRUs). The newly numbered tiles are interleaved according to the permutation pattern. In this case, the block interleaving method illustrated in FIG. 10 may be used. In addition, a permutation sequence for interleaving may be used. However, the permutation pattern is changed depending on the subframe (S1420). For example, the permutation based on the time parameter may be performed using at least one of time-varying in-row permutation and time-varying in-row permutation. Therefore, when transmitting data using one or more PRUs in a plurality of consecutive subframes, the transmitting end may disperse and tile tiles for data transmission in a frequency domain in a form changed over time. Thereafter, the transmitting end may configure an uplink subchannel using the interleaved tiles (S1420). The uplink subchannels correspond to LRUs temporally contiguous within a plurality of subframes. Thereafter, the transmitting end may transmit data to the receiving end through the subchannel (S1440).

Example  1: long TTI If you use the uplink tile Permutation

15 illustrates an example of performing internal permutation when the number of _DRUs (N _DRUs ) is 5 according to an embodiment of the present invention. Assume that the number of subframes SF included in the TTI is three (N _{SF , TTI} = 3).

Referring to FIG. 15, a distributed resource may include a plurality of DRUs for each subframe, and each DRU may include a plurality of tiles. This embodiment illustrates the case where each DRU includes three tiles. Therefore, the distributed resource includes 15 tiles per subframe. Internal permutation is performed together for one or more DRUs, and may be performed tile by tile. To this end, an index may be newly added to all tiles in the distributed resource. In the present embodiment, tiles are sequentially numbered from 0 to 15.

Internal permutation may be performed using the block interleaving scheme illustrated in FIG. 10. In this case, the interleaving matrix may be N _{tile , PRU} × N _DRU matrix. Here, N _{tile and PRU} represent the number of tiles in the resource unit, and N _DRU represents the number of distributed resource units. In the interleaving matrix, the row index m has a value of 0 to N _{tile , PRU} −1, and the column index n has a value of 0 to N _DRU −1. In addition, internal permutation may be performed using a permutation sequence. Permutation sequences may be generated using intra-row permutation and / or intra-column permutation.

In one embodiment of the present invention, the permutation pattern applied to each permutation may be changed in a certain manner from the basic permutation pattern according to the subframe index. For convenience, it is assumed that the basic permutation pattern is a permutation pattern applied to the 0th subframe. Specifically, when performing permutation on the sequence of [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15], the first sub The permutation pattern applied to the frame is [0,11,8,6,3,14,12,9,1,4,10,7,5,2,13], but the permutation applied to the second subframe It can be seen that the pattern is changed as [3,14,6,9,1,12,10,7,4,2,13,5,8,0,11].

After the permutation is completed, three tiles logically continuous in the frequency domain and a plurality of subframes logically continuous in the time domain constitute an uplink subchannel. In the present embodiment, the subchannel includes three tiles logically contiguous in the frequency domain and three subframes logically contiguous in the time domain. As can be seen from the figure, adjacent tiles in a subchannel have different mapping patterns in the frequency domain and the time domain. Accordingly, it can be seen that the permutation method according to the embodiment of the present invention maximizes diversity gain by effectively distributing uplink resources when data is transmitted through a plurality of subframes.

The above-described internal permutation may be performed by a block interleaving method including a time-varying in-row permutation and an intra-column permutation step and a column-direction read step. In addition, the above-described internal permutation may be performed using block interleaving including at least one of time-varying in-row permutation and intra-column permutation. However, this is an example, and implementing time-varying permutation is not limited to a specific example. Hereinafter, various modifications to time-varying permutation will be described in detail.

Example  2-1: Sequence  Of distributed resources used Permutation

Permutation for distributed resources may be performed by the rules described below without using block interleaving. For the m-th tile in the s-th LRU in the t-th subframe, the permutation index R [n, m, t] (that is, the index of the physical tile) may be defined as Equation 1 below.

R [n, m, t] = s × N _DRU + P [(n + s) mod N _DRU ], where s = (f ₁ × m + f ₂ × n + t) mod N _{tile , PRU}

In the above equation, N _DRU represents the number of distributed resource units and mod represents a modulo operation. That is, A mod B represents the remainder of A divided by B. P [.] Also represents the base sequence of length N _DRUs for intra-row permutation. Each element of P [·] may have a value from 0 to N _DRU −1. In addition, N _{tile , PRU} represents the number of tiles included in one resource unit.

In the above formula, f ₁ is a positive integer that is small with N _{tile and PRU} . If not performing intra-row permutation, f ₁ may be set to one. In addition, f ₂ is a positive integer. When f ₂ is small with N _DRU , each column has a different intra-row permutation pattern. To use the same in-row permutation pattern, f ₂ can be set to zero. In addition, when the time parameter t is not used, the permutation sequence has a time-invariant characteristic. The above equation may be described as in Equation 2.

R [n, m, t] = s × N _DRU + P _s [n], where s = (f ₁ × m + f ₂ × n + t) mod 3

In the above formula, P _s [·] can be obtained by cyclically rotating the basic permutation sequence P [·] to the left.

Meanwhile, the basic permutation sequence P [·] may be generated by a random sequence generation algorithm. Although not limited thereto, a basic permutation sequence P [·] of length L may be generated to satisfy a condition defined in the following equation.

(P [i + 1]-P [i]) mod L = D or D + 1

The random sequence that satisfies the above condition is referred to as Almost Equidistance Permutation Sequence (AEPS), and the permutation sequence P [i] is distributed to have almost equal intervals D. Also, if the offset O is defined, the permutation sequence will start from the value of (0 mod L). Specifically, the basic permutation sequence P [·] satisfying the above condition may be defined as in Equation 4 below.

P [i] = {D × i + O + floor (i / W)} mod L, where i = 0, 1,... , L-1

Here, D represents a positive integer less than L, O represents an offset value for the permutation sequence, and W may be defined as W = L / GCD (L, D) as the window size. Here, GCD (L, D) represents the greatest common divisor of L and D.

As an example, an example of an AEPS sequence may be as follows.

L = 14, D = 6 and O = 0; P = {0,6,12,4,10,2,8,1,7,13,5,11,3,9}

L = 16, D = 4 and O = 3; P = {3,7,11,15,4,8,12,0,5,9,13,1,6,10,14,2}

L = 18, D = 7 and O = 6; P = {6,13,2,9,16,5,12,1,8,15,4,11,0,7,14,3,10,17}

A. Time-varying  In-row permutation ( time variant intra - row permutation )and Time-varying  In-column permutation ( intra-column permutation ) Permutation sequence  produce

Time-varying in-row permutation may also be applied to the permutation pattern generated according to Equation (2). In this case, the time parameter t can be used as the shift value or masking value of the intra-row permutation.

In-row permutation using the time parameter as the shift value

R [n, m, t] = s × N _DRU + P _{(s + t)} [n]

Where s = (f ₁ × m + f ₂ × n + t) mod 3

In-row permutation using time parameters as masking values

R [n, m, t] = s × N _DRU + (P _s [n] + t) mod N _DRU

Where s = (f ₁ × m + f ₂ × n + t) mod 3

P _s [·] is obtained by rotating the basic permutation sequence P [·] left s times. In addition, using the permutation sequence P _time [] using the time parameter as the input index, P _time [t] instead of t may be used as a time shift value or a masking value in the above equations.

B. Cell-specific Time-varying ( cell - specific - time variant ) In-row Permutation  Cell-specific-time varying column-in Permutation  Used Permutation sequence  produce

Time-varying in-row permutation may also be applied to the permutation pattern generated according to Equation (2). In this case, the time parameter t may be used as a shift value or masking value of in-row permutation together with Coeff (Cell_ID), which is a cell-specific coefficient. Here, Coeff (·) represents a function that takes a Cell Identity (Cell_ID) as an argument.

In-row permutation using the time parameter as the shift value

R [n, m, t, Cell_ID] = s x N _DRU + P _{(s + Coeff ( Cell _ ID ) x t)} [n]

Where s = (f ₁ × m + f ₂ × n + Coeff (Cell_ID) × t) mod 3

In-row permutation using time parameters as masking values

R [n, m, t, Cell_ID] = s x N _DRU + (P _s [n] + Coeff (Cell_ID) x t) mod N _DRU

Where s = (f ₁ × m + f ₂ × n + Coeff (Cell_ID) × t) mod 3

C. Time-varying  In-row Permutation  Hour-unchanging time invariant A) heat- mine Permutation  Used Permutation sequence  produce

For time-invariant intra-permutation, the time parameter t is not used to calculate the s value. In this case, the time parameter t is used only for intra-row permutation.

In-row permutation using the time parameter as the shift value

R [n, m, t] = s × N _DRU + P _{(s + t)} [n]

Where s = (f ₁ × m + f ₂ × n) mod 3

In-row permutation using time parameters as masking values

R [n, m, t] = s × N _DRU + (P _s [n] + t) mod N _DRU

Where s = (f ₁ × m + f ₂ × n) mod 3

D. Cell-specific Time-varying  In-row Permutation  City-invariant heat-my Permutation  Used Permutation sequence  produce

For time-invariant intra-permutation, the time parameter t is not used to calculate the s value. In this case, the time parameter t is used only for in-row permutation with Coeff (Cell_ID), a cell-specific coefficient.

In-row permutation using the time parameter as the shift value

R [n, m, t, Cell_ID] = s x N _DRU + P _{(s + Coeff ( Cell _ ID ) x t)} [n]

Where s = (f ₁ × m + f ₂ × n) mod 3

In-row permutation using time parameters as masking values

R [n, m, t, Cell_ID] = s x N _DRU + (P _s [n] + Coeff (Cell_ID) x t) mod N _DRU

Where s = (f ₁ × m + f ₂ × n) mod 3

E. Cell-specific Shift /- Masking  And A time variable  In-row Permutation  City-invariant heat-my Permutation  Used Permutation sequence  produce

If the base sequence P [·] for intra-row permutation is a cell common permutation pattern, one may consider applying one or more shift or masking values based on the cell identifier to the intra-row permutation. .

In-row permutation using time and cell specific parameters as shift values

R [n, m, t, Cell_ID] = s × N _DRU + P _{(s + t + SM ( Cell _ ID ))} [n]

Where s = (f ₁ × m + f ₂ × n) mod 3

In-row permutation using time and cell specific parameters as masking values

R [n, m, t, Cell_ID] = s × N _DRU + (P _s [n] + t + SM (Cell_ID)) mod N _DRU

Where s = (f ₁ × m + f ₂ × n) mod 3

In the above formula, SM (Cell_ID) represents a cell-specific shift or masking value.

F. Cell-specific Shift /- Masking  And cell-specific- A time variable  In-row Permutation  City-invariant heat-my Permutation  Used Permutation sequence  produce

If the base sequence P [·] for intra-row permutation is a cell common permutation pattern, one may consider applying one or more shift or masking values based on the cell identifier to the intra-row permutation. . In this case, the cell-specific shift / masking value and the cell-specific time parameter may be used together in the in-row permutation.

In-row permutation using time and cell specific parameters as shift values

R [n, m, t, Cell_ID] = s x N _DRU + P _{(s + Coeff ( Cell _ ID ) x t + SM ( Cell _ ID ))} [n]

Where s = (f ₁ × m + f ₂ × n) mod 3

In-row permutation using time and cell specific parameters as masking values

R [n, m, t, Cell_ID] = s × N _DRU + (P _s [n] + Coeff (Cell_ID) × t + SM (Cell_ID)) mod N _DRU

Where s = (f ₁ × m + f ₂ × n) mod 3

Example  2-2: Sequence  Of distributed resources used Permutation

The symbols used in this embodiment are used the same as described above, unless otherwise defined. It should be noted, however, that some symbols have been defined to have different meanings from those described above for convenience.

In the uplink frequency partition, each DRU is divided into three tiles, each tile containing six subcarriers × N _sym symbols. Here, N _sym represents the number of symbols included in the subframe. The tiles in the frequency partition are then tile-permuted collectively to obtain diversity gain for the allocated resources. For example, internal permutation of allocating a physical tile in a DRU to a logical tile of a subchannel may be performed using the following equation.

Tile (s, n, t) = L _{DRU , FPi} × f (n, s) + g ( PermSeq (), s, n, t), or

Tile (s, n, t) = { L _{DRU , FPi} × f (n, s) + g ( PermSeq (), s, n, t) + UL _ PermBase } mod {3 × L _{DRU, FPi} } , Tiles (s, n, t) indicates a physical tile index for an n-th tile in an s-th Distributed LRU (DLRU) of a t-th subframe. The logical tile index n in the DLRU has a value of 0-2. L _{DRU and FPi} indicate the number of DRUs included in an i -th frequency partition. f (n, s) is a function with the value [0, 2 ]. g ( PermSeq (), s, n, t) represents a permutation sequence of length L _{DRU, FPi} −1. As an example, g ( PermSeq (), s, n, t) may be a permutation sequence having a value of [0, L _{DRU , FPi} −1]. That is, each element of g ( PermSeq (), s, n, t) may have a value of any one of [0, L _{DRU , FPi} −1]. PermSeq () represents a basic permutation sequence of length L _{DRU , FPi} . For example, it may be a permutation sequence having a value of [0, L _{DRU , FPi} −1] of PermSeq () . That is, each element of PermSeq () may have a value of any one of [0, L _{DRU , FPi} −1]. PermSeq () can be obtained using a known random sequence generation method. For example, PermSeq () may be obtained using an AEPS sequence generation method. UL _ PermBase represents an integer of 0 or more, and can be replaced with the values associated with the Cell_ID or Cell_ID.

f (n, s) Is With the formula  Can be defined as:

f (n, s) = ( f ₁ × n + f ₂ × s) mod 3

f (n, s) = (5n + 7s) mod  3,

f (n, s) = (n + 13s) mod  3,

f (n, s) = (n + 17s) mod  3, or

f (n, s) = n

Here, f ₁ represents 3 and a positive integer, f ₂ represents 0 or 3 and a positive integer, and n, s, and mod are as defined above.

g ( PermSeq (), s, n, t) Is With the formula  Can be defined as:

g ( PermSeq (), s, n, t) = PermSeq ({f (n, s) + s + t} mod { L _{DRU , FPi} }, or

g ( PermSeq (), s, n, t) = { PermSeq ({f (n, s) + s + t} mod { L _{DRU , FPi} }) + UL _ Permbase } mod { L _{DRU , FPi} }

Here, f (n, s) , PermSeq (), n, s, t, L _{DRU , FPi} and mod are as defined above.

PermSeq () Is With the formula  Can be defined as:

는 내림 함수(floor)를 나타낸다. D _SP 및 O _SP 는 Cell_ID와 L _{DRU , FPi} 의 함수로 정의될 수 있다. 일 예로, D _SP 및 O _SP 는 하기 수학식과 같이 정의될 수 있다.Here, D _SP determines the distance between logically adjacent tiles in the sequence, and O _SP determines the starting position (ie, offset) of the tiles in the sequence.

Represents a floor function. D _SP And O _SP Can be defined as a function of Cell_ID, L _{DRU , and FPi} . For example, D _SP And O _SP may be defined as in the following equation.

D _SP = f (SEED) and O _{SP =} g (SEED)

Here, SEED can be obtained using a function that takes a cell identifier as an argument (SEED = p (Cell_ID)). For example, SEED = {Cell_ID × decimal} mod {2 ^{Number of SEED bits} }.

Here, f (SEED) and g (SEED) each represent a function that takes a SEED value as a factor. For example, f (SEED) = floor (SEED / 2 ⁵ ) +1 and g (SEED) = {SEED} mod {2 ⁵ }. floor () represents a rounding function.

Here, D _SP and O _SP may be exchanged with each other. _SP and _SP in D O L _{DRU, FPi} -1 may be replaced with L _{DRU, FPi.} In D _SP and O _SP , +1 at the end of the equation can be omitted.

16 shows simulation results according to Embodiment 2-2 of the present invention. In the figure, the horizontal axis represents the Signal to Noise Ratio (SNR), and the vertical axis represents the Packet Error Rate (PER).

Simulation execution conditions are as follows.

-Uplink transmission, TDD mode-DL: UL = 6: 2

-Short TTI = 1 subframe, long TTI = 2 subframes

10 MHz, 1024 FFT, 2.4 GHz

Single LRU (narrowband uplink allocation)

-Number of antennas of the base station = 2, number of antennas of the terminal = 1

Multiple Output Multiple Input (MIMO) Transmission Mode = 1 (SM, Mt = 1)

Tile-based DRUs (subband allocation count = 0, DRU count = 48)

ITU mPed-B channel model (3kmph)

Minimum Mean Square Error (MMSE) receiver

Referring to FIG. 16, when the short TTI is used, the SNR for obtaining a PER of 4% is about 8.7 dB. Meanwhile, when time-varying permutation is performed on a subframe basis according to an embodiment of the present invention, it can be seen that an SNR for obtaining a PER of 4% at a long TTI is about 8 dB. That is, by applying time-varying permutation, more diversity gain can be obtained by randomly dispersing an uplink tile in a frequency domain in a form changed over time.

Example  2-3: Sequence  Of distributed resources used Permutation

On the other hand, when a narrowband uplink allocation (eg, 1 LRU) is used while using a long TTI, frequency diversity loss may be experienced by a conventional random sequence generation method.

17 illustrates an output result of the random sequence generation function. Referring to FIG. 17, when generating a plurality of cell-specific sequences, some of the sequences may be identically or sequentially arranged between cells. In this case, the frequency diversity gain may be lost.

18 illustrates diversity loss that may occur when allocating uplink resources. Referring to FIG. 18, the same logical tile in the n-th LRU in two adjacent subframes t and t + 1 may be tiles adjacent to each other in the physical region. That is, the relationship between the physical tile and the logical tile may be as shown in the following equation.

Here, Tile (s, n, t) represents the physical tile index for the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe. g ( PermSeq (), s, n, t) is a permutation sequence with a value of [0, L _{DRU, FPi} −1]. Details of Tile (s, n, t) and g ( PermSeq (), s, n, t) are as defined above.

As described above, when the same logical tiles in the n-th LRU are adjacent to each other in the physical region in two adjacent subframes t and t + 1, the adjacent physical tiles may be placed in the same DRU. In this case, PRUs used for uplink transmission may be physically adjacent to cause diversity loss.

In order to solve the above-described problem, a method of making the permutation more random may be considered. To this end, it may be considered to replace the permutation sequence illustrated in Equation 19 of Embodiment 2-3 with the following equation.

g ( PermSeq (), s, n, t) = PermSeq ({f (n, s) + s + h ( cell _ ID , L _{DRU , FPi} ) × t} mod { L _{DRU , FPi} }), or

g ( PermSeq (), s, n, t) = { PermSeq ({f (n, s) + s + h ( cell _ ID , L _{DRU , FPi} ) × t} mod { L _{DRU , FPi} }) + UL _ PermBase } mod { L _{DRU , FPi} }

Here, f (n, s) , PermSeq (), n, s, t, L _{DRU , FPi} and mod are as defined above.

Here, h ( cell _ ID , L _{DRU , FPi} ) represents a cell identifier and a function of L _{DRU , FPi} . For example, h ( cell _ ID , L _{DRU , FPi} ) may be a prime number (eg, 107, 1213, etc.), D _SP , O _SP, or UL _ PermBase . D _SP And O _SP are as defined above.

As described above, by further multiplying a predetermined function with a time parameter for generating a permutation sequence, the permutation pattern over time can be further diversified.

19 shows simulation results according to Embodiments 2-3 of the present invention. In the figure, the horizontal axis represents the Signal to Noise Ratio (SNR), and the vertical axis represents the Packet Error Rate (PER). The conditions for performing the simulation are the same as in the simulation of FIG.

Referring to FIG. 19, the SNR for obtaining a PER of 4% in the long TTI was observed to be about 8.3 dB when using the time varying interleaving_1 method, but about 8 dB when using the time varying interleaving_2 method. Here, the time-varying interleaving_1 method represents a case where the time parameter is not multiplied by any value as in the embodiment 2-2, and the time-varying interleaving_1 method is based on the method of the embodiment 2-3. prime number). As can be seen from the simulation results, it can be seen that a greater diversity gain can be obtained by diversifying the time parameter. In particular, when transmitting signals using a narrowband uplink allocation (eg, 1 LRU) and a long TTI, the method according to embodiments 2-3 may be preferably used.

20 illustrates a block diagram of a transmitter and a receiver according to an embodiment of the present invention. In downlink, transmitter 2010 is part of a base station and receiver 2050 is part of a terminal. In uplink, transmitter 2010 is part of a terminal and receiver 2050 is part of a base station.

Transmitter (TX) data and pilot processor 2020 at transmitter 2010 encode, interleave and symbol map data (eg, traffic data and signaling) to generate data symbols. In addition, the processor 2020 generates pilot symbols to multiplex the data symbols and the pilot symbols. The modulator 2030 generates a transmission symbol according to a wireless access scheme. Radio access schemes include FDMA, TDMA, CDMA, SC-FDMA, MC-FDMA, OFDMA, or a combination thereof. In addition, the modulator 2030 allows data to be distributed and transmitted in the frequency domain and the time domain using various permutation methods illustrated in the embodiments of the present invention. The radio frequency (RF) module 2032 processes (eg, analog converts, amplifies, filters, and frequency upconverts) the transmission symbol to generate an RF signal transmitted through the antenna 2034. At the receiver 2050, the antenna 2052 receives the signal transmitted from the transmitter 2010 and provides it to the RF module 2054. The RF module 2054 processes (eg, filters, amplifies, frequency downconverts, digitizes) the received signal to provide input samples. Demodulator 2060 demodulates the input samples to provide a data value and a pilot value. Channel estimator 2080 derives a channel estimate based on the received pilot values. The demodulator 2060 also performs data detection (or equalization) on the received data values using the channel estimate and provides data symbol estimates for the transmitter 2010. In addition, the demodulator 2060 may rearrange data distributed in the frequency domain and the time domain in an original order by performing an inverse operation on the various permutation methods illustrated in the embodiment of the present invention. Rx data processor 2070 symbol demaps, deinterleaves, and decodes the data symbol estimates and provides decoded data. In general, processing by demodulator 2060 and RX data processor 2070 at receiver 2050 is complementary to processing by modulator 2030 and TX data and pilot processor 2020 at transmitter 2010, respectively.

Controllers / processors 2040 and 2090 supervise and control the operation of the various processing modules present in transmitter 2010 and receiver 2050, respectively. Memory 2042 and 2092 store program codes and data for transmitter 2010 and receiver 2050, respectively.

The module illustrated in FIG. 20 is for illustrative purposes, and the transmitter and / or receiver may further include necessary modules, some modules / functions may be omitted, or may be separated into different modules, and two or more modules may be one module. It can be integrated into.

The embodiments described above are the components and features of the present invention are combined in a predetermined form. Each component or feature is to be considered optional unless stated otherwise. Each component or feature may be implemented in a form that is not combined with other components or features. It is also possible to combine some of the components and / or features to form an embodiment of the invention. The order of the operations described in the embodiments of the present invention may be changed. Some configurations or features of certain embodiments may be included in other embodiments, or may be replaced with corresponding configurations or features of other embodiments. It is obvious that the claims may be combined to form an embodiment by combining claims that do not have an explicit citation relationship in the claims or as new claims by post-application correction.

In this document, the embodiments of the present invention have been mainly described with reference to the data transmission / reception relationship between the terminal and the base station. The specific operation described herein as being performed by the base station may be performed by its upper node, in some cases. That is, it is apparent that various operations performed for communication with a terminal in a network including a plurality of network nodes including a base station can be performed by a network node other than the base station or the base station. A 'base station' may be replaced by terms such as a fixed station, a Node B, an eNode B (eNB), an access point, and the like. In addition, the term "terminal" may be replaced with terms such as a user equipment (UE), a mobile station (MS), a mobile subscriber station (MSS), and the like.

Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof. In the case of a hardware implementation, an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.

In the case of implementation by firmware or software, an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above. The software code may be stored in a memory unit and driven by a processor. The memory unit may be located inside or outside the processor, and may exchange data with the processor by various known means.

It will be apparent to those skilled in the art that the present invention may be embodied in other specific forms without departing from the spirit of the invention. Accordingly, the above detailed description should not be construed as limiting in all aspects and should be considered as illustrative. The scope of the invention should be determined by reasonable interpretation of the appended claims, and all changes within the equivalent scope of the invention are included in the scope of the invention.

The present invention can be applied to a wireless communication system. Specifically, the present invention can be applied to a signal transmission method and an apparatus therefor in a wireless communication system.

BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are included as part of the detailed description in order to provide a thorough understanding of the present invention, provide an embodiment of the present invention and together with the description, illustrate the technical idea of the present invention.

1 illustrates a wireless communication system.

2 illustrates a channel change in frequency in a wireless communication system.

3 illustrates a block diagram of a transmitter and a receiver for OFDMA and SC-FDMA.

4 illustrates a radio frame structure of an IEEE 802.16m system.

5 shows the structure of a superframe according to the duplex mode in the IEEE 802.16m system.

6 shows an example of a physical structure of a subframe in the IEEE 802.16m system.

7 illustrates a block diagram for a transmission chain in an IEEE 8002.16m system.

8 illustrates a process of mapping a resource unit.

9 illustrates a subchannelization process.

10A and 10C illustrate an example of performing permutation using block interleaving.

11 is a flowchart illustrating a method of performing permutation in consideration of time and transmitting data using distributed resources according to an embodiment of the present invention.

12 illustrates an example of performing permutation in consideration of time according to an embodiment of the present invention.

13 illustrates a structure of an uplink tile.

14 illustrates a flowchart of performing internal permutation in consideration of time and transmitting data using distributed resources according to an embodiment of the present invention.

15 shows an example of performing internal permutation according to an embodiment of the present invention.

16 shows simulation results according to an embodiment of the present invention.

17 illustrates an output result of the random sequence generation function.

18 illustrates diversity loss that may occur when allocating uplink resources.

19 shows simulation results according to an embodiment of the present invention.

20 illustrates a block diagram of a transmitter and a receiver according to an embodiment of the present invention.

Claims (28)

In a method of transmitting a signal from a terminal in a wireless communication system, Establishing distributed resources in a plurality of contiguous subframes; And Including transmitting a signal to a base station through the distributed resource, Here, the distributed resources are permutated in units of subframes, and the permutation pattern is different for each subframe. The method of claim 1, The distributed resource includes one or more Distributed Resource Units (DRUs), and the permutation is performed in units of tiles in a subframe. The method of claim 1, The permutation pattern is set differently for each subframe using a subframe index. The method of claim 1, The permutation pattern is set differently for each subframe using a product of a subframe index and a prime number. The method of claim 1, The permutation pattern is obtained using a permutation sequence of length L _{DRU, FPi,} the permutation sequence of length L _{DRU, FPi} is cyclically shifted or masked using a subframe index, and the L _{DRU, FPi} is i And a number of DRUs of the -th frequency partition. The method of claim 1, And wherein the permutation pattern is obtained using at least one of time variant intra-row permutation and time variant intra-column permutation. The method of claim 1, The permutation pattern is a signal transmission method, characterized in that obtained using the following equation: Equation Tile (s, n, t) = L _{DRU, FPi} × n + g (PermSeq (), s, n, t) From here, Tiles (s, n, t) represents the tile index of the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe, L _{DRU, FPi} represents the number of DRUs in the i -th frequency partition, g (PermSeq (), s, n, t) represents a function with PermSeq () , s, n and t as arguments, PermSeq () represents a permutation sequence of length L _{DRU, FPi} . An RF module configured to transmit a signal to a base station; And A processor configured to generate the signal, Here, the processor is Set up distributed resources within a plurality of contiguous subframes, And transmit a signal to the base station through the distributed resource, Here, the distributed resources are permuted in units of subframes, and the permutation pattern is different for each subframe. The method of claim 8, The distributed resource includes one or more Distributed Resource Units (DRUs), and the permutation is performed in units of tiles in a subframe. The method of claim 8, The permutation pattern is set to be different for each subframe using a subframe index. The method of claim 8, The permutation pattern is set to be different for each subframe by using a product of a subframe index and a prime number. The method of claim 8, The permutation pattern is obtained using a permutation sequence of length L _{DRU, FPi,} the permutation sequence of length L _{DRU, FPi} is cyclically shifted or masked using a subframe index, and the L _{DRU, FPi} is i And a number of DRUs of the -th frequency partition. The method of claim 8, The permutation pattern is obtained by using at least one of time variant intra-row permutation and time variant intra-column permutation. The method of claim 8, The permutation pattern is characterized in that the terminal is obtained using the following equation: Equation Tile (s, n, t) = L _{DRU, FPi} × n + g (PermSeq (), s, n, t) From here, Tiles (s, n, t) represents the tile index of the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe, L _{DRU, FPi} represents the number of DRUs in the i -th frequency partition, g (PermSeq (), s, n, t) represents a function with PermSeq () , s, n and t as arguments, PermSeq () represents a permutation sequence of length L _{DRU, FPi} . A method for processing a signal by a base station in a wireless communication system, Receiving a signal from a terminal through distributed resources set in a plurality of adjacent subframes; De-permuting distributed resources set in the plurality of contiguous subframes in subframe units; And Obtaining data from the de-permuted distributed resource, Here, the permutation pattern of the distributed resources is different signal processing method for each subframe. The method of claim 15, The distributed resource includes at least one distributed resource unit (DRU), and the permutation is performed in units of tiles in a subframe. The method of claim 15, The permutation pattern is set differently for each subframe using a subframe index. The method of claim 15, The permutation pattern is set differently for each subframe using a product of a subframe index and a prime number. The method of claim 15, The permutation pattern is obtained using a permutation sequence of length L _{DRU, FPi,} the permutation sequence of length L _{DRU, FPi} is cyclically shifted or masked using a subframe index, and the L _{DRU, FPi} is i And a number of DRUs of the -th frequency partition. The method of claim 15, And wherein the permutation pattern is obtained using at least one of time variant intra-row permutation and time variant intra-column permutation. The method of claim 15, The permutation pattern is obtained by using the following equation: Equation Tile (s, n, t) = L _{DRU, FPi} × n + g (PermSeq (), s, n, t) From here, Tiles (s, n, t) represents the tile index of the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe, L _{DRU, FPi} represents the number of DRUs in the i -th frequency partition, g (PermSeq (), s, n, t) represents a function with PermSeq () , s, n and t as arguments, PermSeq () represents a permutation sequence of length L _{DRU, FPi} . An RF module configured to receive a signal from a terminal; And A processor configured to process the signal, Here, the processor is Receive a signal from the terminal through distributed resources set in a plurality of adjacent subframes, De-permuting distributed resources set in the plurality of contiguous subframes in subframe units, Configured to obtain data from the de-permuted distributed resource, Here, the permutation pattern of the distributed resources are different base stations for each subframe. The method of claim 22, The distributed resource includes one or more Distributed Resource Units (DRUs), and the permutation is performed in units of tiles in a subframe. The method of claim 22, The permutation pattern is configured to be differently set for each subframe using a subframe index. The method of claim 22, The permutation pattern is configured to be differently set for each subframe by using a product of a subframe index and a prime number. The method of claim 22, The permutation pattern is obtained using a permutation sequence of length L _{DRU, FPi,} the permutation sequence of length L _{DRU, FPi} is cyclically shifted or masked using a subframe index, and the L _{DRU, FPi} is i And a number of DRUs of the -th frequency partition. The method of claim 22, And the permutation pattern is obtained using at least one of time variant intra-row permutation and time variant intra-column permutation. The method of claim 22, The base station, characterized in that the permutation pattern is obtained using the following equation: Equation Tile (s, n, t) = L _{DRU, FPi} × n + g (PermSeq (), s, n, t) From here, Tiles (s, n, t) represents the tile index of the n-th tile in the s-th Distributed LRU (DLRU) of the t-th subframe, L _{DRU, FPi} represents the number of DRUs in the i -th frequency partition, g (PermSeq (), s, n, t) represents a function with PermSeq () , s, n and t as arguments, PermSeq () represents a permutation sequence of length L _{DRU, FPi} .

Images