JP4230343B2 - Wireless communication method, wireless communication system, and reception processing program - Google Patents

Description

  The present invention uses the same frequency channel, transmits independent data from a plurality of different transmission antennas, receives signals using a plurality of reception antennas, and receives a reception station based on a transfer function matrix between the transmission and reception antennas. The present invention relates to a reception technique for realizing good transmission characteristics while suppressing a circuit scale in a high-speed wireless access system that realizes wireless communication by demodulating data on the side.

In recent years, the IEEE802.11g standard, the IEEE802.11a standard, etc. have been remarkably spread as high-speed wireless access systems using the 2.4 GHz band or the 5 GHz band. Although these systems achieve a maximum transmission rate of 54 Mbps, further increase in transmission rate is required with the spread of wireless LAN. For this purpose, MIMO (Multiple-Input Multiple-Output) technology is promising.
With this MIMO technology, the transmitting station transmits different independent signals on the same channel from multiple transmitting antennas, and the receiving station receives signals using the same multiple antennas. The transfer function matrix is obtained, the independent signal transmitted from each antenna is estimated on the transmitting station side using this matrix, and the data is reproduced.

Here, a case is considered where N signals are transmitted using N transmission antennas and signals are received using M antennas. First, there are N × M transmission paths between the antennas of the transmitting and receiving stations, and the transfer function when transmitted from the i-th transmitting antenna and received by the j-th receiving antenna is h _{j, i} , A matrix of N rows and M columns as the (j, i) component is denoted as H. Further, let t _{i be} the transmission signal from the i-th transmitting antenna, Tx be a column vector whose components are (t ₁ , t ₂ , t ₃ ,... T _N ), and r _{i be} the received signal at the i-th receiving antenna. (R ₁ , r ₂ , r ₃ ,..., R _M ) as a column vector, Rx, and the i-th receiving antenna thermal noise as n _i (n ₁ , n ₂ , n ₃ ,. A column vector whose component is n _M ) is denoted as n.
In this case, the following relational expression holds.

Therefore, there is a need for a technique for estimating the transmission signal Tx based on the signal Rx received on the receiving station side. As the most basic one of the MIMO techniques, there is a method generally called a ZF (Zero Forcing) method (see, for example, Non-Patent Document 1).
Here, for the above equation (1), an inverse matrix H ⁻¹ of the transfer function matrix is obtained, and this is multiplied from the left of both sides of the equation. As a result, the following expression is obtained.

In other words, when the signals received by the receiving antennas are combined and processing for removing interference caused by signals other than the desired transmitting antenna is performed, a small thermal noise term H ⁻¹ × n is added to the actual transmitted signal vector Tx. Signal points are obtained. Here, when a signal subjected to modulation such as BPSK, QPSK, 16QAM, or 64QAM is used as the transmission signal, signal points that can be taken as the transmission signal are discontinuous. Therefore, a hard decision process for searching for a point on the transmission constellation where H ⁻¹ × Rx is closest to the Euclidean distance is performed to estimate a transmission signal.

In the above ZF method, good characteristics can be expected when the thermal noise term H ⁻¹ × n is sufficiently small and the components for each transmitting antenna can be assumed to be equal.
However, in general, this assumption does not hold, and the expected value of the absolute value of the thermal noise H ⁻¹ × n for each transmission antenna is different for a certain transfer function matrix.
Furthermore, if the transfer function matrix H is a matrix that does not have an inverse matrix (or its determinant is very small), the estimation of the transmission signal becomes very unstable. In such a situation, there is a possibility that the reception characteristic is greatly deteriorated.

As a method for solving such a problem, a method having the most excellent characteristics is a method called an MLD (Most Likelihood Detection) method (see, for example, Non-Patent Document 2).
In this method, first, when the modulation method of a transmission signal from each antenna is determined, the number of signal points that can be taken by a signal transmitted from one antenna (hereinafter referred to as N _max ) is determined. There are N _max ^N variations of signal vectors transmitted across the N antennas.

In the MLD method, for all candidates (total N _max ^N ) that can be taken as Tx as a transmission signal, the received signal is predicted when that signal is transmitted, and the most actual received signal among them is predicted. Is selected as the signal point with the highest estimation accuracy. In other words, if the kth transmission signal candidate is represented by Tx ^[k] , the value of k that minimizes the Euclidean distance E defined by the following equation is selected.

Note that ^{MH with} respect to the matrix M refers to a matrix that is Hermitian conjugate of the matrix M. With the above processing, it is possible to perform stable reception processing for any matrix H, and characteristics are greatly improved as compared with the ZF method.
Here, FIG. 11 includes a first radio station including N (N> 1: integer) or more first antenna groups and M (M> 1: integer) second antenna groups. The structure of the transmission part of the 1st radio station in the conventional radio | wireless communications system comprised by the 2nd radio station is shown. In the figure, 100 is a data division circuit, 101-1 to 101-3 are preamble assignment circuits, 102-1 to 102-3 are modulation circuits, 103-1 to 103-3 are radio units, 104-1 to 104- Reference numeral 3 denotes a transmitting antenna. As a modulation method, single carrier modulation can be used, or multicarrier modulation represented by orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing) can be used. As an example, a case where a transmitting station transmits three systems of data using three transmitting antennas will be described as an example.

  In the above configuration, when data is input, the data dividing circuit 100 separates the data into three systems. For example, the first system data is input to the preamble applying circuit 101-1, and is input to the modulation circuit (Ch1) 102-1 with the preamble signal applied. The modulation circuit performs predetermined modulation, and the modulated signal is converted into a radio frequency by the radio unit 103-1 and transmitted from the transmission antenna 104-1. Similarly. The second system data is individually transmitted via 101-2 to 104-2, and the third system data is individually transmitted via 101-3 to 104-3.

  FIG. 12 shows a first radio station having N (N> 1: integer) or more first antenna groups and a second radio station having M (M> 1: integer) second antenna groups. The structure of the receiving part of the 1st radio station using the MLD method in the conventional radio | wireless communications system comprised by these radio stations is shown. In the figure, 111-1 to 111-3 are receiving antennas, 112-1 to 112-3 are radio units, 113 is a channel estimation circuit, 114 is a received signal management unit, 115 is a transfer function matrix management circuit, and 116 is a replica. A signal generation circuit, 117 is a transmission signal generation circuit, 118 is a Euclidean distance calculation circuit, 119 is a selection circuit, and 120 is a data synthesis circuit.

In the above configuration, the first receiving antenna 111-1 to the third receiving antenna 111-3 individually receive the received signals. The received signal is input to the channel estimation circuit 113 via the radio units 112-1 to 112-3. The channel estimation circuit 113 obtains a transfer function between each transmission antenna and the reception antenna from the reception situation of a predetermined preamble signal given on the transmission side. The acquired information h _{j, i} of each transfer function is managed as a transfer function matrix H by the transfer function matrix management circuit 115. The data signal following the preamble signal is input to the received signal management circuit 114 for each symbol. In the reception signal management circuit 114, a reception signal vector Rx having the reception signals (r ₁ , r ₂ , r ₃ ) of each antenna as components is temporarily managed.

On the other hand, the transmission signal generation circuit 117 generates N _max ^N types of transmission signal candidates {S [k]} (1 ≦ k ≦ N _max ^N ) as all signal patterns that can be output from the transmission antenna. The replica signal generation circuit 116 calculates the product of the signal S [k] input from the transmission signal generation circuit 117 and the transfer function matrix H managed by the transfer function matrix management circuit 115, H × S [k], and the Euclidean distance. The arithmetic circuit 118 calculates the Euclidean distance between this result and the received signal vector Rx managed by the received signal management circuit 114.

The above Euclidean distance calculation processing is performed for all values of k (total N _max ^N times). The selection circuit 119 selects one having the shortest Euclidean distance from among these, and determines that the transmission signal has the highest estimation accuracy. These data are continuously processed over a plurality of symbols. However, after receiving a series of data, the data synthesis circuit 120 reconstructs the data and outputs the data.

  Next, FIG. 13 shows the contents of the transmission processing of the first radio station in the conventional radio communication system. In FIG. 13, when data is input (S300), the transmitting station divides the data into N data series (S301), and these signals are assigned preamble signals (S302), respectively. Individual modulation processing is performed (S303). The modulated signal is converted into a radio frequency by the radio unit, and the signal is transmitted (S304).

Next, FIG. 14 shows the contents of the reception process of the second radio station using the MLD method in the conventional radio communication system. In FIG. 14, when a receiving station receives a radio packet (S310), it detects a preamble (S311) and performs channel estimation (S312). Here, all transfer functions between the transmission antennas and the reception antennas are acquired. A signal received subsequent to the preamble signal is managed as a received signal vector Rx having the received signal r _j at each receiving antenna as a component for each symbol (S313).

On the other hand, N _max ^N types of transmission signal candidates {S [k]} (1 ≦ k ≦ N _max ^N ) are generated as all signal patterns that can be output from the transmission antenna, and the transfer function matrix H Product H × S [k] is calculated (S315), and the Euclidean distance from the received signal Rx is calculated (S316).
The processes S314 to S316 are described including actually performing N _max ^N times in total. In other words, N _max ^N processes S314 to S316 are processed in parallel, or S314 → S315 → S316 → S314 → S315 → S316 → S314 → S315 → S316 → ... and N _max ^N times in series. However, it may be a combination thereof.

In any case, when the calculated E _maxid distance for each of N _max ^N transmission signal vectors is obtained, the whole is compared to search for a transmission signal vector S [k _best ] that gives the minimum Euclidean distance (S317). With this S [k _best ], the signal estimation transmitted from each transmission antenna of the corresponding symbol is determined (S318). If the received data continues, the process returns to step S313, and steps S313 to S319 are repeated. When the received data is finished (S319), the series of received data of each system is reconstructed, the data on the transmission side is reproduced, and the data is output (S320).
S. Kurosaki et. Al., “A SDM-COFDM Scheme Employing a Simple Feed-Forward Inter-Channel Interference Canceller for MIMO Based Broadband Wireless LANs”, IEICE TRANS. COMMUN., Vol.E86 B. No.1, January, 2003 A. van Zelst et. Al., “Space Division Multiplexing (SDM) for OFDM Systems”, Proc. VTC2000 Spring, Vol. 2, pp.1070-1074

The biggest problem with this MLD method is that the calculation process for _obtaining the Euclidean distance must be performed N _max ^N times. For example, when 64QAM is used as the modulation method, N _max = 64. Using this example, the number of Euclidean distance calculations is 64 ² (= 4096) when N = ² , 64 ³ (= 26214464) when N = 3, and 64 ⁴ (= 1677726 when N = 4. ) Diversify exponentially with times.
When realizing this as a circuit, there are a method of sequentially performing the processes S314 to S316 in FIG. 14 in series and a method of processing in parallel, that is, simultaneously.

However, in the case of performing serially, it is necessary to perform N _max ^N times of loop processing to determine one symbol of transmission data, resulting in a huge processing delay. On the other hand, even when implemented in parallel, N _max ^N similar circuits must be mounted, and when N becomes 3 or more, the circuit scale increases explosively, so mounting on LSI is completely impossible. It becomes. An intermediate combination is also conceivable, but it is difficult to achieve both circuit scale and calculation time.
All the problems are caused by the fact that the amount of calculation processing is a value proportional to N _max ^N , and it is a problem to suppress this amount of calculation.

  The present invention has been made in view of such circumstances, and can be realized with a realistic circuit scale and calculation amount while realizing good characteristics when performing wireless communication using MIMO technology. An object of the present invention is to provide a simple wireless communication method, a wireless communication system, and a reception processing program.

In order to solve the above-described problem, the invention described in claim 1 includes a first radio station including N (N> 1: integer) or more first antenna groups, and M (M> 1: (Integer) In a wireless communication method for communicating with a second wireless station having a second antenna group,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K a step of calculating and generating a column vector T ₃ ^{[k1, k2],} the said transfer function matrix H column vector T ₃ ^{[k1, k2]} product of i.e. ^{_{H × T 3 [k1, k2}} ] ,
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Combining the elements of the selected column vector and reproducing and outputting the user data transmitted from the first radio station.

The prior art is an N-row M-column matrix that is Hermitian conjugate of an M-row N-column transfer function matrix H having the transfer function h _{j, i} as the (j, i) element in the second wireless station. A step of generating H ^H , a step of calculating a product of these matrices, that is, a matrix H ^H × H of N rows and N columns, and an inverse matrix of the matrix, that is, a matrix of N rows and N columns (H ^H × H) ⁻¹ Calculating the product of the inverse matrix and the matrix H ^H , that is, calculating the matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H, and the m-th antenna of the second antenna group When the received signal actually received is r _m, and the column vector of M rows where each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ) is Rx, (H ^H × H ) A step of calculating an N-row column vector Tx given by ⁻¹ × H ^H × Rx, and a hard decision process of the signal point position was performed for each transmission signal point given by each element of the column vector Tx Find column vector Tx ' And steps, with the difference that implementing the steps of the first to N.
As a result, it is possible to limit the range of transmission signal points for performing signal point distance calculation in the MLD method, and to realize characteristics superior to the ZF method while significantly reducing the circuit scale.

The invention according to claim 2 is a first radio station including a first antenna group of N (N> 1: integer) or more and a second radio station of M (M> 1: integer). In a wireless communication method for performing communication with a second wireless station having an antenna group,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the process of superimposing and transmitting the first signal sequence at the same frequency simultaneously using the N first antenna groups,
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Combining the elements of the selected column vector and reproducing and outputting the user data transmitted from the first radio station.
This is to improve the characteristics by applying the MMSE method, which has better characteristics than the ZF method, when providing initial information of transmission signal point search before performing the first to Nth steps. This is a simple realization method.

According to a third aspect of the present invention, there is provided a first wireless station including N (N> 1: integer) or more first antenna groups and a second wireless station including N second antenna groups. In a wireless communication method for communicating with other wireless stations,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Combining the elements of the selected column vector and reproducing and outputting the user data transmitted from the first radio station.
This is a simple method for easily realizing the ZF method when providing initial information of transmission signal point search before performing the first to Nth steps.

According to a fourth aspect of the present invention, there is provided a first wireless station having a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. In a wireless communication method for performing communication with a second wireless station having an antenna group,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H _k ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
Combining the elements of the selected column vector and reproducing and outputting the user data transmitted from the first radio station.

According to a fifth aspect of the present invention, there is provided a first radio station including a first antenna group of N (N> 1: integer) or more and M (M> 1: integer) second radio stations. In a wireless communication method for performing communication with a second wireless station having an antenna group,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And combining the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

According to a sixth aspect of the present invention, there is provided a first radio station having N (N> 1: integer) or more first antenna groups and a second radio station having N second antenna groups. In a wireless communication method for communicating with other wireless stations,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
Combining the elements of the selected column vector and reproducing and outputting the user data transmitted from the first radio station.
The inventions according to claims 4 to 6 not only carry out the first to Nth steps in claims 1 to 3 but also the (N + 1) to 2 × An N step group is implemented. In this case, a highly accurate transmission signal point is once estimated in the first to Nth step groups, and the first to Nth step groups are executed again using this as an initial value (actually, (N + 1) th ~ Equivalent to 2 × N step group), which is a simple implementation method for improving reception characteristics

The invention described in claim 7 is a first radio station including a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. In a wireless communication system configured with a second wireless station having an antenna group,
The first radio station is
Means for dividing the input user data into N systems;
Means for generating a first signal sequence of N systems by giving signals of individual known patterns to the data divided into the N systems;
Means for simultaneously superimposing and transmitting the first signal sequence at the same frequency using N first antenna groups,
The second radio station is
Means for individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, with a known pattern signal given to the received signal as a reference signal means for obtaining _i ;
Linear calculation that performs processing to obtain a matrix that is Hermitian conjugate of various matrices, and / or processing that performs matrix-matrix integration, and / or processing that performs matrix-vector integration, and / or processing that obtains an inverse matrix Means,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a means for obtaining a column vector Tx as a primary estimation of the transmission signal by integrating the vector and the matrix obtained by the linear computing means;
Means for obtaining a column vector Tx ′ obtained by performing a hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
If the reference signal is (t ₁ , t ₂ , t ₃ ,... T _N ), a transmission signal candidate is generated by replacing only one of these components as a transmission signal. Means to
Means for generating a replica signal by accumulating a transfer function matrix H to a column vector that is a candidate for the transmission signal;
Means for calculating a signal point distance between the generated replica signal and the actual received signal vector Rx;
Means for selecting K (K> 1: integer) from the one that minimizes the distance between the signal points for a plurality of transmission signal candidates;
Means for combining the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention according to claim 8 is a first wireless station including a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. A program for performing a reception process of a second wireless station of a wireless communication system configured with a second wireless station including an antenna group,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K a step of calculating and generating a column vector T ₃ ^{[k1, k2],} the said transfer function matrix H column vector T ₃ ^{[k1, k2]} product of i.e. ^{_{H × T 3 [k1, k2}} ] ,
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention according to claim 9 is a first wireless station including a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. A program for performing reception processing of a second wireless station of a wireless communication system configured with a second wireless station provided with an antenna group,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention according to claim 10 is a first radio station including N (N> 1: integer) or more first antenna groups and a second radio station including N second antenna groups. A program for performing a reception process of a second radio station of a radio communication system configured with
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention according to claim 11 is a first wireless station including a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. A program for performing reception processing of a second wireless station of a wireless communication system configured with a second wireless station provided with an antenna group,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H _k ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention according to claim 12 is a first wireless station including a first antenna group of N (N> 1: integer) or more, and M (M> 1: integer) second radio stations. A program for performing reception processing of a second wireless station of a wireless communication system configured with a second wireless station provided with an antenna group,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

The invention described in claim 13 is a first radio station having N (N> 1: integer) or more first antenna groups and a second radio station having N second antenna groups. A program for performing a reception process of a second radio station of a radio communication system configured with a radio station of
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And synthesizing the elements of the selected column vector to reproduce and output user data transmitted from the first radio station.

As described above in detail, according to the present invention, when performing highly efficient wireless communication using MIMO technology, while achieving the good characteristics of the MLD method, it is significantly larger than the conventional MLD method. In addition, it is possible to obtain an effect that the circuit scale and the calculation amount can be reduced. As a result, for example, a receiving circuit having a scale that cannot be mounted on one chip by the MLD method can be mounted in a one-chip LSI. Moreover, the effect that the power consumption is directly reduced by reducing the calculation amount can be expected.
The effect is obtained.

Embodiments of the present invention will be described below with reference to the drawings. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; The difference between the wireless communication system according to the present invention and the conventional wireless communication system configured by Is also common. Accordingly, a description will be given below regarding the second radio station on the receiving station side.
For simplicity, here, a case where the number of transmission antennas and the number of reception antennas are both three (N = M = 3) will be described as an example.

FIG. 1 shows the processing contents (contents described in claim 1) of the receiving unit of the second wireless station in the wireless communication system according to the first embodiment of the present invention.
In FIG. 1, when a receiving station receives a signal (S1), it performs channel estimation and acquires a transfer function matrix H (S2). Thereafter, H ^H , H ^H × H, (H ^H × H) ⁻¹ , and (H ^H × H) ⁻¹ × H ^H are sequentially calculated as matrix operations (S3). The received signal is processed for each symbol, a received signal Rx of a certain symbol is extracted (S4), and a first estimation point Tx of the transmitted signal is performed by (H ^H × H) ⁻¹ × H ^H × Rx (S5). Thereafter, a term determination process is performed, and Tx → Tx ′ is converted (S6).

In the process S7, when each component of the vector Tx ′ is (t ₁ , t ₂ , t ₃ ), the second and third components are fixed at t ₂ and t ₃ , and only t ₁ is used as a transmission signal point. Signal point candidates (t [k ₁ ], t ₂ , t ₃ ) replaced with all possible signal points are generated (S7). For example, the number of possible transmission signal points N _max is 4 for QPSK, and N _max = 64 for 64QAM. For the transmission signal point candidate T ₁ ^[k1] = (t [k ₁ ], t ₂ , t ₃ ) where 1 ≦ k ₁ ≦ N _max , the product of the transfer function matrix H is calculated, and the transmission signal there generating a T ₁ ^[k1] replica H × T ₁ of the expected received signal if it was ^[k1] (S8). The Euclidean distance between this replica signal and the actual received signal is calculated (S9). The above processing is repeated for all N _max transmission signal candidates (S10).

When the Euclidean distances are obtained for all N _max transmission signal candidates, K candidates are selected from the shorter Euclidean distances (S11). The K candidates are expressed as vectors (t ₁ ^{[1, k2]} , t ₂ , t ₃ ). Next, the third component is fixed at t ₃ , K candidates t ₁ ^{[1, k2]} (1 ≦ k ₂ ≦ K) as the first component, and all N _max all as the second component Each of the transmission signal candidates t [k ₁ ] is combined, and a total of K × N _max transmission signal point candidates T ₂ ^{[k1, k2]} = (t ₁ ^{[1, k2]} , t [k ₁ ], t ₃ ) Is generated (S12). Also for this candidate, processing similar to processing S8 to S10 is performed (S13 to S15), and K candidates are selected from the shortest Euclidean distance among the K × N _max transmission signal point candidates. (S16). The K candidates are expressed as vectors (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t ₃ ).

Furthermore, as a combination of the first component and the second component, K sets of candidates (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} ) are used, and N _max transmission signal candidates are set as the third component. Each of t [k ₁ ] is combined, and a total of K × N _max transmission signal point candidates T ₃ ^{[k1, k2]} = (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t [k ₁ ]) is generated (S17). Also for this candidate, processing similar to the processing S8 to S10 is performed (S18 to S20), and the candidate with the shortest Euclidean distance is selected from among K × N _max transmission signal point candidates (S21). If there is further received data, the process returns to process S4, and processes S5 to S21 are continued. Upon completion of the data (S22), the received data is synthesized and output (S23).
In the figure, S7 to S10, S12 to S15, and S17 to S20 are illustrated as cases in which processing is performed in series. However, each of these processes (for example, S7 to S10) it is also possible to perform parallel processing on N _max number or K × N _max number of transmission signal points.

Next, FIG. 2 shows processing contents (contents described in claim 2) of the receiving unit of the second radio station in the radio communication system according to the second embodiment of the present invention. The difference from the processing contents of the receiving unit of the second radio station according to the first embodiment shown in FIG. 1 is transmitted in the receiving process by the receiving unit of the second radio station according to the first embodiment shown in FIG. The first estimation Tx of the signal is performed by (H ^H × H) ⁻¹ × H ^H × Rx. However, in the reception processing by the receiving unit of the second radio station according to the second embodiment shown in FIG. Is performed by H ^H × Y ⁻¹ × Rx (S35).

Further, in order to obtain the matrix Y used here, when a preamble signal is received, y is acquired as a row vector in which the reception state of the preamble signal at each receiving antenna is taken as each component (S55). Further, a Hermitian conjugate row vector y ^H of this vector is generated, and a matrix Y is generated as the product y × y ^H (S56). If the preamble signal spans multiple symbols, they are averaged over the preamble interval (S57). Except for using Y acquired as described above, the processes S36 to S54 are the same as the processes S6 to S24 in FIG.

Next, FIG. 3 is a diagram showing processing contents (contents described in claim 3) of the receiving unit of the second wireless station in the wireless communication system according to the third embodiment of the present invention. In the first embodiment of the present invention, since the numbers N and M of the transmission antenna and the reception antenna are generally different, the first-order estimation Tx of the transmission signal is performed by (H ^H × H) ⁻¹ × H ^H × Rx. However, when limited to the case of N = M, it is also possible to perform the primary estimation Tx by H ⁻¹ × Rx as shown in the third embodiment (S65). Accordingly, the process S3 in FIG. 1 is replaced with the process S63 in FIG.

Next, FIGS. 4 to 9 show the processing contents of the receiving unit of the second radio station in the radio communication system according to the fourth, fifth, and sixth embodiments of the present invention, respectively. In the description of FIGS. 1 to 3 showing the processing contents of the receiving unit of the second radio station according to the first embodiment, the second embodiment, and the third embodiment of the present invention, the first estimation method of the transmission signal is used. In all other _cases , KxN _max candidates of transmission signal points are generated in the order of the first transmission antenna, the second transmission antenna, and the third transmission antenna to narrow down the candidates with short Euclidean distances. The transmission signal point has been determined after the processing for is completed.

  4th Embodiment (FIG. 4, FIG. 5: The content described in Claim 4), 5th Embodiment (FIG. 6, FIG. 7: The content described in Claim 5), 6th Embodiment (FIG. 8) of this invention. , FIG. 9: Content of Claim 6) In the receiving unit of the second wireless station in the wireless communication system, this method is extended to the first transmitting antenna → the second transmitting antenna → the third transmitting antenna → The first transmission antenna, the second transmission antenna, and the third transmission antenna are performed over a plurality of turns.

  Next, FIG. 10 shows the configuration of the receiving unit of the second radio station in the radio communication system according to the embodiment of the present invention. In the figure, 1-1 to 1-3 are receiving antennas, 2-1 to 2-3 are radio units, 3 is a channel estimation circuit, 4 is a received signal management unit, 5 is a transfer function matrix management circuit, and 6 is a replica. Signal generation circuit, 7 is a transmission signal generation circuit, 8 is a Euclidean distance calculation circuit, 9 is a selection circuit, 10 is a data synthesis circuit, 11 is a matrix calculation circuit, 12 is a primary estimation circuit, and 13 is a hard decision circuit .

In the above configuration, the transfer function matrix managed by the transfer function matrix management circuit 5 is input to the matrix operation circuit 11. In the first embodiment or the fourth embodiment, the matrix (H ^H × H) ⁻¹ × H ^H is obtained here. In the second embodiment or the fifth embodiment, the matrix H ^H × Y ⁻¹ is obtained here.
Furthermore, in the third embodiment or the sixth embodiment, the matrix H ⁻¹ is obtained here. By integrating these matrices with the received signal Rx, a first-order estimation Tx of the transmission signal is obtained, and this is converted into a signal point Tx ′ subjected to the term determination processing in the hard decision circuit 12. This signal is input to the transmission signal generation circuit 7.

In the transmission signal generation circuit 7, for example, in the example of FIG. 1, transmission signal candidates corresponding to the processing S7, the processing S12, and the processing S17 are generated. The replica signal generation circuit 6 generates a replica of the received signal for these signals, and the Euclidean distance calculation circuit 8 calculates the Euclidean distance. The selection circuit 9 narrows down from N _max or K × N _max candidates to K candidates having a short Euclidean distance, and feeds back this information to the transmission signal generation circuit 7.

The process of the transmission signal generation circuit 7 → the replica signal generation circuit 6 → the Euclidean distance calculation circuit 8 → the selection circuit 9 → the transmission signal generation circuit 7 → the replica signal generation circuit 6 is repeated a predetermined number of times, and finally the Euclidean distance becomes the shortest. The signal is selected by the selection circuit 9, and the data synthesis circuit 10 reproduces and outputs the data.
In addition, although the example using the Euclidean distance is shown here as the distance between the signal points of the actual received signal and the replica signal, other distances between the signal points (for example, approximate values for the Euclidean distance, etc.) may be used. I do not care.

  In the first to sixth embodiments, the signal point position is not subjected to the hard decision process on the transmission signal point given by each element of the column vector Tx, and instead of the column vector Tx ′, the column The vector Tx may be used as it is.

  Note that a computer-readable recording medium for realizing a reception processing function implemented by the reception unit of the second wireless station in the wireless communication system according to the first embodiment of the present invention shown in FIG. The function of the receiving unit of the second radio station may be realized by reading the program recorded on the recording medium and reading the program recorded on the recording medium into the computer system and executing the program.

That is, a first radio station including N (N> 1: integer) or more first antenna groups and a second radio including M (M> 1: integer) second antenna groups. A program for performing reception processing of a second wireless station of a wireless communication system configured with a station,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K a step of calculating and generating a column vector T ₃ ^{[k1, k2],} the said transfer function matrix H column vector T ₃ ^{[k1, k2]} product of i.e. ^{_{H × T 3 [k1, k2}} ] ,
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Determining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  A computer-readable recording medium for realizing a reception processing function implemented by the reception unit of the second wireless station in the wireless communication system according to the second embodiment of the present invention shown in FIG. The function of the receiving unit of the second radio station may be realized by reading the program recorded on the recording medium and reading the program recorded on the recording medium into the computer system and executing the program.

That is, a first radio station including N (N> 1: integer) or more first antenna groups and a second radio including M (M> 1: integer) second antenna groups. A program for performing reception processing of a second wireless station of a wireless communication system configured with a station,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  In addition, a computer-readable recording medium for realizing a reception processing program implemented by the reception unit of the second wireless station in the wireless communication system according to the third embodiment of the present invention shown in FIG. The function of the receiving unit of the second radio station may be realized by reading the program recorded on the recording medium and reading the program recorded on the recording medium into the computer system and executing the program.

That is, a radio comprised of a first radio station having N (N> 1: integer) or more first antenna groups and a second radio station having N second antenna groups. A program for performing reception processing of a second wireless station of a communication system,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  Also, a computer-readable reception processing program for realizing the reception processing function implemented by the reception unit of the second wireless station in the wireless communication system according to the fourth embodiment of the present invention shown in FIGS. The function of the receiving unit of the second radio station may be realized by recording on a recording medium, reading the program recorded on the recording medium into a computer system, and executing the program.

That is, a first radio station including N (N> 1: integer) or more first antenna groups and a second radio including M (M> 1: integer) second antenna groups. A program for performing reception processing of a second wireless station of a wireless communication system configured with a station,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H _k ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  6 and 7 can read the reception processing program for realizing the reception processing function implemented by the reception unit of the second wireless station in the wireless communication system according to the fifth embodiment of the present invention. The function of the receiving unit of the second radio station may be realized by recording on a recording medium, reading the program recorded on the recording medium into a computer system, and executing the program.

That is, a first radio station including N (N> 1: integer) or more first antenna groups and a second radio including M (M> 1: integer) second antenna groups. A program for performing reception processing of a second wireless station of a wireless communication system configured with a station,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  In addition, a computer-readable reception processing program for realizing the reception processing function performed by the reception unit of the second wireless station in the wireless communication system according to the sixth embodiment of the present invention shown in FIGS. 8 and 9 is possible. The function of the receiving unit of the second radio station may be realized by recording on a recording medium, reading the program recorded on the recording medium into a computer system, and executing the program.

That is, a radio comprised of a first radio station having N (N> 1: integer) or more first antenna groups and a second radio station having N second antenna groups. A program for performing reception processing of a second wireless station of a communication system,
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
Recording a reception processing program on a computer-readable recording medium, comprising combining the elements of the selected column vector to reproduce and output user data transmitted from the first wireless station. The function of the receiving unit of the second radio station may be realized by causing a computer system to read and execute a program recorded on a recording medium.

  Here, the “computer system” includes an OS and hardware such as peripheral devices. The “computer system” includes a WWW system having a homepage providing environment (or display environment). The “computer-readable recording medium” refers to a storage device such as a flexible medium, a magneto-optical disk, a portable medium such as a ROM and a CD-ROM, and a hard disk incorporated in a computer system. Further, the “computer-readable recording medium” refers to a volatile memory (RAM) in a computer system that becomes a server or a client when a program is transmitted via a network such as the Internet or a communication line such as a telephone line. In addition, those holding programs for a certain period of time are also included.

  The program may be transmitted from a computer system storing the program in a storage device or the like to another computer system via a transmission medium or by a transmission wave in the transmission medium. Here, the “transmission medium” for transmitting the program refers to a medium having a function of transmitting information, such as a network (communication network) such as the Internet or a communication line (communication line) such as a telephone line. The program may be for realizing a part of the functions described above. Furthermore, what can implement | achieve the function mentioned above in combination with the program already recorded on the computer system, and what is called a difference file (difference program) may be sufficient.

  The above-described embodiments are all illustrative of the present invention and are not limited to the present invention, and the present invention can be implemented in various other variations and modifications. Therefore, the scope of the present invention is defined only by the claims and their equivalents.

The flowchart which shows the processing content of the receiving part of the 2nd radio station in the radio | wireless communications system which concerns on 1st Embodiment of this invention. 7 is a flowchart showing processing contents of a receiving unit of a second radio station in the radio communication system according to the second embodiment of the present invention. 9 is a flowchart showing processing contents of a receiving unit of a second radio station in the radio communication system according to the third embodiment of the present invention. 10 is a flowchart (part 1) showing the processing contents of the receiving unit of the second wireless station in the wireless communication system according to the fourth embodiment of the present invention. 10 is a flowchart (part 2) showing the processing contents of the reception unit of the second wireless station in the wireless communication system according to the fourth embodiment of the present invention. 12 is a flowchart (part 1) showing processing contents of a receiving unit of a second wireless station in the wireless communication system according to the fifth embodiment of the present invention. 21 is a flowchart (part 2) showing the processing contents of the receiving unit of the second wireless station in the wireless communication system according to the fifth embodiment of the present invention. 18 is a flowchart (part 1) showing the processing contents of the reception unit of the second wireless station in the wireless communication system according to the sixth embodiment of the present invention. 18 is a flowchart (part 2) showing the processing contents of the reception unit of the second wireless station in the wireless communication system according to the sixth embodiment of the present invention. The block diagram which shows the structure of the receiving part of the 2nd radio station in the radio | wireless communications system which concerns on embodiment of this invention. The block diagram which shows the structure of the transmission part of the 1st radio station in the conventional radio | wireless communications system. The block diagram which shows the structure of the receiving part of the 2nd radio station in the conventional radio | wireless communications system. The flowchart which shows the processing content of the transmission part of the 1st radio station in the conventional radio | wireless communications system. The flowchart which shows the processing content of the receiving part of the 2nd radio station in the conventional radio | wireless communications system.

Explanation of symbols

1-1 to 1-3 ... Receiving antenna
2-1 to 2-3 ... Radio unit
3… Channel estimation circuit
4 Received signal management section
5… Transfer function matrix management circuit
6… Replica signal generation circuit
7 ... Transmission signal generation circuit
8 ... Euclidean distance calculation circuit
9 ... Selection circuit
10 ... Data synthesis circuit
11 ... Matrix operation circuit
12 ... First estimation circuit
13 ... Hard decision circuit
100: Data division circuit
101-1 to 101-3 ... Preamble applying circuit
102-1 to 102-3 ... Modulation circuit
103-1 to 103-3 ... Radio unit
104-1 to 104-3 ... Transmitting antenna
111-1 to 111-3 ... Receiving antenna
112-1 to 112-3 ... Wireless unit
113 ... Channel estimation circuit
114 ... Received signal management section
115 ... Transfer function matrix management circuit
116… Replica signal generation circuit
117 ... Transmission signal generation circuit
118 ... Euclidean distance calculation circuit
119 ... Selection circuit
120 ... Data synthesis circuit

Claims (13)

A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; In a wireless communication method for performing communication between
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K a step of calculating and generating a column vector T ₃ ^{[k1, k2],} the said transfer function matrix H column vector T ₃ ^{[k1, k2]} product of i.e. ^{_{H × T 3 [k1, k2}} ] ,
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And a step of reproducing and outputting user data transmitted from the first wireless station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; In a wireless communication method for performing communication between
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the process of superimposing and transmitting the first signal sequence at the same frequency simultaneously using the N first antenna groups,
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And a step of reproducing and outputting user data transmitted from the first radio station by combining the elements of the selected column vector. Wireless communication between a first wireless station having N (N> 1: integer) or more first antenna groups and a second wireless station having N second antenna groups In the communication method,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
And a step of reproducing and outputting user data transmitted from the first radio station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; In a wireless communication method for performing communication between
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H _k ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And a step of reproducing and outputting user data transmitted from the first radio station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; In a wireless communication method for performing communication between
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And a step of reproducing and outputting user data transmitted from the first radio station by combining the elements of the selected column vector. Wireless communication between a first wireless station having N (N> 1: integer) or more first antenna groups and a second wireless station having N second antenna groups In the communication method,
The first radio station is
Dividing the input user data into N systems;
Providing a signal of an individual known pattern to the data divided into the N systems to generate a first signal sequence of N systems,
Performing the step of superimposing and transmitting the first signal sequence at the same frequency simultaneously using N first antenna groups, and
The second radio station is
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
And a step of reproducing and outputting user data transmitted from the first wireless station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; In a wireless communication system configured by:
The first radio station is
Means for dividing the input user data into N systems;
Means for generating a first signal sequence of N systems by giving signals of individual known patterns to the data divided into the N systems;
Means for simultaneously superimposing and transmitting the first signal sequence at the same frequency using N first antenna groups;
Have
The second radio station is
Means for individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, with a known pattern signal given to the received signal as a reference signal means for obtaining _i ;
Linear calculation that performs processing to obtain a matrix that is Hermitian conjugate of various matrices, and / or processing that performs matrix-matrix integration, and / or processing that performs matrix-vector integration, and / or processing that obtains an inverse matrix Means,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a means for obtaining a column vector Tx as a primary estimation of the transmission signal by integrating the vector and the matrix obtained by the linear computing means;
Means for obtaining a column vector Tx ′ obtained by performing a hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
If the reference signal is (t ₁ , t ₂ , t ₃ ,... T _N ), a transmission signal candidate is generated by replacing only one of these components as a transmission signal. Means to
Means for generating a replica signal by accumulating a transfer function matrix H to a column vector that is a candidate for the transmission signal;
Means for calculating a signal point distance between the generated replica signal and the actual received signal vector Rx;
Means for selecting K (K> 1: integer) from the one that minimizes the distance between the signal points for a plurality of transmission signal candidates;
Means for combining the elements of the selected column vector to reproduce and output user data transmitted from the first radio station;
A wireless communication system comprising: A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; A program for performing reception processing of the second radio station of the radio communication system configured by:
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K a step of calculating and generating a column vector T ₃ ^{[k1, k2],} the said transfer function matrix H column vector T ₃ ^{[k1, k2]} product of i.e. ^{_{H × T 3 [k1, k2}} ] ,
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
A reception processing program for causing a computer to execute the step of reproducing and outputting the user data transmitted from the first radio station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; A program for performing reception processing of the second radio station of the radio communication system configured by:
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
A reception processing program for causing a computer to execute the step of reproducing and outputting user data transmitted from the first wireless station by combining the elements of the selected column vector. A radio communication system including a first radio station including N (N> 1: integer) or more first antenna groups and a second radio station including N second antenna groups. A program for receiving the second radio station of
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
K types of transmission signal candidates having short distances between signal points selected in the second step group are represented by (t ₁ ^[2,1] , t ₂ ^[2,1] , t _[k1] , t _{4 ,.} ..T _N ), (t ₁ ^[2,2] , t ₂ ^[2,2] , t _[k1] , t ₄ ,... T _N ), (t ₁ ^[2,3] , t ₂ ^{[ 2,3]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ , ... t _N ) ... (t ₁ ^{[2, K]} , t ₂ ^{[2, K]} , t _[k1] , t ₄ ,... t _N ), 1 ≦ k1 ≦ N _max and 1 ≦ N rows with (t ₁ ^{[2, k2]} , t ₂ ^{[2, k2]} , t _[k1] , t ₄ ,... t _N ) as components for all integers k1 and k2 with k2 ≦ K Generating a column vector T ₃ ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T ₃ ^{[k1, k2]} , that is, H × T ₃ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₃ ^{[k1, k2]} and the column vector Rx;
The process similar to the third step group including the step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation is sequentially performed. K types of transmission signal candidates with short distances between the signal points selected in the (N-1) th step group (t ₁ ^[N-1,1] , t ₂ ^[N-1,1] , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^[N-1,2] , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^{[N -1,3]} , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N −1, K]} ,... T _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1, k2]} , t ^{_{2 [N-1, k2]}} , t 3 [N-1, k2], ··· t N-1 [N-1, k2], t [k1]) of N rows whose components column vector T _N ^{generating [k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
Selecting a transmission signal having the shortest signal point distance calculated from K × N _max transmission signal candidates subjected to signal point distance calculation; and an Nth step group including:
A reception processing program for causing a computer to execute the step of reproducing and outputting user data transmitted from the first wireless station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; A program for performing reception processing of the second radio station of the radio communication system configured by:
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Calculating the product of these matrices, i.e., the N-by-N matrix H ^H × H;
Calculating an inverse matrix of the matrix, that is, an N × N matrix (H ^H × H) ⁻¹ ;
Calculating the product of the inverse matrix and the matrix H _k ^H , that is, a matrix of N rows and M columns (H ^H × H) ⁻¹ × H ^H ;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). And Rx, a step of calculating a column vector Tx of N rows given by (H ^H × H) ⁻¹ × H ^H × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 such that 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
A reception processing program for causing a computer to execute the step of reproducing and outputting user data transmitted from the first wireless station by combining the elements of the selected column vector. A first radio station having N (N> 1: integer) or more first antenna groups, and a second radio station having M (M> 1: integer) second antenna groups; A program for performing reception processing of the second radio station of the radio communication system configured by:
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Generating an N-row M-column matrix H ^H that is Hermitian conjugate of an M-row N-column transfer function matrix H with the transfer function h _{j, i} as the (j, i) element;
Obtaining a column vector y having each signal as a component when a preamble signal transmitted by the first radio station is received by the second antenna group;
Generating a Hermitian conjugate row vector y ^H of the column vector;
The product of these vectors is an M-by-M matrix, ie Y = y × calculating y ^H ;
If the preamble signal spans multiple symbols, averaging the values of each component of the matrix Y over multiple symbols and replacing it with
Calculating an inverse matrix of the matrix Y, i.e., Y ^-1 ;
Generating a matrix H ^H × Y ^-1 of matrix product i.e. N rows and M columns of said matrix and ^H H × Y ^-1,
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ^H × Y ⁻¹ × Rx;
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
A reception processing program for causing a computer to execute the step of reproducing and outputting the user data transmitted from the first radio station by combining the elements of the selected column vector. A radio communication system including a first radio station including N (N> 1: integer) or more first antenna groups and a second radio station including N second antenna groups. A program for receiving the second radio station of
Individually receiving radio signals using the M second antenna groups;
A transfer function h _j, between the i-th antenna in the first antenna group and the j-th antenna in the second antenna group, using a known pattern signal given to the received signal as a reference signal obtaining _i ;
Calculating an inverse matrix of the transfer function matrix H having the transfer function h _{j, i} as the (j, i) element, that is, a matrix H ⁻¹ having N rows and N columns;
A received signal actually received by the m-th antenna of the second antenna group is r _m, and M rows of column vectors in which each component is given by (r ₁ , r ₂ , r ₃ ,... R _M ). Where Rx is a step of calculating a column vector Tx of N rows given by H ⁻¹ × Rx,
Obtaining a column vector Tx ′ obtained by performing hard decision processing of the signal point position for each transmission signal point given by each element of the column vector Tx;
Signal points of the set of {t _[n]} of the N _max number can take as a transmission signal from each antenna (N _max> 1 _{integer) (1 ≦ n ≦ N max} : integer), and each of the column vectors Tx ' the component _{(t 1, t 2, t} 3, ··· t N) when a relative 1 ≦ k1 ≦ N _max becomes all integers _{k1 (t [k1], t} 2, t 3, ·· Generating an N-row column vector T ₁ ^[k1] whose components are t _N );
Calculating a product of the transfer function matrix H and the column vector T ₁ ^[k1] , that is, H × T ₁ ^[k1] ;
Obtaining a signal point distance between the column vector H × T ₁ ^[k1] and the column vector Rx;
A first step group comprising: selecting K types (1 <K: integer) from the shorter signal point distance calculated from the N _max transmission signal candidates for which the signal point distance calculation is performed; ,
K types of transmission signal candidates having a short distance between the signal points selected in the first step group (t ₁ ^[1,1] , t ₂ , t ₃ ,... T _N ), (t ₁ ^{[ 1,2]} , t ₂ , t ₃ , ... t _N ), (t ₁ ^[1,3] , t ₂ , t ₃ , ... t _N ) ... (t ₁ ^{[1, K]} , t ₂ , t ₃ ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[1, k2]} , t _{[ k1]} , t ₃ ,... t _N ) to generate N rows of column vectors T ₂ ^{[k1, k2]} ;
Calculating the product of the transfer function matrix H and the column vector T ₂ ^{[k1, k2]} , that is, H × T ₂ ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T ₂ ^{[k1, k2]} and the column vector Rx;
Selecting a K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and a second step group including:
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between the signal points selected in the (N-1) th step group are (t ₁ ^[N-1,1] , t ₂ ^{[N-1, 1]} , t ₃ ^[N-1,1] , ... t _N-1 ^[N-1,1] , t _N ), (t ₁ ^[N-1,2] , t ₂ ^{[N-1, 2]} , t ₃ ^[N-1,2] , ... t _N ^[N-1,2] , t _N ), (t ₁ ^[N-1,3] , t ₂ ^[N-1,3] , t ₃ ^[N-1,3] , ... t _N ^[N-1,3] , t _N ) ... (t ₁ ^{[N-1, K]} , t ₂ ^{[N-1, K]} , t ₃ ^{[N−1, K]} ,... t _N ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[N−1 _{, k2], t 2 [N}} -1, k2], t 3 [N-1, k2], ··· t N-1 [N-1, k2], N rows and t _[k1]) component Generating a column vector T _N ^{[k1, k2]} of
Calculating a product of the transfer function matrix H and the column vector T _N ^{[k1, k2]} , that is, H × T _N ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _N ^{[k1, k2]} and the column vector Rx;
A step of selecting the K type from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation, and an Nth step group including:
K types of transmission signal candidates selected in the Nth step group and having a short distance between signal points are represented by (t ₁ ^{[N, 1]} , t ₂ ^{[N, 1]} , t ₃ ^{[N, 1],.} ..T _N-1 ^{[N, 1]} , t _N ^{[N, 1]} ), (t ₁ ^{[N, 2]} , t ₂ ^{[N, 2]} , t ₃ ^{[N, 2]} , ... t _N ^{[N, 2]} , t _N ^{[N, 2]} ), (t ₁ ^{[N, 3]} , t ₂ ^{[N, 3]} , t ₃ ^{[N, 3]} , ... t _N ^{[N, 3 ]} , t _N ^{[N, 3]} ) ... (t ₁ ^{[N, K]} , t ₂ ^{[N, K]} , t ₃ ^{[N, K]} , ... t _N ^{[N, K]} ) If you for 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K becomes all integers k1 and _{k2 (t [k1], t} 2 [N, k2], t 3 [N, k2], ··· generating an N-row column vector T _{N + 1} ^{[k1, k2]} with components of t _N ^{[N, k2]} );
Calculating a product of the transfer function matrix H and the column vector T _{N + 1} ^{[k1, k2]} , that is, H × T _{N + 1} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 1} ^{[k1, k2]} and the column vector Rx;
N + 1-th step group including the step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation,
K types of transmission signal candidates with short distances between the signal points selected in the (N + 1) th step group are (t ₁ ^{[N + 1,1]} , t ₂ ^{[N + 1,1]} , t ₃ ^{[N + 1,1]} , ... t _N-1 ^{[N + 1,1]} , t _N ^{[N + 1,1]} ), (t ₁ ^{[N + 1,2]} , t ₂ ^{[N + 1,2 ]} , t ₃ ^{[N + 1,2]} , ... t _N ^{[N + 1,2]} , t _N ^{[N + 1,2]} ), (t ₁ ^{[N + 1,3]} , t ₂ ^{[ N + 1,3]} , t ₃ ^{[N + 1,3]} , ... t _N ^{[N + 1,3]} , t _N ^{[N + 1,3]} ) ... (t ₁ ^{[N + 1 , K]} , t ₂ ^{[N + 1, K]} , t ₃ ^{[N + 1, K]} ,... T _N ^{[N + 1, K]} ), 1 ≦ k1 ≦ N _max and 1 ≦ For all integers k1 and k2 where k2 ≦ K, (t ₁ ^{[N + 1, k2]} , t _[k1] , t ₂ ^{[N + 1, k2]} , t ₃ ^{[N + 1, k2]} , ・A step of generating a column vector T _{N + 2} ^{[k1, k2]} of N rows whose components are t _N ^{[N + 1, k2]} );
Calculating the product of the transfer function matrix H and the column vector T _{N + 2} ^{[k1, k2]} , that is, H × T _{N + 2} ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _{N + 2} ^{[k1, k2]} and the column vector Rx;
A step of selecting N + 2 steps including a step of selecting K types from the shorter signal point distance calculated from the K × N _max transmission signal candidates subjected to signal point distance calculation;
The same processing is sequentially performed, and K types of transmission signal candidates having a short distance between signal points selected in the 2 × N−1 step group are (t ₁ ^{[2 × N−1,1]} , t ₂ ^{[ 2 × N-1,1]} , t ₃ ^{[2 × N-1,1]} , ... t _N-1 ^{[2 × N-1,1]} , t _N ^{[2 × N-1,1]} ) , (T ₁ ^{[2 × N-1,2]} , t ₂ ^{[2 × N-1,2]} , t ₃ ^{[2 × N-1,2]} , ... t _N ^{[2 × N-1, 2]} ), (t ₁ ^{[2 × N-1,3]} , t ₂ ^{[2 × N-1,3]} , t ₃ ^{[2 × N-1,3]} , ... t _N ^{[2 × N -1,3]} ) ... (t ₁ ^{[2 × N-1, K]} , t ₂ ^{[2 × N-1, K]} , t ₃ ^{[2 × N-1, K]} , ... t _N ^{[2 × N−1, K]} ), for all integers k1 and k2 where 1 ≦ k1 ≦ N _max and 1 ≦ k2 ≦ K, (t ₁ ^{[2 × N−1, k2]} , t ₂ ^{[2 × N-1, k2]} , t ₃ ^{[2 × N-1, k2]} , ... t _N-1 ^{[2 × N-1, k2]} , t _[k1] ) Generating an N-row column vector T _2N-1 ^{[k1, k2]} ;
Calculating a product of the transfer function matrix H and the column vector T _2N-1 ^{[k1, k2]} , that is, H × T _2N-1 ^{[k1, k2]} ;
Obtaining a signal point distance between the column vector H × T _2N-1 ^{[k1, k2]} and the column vector Rx;
A step of selecting 2 × N steps including the step of selecting the shortest signal point distance calculated from the K × N _max transmission signal candidates subjected to the signal point distance calculation;
A reception processing program for causing a computer to execute the step of reproducing and outputting the user data transmitted from the first radio station by combining the elements of the selected column vector.

Images