APPARATUS AND METHOD FOR PERMUTATION OF BLOCK CODE IN WIRELESS COMMUNICATION SYSTEM

Abstract

The present disclosure relates to a pre-5.sup.th-generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4.sup.th-generation (4G) communication system such as long term evolution (LTE). Disclosed are an apparatus and a method for a permutation of a block code in a wireless communication system. A method of operating a transmitting node in a wireless communication system includes: determining a permutation matrix according to a block code scheme; generating symbols corresponding to a plurality of antennas based on the block code scheme and the permutation matrix; and transmitting the symbols to a receiving node through the plurality of antennas. The permutation matrix is determined based on a number of blocks and an arrangement structure of the plurality of antennas, and the number of blocks comprises a number of sub-blocks within a code block corresponding to the permutation matrix.

Claims

1. A method of a transmitting node in a wireless communication system, the method comprising: determining a permutation matrix according to a block code scheme; generating symbols corresponding to a plurality of antennas based on the block code scheme and the permutation matrix; and transmitting the symbols to a receiving node through the plurality of antennas, wherein the permutation matrix is determined based on a number of blocks and an arrangement structure of the plurality of antennas, and wherein the number of blocks comprises a number of sub-blocks within a code block corresponding to the permutation matrix.

2. The method of claim 1, wherein each of the sub-blocks includes symbols that share time-frequency resources among the symbols.

3. The method of claim 1, wherein the plurality of antennas comprises a 2 dimensional (2D) planar array, and wherein the arrangement structure is determined based on a number of rows of antennas located in a vertical direction and a number of columns of the antennas located in a horizontal direction in the 2D planar array.

4. The method of claim 1, wherein the plurality of antennas is arranged such that multiple antennas having different polarities are located at one position.

5. The method of claim 1, wherein the permutation matrix maximizes a minimum distance between antennas used for transmitting a sub-block of the sub-blocks.

6. The method of claim 1, wherein determining the permutation matrix comprises calculating the permutation matrix to maximize a minimum distance between antennas used for transmitting each of the sub-blocks.

7. The method of claim 6, wherein calculating the permutation matrix comprises: determining a horizontal interval and a vertical interval that configure a minimum distance between two antennas maximum within the sub-blocks; and determining a combination of positions of antennas for each of the sub-blocks based on the determined horizontal interval and vertical interval.

8. The method of claim 1, wherein the permutation matrix configures polarities of antennas having a minimum distance that is different among antennas used for transmitting a sub-block.

9. The method of claim 1, wherein determining the permutation matrix comprises calculating the permutation matrix to configure antennas having a minimum distance and different polarities among antennas used for transmitting each of the sub-blocks.

10. The method of claim 1, wherein the block code scheme is determined based on a frequency shift transmit diversity (FSTD) scheme in which space frequency block code (SFBC) blocks are orthogonally arranged on a frequency domain.

11. An apparatus of a transmitting node in a wireless communication system, the apparatus comprising: at least one processor configured to determine a permutation matrix according to a block code scheme; and a transceiver configured to: generate symbols corresponding to a plurality of antennas based on the block code scheme and the permutation matrix; and transmit the symbols to a receiving node through the plurality of antennas, wherein the permutation matrix is determined based on a number of blocks and an arrangement structure of the plurality of antennas, and wherein the number of blocks comprises a number of sub-blocks within a code block corresponding to the permutation matrix.

12. The apparatus of claim 11, wherein each of the sub-blocks includes symbols that share time-frequency resources among the symbols.

13. The apparatus of claim 11, wherein the plurality of antennas comprises a 2 dimensional (2D) planar array, and wherein the arrangement structure is determined based on a number of rows of antennas located in a vertical direction and a number of columns of antennas located in a horizontal direction in the 2D planar array.

14. The apparatus of claim 11, wherein the plurality of antennas is arranged such that multiple antennas having different polarities are located at one position.

15. The apparatus of claim 11, wherein the permutation matrix maximizes a minimum distance between antennas used for transmitting a sub-block of the sub-blocks.

16. The apparatus of claim 11, wherein the at least one processor is further configured to calculate the permutation matrix to maximize a minimum distance between antennas used for transmitting each of the sub-blocks.

17. The apparatus of claim 16, wherein the at least one processor is further configured to: determine a horizontal interval and a vertical interval that configure a minimum distance between two antennas maximum within the sub-blocks; and determines a combination of positions of antennas for each of the sub-blocks based on the determined horizontal interval and vertical interval.

18. The apparatus of claim 11, wherein the permutation matrix configures polarities of antennas having a minimum distance that is different among antennas used for transmitting a sub-block.

19. The apparatus of claim 11, wherein the at least one processor is further configured to calculate the permutation matrix to configure antennas having a minimum distance and different polarities among antennas used for transmitting each of the sub-blocks.

20. The apparatus of claim 11, wherein the block code scheme is determined based on a frequency shift transmit diversity (FSTD) scheme in which space frequency block code (SFBC) blocks are orthogonally arranged on a frequency domain.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0019] For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

[0020] FIG. 1 illustrates an example of a wireless communication system according to various embodiments of the present disclosure;

[0021] FIG. 2 illustrates a transmitting node in a wireless communication system according to various embodiments of the present disclosure;

[0022] FIG. 3 illustrates various embodiments of a full dimensional multiple input multiple output (FD-MIMO) antenna in a wireless communication system according to various embodiments of the present disclosure;

[0023] FIG. 4 illustrates an example of a 2 dimensional (2D) planar antenna array using cross-polarization antennas are used in a wireless communication system according to various embodiments of the present disclosure;

[0024] FIG. 5 illustrates a block code in a wireless communication system according to various embodiments of the present disclosure;

[0025] FIG. 6 illustrates a transmission of a signal in a wireless communication system according to various embodiments of the present disclosure;

[0026] FIG. 7 illustrates a process of transmitting signals through a plurality of antennas based on a permutation matrix in a wireless communication system according to various embodiments of the present disclosure;

[0027] FIG. 8A illustrates an example of signal transmission when the permutation matrix is not applied in a wireless communication system according to various embodiments of the present disclosure;

[0028] FIG. 8B illustrates an example of signal transmission when the permutation matrix is applied when the permutation matrix is applied in a wireless communication system according to various embodiments of the present disclosure;

[0029] FIG. 9 illustrates an example of an optimization parameter for space separation in a wireless communication system according to various embodiments of the present disclosure;

[0030] FIG. 10 illustrates an example of an antenna set pattern for space separation in a wireless communication system according to various embodiments of the present disclosure;

[0031] FIG. 11 illustrates an example of polarity separation for antennas having a minimum distance in a wireless communication system according to various embodiments of the present disclosure;

[0032] FIG. 12 illustrates a process of calculating a permutation matrix in a wireless communication system according to various embodiments of the present disclosure;

[0033] FIG. 13 illustrates an example of various transmission modes for a plurality of users in a wireless communication system according to various embodiments of the present disclosure;

[0034] FIG. 14 illustrates an example of a transmitting node operating based on user's channel quality feedback in a wireless communication system according to various embodiments of the present disclosure;

[0035] FIG. 15 illustrates a process of applying a permutation matrix based on user's channel quality feedback in a wireless communication system according to various embodiments of the present disclosure; and

[0036] FIGS. 16 to 29 illustrate performance experiment results in a wireless communication system according to various embodiments of the present disclosure.

DETAILED DESCRIPTION

[0037] FIGS. 1 through 29, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged system or device.

[0038] The terms used in the present disclosure are only used to describe specific embodiments, and are not intended to limit the present disclosure. A singular expression may include a plural expression unless they are definitely different in a context. Unless defined otherwise, all terms used herein, including technical and scientific terms, have the same meaning as those commonly understood by a person skilled in the art to which the present disclosure pertains. Such terms as those defined in a generally used dictionary may be interpreted to have the meanings equal to the contextual meanings in the relevant field of art, and are not to be interpreted to have ideal or excessively formal meanings unless clearly defined in the present disclosure. In some cases, even the term defined in the present disclosure should not be interpreted to exclude embodiments of the present disclosure.

[0039] Hereinafter, in various embodiments of the present disclosure, hardware approaches will be described as an example. However, various embodiments of the present disclosure include a technology that uses both hardware and software and thus, the various embodiments of the present disclosure may not exclude the perspective of software.

[0040] The present disclosure relates to an apparatus and a method for a permutation of a block code in a wireless communication system.

[0041] The terms referring to an encoding scheme (for example, a space frequency block code (SFBC), or frequency switched transmit diversity (FSTD)), the terms referring to control information (for example, a channel quality feedback or a channel quality indicator (CQI)), the terms referring to network entities, the terms referring to messages, and the terms referring to components within an apparatus are for convenience of description. Accordingly, the present disclosure is not limited to the following terms and other terms having the equivalent technical meaning may be applied to the present disclosure.

[0042] In order to handle wireless data traffic that currently rapidly increases, a massive multiple input multiple output (MIMO) technique using a large number of transmission antennas has been discussed in various ways. It has been known that the large number of antennas can improve the performance of a communication system. However, since a channel correlation becomes stronger as a distance between antennas become closer, the large number of antennas may rather result in deteriorating the performance of the communication system.

[0043] In order to overcome realistic constraints, a full dimensional MIMO (FD-MIMO) system has been proposed. In the FD-MIMO system, antenna elements are arranged on a two-dimensional plane, so that a larger number of antennas may be arranged in the same space. Accordingly, in the FD-MIMO system, a performance gain of the system may further increase.

[0044] The conventional FD-MIMO system has been mainly researched in a closed-loop environment. For the proper operation of the closed-loop scheme, an accurate channel estimation is necessary. Since overhead for the channel estimation is proportional to the number of antennas, applying the closed-loop scheme to the FD-MIMO system that supports scores of antennas or more may cause a performance problem due to a channel estimation error and overhead.

[0045] Accordingly, extensively applying the open-loop scheme to the FD-MIMO system is recently discussed. When a SFBC scheme or a space time block code (STBC) scheme is used in the open-loop FD-MIMO system, a transmitting node may acquire improved link performance using simple signal processing alone without channel information. However, when the block code scheme is used, it is most important to find a code matrix having good performance. In the FD-MIMO system having the large number of antennas, a dimension of the code matrix increases, so that it is very difficult to find suitable space-frequency mapping or space-time mapping. For this reason, the block code scheme of the open-loop scheme has been rarely proposed in the FD-MIMO system that considers scores of antennas.

[0046] Accordingly, the present disclosure proposes an open-loop transmission method for the FD-MIMO system. More specifically, the present disclosure provides an apparatus and a method for efficiently transmitting a signal by applying a block code and a permutation matrix in the open-loop FD-MIMO system.

[0047] FIG. 1 illustrates an example of a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 1, a wireless communication system 100 includes a transmitting node 110 and a receiving node 120.

[0048] The transmitting node 110 and the receiving node 120 may correspond to a user device or a network device. The network device may include a base station, a NodeB (NB), an evolved NodeB (eNB), and the like. The user device may include a terminal, a mobile station, a user equipment, and the like. For example, the transmitting node 110 may correspond to a base station and the receiving node 120 may correspond to a terminal. In another example, the transmitting node 110 may correspond to a terminal and the receiving node 120 may correspond to a base station.

[0049] Each of the transmitting node 110 and the receiving node 120 may include a plurality of antennas for data communication. The transmitting node 110 transmits a signal including data to the receiving node 120. For example, the transmitting node 110 may transmit the signal including data to the receiving node 120 in a mmWave band (for example, band of 60 GHz). The transmitting node 110 may use beamforming, massive MIMO, and FD-MIMO techniques to mitigate propagation path loss and increase a radio propagation distance in the mmWave band.

[0050] As described above, the transmitting node 110 may be the base station or the terminal and the receiving node 120 may be the terminal or the base station. Hereinafter, for convenience of description, it is assumed that the base station functions as the transmitting node 110 and the terminal functions as the receiving node 120 in the following various embodiments. That is, the following various embodiments assume a situation of downlink communication. However, the present disclosure does not exclude uplink communication. That is, the following various embodiments may be applied to the uplink communication.

[0051] FIG. 2 illustrates a transmitting node 110 in a wireless communication system according to various embodiments of the present disclosure. The term unit or er used hereinafter may refer to the unit for processing at least one function or operation and may be implemented in hardware, software, or a combination of hardware and software. Referring to FIG. 2, the transmitting node 110 may include an antenna unit 210, a communication interface 220, a storage 230, and a controller 240.

[0052] The antenna unit 210 is an element for radiating a radio frequency (RF) band signal to a radio channel or detecting a signal transmitted through a radio channel. The antenna unit 210 may include a plurality of antennas. For example, the antenna unit 210 may have a structure of a 2D (dimensional) antenna array. At this time, antenna elements included in the antenna unit 210 may have different polarities.

[0053] The communication interface 220 performs functions for transmitting and receiving a signal through a radio channel. For example, the communication interface 220 performs a function of conversion between a baseband signal and a bit stream according to a physical layer standard of the system. For example, when data is transmitted, the communication interface 220 generates complex symbols by encoding and modulating a transmission bit stream. Further, when data is received, the communication interface 220 reconstructs a reception bit stream by demodulating and decoding a baseband signal. In addition, the communication interface 220 up-converts a baseband signal into an RF band signal, transmits the converted signal through an antenna, and then down-converts the RF band signal received through the antenna into the baseband signal. For example, the communication interface 220 may include a transmission filter, a reception filter, an amplifier, a mixer, an oscillator, a digital to analog convertor (DAC), an analog to digital convertor (ADC), and the like.

[0054] The communication interface 220 may include a plurality of RF chains. Further, the communication interface 220 may map modulation symbols to a plurality of antennas through a block code scheme for transmit diversity and transmit the mapped modulation symbols. The block code scheme may include at least one of an SFBC scheme and an STBC scheme. The communication interface 220 may also perform beamforming. For beamforming, the communication interface 220 may control the phase and size of each of the signals transmitted and received through the plurality of antennas or the antenna elements, that is, perform analog beamforming. Alternatively, the communication interface 220 may perform beamforming for a digital signal, that is, perform digital beamforming.

[0055] The communication interface 220 may transmit and receive a signal as described above. Accordingly, the communication interface 220 may be referred to as a transmitter, a receiver, or a transceiver. Further, in the following description, transmission and reception performed through a radio channel are used as meanings including the processing by the communication interface 220 as described above.

[0056] The storage 230 stores a basic program, an application program, and data such as setting information for the operation of the transmitting node 110. The storage 230 may include a volatile memory, a non-volatile memory, or a combination of the volatile memory and the non-volatile memory. Further, the storage 230 provides stored data according to a request of the controller 240. That is, the storage 230 may store a pre-calculated permutation matrix to reduce a channel correlation by permutating a block code, and provide permutation matrix information according to a request of the controller 240.

[0057] The controller 240 controls general operations of the transmitting node 110. For example, the controller 240 transmits and receives a signal through the communication interface 220. Further, the controller 240 records data in the storage 230 and reads the data from the storage 230. To this end, the control unit 240 may include at least one processor. The controller 240 may determine whether to apply a block code scheme according to transmission modes of multiple users. According to another embodiment, when the transmission mode corresponds to a transmit diversity mode, the controller 240 may determine a block code matrix to be applied. The block code matrix may be one of the matrixes according to an SFBS or STBC scheme. Further, in order to reduce a channel correlation between a plurality of antennas for transmit diversity, the controller 240 may calculate a permutation matrix to permutate the block code matrix or select a pre-stored permutation matrix. To this end, the controller 240 may include a block code matrix determination unit 241 for determining a code scheme for signal processing (for example, block code for diversity transmission) and a permutation determination unit 243 for determining a permutation rule corresponding to the code scheme. Accordingly, the controller 240 may control the transmitting node 110 to perform a procedure according to various embodiments described below.

[0058] In the configuration of the transmitting node 110 described with reference to FIG. 2, the antenna unit 210 may be configured in various forms. For example, the antenna unit 210 may be configured as illustrated in FIGS. 3 and 4.

[0059] FIG. 3 illustrates various examples of the FD-MIMO antenna according to various embodiments of the present disclosure. Referring to FIG. 3, the arrangement of a 2D antenna array for FD-MIMO may be one of the arrangements 312 to 320. The arrangement 312 corresponds to 164 antenna array arrangement, and may have a horizontal length of 4 m and a vertical length of 7 to 10 cm. The arrangement 314 corresponds to 88 antenna array arrangement, and may have a horizontal length of 0.5 m and a vertical length of 0.5 m. The arrangement 316 corresponds to 84 antenna array arrangement, and may have a horizontal length of 0.25 m and a vertical length of 0.5 m. The arrangement 318 corresponds to 48 antenna array arrangement, and may have a horizontal length of 0.5 m and a vertical length of 0.25 m. The arrangement 320 corresponds to the 84 antenna array arrangement that is the same as the arrangement 316, but may have a total horizontal length of 1 m with an interval between antenna columns in order to reduce a channel correlation. As illustrated in FIG. 3, a plurality of antennas is arranged in two dimensions for high-speed data transmission in the FD-MIMO system, so that a channel correlation problem between antennas is important to arrange the plurality of antennas in a limited space.

[0060] FIG. 4 illustrates an example of a 2D planar antenna array using cross-polarization antennas in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 4, according to an embodiment, the antenna unit 210 may be a 2D planar antenna array that can accept maximum antennas in a limited space to allow the antennas to have different polarities by perpendicularly crossing two antennas at the same location. In FIG. 4, N.sub.r denotes the number of antennas included in the 2D planar antenna array, and N.sub.H denotes the number of columns of antennas included in the 2D planar antenna array. Further, d.sub.V denotes an interval between vertical antennas, and d.sub.H denotes an interval between horizontal antennas. Referring to FIG. 4, when antennas having two types of different polarities are arranged at the same location, an index of the antenna having a first polarity located at an m.sup.th row and an n.sup.th column may be expressed by (m, n, 1). An index of the antenna having a second polarity located at the m.sup.th row and the n.sup.th column may be expressed by (m, n, 2). In this case, a total number of antennas may be expressed by equation (1):

N.sub.T=2N.sub.VN.sub.HEquation (1)

where N.sub.T denotes a total number of transmission antennas, N.sub.V denotes the number of rows of antennas in the antenna array, and N.sub.H denotes the number of columns of antennas in the antenna array.

[0061] That is, when the polarities of the antennas are classified into two types as illustrated in FIG. 4, two antennas may be arranged at one location. The number of polarities of antennas may be two or more, and a maximum number of antennas included in the antenna array may be the product of the number of columns, the number of rows, and the number of polarities in the antenna array structure. According to another embodiment, antennas having three or more different polarities may be included in the antenna array.

[0062] FIG. 5 illustrates an example of a block code configuration circuitry 500 for performing block coding in a wireless communication system according to various embodiments of the present disclosure. The block code configuration circuitry 500 may be an element of the communication interface 220 of FIG. 2 and may be differently configured according to a block code scheme to be applied. Referring to FIG. 5, according to an embodiment, the block code configuration circuitry 500 applying a FSTD scheme includes SFBC mapping circuitry 510-1 to 510-B and an FSTD mapping circuitry 520 for combining SFBC blocks.

[0063] The FSTD scheme corresponds to a scheme for orthogonally stacking SFBC matrixes such as Alamouti code effectively operating in a small number of antennas on a frequency domain. In FIG. 5, N.sub.S denotes the number of data symbols, N.sub.T denotes the number of transmission antennas, B denotes the number of SFBC blocks, and S.sub.i denotes an i.sup.th data symbol.

[0064] According to an embodiment, the block code configuration circuitry 500 receives N.sub.S data symbols, and blocks the data symbols for each antenna and frequency so as to generate SFBC block codes. That is, N.sub.S symbols are joined together into G data symbols to be transmitted to the same time-frequency resources. Accordingly, B data symbol groups are generated, and the SFBC mapping circuitry 510-1 to 510-B block-code respective symbols of each of the B groups for transmit diversity. As a result, when an 1.sup.th SFBC block is generated from the G data symbols, the 1.sup.th SFBC block may be expressed by S.sub.SFBC({S.sub.i}.sub.i=(l1)G.sup.1G). The FSTD mapping circuitry 520 configures an X.sub.FSTD matrix by orthogonally stacking the SFBC blocks generated by the SFBC mapping circuitry 510-1 to 510-B on the frequency domain. The X.sub.FSTD matrix corresponds to a code block corresponding to a permutation matrix, and each of the B SFBC blocks becomes a sub-block included in the X.sub.FSTD matrix. That is, the FSTD mapping matrix in which the B SFBC blocks are arranged in an FSTD scheme may be expressed by Equation (2):

[00001]$.Math.\mathrm{Equation}.Math..Math.\left(2\right)$$X_{\mathrm{FSTD}}\left({\left\{s_i\right\}}_{i=1}^{N_s}\right)=\mathrm{blkdiag}.Math.\stackrel{\stackrel{B.Math..Math.\mathrm{SFBCs}}{}}{\left\{S_{\mathrm{SFBC}}\left({\left\{s_i\right\}}_{i=1}^G\right),\mathrm{.Math.}.Math.,S_{\mathrm{SFBC}}.Math.\underset{\underset{G.Math..Math.\mathrm{symbols}}{}}{\left({\left\{s_i\right\}}_{i=\left(l-1\right).Math.G+1}^{\mathrm{iG}}\right)},\mathrm{.Math.}.Math.,S_{\mathrm{SFBC}}\left({\left\{s_i\right\}}_{i=\left(B-1\right).Math.G+1}^{N_s}\right)\right\}}$

where X.sub.FSTD({S.sub.i}.sub.i=1.sup.N.sup.S) denotes an FSTD mapping matrix, S.sub.i denotes an i.sup.th data symbol, N.sub.S denotes a total number of data symbols, blk diag{ } denotes a block diagonal matrix, S.sub.SFBC({S.sub.i}.sub.i=(i1)G.sup.1G) denotes an 1.sup.th SFBC block, G denotes the number of symbols applied to one SFBC mapping circuitry (that is, the number of symbols to be coded into one block), and B denotes the number of SFBC blocks generated when data symbols are divided by G and encoded.

[0065] For example, in an FSTD with Alamouti (FSTD-A) scheme using Alamouti code, when G=2 and N.sub.2=4, the number of SFBC blocks becomes B=2. Four data symbols S.sub.1, S.sub.2, S.sub.3, and S.sub.4 are mapped to S.sub.A(S.sub.1,S.sub.2) and S.sub.A(S.sub.3,S.sub.4) through the SFBC mapping circuitry 510-1 and 510-2, and mapped to X.sub.FSTDA({S.sub.i}.sub.i=1.sup.4) as shown in Equation (3) via the FSTD mapping circuitry 520.

[00002]$\begin{array}{cc}{X}_{\mathrm{FSTD}-A}\left({\left\{S_i\right\}}_{i=1}^4\right)=\mathrm{blkdiag}.Math.\left\{S_A\left(S_1,S_2\right),S_A\left(S_3,S_4\right)\right\}=\stackrel{S_A\left(s_1,s_2\right)}{\underset{S_A\left(s_3,s_4\right)}{\left[\begin{array}{cc}\begin{array}{cc}{s}_1& -s_2^{*}\\ s_2& s_1^{*}\end{array}& \begin{array}{cc}0& .Math.0\\ 0& .Math.0.Math.\end{array}\\ \begin{array}{cc}0& .Math.0\\ 0& .Math.0\end{array}& \begin{array}{cc}{s}_3& -s_4^{*}\\ s_4& s_3^{*}\end{array}\end{array}\right]}}& \mathrm{Equation}.Math..Math.\left(3\right)\end{array}$

where X.sub.FSTDA({S.sub.i}.sub.i=1.sup.4) denotes an FSTD matrix in which SFBC blocks are orthogonally arranged, S.sub.i denotes an i.sup.th data symbol, S*.sub.i denotes a conjugate complex symbol of i.sup.th data, blk diag{ } denotes a block diagonal matrix, and S.sub.A(S.sub.1,S.sub.2) and S.sub.A(S.sub.3,S.sub.4) denote SFBC blocks. In Equation (3), a column of the matrix corresponds to each subcarrier (frequency) and a row corresponds to each antenna. S.sub.A blocks are sub-blocks included in X.sub.FSTDA to which a permutation operation described below is applied.

[0066] In another example, in an FSTD with Phase Shift Diversity (FSTD-PSD) scheme, when G=2, N.sub.S=4, and N.sub.T=0, an FSTD-PSD mapping matrix X.sub.FSTD({S.sub.i}.sub.i=1.sup.N.sup.S) may be expressed by Equation (4). Since G=2, symbols to share the same time-frequency resources may be grouped by two such as (S.sub.1,S.sub.2) and (S.sub.3,S.sub.4), but the number N.sub.T of transmission antennas is larger than the number N.sub.S of input symbols, so that the symbols may be block-coded including phase shifted symbols as shown in Equation (4). That is, four data symbols S.sub.1, S.sub.2, S.sub.3, and S.sub.4 are mapped to S.sub.PSD(S.sub.1,S.sub.2) and S.sub.PSD(S.sub.3,S.sub.4) through the SFBC mapping circuitry 510-1 and 510-2, and mapped as shown in Equation (4) via the FSTD mapping circuitry 520:

[00003]$\begin{array}{cc}{X}_{\mathrm{FSTD}-\mathrm{PSD}}\left({\left\{S_i\right\}}_{i=1}^4\right)=\mathrm{blkdiag}.Math.\left\{S_{\mathrm{PSD}}\left(S_1,S_2\right),S_{\mathrm{PSD}}\left(S_3,S_4\right)\right\}=\underset{.Math.S_{\mathrm{PSD}}\left(s_3,s_4\right)}{\stackrel{S_{\mathrm{PSD}}\left(s_1,s_2\right).Math.}{\left[\begin{array}{cc}\begin{array}{c}\begin{array}{cc}{s}_1& -s_2^{*}\\ s_2& s_1^{*}\\ s_1.Math.e^{j.Math..Math.{}_1.Math.k}& -s_2^{*}.Math.e^{j.Math..Math.{}_1.Math.k}\\ s_2.Math.e^{j.Math..Math.{}_2.Math.k}& s_1^{*}.Math.e^{j.Math..Math.{}_2.Math.k}\end{array}\end{array}& \begin{array}{cc}0& .Math.0\\ 0& .Math.0\\ 0& .Math.0\\ 0& .Math.0\end{array}\\ \begin{array}{cc}0.Math.& .Math.0\\ 0.Math.& .Math.0\\ 0.Math.& .Math.0\\ 0.Math.& .Math.0\end{array}& \begin{array}{c}\begin{array}{cc}{s}_3& -s_4^{*}\\ s_4& s_3^{*}\\ s_3.Math.e^{j.Math..Math.{}_3.Math.k}& -s_4^{*}.Math.e^{j.Math..Math.{}_3.Math.k}\\ s_4.Math.e^{j.Math..Math.{}_4.Math.k}& s_3^{*}.Math.3.Math.e^{j.Math..Math.{}_4.Math.k}\end{array}\end{array}\end{array}\right]}}& \mathrm{Equation}.Math..Math.\left(4\right)\end{array}$

where X.sub.FSTDPSD({S.sub.i}.sub.i=1.sup.4) denotes an FSTD-PSD mapping matrix, S.sub.i denotes an i.sup.th data symbol, blk diag{ } denotes a block diagonal matrix, S.sub.PSD(S.sub.1,S.sub.2) and S.sub.PSD(S.sub.3,S.sub.4) denote PSD blocks, and .sub.1, .sub.2, .sub.3, .sub.4 denote phase shift values. In Equation (4), a column of the matrix corresponds to each subcarrier (frequency) and a row corresponds to each antenna. S.sub.PSD blocks are sub-blocks included in X.sub.FSTD-PSD to which a permutation operation described below is applied. As a result, N.sub.S data symbols may be block-coded via the block code configuration circuitry 500 and mapped to N.sub.S transmission antennas.

[0067] The above-described FSTD scheme is very easily implemented and thus is used in many fields such as an LTE system and a cognitive radio standard. However, the present disclosure is not limited to the FSTD scheme, and different block codes may be used according to various embodiments.

[0068] According to various embodiments, in addition to the block coding as illustrated in FIG. 5, a permutation may be performed. In various embodiments, the permutation is performed to reduce a correlation between channels for transferring signals by controlling a mapping relation between block-coded signals and antennas. In this case, signal transmission may be performed as illustrated in FIG. 6.

[0069] FIG. 6 illustrates a transmission of a signal in a wireless communication system according to various embodiments of the present disclosure. According to an embodiment, elements illustrated in FIG. 6 may be some elements of the communication interface 220 of the transmitting node 110.

[0070] Referring to FIG. 6, according to an embodiment, the communication interface 220 includes the block code configuration circuitry 500, a permutation operator 610, and an OFDM transmitter 620. The block code configuration circuitry 500 may include the SFBC mapping circuitry 510-1 to 510-B and the FSTD mapping circuitry 520 for combining the SFBC blocks.

[0071] N.sub.S data symbols are block-coded via the SFBC mapping circuitry 510-1 to 510-B of the block code configuration circuitry 500 and the FSTD mapping circuitry 520 for combining the SFBC matrixes and then input into the permutation operator 610. The permutation operator 610 multiplies an input FSTD matrix X.sub.FSTD({S.sub.i}.sub.i=1.sup.N.sup.S) and a permutation matrix r in order to additionally improve error performance. At this time, N.sub.T rows in X.sub.FSTD({S.sub.i}.sub.i=1.sup.N.sup.S) are mixed by the matrix in consideration of a channel correlation between antennas. Data symbols mixed by the matrix are transmitted by the OFDM transmitter 620 through N.sub.T antennas. For example, when N.sub.S=4 and G=2 in the FSTD-A scheme, the data symbols mixed by the matrix may be expressed by Equation (5):

[00004]$.Math.\mathrm{Equation}.Math..Math.\left(5\right)$$\underset{.Math.2.Math.\text{-}.Math.\mathrm{nd}.Math..Math.\mathrm{SFBC}}{\stackrel{1.Math.\text{-}.Math.\mathrm{st}.Math..Math.\mathrm{SFBC}.Math.}{\left[\begin{array}{cc}\begin{array}{c}\begin{array}{cc}{s}_1& -s_2^{*}\\ s_2& s_1^{*}\end{array}\end{array}& \begin{array}{cc}0.Math.& 0\\ 0.Math.& 0\end{array}\\ \begin{array}{cc}0.Math.& 0\\ 0.Math.& 0\end{array}& \begin{array}{c}\begin{array}{cc}{s}_3& -s_4^{*}\\ s_4& s_3^{*}\end{array}\end{array}\end{array}\right]}}.Math.\stackrel{\mathrm{permute}}{\underset{}{.fwdarw.}}.Math.\stackrel{1.Math.\text{-}.Math.\mathrm{st}.Math..Math.\mathrm{SFBC}.Math.}{\underset{.Math.2.Math.\text{-}.Math.\mathrm{nd}.Math..Math.\mathrm{SFBC}}{\left[\begin{array}{cc}\begin{array}{cc}{s}_1& -s_2^{*}\end{array}& \begin{array}{cc}0.Math.& 0\end{array}\\ \begin{array}{cc}0.Math.& 0\end{array}& \begin{array}{cc}{s}_3& -s_4^{*}\end{array}\\ \begin{array}{cc}{s}_2& -s_1^{*}\end{array}& \begin{array}{cc}0.Math.& 0\end{array}\\ \begin{array}{cc}0.Math.& 0\end{array}& \begin{array}{cc}{s}_4& s_3^{*}\end{array}\end{array}\right]}}$

where S.sub.i denotes an i.sup.th data symbol, an upper left block denotes a first SFBC block and a lower right block denotes a second SFBC block. The first SFBC block and the second SFBC block are sub-blocks within the code block corresponding to the permutation matrix. In Equation (5), a column of the matrix corresponds to each subcarrier (e.g., frequency) and a row corresponds to each antenna. Referring to Equation (5), after the permutation operation, antenna mapping for symbols within the first SFBC block and the second SFBC block may become different.

[0072] A process of calculating and applying the matrix according to various embodiments will be described in detail through FIGS. 8 to 12 below.

[0073] In the above-described embodiments, Alamouti has been used as an example of the SFBC. However, according to various embodiments, the scheme proposed by the present disclosure may be applied to another SFBC operating in 2.sup.n (2, 4, 8, . . . ) antennas. For example, code matrix schemes such as Jafarkhani (H. Jafarkhani, A quasi-orthogonal space-time block code, IEEE TCOM, 2001), Tirkkonen-Hottinen (O. Tirkkonen et. al., Square-matrix embeddable space-time block codes for complex signal constellations, IEEE TIT, 2002), Trikkonen-Boariu-Hottinen (O. Tirkkonen et. al., Minimal nonorthogonality rate 1 space-time block code for 3+Tx antennas, IEEE ISSSTA, 2000), Su-Xia (W. Su et. al., Signal constellations for quasi-orthogonal space-time block codes with full diversity, IEEE TIT, 2004), Tarokh-Jafarkhani-Calderbank 1 (V. Tarokh et. al., Space-time block codes from orthogonal designs, IEEE TIT, 1999), Tarokh-Jafarkhani-Calderbank 2 (V. Tarokh et. al., Space-time block codes from orthogonal designs, IEEE TIT, 1999), Kim (J. Kim et. al., STBC/SFBC for 4 transmit antennas with 1-bit feedback, IEEE ICC, 2008), Murthy-Gowri (N. S. Murthya et. al., Full rate general complex orthogonal space-time block code for 8-transmit antenna, IWIEE, 2012), Erotokritou (I. D. Erotokritou, Space-time block coding for multiple transmit antennas over time-selective fading channels Louisiana State University, May, 2006), Tran-Seberry-Wang-Wysocki (L. C. Tran et. al., Two new complex orthogonal space time codes for 8 transmit antennas, University of Wollongong, 2004) as well as Alamouti may be applied.

[0074] Further, in the above-described embodiments, the FSTD of the scheme for orthogonally arranging the SFBC blocks on the frequency domain has been described. However, according to another embodiment, a scheme such as time switched transmit diversity (TSTD) for the STBC may be applied. According to various embodiments, an independent block code that is not based on the SFBC or the STBC may be used. In other words, the permutation according to various embodiments may be applied to an independently defined block code, not the code defined by a combination of different block codes such as the FSTD and the TSTD. However, similar to the FSTD, it is preferable that the block code to which the permutation according to various embodiments can be applied has a characteristic in which at least one antenna is not used in the same time-frequency resources.

[0075] FIG. 7 illustrates a process of transmitting signals through a plurality of antennas based on a permutation matrix in a wireless communication system according to various embodiments of the present disclosure. A transmitting node described in FIG. 7 may be the transmitting node 110 illustrated in FIG. 2.

[0076] Referring to FIG. 7, in step 701, the transmitting node determines a permutation matrix according to a block code scheme. According to an embodiment, the block code scheme may be determined according to a transmission mode for a user. Data symbols are coded to be mapped to a plurality of antennas by the block code scheme, and at this time, at least one of the plurality of antennas is not mapped to the symbol in one time-frequency resource. In other words, the block code scheme may have a characteristic in which some antennas are not used in the same time-frequency resources. For example, the block code scheme may belong to one range of the SFBC and the STBC. Specifically, the block code scheme may be an FSTD scheme or a TSTD scheme in which SFBC blocks or STBC blocks are orthogonally arranged. Particularly, the FSTD scheme may be one of FSTD-A, FSTD-PSD, and FSTD with extended PSD (FSTD-E-PSD). Specifically, the transmitting node may select a permutation matrix according to the number of sub-blocks within a code block corresponding to one permutation matrix and an arrangement structure (for example, the number of rows and the number of columns) of antennas as described below. For example, the transmitting node may search for at least one permutation matrix corresponding to the number of sub-blocks and the arrangement structure of antennas in a codebook including a plurality of predefined permutation matrixes.

[0077] In step 703, the transmitting node generates symbols corresponding to a plurality of antennas based on the block code scheme and the permutation matrix. In other words, the transmitting node block-codes data symbols according to the block code scheme and mix the block-coded symbols according to the permutation matrix. According to an embodiment, the transmitting node may map the data symbols to the plurality of antennas by multiplying the block code matrix and the permutation matrix. For example, the transmitting node may generate symbols corresponding to the plurality of antennas by multiplying the F STD matrix described in FIG. 6 and the permutation matrix.

[0078] In step 705, the transmitting node transmits the generated symbols based on the block code scheme and the permutation matrix. In other words, through the antennas, the transmitting node may transmit the symbols mixed through the permutation matrix. At this time, additional signal processing may be performed according to a physical layer transmission scheme. For example, the transmitting node may map the symbols mixed through the permutation matrix to time-frequency resources, perform OFDM modulation, and then transmit OFDM symbols. According to another embodiment, the OFDM scheme may be replaced with an FBMC scheme.

[0079] As described above, according to various embodiments, the permutation for the block code may be performed. That is, the permutation may be performed to reduce the channel correlation between antennas within a sub-block including symbols of one group that share the same time-frequency resources in an open-loop environment in which there is no feedback of channel information. Causes of the channel correlation in the FD-MIMO system are two types largely including a space channel correlation and a polarity channel correlation. The space channel correlation corresponds to a phenomenon occurring between antenna elements arranged close to each other, and may be reduced as a distance between the antenna elements increases. Further, the polarity channel correlation may be reduced as antennas having different polarities are used. Accordingly, the process of calculating the permutation matrix proposed by the present disclosure may include a space separation step and a polarity separation step between antennas within a sub-block including one group of symbols that share the same time-frequency resources. The space separation step corresponds to a step of finding a combination of antennas of which a minimum distance is maximum within the sub-block in order to reduce the channel correlation between antennas. The polarity separation step corresponds to a step of configuring antennas having a minimum distance to have opposite polarities in the combination of antennas acquired through the space separate step. The permutation matrix according to various embodiments based on the space separate and the polarity separation may be determined as follows.

[0080] FIGS. 8A and 8B illustrate cases where the permutation matrix is not applied and is applied for comparison according to various embodiments of the present disclosure. Hereinafter, FIGS. 8A and 8B illustrate a block code scheme based on an SFBC. However, according to various embodiments, the permutation may be performed when a different block code scheme is used.

[0081] FIG. 8A illustrates an example of signal transmission when the permutation matrix is not applied in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 8A, according to an embodiment, the transmitting node transmits SFBC-coded symbols. According to an embodiment, when the number B of SFBC blocks is 2, a first SFBC block 810 and a second SFBC block 820 are transmitted through four antennas. Specifically, the first SFBC block 810 is transmitted through a first time-frequency resource and the second SFBC block 820 is transmitted through a second time-frequency resource. At this time, when the permutation is not performed, a minimum distance between first and second antennas used for transmitting the first SFBC block 810 is d and a minimum distance between third and fourth antennas used for transmitting the second SFBC block 820 is also d.

[0082] FIG. 8B illustrates an example of signal transmission when the permutation matrix is applied when the permutation matrix is applied in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 8B, the first SFBC block 810 and the second SFBC block 820 are mixed through the permutation. That is, unlike FIG. 8A, the first SFBC block 810 is transmitted through first and third antennas and the second SFBC block 820 is transmitted through second and fourth antennas. Accordingly, when the signals mixed according to the permutation matrix are transmitted through four antennas, a minimum distance between antennas used for transmitting the first SFBC block 810 and the second SFBC block 820 increases to be 2d.

[0083] As illustrated in FIGS. 8A and 8B, when the permutation matrix proposed in the present disclosure is used, there may be an effect of reducing a spatial channel correlation between antennas as the minimum distance between antennas used for the same time-frequency resources increases.

[0084] As described above, a spatial channel correlation problem may be solved by maximizing a minimum distance between antenna elements within a block using the same time-frequency resources. According to an embodiment, in a 2D antenna array using cross-polarization antennas, a set for maximizing a minimum distance between antenna elements may be expressed by Equation (6):

[00005]$\begin{array}{cc}\underset{\left\{A_l\right\}}{\mathrm{maximize}}.Math..Math.\underset{l}{.Math.\min }.Math..Math.d_{\min ,i}.Math..Math.s.t..Math..Math.A_l.Math.=N_T/B,l=1,\mathrm{.Math.}.Math.,B/2.Math..Math.A_i.Math.A_k=,lk,& \mathrm{Equation}.Math..Math.\left(6\right)\end{array}$

where A.sub.l denotes a set of locations (m, n) of antenna elements for transmitting 1.sup.th and l+B/2.sup.th SFBC blocks, an objective function d.sub.min,1 denotes a minimum distance between locations of two antennas belonging to the set A.sub.l, N.sub.T denotes a total number of antennas, and B denotes the number of SFBC blocks. Since the cross-polarization antennas are used, one antenna element location set A.sub.l is determined for two SFBC blocks. However, the location set A.sub.l may be a combination of a different pair other than a pair of 1.sup.th and l+B/2.sup.th SFBC blocks. When antennas having three or more types of polarities are installed at one antenna location, SFBC blocks sharing one location set A.sub.l may increase to be the number of polarities.

[0085] FIG. 9 illustrates an example of an optimization parameter for space separation in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 9, A.sub.l includes a set A.sub.l of antenna locations for transmitting a first block code and a set A.sub.2 of antenna locations for transmitting a second block code. At this time, minimum distances d.sub.min,1 and d.sub.min,2 between antennas in respective sets are parameters to be optimized, which are objective functions. The objective function d.sub.min,1 may be defined as Equation (7):

[00006]$\begin{array}{cc}{d}_{\min ,l}=\underset{\underset{\left(i,j\right)\left(m,n\right)}{\left(i,j\right),\left(m,n\right)A_l}}{\min }.Math.\sqrt{{\left(m-i\right)}^2.Math.d_V^2+{\left(n-j\right)}^2.Math.d_H^2}.& \mathrm{Equation}.Math..Math.\left(7\right)\end{array}$

where d.sub.min,1 denotes an objective function, d.sub.V denotes a horizontal distance between antennas, and d.sub.w denotes a vertical distance between antennas.

[0086] Equation (6) aims at maximizing a minimum value of the objective function d.sub.min,1 in order to minimize the spatial channel correlation. For example, referring to FIG. 9, a minimum distance between antenna locations of A.sub.l is d.sub.min,1 corresponding to a diagonal distance between a location of (2, 3) and a location of (3, 2). A minimum distance between antenna locations of A.sub.2 is d.sub.min,2 corresponding to a horizontal distance between two antenna locations as illustrated in FIG. 9. In this case, when d.sub.min,1 is smaller than d.sub.min,2, Equation (6) aims at finding the value that makes the minimum value d.sub.min,1 of d.sub.min,2 maximum. In order to find the final value, an exhaustive search scheme for calculating objective functions for all available candidates A.sub.l may be applied, so that a search size of Equation (6) is

[00007]$\underset{n=1}{\overset{B/2}{.Math.}}.Math.\left(\begin{array}{c}\frac{{\mathrm{nN}}_T}{B}\\ \frac{N_T}{B}\end{array}\right).$

[0087] Accordingly, antenna sets that make the minimum distance between antennas maximum may be determined by inspecting a search space having the search size of

[00008]$\underset{n=1}{\overset{B/2}{.Math.}}.Math.\left(\begin{array}{c}\frac{{\mathrm{nN}}_T}{B}\\ \frac{N_T}{B}\end{array}\right)$

according to an embodiment. Additionally, the present disclosure provides another embodiment below to reduce the search size.

[0088] By re-configuring Equation (6) with a new parameter D, an optimization condition is expressed as Equation (8) given by:

[00009]$\begin{array}{cc}\underset{\left\{A_l\right\},D}{\mathrm{maximize}.Math.}.Math.D.Math..Math.s.t..Math.d_{\min ,l}=D,l=1,\mathrm{.Math.}.Math.,B/2.Math..Math..Math.A_l.Math.=N_T/B,l=1,\mathrm{.Math.}.Math.,B/2,.Math.A_l.Math.A_k=,lk& \mathrm{Equation}.Math..Math.\left(8\right)\end{array}$

where N.sub.T denotes a total number of antennas, B denotes the number of SFBC blocks, A.sub.l denotes a set of locations (m, n) of antenna elements for transmitting 1.sup.th and l+B/2.sup.th SFBC blocks, and D denotes a minimum distance between antennas in all sets of A.sub.l. To resolve Equation (8), a maximum value of D that satisfies the condition of the problem may be found through two steps of determining the set A.sub.l that satisfies d.sub.min,1=D and optimizing D based on the set A.sub.l. Accordingly, based on Equation (8), the antenna sets that make the minimum distance between antennas maximum may be determined by inspecting the search space having the search size smaller than that of Equation (6) according to an embodiment. Additionally, the present disclosure provides another embodiment below to reduce the search size.

[0089] FIG. 10 illustrates an antenna set pattern for space separation in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 10, the present disclosure proposes one predefined pattern that may simplify a search parameter as a heuristic scheme for determining a set that makes a minimum distance between antennas maximum. According to an embodiment, a zigzag pattern that may reduce a search size while maximizing a minimum distance between antennas is proposed. That is, the zigzag pattern refers to a pattern determined by searching for an antenna location through a method of, when a next antenna location is searched for from a start position, finding an antenna location in a diagonal direction in which antennas are not located at the same row or column. A column index difference and a row index difference between an antenna location and the next antenna location found in the diagonal direction may be the same as or different from each other. When a plurality of antenna rows and a plurality of antenna columns exist, the zigzag pattern may have a grid structure that is repeated every predetermined number of rows or columns. According to another embodiment, the method of determining a set of antennas may include other methods as well as the zigzag pattern.

[0090] In order to simplify the problem, the present disclosure introduces new parameters .sub.V and .sub.H in a first step for finding a set A.sub.l that satisfies d.sub.min,1=D. .sub.V refers to a vertical distance between two antennas, and .sub.H refers to a horizontal distance between two antennas. The vertical distance or the horizontal distance may be expressed by the number of antennas located between two antennas. Through a heuristic scheme based on newly introduced parameters, the set A.sub.l of locations (m, n) of antenna elements that transmit 1.sup.th and l=B/2.sup.th SFBC blocks may be configured as Equation (9) given by:

[00010]$.Math.\mathrm{Equation}.Math..Math.\left(9\right)$$A_l=\{\begin{array}{cc}\left\{\begin{array}{c}\left(\left(m-1\right).Math.{}_V+i_l,\left(2.Math.n-1-\mathrm{mod}\left(m,2\right)\right).Math.{}_H+j_i\right)\\ .Math.1m\frac{N_V}{{}_V}.Math..Math.\mathrm{and}.Math..Math.1n\frac{N_H}{2.Math..Math.{}_H}\end{array}\right\},& \mathrm{for}.Math..Math.l=1,\mathrm{.Math.}.Math.,\frac{B}{4}\\ \left\{\begin{array}{c}\left(\left(m-1\right).Math.{}_V+i_{l-\frac{B}{4}},\left(2.Math.n-1-\mathrm{mod}\left(m+1,2\right)\right).Math.{}_H+j_{l-\frac{B}{4}}\right)\\ .Math.1m\frac{N_V}{{}_V}.Math..Math.\mathrm{and}.Math..Math.1n\frac{N_H}{2.Math..Math.{}_H}\end{array}\right\},& \mathrm{for}.Math..Math.l=\frac{B}{4}+1,\mathrm{.Math.}.Math.,\frac{B}{2}\end{array}$

where A.sub.l denotes a location set, .sub.V denotes a vertical distance between two antennas, .sub.H denotes a horizontal distance between two antennas, B denotes the number of sub-blocks, t.sub.1[l/H] is defined, and l.sub.1mod (l1,.sub.H)+1 is defined.

[0091] At this time, the minimum distance D is expressed as Equation (10). According to a repeated pattern, the minimum distance D may be determined as a minimum value among {square root over (.sub.V.sup.2d.sub.V.sup.2+.sub.H.sup.2d.sub.H.sup.2)} based on a diagonal distance between antennas, 2.sub.Vd.sub.V based on a vertical distance between antennas, and 2.sub.Hd.sub.H based on a horizontal distance between antennas. That is, the search size of the objective function D may be reduced by using a repeated grid structure pattern:

D=min{{square root over (.sub.V.sup.2d.sub.V.sup.2+.sub.H.sup.2d.sub.H.sup.2)},2.sub.Vd.sub.V,2.sub.Hd.sub.H}Equation (10)

where D denotes an objective function, d.sub.V denotes a horizontal distance between antennas, d.sub.H denotes a vertical distance between antennas, .sub.V denotes a vertical distance between two antenna locations, and .sub.H denotes a horizontal distance between two antenna locations.

[0092] Equation (11) may be induced from Equation (9) and Equation (10). Equation (11) is expressed by variation from Equation (8) given by:

[00011]$\begin{array}{cc}\underset{{}_V,{}_H}{\mathrm{maximize}.Math.}.Math.D=\min .Math.\left\{\sqrt{{}_V^2.Math.d_V^2+{}_H^2.Math.d_H^2},2.Math..Math.{}_V.Math.d_V,2.Math..Math.{}_H.Math.d_H\right\}.Math..Math.s.t..Math.1{}_V{N}_V-1,1{}_H{N}_H-1,{}_V,{}_H.Math..Math..Math.{}_V.Math.{}_H=B/4,{}_V.Math..Math.N_V,{}_H.Math..Math.N_H,& \mathrm{Equation}.Math..Math.\left(11\right)\end{array}$

where d.sub.V denotes a horizontal distance between antennas, d.sub.H denotes a vertical distance between antennas, N.sub.V denotes the number of antenna columns, N.sub.H denotes the number of antenna rows, .sub.V denotes a vertical distance between two antenna locations, di denotes a horizontal distance between two antenna locations, and B denotes the number of SFBC blocks. x|y means that x is a factor of y.

[0093] By solving the Equation (11) instead of Equation (8), .sub.V and .sub.H that maximize D may be acquired. According to the acquired .sub.V and .sub.H, the set A.sub.l that satisfies the minimum distance d.sub.min,1=D may be configured. In other words, after .sub.V and .sub.H that maximize the minimum distance between antennas based on Equation (11) may be acquired, and then, the set A.sub.l of Equation (9) satisfied with the condition may be configured. By using the repeated grid structure pattern, Equation (11) may innovatively reduce the search size of the objective function D compared to Equation (6) or Equation (8). For example, when a space separation scheme is applied to a linear antenna structure corresponding to an unusual situation, an optimal set A.sub.l may be easily calculated since it is enough to consider only one of a horizontal direction and a vertical direction. In a linear antenna structure of horizontal arrangement in which N.sub.H=1, .sub.V and A may be acquired as Equation (12). Further, in a linear antenna structure of vertical arrangement in which N.sub.V=1, .sub.H and A.sub.l may be acquired as Equation (13). In each case, since V, H, the horizontal distance d.sub.V between antennas, and the vertical distance d.sub.H between antennas are all known, optimal D may be easily calculated and A.sub.l which is satisfied with the optimal D may be easily acquired. That is, a set of antenna locations that maximize the minimum distance between antennas may be relatively simply acquired through Equation (11) which is the proposed space separation scheme:

[00012]$\begin{array}{cc}{}_V=\frac{B}{2},A_l=\left\{\left(\left(m-1\right).Math.{}_V+l,1\right)1m\frac{N_V}{{}_V}\right\},.Math.\mathrm{for}.Math..Math.l=1,\mathrm{.Math.}.Math.,\frac{B}{2}.& \mathrm{Equation}.Math..Math.\left(12\right)\\ {}_H=\frac{B}{2},A_l=\left\{\left(1,\left(n-1\right).Math.{}_H+l\right)1n\frac{N_H}{{}_H}\right\},.Math.\mathrm{for}.Math..Math.l=1,\mathrm{.Math.}.Math.,\frac{B}{2}.& \mathrm{Equation}.Math..Math.\left(13\right)\end{array}$

where .sub.V denotes a vertical distance between two antenna locations, H denotes a horizontal distance between two antenna locations, B denotes the number of SFBC blocks, and A.sub.l denotes a location set.

[0094] As described above, when the set of antenna locations for transmitting SFBC blocks is acquired, a polarity separation scheme for mapping each SFBC block to each antenna is applied in consideration of polarity between antennas as illustrated in FIG. 11. According to an embodiment, FIG. 11 assumes cross-polarization antenna arrangement in which two antennas having different polarities are arranged at one location. In another embodiment, the number of polarities of antennas may be three or more, and in this case, three or more antennas may be arranged at the same location.

[0095] FIG. 11 illustrates an example of separation of polarities of antennas having a minimum distance in a wireless communication system according to various embodiments of the present disclosure. In order to avoid a channel correlation effect between antenna elements having the same polarity, antenna elements having a minimum distance are arranged to have different polarities through the polarity separation scheme. For example, when a set A.sub.u is determined in a space separation step, a set B.sub.u of antenna elements that transmit a u.sup.th SFBC block is acquired as Equation (14). That is, as shown in Equation (14), in the set A.sub.u in which the minimum distance between antennas is maximum, antennas having two different polarities may be arranged at the same location:

[00013]$.Math.\mathrm{Equation}.Math..Math.\left(14\right)$$B_u=(\begin{array}{cc}\left\{\left(m,n,p_{m,n}\right)\left(m,n\right)A_u\right\},& \mathrm{for}.Math..Math.u=1,\mathrm{.Math.}.Math.,B/2\\ \left\{\left(m,n,3-p_{m,n}\right)\left(m,n\right)A_{u-B/2}\right\},& \mathrm{for}.Math..Math.u=B/2+1,\mathrm{.Math.}.Math.,B\end{array}$

where B.sub.u denotes a set of antenna elements that transmit a u.sup.th SFBC block, B denotes the number of SFBC blocks, and P.sub.m,n denotes a polarity of an antenna installed at a location (m, n).

[0096] P.sub.m,n may be defined as Equation (15):

[00014]$\begin{array}{cc}{P}_{m,n}=\{\begin{array}{cc}\mathrm{mod}\left(m,2\right)+1,& \mathrm{if}.Math..Math.D=\sqrt{.Math.\text{?}.Math..Math.d.Math.\text{?}+.Math.\text{?}.Math.d.Math.\text{?}}\\ \mathrm{mod}\left(.Math.m/2.Math.,2\right)+1,& \mathrm{if}.Math..Math.D=2.Math..Math.{}_V.Math.d_V\\ \mathrm{mod}\left(.Math.n/2.Math.,2\right)+1,& \mathrm{if}.Math..Math.D=2.Math..Math.{}_H.Math.d_H\end{array}& \mathrm{Equation}.Math..Math.\left(15\right)\\ \text{?}.Math.\text{indicates text missing or illegible when filed}& \end{array}$

where P.sub.m,n denotes a polarity of an antenna installed at a location (m, n), d.sub.V denotes a horizontal distance between antennas, and d.sub.H denotes a vertical distance between antennas. .sub.V denotes a vertical distance between two antenna locations, and .sub.H denotes a horizontal distance between two antenna locations.

[0097] For example, referring to FIG. 11, when a maximum value of a minimum distance between antennas is D=.sub.V.sup.2d.sub.V.sup.2+.sub.H.sup.2d.sub.H.sup.2, B.sub.u is determined to make antennas having the minimum distance at diagonal locations have different polarities. According to another embodiment, the SFBC matrix may be replaced with an STBC matrix.

[0098] FIG. 12 illustrates a process of calculating a permutation matrix in a wireless communication system according to various embodiments of the present disclosure. A transmitting node described in FIG. 12 may be the transmitting node 110 illustrated in FIG. 2. The operation in FIG. 12 may be performed by the transmitting node or performed by a separate subject. Hereinafter, for convenience of description, the subject for performing the procedure of FIG. 12 is referred to as a determiner.

[0099] Referring to FIG. 12, in step 1201, the determiner optimizes .sub.V and .sub.H. In other words, as one of the space separation processes, optimal .sub.V and .sub.H that make a minimum distance between antennas maximum are calculated by a vertical distance .sub.V and a horizontal distance .sub.H between two antenna locations. For example, the determiner determines .sub.V and .sub.H that maximize D as shown in Equation (11).

[0100] In step 1203, the determiner configures a location set A.sub.l that satisfies a minimum distance d.sub.min,1=D according to .sub.V and .sub.H, acquired in step 1201. In other words, after determining .sub.V and .sub.H that maximize the minimum distance between antennas, the determiner may configure the location set A.sub.l as shown in Equation (9) that satisfies the condition.

[0101] In step 1205, according to an embodiment, the determiner identifies a set B.sub.u of antenna elements to transmit a u.sup.th SFBC block. In other words, in order to avoid a channel correlation effect between antenna elements having the same polarity, the determiner arranges antenna elements having the minimum distance to have different polarities according to a polarity separation scheme. That is, the determiner may arrange cross-polarization antennas having the minimum distance to have different polarities in the location set that maximizes the minimum distance between antennas acquired in step 1203. When the set A.sub.u is determined in the previous step, the set B.sub.u of antenna elements that transmit the u.sup.th SFBC block may be acquired as Equation (14).

[0102] In step 1207, the determiner configures a permutation matrix f based on the acquired antenna pattern. According to an embodiment, based on the set B.sub.u of the antenna elements that transmit the u.sup.th SFBC block determined through the above-described steps, the determiner may configure the permutation matrix for mixing rows of the SFBC block. According to another embodiment, the SFBC block may be replaced with an STBC block. Specifically, the permutation matrix may be a matrix in which each element that indicates the antenna, to which signals transmitted through each antenna are transmitted before the permutation, has a value of 1 or 0.

[0103] In step 1209, the determiner stores the configured permutation matrix . In other words, the determiner stores the permutation matrix acquired by the above-described steps. Accordingly, the transmitting node (for example, the determiner or the transmitting node 110) may select the corresponding permutation matrix according to the number of sub-blocks (for example, SFBC blocks) and an antenna arrangement structure (for example, the number of rows and the number of columns). According to another embodiment, the permutation matrix may be calculated according to the necessity at a time point when data is transmitted. According to another embodiment, the permutation matrix may be calculated in advance and stored in the storage (for example, the storage 230), and one of the stored matrixes may be selectively applied when the application of the permutation matrix is required.

[0104] FIG. 13 illustrates an example of various transmission modes for a plurality of users in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 13, in a general multi-user environment, the transmitting node may allocate different transmission modes to respective users. For example, user A 1310 and user D 1340 may receive services in a transmit diversity mode. However, user B 1320 and user C 1330 may receive services through a multi-user MIMO mode and a beamforming mode based on a closed-loop, respectively. As illustrated in FIG. 13, the transmitting node may perform transmission by applying the permutation matrix only to user A 1310 and user D 1340 who receive services in the transmit diversity mode, and may provide transmission modes suitable for situations to users in the transmission mode based on the closed-loop such as user B 1320 and user C 1330 without additional operation. According to an embodiment, the transmission mode of each user may be determined by channel quality feedback information received from each user. In the multi-user environment of the wireless communication system, embodiments of the operation of the transmitting node according to channel quality feedback of each user will be described below.

[0105] FIG. 14 illustrates the transmitting node 110 that operates based on channel quality feedback of the user in a wireless communication system according to various embodiments of the present disclosure. Referring to FIG. 14, the transmitting node 110 includes the block code configuration circuitry 500, the permutation operator 610, the OFDM transmitter 620, a transmission mode determiner 1410, and a permutation matrix determiner 1420.

[0106] The transmission mode determiner 1410 may select a transmission mode based on channel quality feedback information received from the user terminal (for example, the receiving node 120). The channel quality feedback information may be a channel quality indicator (CQI). The channel quality may include at least one of a signal to interference and noise ratio (SINR), a signal to noise ratio (SNR), and a carrier to interference and noise ratio (CINR).

[0107] When the transmission mode determiner 1410 selects the transmit diversity mode for user j based on channel quality feedback information, the block code configuration circuitry 500 block-codes transmission signals for user j. For example, in an FSTD-A scheme, the block code configuration circuitry 500 may generate a matrix X.sub.FSTD.sup.(j) in which SFBC blocks corresponding to N.sub.S.sup.(j) data symbols for user j are orthogonally arranged on a frequency domain.

[0108] The permutation matrix determiner 1420 may determine the permutation matrix according to the block code scheme used by the block code configuration circuitry 500. The permutation matrix may be selected from the pre-calculated and stored values or may be calculated and determined from parameters whenever necessary. The permutation matrix corresponds to a matrix for mapping symbols to antennas in consideration of antenna locations and polarities in order to reduce the channel correlation between antennas that transmit symbols sharing the same time-frequency resources. For example, in the block code through the FSTD-A scheme, the permutation matrix determiner 1420 determines a permutation matrix .sup.(j) in consideration of the number of blocks and an antenna arrangement structure.

[0109] The permutation operator 610 applies the determined permutation matrix to codes coded by the block code configuration circuitry 500. That is, the permutation operator 610 multiplies the selected permutation matrix .sup.(j) and the matrix X.sub.FSTD.sup.(j) and maps the products to antennas for transmitting symbols.

[0110] The OFDM transmitter 620 generates OFDM symbols by OFDM-modulating the symbols generated based on the block code and the permutation operation and transmits the OFDM symbols through a plurality of antennas.

[0111] When the transmission mode determiner 1410 selects different transmission modes for users based on channel quality feedback information (for example, beamforming mode based on closed-loop), the transmitting node 110 may perform the corresponding operation and then transmit a signal through the OFDM transmitter 620.

[0112] FIG. 15 illustrates a process of applying the permutation matrix based on user's channel quality feedback in a wireless communication system according to various embodiments of the present disclosure.

[0113] Referring to FIG. 15, in step 1501, user terminals transmit CQI information to the transmitting node according to an embodiment. That is, the transmitting node may receive the CQI information from the receiving node to receive the signal. According to an embodiment, the transmitting node may be a base station. According to another embodiment, channel quality information as well as the CQI information may be transmitted.

[0114] In step 1503, the transmitting node selects a transmission mode based on CQI information of each terminal. In other words, the transmitting node may determine the transmission mode according to the channel quality information received from each terminal. According to an embodiment, the transmission mode may be one of the transmission modes of a downlink channel defined in the 3.sup.rd Generation Partnership Project (3GPP) standard.

[0115] In step 1505, it is determined whether the transmission mode selected by the transmitting node is a transmit diversity mode. For example, the transmitting node determines the transmission mode based on the received channel quality information and determines whether the determined transmission mode is the transmit diversity mode. When the transmitting node selects the transmit diversity mode, the transmitting node proceeds to step 1507. When the transmitting node selects a mode other than the transmit diversity mode, the transmitting node proceeds to step 1513.

[0116] In step 1507, the transmitting node selects an SFBC scheme based on CQI information. According to various embodiments of the present disclosure, code matrix schemes such as Jafarkhani (H. Jafarkhani, A quasi-orthogonal space-time block code, IEEE TCOM, 2001), Tirkkonen-Hottinen (O. Tirkkonen et. al., Square-matrix embeddable space-time block codes for complex signal constellations, IEEE TIT, 2002), Trikkonen-Boariu-Hottinen (O. Tirkkonen et. al., Minimal nonorthogonality rate 1 space-time block code for 3+Tx antennas, IEEE ISSSTA, 2000), Su-Xia (W. Su et. al., Signal constellations for quasi-orthogonal space-time block codes with full diversity, IEEE TIT, 2004), Tarokh-Jafarkhani-Calderbank 1 (V. Tarokh et. al., Space-time block codes from orthogonal designs, IEEE TIT, 1999), Tarokh-Jafarkhani-Calderbank 2 (V. Tarokh et. al., Space-time block codes from orthogonal designs, IEEE TIT, 1999), Kim (J. Kim et. al., STBC/SFBC for 4 transmit antennas with 1-bit feedback, IEEE ICC, 2008), Murthy-Gowri (N. S. Murthya et. al., Full rate general complex orthogonal space-time block code for 8-transmit antenna, IWIEE, 2012), Erotokritou (I. D. Erotokritou, Space-time block coding for multiple transmit antennas over time-selective fading channels Louisiana State University, May, 2006), Tran-Seberry-Wang-Wysocki (L. C. Tran et. al., Two new complex orthogonal space time codes for 8 transmit antennas, University of Wollongong, 2004) as well as Alamouti may be applied.

[0117] In step 1509, the transmitting node selects a permutation matrix f from the storage. According to an embodiment, the transmitting node may select the permutation matrix f based on a selected SFBC scheme-related parameter (for example, the number of SFBC blocks) and an antenna arrangement structure (for example, the number of rows and the number of columns). The permutation matrix may be calculated in advance and stored in the storage, or the transmitting node may calculate and select a permutation matrix suitable for the SFBC scheme whenever necessary.

[0118] In step 1511, the transmitting node configures a new mapping matrix by multiplying the block code matrix and the permutation matrix. According to an embodiment, the transmitting node may configure the matrix by multiplying an FSTD mapping matrix X.sub.FSTD and the permutation matrix .

[0119] In step 1513, the transmitting node supports a different transmission mode. In other words, when the transmission mode of the transmitting node is selected as a mode other than the transmit diversity mode, the transmitting node operates to support a different transmission mode.

[0120] FIGS. 16 to 29 illustrate performance experiment results in a wireless communication system according to various embodiments of the present disclosure. That is, for the permutation operation according to the present disclosure, results of the performance experiment under an experiment environment of [Table 1] are as shown in FIGS. 16 to 29. In order to verify the performance of the permutation operation proposed by the present disclosure, the performance experiments of FIGS. 17 to 29 are conducted under three antenna arrangement conditions (81, 88, and 18) of the transmitting node. To show the criterion of the performance, FIGS. 17 to 29 also illustrate a block error rate (BLER) of the Alamouti scheme in 21 of the transmission antenna arrangement. FSTD-A, FSTD-PSD, and FSTD-E-PSD schemes are assumed to verify the performance. In FIGS. 16 to 29, horizontal axes of graphs indicate a value of Eb/No corresponding to an Energy per bit to noise density ratio and is expressed by the unit of dB. Vertical axes of graphs indicate a value of BLER corresponding to an block error ratio and is expressed by a probability value equal to or smaller than 1. Since the performance is better as the block error ratio is lower for the same Eb/No value, a lower side on the graph means that the performance of the transmitting node is improved.

TABLE-US-00001 TABLE 1 System parameter Value Tx configuration Multi-antenna, XPOL 45, omni-beam Rx configuration Single-antenna, COPOL, omni-beam Scenario UMi3D, NLOS Carrier frequency 2 Ghz Velocity 3 km/h FFT size 1024 Modulation 4-QAM Channel coding [00015]$\mathrm{Turbo}.Math..Math.\mathrm{code}.Math..Math.\mathrm{with}.Math..Math.\mathrm{code}.Math..Math.\mathrm{rate}.Math..Math.R_C=\frac{1}{2},\frac{3}{4}$

[0121] FIG. 16 illustrates the performance of an optimal permutation method and a proposed permutation method in 22 and 14 of transmission antenna arrangements. FIG. 16 includes a performance graph 1600 using the FSTD-A scheme and a performance graph 1650 using the FSTD-PSD scheme. Referring to FIG. 16, it is noted that there is little difference between the proposed performance scheme graph and the optimal permutation scheme graph. At this time, the optimal permutation scheme has a search size of N.sub.T!=8!=40320 in a condition of cross-polarization antennas arranged in 22. In contrast, the proposed permutation scheme finds the solution of Equation (11), in which only one feasible solution exists. As illustrated in FIG. 16, the proposed permutation scheme may acquire a very large gain in complexity of calculations with little performance difference from the optimal permutation scheme.

[0122] FIG. 17 illustrates a performance experiment result using the FSTD-A scheme in an environment where the transmission antenna arrangement is 81 and a vertical distance d.sub.V between antennas is 0.5. FIG. 17 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 17, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. Further, according to an embodiment, a performance gain of the proposed permutation scheme is about 2 dB.

[0123] FIG. 18 illustrates a performance experiment result using the FSTD-A scheme in an environment where the transmission antenna arrangement is 81 and a vertical distance d.sub.V between antennas is 0.8. FIG. 18 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 18, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB.

[0124] FIG. 19 illustrates a performance experiment result using the FSTD-A scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.5, 0.5). FIG. 19 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 19, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 0.5 dB.

[0125] FIG. 20 illustrates a performance experiment result using the FSTD-A scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.8, 0.5). FIG. 20 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 20, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 0.5 dB.

[0126] FIG. 21 illustrates a performance experiment result using the FSTD-A scheme in an environment where the transmission antenna arrangement is 18 and a horizontal distance d.sub.H between antennas is 0.5. FIG. 21 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 21, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 0.5 dB.

[0127] Referring to FIGS. 17 to 21, the proposed permutation scheme may have better performance when the channel correlation is high, that is, when the distance between the antennas is narrower and in a Uniform Linear Array (ULA) environment in which antennas are vertically arranged.

[0128] FIG. 22 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 81 and a vertical distance d.sub.V between antennas is 0.5. FIG. 22 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 22, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB to 3 dB.

[0129] FIG. 23 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 81 and a vertical distance d.sub.V between antennas is 0.8. FIG. 23 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 23, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1 dB to 2 dB.

[0130] FIG. 24 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.5, 0.5). FIG. 24 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 24, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB.

[0131] FIG. 25 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.8, 0.5). FIG. 25 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 25, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB.

[0132] FIG. 26 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 18 and a horizontal distance d.sub.H between antennas is 0.5. FIG. 26 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 26, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB.

[0133] Referring to FIGS. 22 to 26, the performance gain of about 1 to 3 dB is acquired when the FSTD-PSD scheme is used, which is narrowly increased compared to the FSTD-A scheme. According to an embodiment, since four antennas may be spaced apart from each other in the FSTD-PSD scheme, the FSTD-PSD scheme may be more sensitive to the channel correlation compared to the FSTD-A scheme in which only two antennas are spaced apart from each other.

[0134] FIG. 27 illustrates a performance experiment result using the FSTD-PSD scheme in an environment where the transmission antenna arrangement is 81 and a vertical distance d.sub.V between antennas is 0.5. FIG. 27 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 27, in both cases where a code rate R.sub.c is 1/2 and 3/4, a higher BLER is acquired in a case where the proposed permutation scheme is applied compared to a case where the Alamouti code is used. According to an embodiment, since eight antennas may be spaced apart from each other in the FSTD-E-PSD scheme, the FSTD-E-PSD scheme is more sensitive to the channel correlation, but a performance gain is rather reduced when antennas are arranged in 81. It is because separating all the eight antennas is difficult.

[0135] FIG. 28 illustrates a performance experiment result using the FSTD-E-PSD scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.5, 0.5). FIG. 28 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 28, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. In an 88 antenna environment, unlike FIG. 27, it is possible to separate eight antennas in the FSTD-E-PSD scheme. According to an embodiment, a performance gain of the proposed permutation scheme is about 1.5 dB to 2 dB.

[0136] FIG. 29 illustrates a performance experiment result using the FSTD-E-PSD scheme in an environment where the transmission antenna arrangement is 88 and a vertical distance and a horizontal distance (d.sub.V,d.sub.H) between antennas is (0.8, 0.5). FIG. 29 also illustrates a BLER performance graph using an Alamouti code when the transmission antenna arrangement is 21 in order to present the criterion of the performance. Referring to FIG. 29, in both cases where a code rate R.sub.c is 1/2 and 3/4, a lower BLER is acquired when the proposed permutation scheme is applied in most intervals. According to an embodiment, a performance gain of the proposed permutation scheme is about 1 dB to 1.5 dB.

[0137] Referring to FIGS. 27 to 29, the proposed permutation scheme may acquire a higher performance gain when the transmitting node has a larger number of antennas.

[0138] As a result, when the open-loop scheme, in which the transmitting node has a larger number of antennas and the larger number of antennas transmit one SFBC block, is used, the performance gain of the proposed permutation scheme may increase.

[0139] In the present disclosure, a specific operation described to be performed by the base station may be performed by an upper node than the base station according to some embodiments. That is, it is apparent that various operations performed for communication with the terminal can be performed by the base station or network nodes other than the base station in a network consisting of a plurality of network nodes including the base station.

[0140] Methods according to embodiments stated in claims and/or specifications of the present disclosure may be implemented in hardware, software, or a combination of hardware and software.

[0141] When the methods are implemented by software, a computer-readable storage medium for storing one or more programs (software modules) may be provided. The one or more programs stored in the computer-readable storage medium may be configured for execution by one or more processors within the electronic device. The at least one program may include instructions that cause the electronic device to perform the methods according to various embodiments of the present disclosure as defined by the appended claims and/or disclosed herein.

[0142] The programs (software modules or software) may be stored in non-volatile memories including a random access memory and a flash memory, a read only memory (ROM), an electrically erasable programmable read only memory (EEPROM), a magnetic disc storage device, a compact disc-ROM (CD-ROM), digital versatile Discs (DVDs), or other type optical storage devices, or a magnetic cassette. Alternatively, any combination of some or all of the may form a memory in which the program is stored. Further, a plurality of such memories may be included in the electronic device.

[0143] In addition, the programs may be stored in an attachable storage device which may access the electronic device through communication networks such as the Internet, Intranet, local area network (LAN), wide LAN (WLAN), and storage area network (SAN) or a combination thereof. Such a storage device may access the electronic device via an external port. Further, a separate storage device on the communication network may access a portable electronic device.

[0144] In the above-described detailed embodiments of the present disclosure, a component included in the present disclosure is expressed in the singular or the plural according to a presented detailed embodiment. However, the singular form or plural form is selected for convenience of description suitable for the presented situation, and various embodiments of the present disclosure are not limited to a single element or multiple elements thereof. Further, either multiple elements expressed in the description may be configured into a single element or a single element in the description may be configured into multiple elements.

[0145] While the present disclosure has been shown and described with reference to certain embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the present disclosure. Therefore, the scope of the present disclosure should not be defined as being limited to the embodiments, but should be defined by the appended claims and equivalents thereof.