KR100917428B1 - Method of calculating lattice reduction matrix and device of enabling the method - Google Patents

Abstract

A method of generating a lattice reduction matrix is disclosed. The grid transform matrix generation method includes grouping a channel matrix related to a space-time block coding scheme into a plurality of sub-matrices, and using at least one selected from the sub-matrices using a real-valued form transformation technique. Generating an input matrix corresponding to the selection submatrix and performing a lattice transformation on the input matrix using a lattice deformation algorithm and calculating a first lattice deformation matrix corresponding to the selection submatrix.

Lattice Transform, Space-Time Block Coding

Description

METHOD OF CALCULATING LATTICE REDUCTION MATRIX AND DEVICE OF ENABLING THE METHOD}

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a multiple input / output communication system, and more particularly, to a grid transformation scheme for signal detection in a multi-user uplink multiple input / output communication system having a space time block code (STBC) structure.

Recently, as high-speed data communication, such as multimedia data, is required, research on a technique for a multi-input / output communication system using a plurality of antennas to transmit / receive signals has been actively conducted.

Various wireless channels are formed between a user terminal and a base station provided with a plurality of antennas, and data is transmitted / received along the wireless channels. In general, the direction from the base station to the user terminal is called down-link, and the direction from the user terminal to the base station is called up-link.

In a multi-user multi-input / output system, each user may transmit a unique transmission symbol to the base station through the uplink. Accordingly, the base station needs to efficiently detect transmission symbols transmitted by users, and various reception algorithms have been proposed for this purpose.

A representative one of the reception algorithms is known as a maximum likelihood detection (ML) technique. However, the ML detection technique has a very high complexity of the receiver, and researches on a reception algorithm that can replace it are being actively conducted. As part of this study, in August 2003, W. H. Mow presented a technique called Universal Lattice Decoding, which proposed a lattice deformation technique that can reduce the complexity of the receiver while showing almost the same performance as the ML detection technique.

However, in order to perform signal detection using the lattice deformation technique, the lattice deformation process should be performed whenever the state of the wireless channel changes. It is pointed out that the lattice deformation technique proposed by W. H. Mow still has a high receiver complexity. In particular, in a wireless environment in which radio channel fluctuations are severe, the overhead of the calculation amount generated in the lattice deformation process acts as a heavy load on the communication system.

Accordingly, there is a need for a method and apparatus for generating a grid deformation matrix capable of reducing the complexity of a receiver by performing the grid deformation technique with a lower complexity.

The present invention provides a method and apparatus for generating a lattice strain matrix which can greatly reduce computational complexity by grouping a channel matrix into a plurality of sub-matrixes and applying a lattice strain technique to the grouped sub-matrix.

The present invention provides a method and apparatus for generating a grid transform matrix that can reduce overhead applied to a communication system by minimizing computational complexity for generating grid transform matrix using characteristics of a space-time block coding channel.

The present invention provides a method and apparatus for generating a lattice deformation matrix which can greatly reduce the amount of computation occurring in the lattice deformation process by generating an input matrix by arranging the column vectors included in the selection sub matrix in advance in order of magnitude.

The present invention provides a method and apparatus for generating a grid strain matrix that can utilize the grid strain technique even in a rapidly changing wireless channel environment by greatly reducing the complexity of applying the grid strain technique.

In accordance with another aspect of the present invention, there is provided a method of generating a lattice transform matrix by grouping a channel matrix related to a space-time block coding scheme into a plurality of sub-matrices, using a real-valued form conversion technique. Generating an input matrix corresponding to the selected at least one selected sub-matrix of the sub-matrices and performing a lattice transformation on the input matrix using a lattice deformation algorithm, the first lattice modified matrix corresponding to the selected sub-matrix Calculating the steps.

In this case, the method for generating a lattice transform matrix according to an embodiment of the present invention derives the first remaining lattice transform matrix corresponding to the non-selected sub-matrix based on the characteristics of the space-time block coding channel based on the first lattice transform matrix. It may further comprise the step.

At this time, the method for generating a lattice strain matrix according to an embodiment of the present invention comprises the steps of generating a first reconstruction matrix by combining the column vectors included in the first lattice strain matrix and the first remaining lattice strain matrix and the first The method may further include calculating a second lattice deformation matrix and a second remaining lattice deformation matrix using a lattice deformation algorithm based on the reconstruction matrix.

At this time, the grid deformation matrix generation method according to an embodiment of the present invention is the input according to whether the basis swap (basis swap) occurred in the process of calculating the second grid deformation matrix and the second remaining lattice deformation matrix The method may further include determining whether to update the matrix.

In addition, the method of generating a grid transform matrix according to an embodiment of the present invention comprises the steps of grouping a channel matrix related to a space-time block coding scheme into a plurality of sub-matrices, using a real-valued form transformation technique. Generating an input matrix corresponding to at least one selected sub-matrix among the sub-matrixes, and converting the input matrix into an aligned input matrix by arranging a plurality of column vectors included in the input matrix in order of magnitude And performing a lattice transformation on the alignment input matrix using a lattice deformation algorithm and calculating a first lattice deformation matrix corresponding to the selection sub-matrix.

In addition, the apparatus for generating lattice transform matrix according to an embodiment of the present invention includes a sub-matrix separator and a real-valued form transform for grouping a channel matrix related to a space-time block coding scheme into a plurality of sub-matrixes. Performing a lattice transformation on the input matrix using a lattice transformation algorithm and an input matrix generator for generating an input matrix corresponding to at least one selected sub-matrix among the sub-matrices by using a scheme, and performing the lattice transformation on the selected sub-matrix And a first lattice strain matrix calculator for calculating a first lattice strain matrix corresponding to.

In addition, the apparatus for generating lattice transform matrix according to an embodiment of the present invention includes a sub-matrix separator and a real-valued form transform for grouping a channel matrix related to a space-time block coding scheme into a plurality of sub-matrixes. An input matrix generator for generating an input matrix corresponding to at least one selected sub-matrix selected from among the sub-matrixes, and aligning the input matrix by aligning a plurality of column vectors included in the input matrix in an order of magnitude A first lattice deformation matrix calculator for performing a lattice transformation on the alignment input matrix using a vector alignment unit for transforming into an input matrix and a lattice deformation algorithm, and calculating a first lattice deformation matrix corresponding to the selected sub-matrix. do.

The present invention can provide a method and apparatus for generating a lattice deformation matrix that greatly reduces computational complexity by grouping a channel matrix into a plurality of sub-matrixes and applying a lattice deformation technique to the grouped sub-matrix.

The present invention can provide a method and apparatus for generating a grid deformation matrix which reduces overhead applied to a communication system by minimizing the computational complexity for generating grid deformation matrix using characteristics of a space-time block coding channel.

The present invention can provide a method and apparatus for generating a lattice deformation matrix which greatly reduces the amount of computation occurring in the lattice deformation process by generating an input matrix by arranging column vectors included in a selected sub matrix in advance in order of magnitude.

The present invention can provide a method and apparatus for generating a lattice deformation matrix which can utilize the lattice deformation technique even in an environment in which a wireless channel changes rapidly by greatly reducing the complexity of applying the lattice deformation technique.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating an example of a multi-user multi-input / output communication system.

Referring to FIG. 1, a multi-user multi-input / output communication system includes a base station 110 and two or more users 120 and 130. Two antennas may be installed in the base station 110 and the respective users 120 and 130, and each of the users 120 and 130 may transmit a transmission symbol having an STBC structure of Alamouti to the base station 110. have.

In the uplink, in general, when each of the users 120 and 130 transmits a transmission symbol having an Alamouti STBC structure, the received signal received by the base station 110 during two symbol periods is represented by Equation 1 below. Can be.

은 유저 1의 두 개의 안테나들 각각에 상응하는 전송 심볼이며,

은 유저 2의 두 개의 안테나들 각각에 상응하는 전송 심볼이다. 이 때, H는 전송 심볼들이 Alamouti의 STBC 구조를 갖는 경우에 대한 유효 채널 매트릭스이다.Referring to Equation 1,

Is a transmission symbol corresponding to each of two antennas of user 1,

Is the transmission symbol corresponding to each of the two antennas of user2. In this case, H is an effective channel matrix for the case where the transmission symbols have the STBC structure of Alamouti.

은 기지국(110)의 i 번째 안테나에 더해지는 부가 백색 가우시안 잡음(Additive White Gaussian Noise, AWGN)이다.Also,

Is an additive white Gaussian noise (AWGN) added to the i th antenna of the base station 110.

는 하기 수학식 2와 같이 정의될 수 있다. At this time, the effective submatrix of the channel matrix H

May be defined as in Equation 2 below.

는 유저 k의 j 번째 안테나로부터 기지국의 i 번째 안테나로의 채널 계수(channel coefficient)이다.Referring to Equation 2,

Is the channel coefficient from the j th antenna of user k to the i th antenna of the base station.

Recently, various lattice deformation algorithms have been proposed, but W. H. Mow has proposed a lattice deformation algorithm having three steps in the above-mentioned recent paper. That is, WH Mow performs 1) Gram Schmidt Orthogonalization on any input matrix, 2) performs Size Reduction process, and 3) performs Basis Swap. A lattice deformation algorithm has been proposed.

More specifically, WH Mow detects the bases of the space in which the column vectors included in the input matrix span through Gram Schmidt Orthogonalization, and the size of the bases detected in the size reduction process. ) Then, a basis swap process of sorting the size-modified bases in order of size is performed. At this time, if a base exchange event has occurred, the input matrix is updated, and the lattice transformation algorithm is performed on the updated input matrix again. As a result, the lattice deformation algorithm is repeatedly performed until no base exchange event occurs, and finally, a grid deformation matrix is generated when no base exchange event occurs.

In general, to perform the lattice deformation algorithm, Equation 1 is converted into Equation 3 through a real valued form technique.

Referring to Equation 3, the real form conversion technique may be defined as Equation 4 below.

,

,

,

,

는 8 x 8 매트릭스가 된다.Referring to Equation 4, Re {H} is a matrix having a real part as an element for each of the elements of H, and Im {H} represents a matrix having an imaginary part as an element for each of all the elements of H. . For example, if H is a 4 x 4 matrix,

Becomes an 8 x 8 matrix.

이 격자 변형 알고리즘에 입력되면,

이 생성되며, T는 유니모듈러 정수 매트릭스(unimodular integer matrix)로서 모든 원소들이 정수값이고, 디터미넌트(determinant)가 1 또는 -1인 매트릭스이다. 격자 변형 알고리즘을 통해 얻어진

는 모든 열벡터들이 서로 거의 직교하는(near orthogonal) 특성을 갖는다. 따라서, 격자 변형 알고리즘을 이용하는 경우, 일반적인 제로 포싱(zero-forcing) 검출 기법 등과 같은 선형 검출 기법을 활용할 수 있게 됨에 따라 낮은 수신기 복잡도를 가지면서도 최대 우도 검출 기법(ML 기법)과 동일한 다이버시티(diversity) 성능이 달성될 수 있다.if,

Once entered into this grid transformation algorithm,

Where T is a unimodular integer matrix, where all the elements are integer values and the matrix has a determinant of 1 or -1. Obtained through the lattice deformation algorithm

Has the property that all column vectors are nearly orthogonal to each other. Therefore, when using the lattice deformation algorithm, it is possible to utilize a linear detection technique such as a general zero-forcing detection technique, thereby having the same diversity as the maximum likelihood detection technique (ML technique) while having a low receiver complexity. Performance can be achieved.

2 is a flowchart illustrating a method of generating a grating deformation matrix according to an embodiment of the present invention.

Referring to FIG. 2, a channel matrix related to a space-time block coding scheme according to an embodiment of the present invention is grouped into a plurality of sub-matrices (S210). In this case, the channel matrix may be grouped into a plurality of sub-matrices by separating the plurality of column vectors included in the channel matrix into groups.

In Equation 1, H is a channel matrix for a case where a transmission symbol of a space-time block coding structure is transmitted through a wireless channel. In this case, when H is a 4 x 4 matrix, H may be expressed as shown in Equation 5 below.

은 4 x 1 사이즈를 갖는 H의

번째 열벡터를 의미한다. Referring to Equation 5,

Is H of 4 x 1 size

The second column vector.

을 생성하고, 생성된

을 격자 변형 알고리즘의 입력 매트릭스로 활용한 것과는 달리, 본 발명의 일실시예에 따르면 H를 복수의 서브 매트릭스들로 미리 그룹핑하고, 서브 매트릭스들에 실수 형태 변환 기법을 적용하여 사이즈가 줄어든 입력 매트릭스를 생성할 수 있다.WH Mow applies real shape conversion to H

Generated,

According to an embodiment of the present invention, H is pre-grouped into a plurality of sub-matrices, and a real size transformation technique is applied to the sub-matrices to reduce the size of the input matrix. Can be generated.

For example, H may be grouped into two sub matrices as shown in Equation 6 below. .

,

)로 그룹핑되는 것이 바람직하다. 왜냐 하면, 유저들의 전송 심볼이 Alamouti의 STBC 구조를 갖고 있으므로,

과

는 이미 서로 직교하며, 마찬가지로

및

는 이미 직교하기 때문이다. 물론,

가

및

를 포함하고,

가

및

를 포함하도록 H가 그룹핑되는 것도 가능하다.When the size of H is larger than 4 x 4, the sub-matrixes may be configured by a combination of various column vectors. However, when H is a 4 x 4 matrix, H is represented by the sub-matrix (

,

Preferably grouped together). Because the user's transmitted symbols have Alamouti's STBC structure,

and

Are already orthogonal to each other,

And

Is already orthogonal. sure,

end

And

Including,

end

And

It is also possible that H is grouped to include.

According to the present invention, since H is pre-grouped into sub-matrices and the lattice deformation algorithm is performed on the grouped sub-matrixes, the amount of computation generated when the lattice deformation algorithm is performed can be greatly reduced. In other words, this is a natural result because the size of the sub-matrix is smaller than H.

In addition, the grid deformation matrix generation method according to an embodiment of the present invention generates an input matrix corresponding to at least one selected sub matrix selected from among sub matrices by using a real shape transformation method (S220).

,

)에 실수 형태 변환 기법이 적용된 경우, 서브 매트릭스들(

,

)는 하기 수학식 7과 같이 변형된다. Sub-matrix (

,

Sub-matrix ()

,

) Is modified as in Equation 7 below.

,

) 중 적어도 하나가 선택 서브 매트릭스로 선택된다. 예를 들어,

가 선택 서브 매트릭스로 선택된 경우, 입력 매트릭스는

로 생성된다. Sub-matrix (

,

At least one of) is selected as the selection submatrix. E.g,

If is selected as the selection submatrix, then the input matrix is

Is generated.

로 표현될 수 있는데, 상기 수학식 7의

는 상기 수학식 4의

보다 N 값(열의 개수)이 1/2이기 때문에 연산량이 1/8로 감소할 수 있다.When the size of the input matrix is M x N, the amount of computation consumed by the lattice transformation algorithm is

It may be represented by,

Of Equation 4

Since the N value (number of columns) is 1/2, the computation amount can be reduced to 1/8.

In addition, the grid deformation matrix generation method according to an embodiment of the present invention arranges the column vectors included in the selected sub-matrix in the order of size (S230).

That is, the final process performed in the lattice transformation algorithm is a base exchange process for aligning the base-strained vectors in size order and exchanging the bases. Lattice transformation algorithms may be performed on the aligned input matrix.

At this time, the probability of occurrence of the base exchange event in the base exchange process is proportional to N ² , and according to an embodiment of the present invention, the probability of occurrence of the base exchange event is reduced to 1/4, resulting in the lattice deformation algorithm being performed. The number of repetitions can be greatly reduced.

In addition, according to an embodiment of the present invention, the lattice deformation matrix generation method performs lattice deformation on an input matrix using a lattice deformation algorithm and generates a first lattice deformation matrix corresponding to a selected sub-matrix (S240).

In the present invention, not only the lattice deformation algorithm proposed by W. H. Mow can be applied, but also various lattice deformation algorithms can be applied.

에 포함된 열벡터들이 크기 순서대로 정렬된 것이라고 가정한다. 격자 변형 알고리즘이 적용된 경우,

에 유니모듈라 인티저 매트릭스(unimodular integer matrix)가 곱해진 제1 격자 변형 매트릭스

가 생성된다. 이 때, 제1 격자 변형 매트릭스

는 하기 수학식 8과 같이 표현될 수 있다. In Equation 7

Assume that the column vectors included in are sorted in order of magnitude. If the grid deformation algorithm is applied,

The first lattice transformation matrix multiplied by the unimodular integer matrix

Is generated. At this time, the first lattice deformation matrix

May be expressed as Equation 8 below.

는 네 개의 열벡터들을 포함하며, 각각의 열벡터들은 거의 직교성(near orthogonal)을 갖는다.Referring to Equation 8,

Contains four column vectors, each of which is nearly orthogonal.

In addition, according to an embodiment of the present invention, a method for generating a lattice deformation matrix derives a first remaining lattice deformation matrix corresponding to an unselected submatrix by using characteristics of a space-time block coding channel based on the first lattice deformation matrix ( S250).

및

는 각각은

및

로부터 도출될 수 있고, 따라서, 제1 나머지 격자 변형 매트릭스

에 포함되는 열벡터들은 하기 수학식 9를 통하여 생성될 수 있다. Users have a transmission symbol of Alamouti's STBC structure, so users can take advantage of the characteristics of Alamouti's STBC structure.

And

Are each

And

And thus, the first remaining lattice strain matrix

The column vectors included in may be generated through Equation 9 below.

에 포함된 네 개의 열벡터들 각각에 대 하여 상기 수학식 9를 통하여

에 포함되는 네 개의 열벡터들 각각이 계산될 수 있다.Referring to Equation 9,

Equation 9 for each of the four column vectors included in

Each of the four column vectors included in may be calculated.

와

는 서로 직교하며, 마찬가지로

와

는 서로 직교한다. 또한, 격자 변형된

에 포함되는

와

는 서로 거의 직교하며, 마찬가지로

에 포함되는

와

는 서로 거의 직교함을 알 수 있다. 다만,

와

사이 또는

와

사이의 직교성은 보장되지 않는다. After all, since the transmission symbol has Alamouti's STBC structure,

Wow

Are orthogonal to each other and likewise

Wow

Are orthogonal to each other. Also, the grid is deformed

Included in

Wow

Are nearly orthogonal to each other,

Included in

Wow

It can be seen that they are almost orthogonal to each other. but,

Wow

Between or

Wow

Orthogonality between them is not guaranteed.

와

사이 또는

와

사이의 직교성이 보장되는 상황이라면, 제1 격자 변형 매트릭스

와 제1 나머지 격자 변형 매트릭스

를 통해 H에 상응하는 격자 변형 매트릭스가 간단한 연산만으로도 생성될 수 있다.if,

Wow

Between or

Wow

If orthogonality is guaranteed between, the first lattice strain matrix

And the first remaining lattice strain matrix

The lattice deformation matrix corresponding to H can be generated by a simple operation.

That is, according to the present invention, the calculation amount required to generate the lattice strain matrix is greatly reduced by generating the lattice strain matrix using the sub-matrix grouped by H.

3 is a flowchart illustrating a method of generating a lattice deformation matrix according to an embodiment of the present invention in more detail.

Referring to FIG. 3, the method for generating a lattice strain matrix according to an embodiment of the present invention generates a first reconstruction matrix by combining column vectors included in the first lattice strain matrix and the first remaining lattice strain matrix (S310). .

와 제1 나머지 격자 변형 매트릭스

가 생성된 경우에도 제1 격자 변형 매트릭스와 제1 나머지 격자 변형 매트릭스에 포함되는 모든 열벡터들 사이에 직교성(거의 직교성)이 보장되지 않는 경우가 발생할 수 있다. 이러한 경우에, 본 발명은 제1 재구성 매트릭스를 생성하여 직교성이 보장되지 않는 열벡터들이 서로 직교성을 갖도록 다시 격자 변형 알고리즘을 수행할 수 있다.That is, the first lattice strain matrix as described above

And the first remaining lattice strain matrix

Even if is generated, orthogonality (almost orthogonality) may not be guaranteed between all the column vectors included in the first lattice strain matrix and the first remaining lattice strain matrix. In this case, the present invention may perform the lattice transformation algorithm again by generating the first reconstruction matrix so that the column vectors that are not guaranteed to be orthogonal are orthogonal to each other.

와

를 포함하는 제1 재구성 매트릭스

는 하기 수학식 10과 같이 나타낼 수 있다. That is, orthogonality is not guaranteed

Wow

First reconstruction matrix comprising a

Can be expressed as in Equation 10 below.

는

와

을 포함할 수 있다. 즉, 제1 재구성 매트릭스

는 직교성이 보장되지 않는 열벡터들이 조합되도록 생성될 수 있다.Referring to Equation 10, the first reconstruction matrix

Is

Wow

It may include. That is, the first reconstruction matrix

Can be generated such that the column vectors that are not guaranteed to be orthogonal are combined.

에 포함되는 열벡터들을 크기 순서대로 정렬한다(S320). In addition, the lattice deformation matrix generation method according to an embodiment of the present invention is the first reconstruction matrix

The column vectors included in are arranged in order of size (S320).

That is, by going through step S320, the number of cases in which the base exchange event occurs in the base exchange process, which is the final stage of the lattice deformation algorithm, may be reduced to less than half, and thus the calculation amount of the entire grid deformation matrix generation process may be greatly reduced. Can be.

In addition, the method for generating a lattice deformation matrix according to an embodiment of the present invention calculates a second lattice deformation matrix by using a lattice deformation algorithm based on the first reconstruction matrix (S330).

에 대한 격자 변형 알고리즘이 수행되어,

가 격자 변형된

가 생성된다. 이 때,

는 하기 수학식 11과 같이 표현될 수 있다. In other words,

A lattice deformation algorithm for is performed,

Autumn Grid Deformed

Is generated. At this time,

May be expressed as in Equation 11 below.

가 격자 변형된

는

와

에 상응하는

및

를 포함한다. 이 때,

및

는 거의 직 교성을 가진다.Referring to Equation 11,

Autumn Grid Deformed

Is

Wow

Equivalent

And

It includes. At this time,

And

Is almost orthogonal.

In addition, the method for generating a lattice transform matrix according to an embodiment of the present invention generates a second remaining lattice transform matrix by using a space-time block coding channel characteristic based on the second lattice transform matrix (S340).

와

는 서로 직교성을 가지며, 상기 수학식 9의 관계를 만족한다. 따라서, 제2 격자 변형 매트릭스

가 생성된 경우, 제2 나머지 격자 변형 매트릭스

가 상기 수학식 9를 통해 생성될 수 있다.That is, since the transmission symbol has an Alamouti STBC structure,

Wow

Are orthogonal to each other and satisfy the relationship of Equation (9). Thus, the second lattice strain matrix

Is generated, the second remaining lattice strain matrix

May be generated through Equation 9.

In addition, the method for generating a lattice strain matrix according to an embodiment of the present invention determines whether to update the input matrix according to whether a base exchange occurs in the process of calculating the second lattice strain matrix and the second remaining lattice strain matrix. (S350).

That is, even if the lattice transformation algorithm is performed by arranging the column vectors included in the input matrix in the order of magnitude, the basis exchange may occur. If a base exchange occurs, the input matrix is updated, and again the grid deformation algorithm is performed, and if the base exchange does not occur, the generation of the grid deformation matrix is completed.

In this case, when no base exchange occurs, the finally generated lattice deformation matrix may be represented by Equation 12 below.

However, when the base exchange occurs, the input matrix is newly updated as shown in Equation 13 below, and the process returns to step S220 of FIG. 2 (S360).

The method for generating a lattice deformation matrix according to the present invention may be implemented in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

4 is a block diagram illustrating an apparatus for generating a grid strain matrix according to an embodiment of the present invention.

Referring to FIG. 4, the apparatus for generating a grid strain matrix according to an exemplary embodiment of the present invention may include a sub-matrix separator 410, an input matrix generator 420, a first grid strain matrix calculator 430, and the remaining grid strain. The matrix derivation unit 440 is included.

The sub-matrix separator 410 groups the channel matrix related to the space-time block coding scheme into a plurality of sub-matrixes. In this case, the sub-matrix separator 410 may divide the plurality of column vectors included in the channel matrix into groups to group the channel matrix into the sub-matrixes.

In addition, the input matrix generator 420 generates an input matrix corresponding to at least one selected submatrix of the submatrices by using a real-valued form conversion technique.

In addition, the first lattice deformation matrix calculator 430 performs lattice deformation on the input matrix using a lattice deformation algorithm and calculates a first lattice deformation matrix corresponding to the selected sub-matrix.

In addition, the remaining lattice transform matrix derivation unit 440 derives the first remaining lattice transform matrix corresponding to the non-selected sub-matrix based on the characteristics of the space-time block coding channel based on the first lattice transform matrix.

In addition, although not shown in FIG. 4, the method for generating a lattice transform matrix according to an embodiment of the present invention includes a sub-matrix separating unit for realizing a group of channel matrices related to a space-time block coding scheme into a plurality of sub-matrixes, and a real number. An input matrix generator for generating an input matrix corresponding to at least one selected sub-matrix of the sub-matrices by using a real-valued form conversion technique, and a plurality of column vectors included in the input matrix in order Performing a lattice transformation on the alignment input matrix by using a vector alignment unit and a lattice transformation algorithm to align the input matrix into an alignment input matrix, and calculating a first lattice deformation matrix corresponding to the selected sub-matrix. One lattice deformation matrix calculation unit may be included.

Descriptions related to the lattice strain matrix generating apparatus have been described in detail with reference to FIGS. 1 to 3, and thus will be omitted.

As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above embodiments, and those skilled in the art to which the present invention pertains various modifications and variations from such descriptions. This is possible.

Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined not only by the claims below but also by the equivalents of the claims.

1 is a diagram illustrating an example of a multi-user multi-input / output communication system.

2 is a flowchart illustrating a method of generating a grating deformation matrix according to an embodiment of the present invention.

3 is a flowchart illustrating a method of generating a lattice deformation matrix according to an embodiment of the present invention in more detail.

4 is a block diagram illustrating an apparatus for generating a grid strain matrix according to an embodiment of the present invention.

Claims (15)

Grouping a channel matrix related to the space-time block coding scheme into a plurality of sub-matrices; Generating an input matrix corresponding to at least one selected sub-matrix of the sub-matrices using a real-valued form conversion technique; And Performing a lattice transformation on the input matrix using a lattice deformation algorithm and calculating a first lattice deformation matrix corresponding to the selected sub-matrix The lattice deformation matrix generation method comprising a. The method of claim 1, Deriving a first remaining lattice transform matrix corresponding to an unselected sub-matrix using characteristics of a space-time block coding channel based on the first lattice transform matrix The method of generating a grid strain matrix further comprising. The method of claim 2, Generating a first reconstruction matrix by combining the column vectors included in the first lattice strain matrix and the first remaining lattice strain matrix; And Calculating a second lattice deformation matrix and a second remaining lattice deformation matrix using a lattice deformation algorithm based on the first reconstruction matrix; The method of generating a grid strain matrix further comprising. The method of claim 3, Computing the second lattice strain matrix and the second remaining lattice strain matrix The second lattice deformation matrix is calculated using the lattice deformation algorithm based on the first reconstruction matrix, and the second remaining lattice deformation matrix is determined using a spatiotemporal block coding channel characteristic based on the second lattice deformation matrix. And calculating the lattice strain matrix. The method of claim 3, Determining whether to update the input matrix according to whether a base swap has occurred in calculating the second lattice strain matrix and the second remaining lattice strain matrix; The method of generating a grid strain matrix further comprising. The method of claim 1, Grouping into the plurality of sub matrices And dividing a plurality of column vectors included in the channel matrix into groups to group the channel matrix into the sub-matrices. The method of claim 1, Generating the input matrix And generating the input matrix by arranging the column vectors included in the selection sub-matrix in the order of magnitude. Grouping a channel matrix related to the space-time block coding scheme into a plurality of sub-matrices; Generating an input matrix corresponding to at least one selected sub-matrix of the sub-matrices using a real-valued form conversion technique; Converting the input matrix into an aligned input matrix by arranging a plurality of column vectors included in the input matrix in an order of magnitude; And Performing a lattice transformation on the alignment input matrix using a lattice deformation algorithm and calculating a first lattice deformation matrix corresponding to the selected sub-matrix The lattice deformation matrix generation method comprising a. The method of claim 8, Grouping into the plurality of sub matrices And dividing a plurality of column vectors included in the channel matrix into groups to group the channel matrix into the sub-matrices. A computer-readable recording medium in which a program for executing the method of any one of claims 1 to 9 is recorded. A sub-matrix separator for grouping a channel matrix related to the space-time block coding scheme into a plurality of sub-matrices; An input matrix generator configured to generate an input matrix corresponding to at least one selected sub matrix selected from the sub matrices using a real-valued form conversion technique; And A first lattice deformation matrix calculator configured to perform lattice deformation on the input matrix using a lattice deformation algorithm and to calculate a first lattice deformation matrix corresponding to the selected sub-matrix Lattice deformation matrix generating apparatus comprising a. The method of claim 11, Residual lattice transform matrix derivation unit for deriving a first remaining lattice transform matrix corresponding to an unselected submatrix by using characteristics of a space-time block coding channel based on the first lattice transform matrix The apparatus for generating a lattice strain matrix further comprising a. The method of claim 11, Sub-matrix separator And separating the plurality of column vectors included in the channel matrix into groups to group the channel matrix into the sub-matrices. A sub-matrix separator for grouping a channel matrix related to the space-time block coding scheme into a plurality of sub-matrices; An input matrix generator configured to generate an input matrix corresponding to at least one selected sub matrix selected from the sub matrices using a real-valued form conversion technique; A vector alignment unit for converting the input matrix into an aligned input matrix by arranging a plurality of column vectors included in the input matrix in an order of magnitude; And A first lattice deformation matrix calculator configured to perform lattice deformation on the alignment input matrix using a lattice deformation algorithm and to calculate a first lattice deformation matrix corresponding to the selected sub-matrix Lattice deformation matrix generating apparatus comprising a. The method of claim 14, Sub-matrix separator And separating the plurality of column vectors included in the channel matrix into groups to group the channel matrix into the sub-matrices.

Images