WO2013021803A1 - Dispositif de précodage, programme de précodage et circuit intégré - Google Patents

Dispositif de précodage, programme de précodage et circuit intégré Download PDF

Info

Publication number
WO2013021803A1
WO2013021803A1 PCT/JP2012/068488 JP2012068488W WO2013021803A1 WO 2013021803 A1 WO2013021803 A1 WO 2013021803A1 JP 2012068488 W JP2012068488 W JP 2012068488W WO 2013021803 A1 WO2013021803 A1 WO 2013021803A1
Authority
WO
WIPO (PCT)
Prior art keywords
perturbation
vector
precoding
propagation path
transmission data
Prior art date
Application number
PCT/JP2012/068488
Other languages
English (en)
Japanese (ja)
Inventor
宏道 留場
毅 小野寺
博史 中野
デルガド アルバロ ルイズ
Original Assignee
シャープ株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by シャープ株式会社 filed Critical シャープ株式会社
Priority to US14/236,125 priority Critical patent/US9077599B2/en
Publication of WO2013021803A1 publication Critical patent/WO2013021803A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received

Definitions

  • the present invention relates to a precoding technique for performing preliminary processing on transmission data transmitted from a wireless transmission device having a plurality of antennas to a wireless reception device.
  • MIMO Multiple input multiple output
  • MU-MIMO multi-user MIMO
  • MU-MIMO transmission signals destined for each terminal device are received by the terminal device as inter-user interference (IUI), so it is necessary to suppress IUI.
  • IUI inter-user interference
  • LTE long term evolution
  • LTE long term evolution
  • Linear precoding that suppresses the IUI by multiplying in advance is employed.
  • the orthogonality of transmission signals between spatially multiplexed terminals is not high, IUI cannot be effectively suppressed. Therefore, in MU-MIMO based on linear precoding, there is a limit in improving frequency utilization efficiency.
  • the terminal device is capable of modulo operation, it can add a perturbation vector whose element is a complex number (perturbation term) obtained by multiplying an arbitrary Gaussian integer by a constant real number to the transmitted signal. It becomes. Therefore, if the perturbation vector is appropriately set according to the propagation path state between the base station device and the plurality of terminal devices, the perturbation vector is added even if the orthogonality of the transmitted signals between the spatially multiplexed terminals is not high. Compared with linear precoding that does not, the required transmission power can be greatly reduced.
  • Non-Patent Document 1 describes Vector perturbation (VP) as a method that can realize optimal transmission characteristics as nonlinear precoding.
  • VP is a simultaneous estimation technique that searches for an optimal perturbation vector from all selectable perturbation vectors, and has a problem that the amount of computation increases exponentially with respect to the number of multiple terminals.
  • Non-patent document 1 discusses SE-VP based on Sphere encoding (SE) as a VP calculation amount reduction technique.
  • SE Sphere encoding
  • SE-VP reduces the amount of computation required for perturbation vector exploration by performing exploration considering only transmission signal candidate points existing in a sphere drawn in a multidimensional signal point space.
  • SE-VP can reduce the amount of calculation without degrading the transmission characteristics, but the increase in the amount of calculation with respect to the number of multiple terminals is still exponential.
  • Non-Patent Document 2 discusses a VP perturbation vector exploration technique based on the M algorithm using QR decomposition.
  • this technique is called QRM-VP.
  • QRM-VP is a sequential search technique that can suppress an increase in the amount of calculation for the number of multiple terminals in a polynomial function.
  • the amount of calculation is reduced by not performing the calculation on the transmission signal candidate point unrelated to the optimal perturbation vector, and the effect of reducing the amount of calculation is greater than that of SE-VP.
  • SE-VP the effect of reducing the amount of calculation is greater than that of SE-VP.
  • Patent Document 1 proposes an adaptive surviving symbol algorithm (ASESS) for reducing the amount of computation of SU-MIMO using MLD.
  • ASESS adaptive surviving symbol algorithm
  • ASESS ranks candidate signal points by simple signal processing, thereby reducing the number of candidate signal points whose likelihood should be detected in MLD. Even in QRM-VP, by applying an adaptive survival algorithm such as ASESS, a large amount of computation can be expected to be reduced. However, a simple signal candidate point reduction technique suitable for QRM-VP is not disclosed. This is the actual situation.
  • QRM-VP which is a VP calculation amount reduction technology
  • QRM-VP has a limit in reducing the amount of calculation.
  • a technology for further reducing the amount of calculation of QRM-VP is not disclosed.
  • the present invention has been made in view of such circumstances.
  • a precoding device, a precoding program, and a precoding device that realize a reduction in the amount of calculation compared to QRM-VP while maintaining transmission characteristics that can be achieved by VP.
  • An object is to provide an integrated circuit.
  • the precoding device of the present invention is a precoding device that performs preliminary processing on transmission data transmitted from a wireless transmission device including a plurality of antennas to at least one wireless reception device, and each of the antennas and the antennas Based on the propagation path information with the wireless receiver, a linear filter generation unit that generates a linear filter, a perturbation term candidate of a perturbation vector to be added to a transmission data vector, and a reference signal associated with the transmission data are complex.
  • a signal conversion unit that develops on a plane, and a perturbation vector search unit that searches for a perturbation vector to be added to the transmission data vector based on the perturbation term candidates and the reference signal developed on the complex plane. And adding the searched perturbation vector to the transmission data vector, multiplying the linear filter, and transmitting And calculating a signal vector.
  • the perturbation vector candidate added to the transmission data vector and the reference signal associated with the transmission data are expanded on the complex plane, and based on the perturbation term candidate and the reference signal expanded on the complex plane. Since the perturbation vector added to the transmission data vector is searched, the perturbation vector searched for is added to the transmission data vector, and the transmission signal vector is calculated by multiplying the linear filter, minimizing the deterioration of transmission characteristics However, the amount of calculation can be greatly reduced. In addition, even if the number of multiple terminal devices increases, the increase in the amount of computation is not an exponential increase, but only a polynomial increase. It can contribute to improvement.
  • the perturbation vector may include a perturbation term that is a complex number obtained by multiplying a real number associated with a data modulation scheme applied to the transmission data by an arbitrary Gaussian integer. It is characterized by doing.
  • the perturbation vector has a perturbation term that is a complex number obtained by multiplying a real number associated with a data modulation scheme applied to transmission data by an arbitrary Gaussian integer. Even if the orthogonality of the transmission signals is not high, the required transmission power can be greatly reduced as compared with linear precoding in which no perturbation vector is added.
  • the reference signal is calculated based on perturbation term candidates of perturbation vectors associated with other reference signals.
  • the perturbation vector closest to the reference signal point calculated by another perturbation vector candidate is searched. can do.
  • the propagation path matrix indicating the propagation path information is converted into a matrix suitable for any one of matrix operation of QR decomposition, QL decomposition, or Cholesky decomposition for the linear filter.
  • a channel matrix conversion unit that performs the matrix operation corresponding to the converted channel matrix on the linear filter using the converted channel matrix.
  • the propagation path matrix indicating the propagation path information is converted into a matrix suitable for any one of the QR decomposition, the QL decomposition, and the Cholesky decomposition for the linear filter, so that transmission characteristics are not deteriorated.
  • the value of M which is the number of perturbation term candidates for each term, can be reduced.
  • the propagation path matrix conversion unit multiplies the propagation path matrix by a unimodular matrix calculated based on a lattice base reduction technique or an ordering technique. It is characterized by doing.
  • the propagation path matrix is multiplied by a unimodular matrix calculated based on the lattice basis reduction technique or the ordering technique, so that perturbation term candidates for each term can be obtained without degrading transmission characteristics.
  • the value of M which is a number, can be reduced.
  • the propagation path matrix conversion unit shares part of the information included in the unimodular matrix and shares the propagation path matrix. The conversion is performed.
  • the perturbation vector search unit divides the complex plane into a plurality of sections, specifies a section including the reference signal, and is included in the specified section.
  • a perturbation term candidate is selected as a perturbation term candidate to be added to the transmission data, and a perturbation vector to be added to the transmission data vector is searched based on the selected perturbation term candidate.
  • the complex plane is divided into a plurality of sections, a section including the reference signal is specified, and a perturbation term candidate included in the specified section is selected as a perturbation term candidate to be added to the transmission data, Since the perturbation vector to be added to the transmission data vector is searched based on the selected perturbation term candidates, there is no limitation on the value of K, which is a substantially selectable number of Gaussian integers, and each term Can be limited to M times, which is the number of perturbation term candidates for each term.
  • the perturbation vector search unit detects a Gaussian integer closest to the reference signal point, and the detected Gaussian integers are arranged in ascending order by size. And selecting the Gaussian integer sequence after the addition as a candidate for a perturbation term to be added to the transmission data, and searching for a perturbation vector to be added to the transmission data vector based on the selected perturbation term candidate It is characterized by doing.
  • the Gaussian integer closest to the reference signal point is detected, the detected Gaussian integer is added to the Gaussian integer sequence arranged in ascending order by size, and the Gaussian integer sequence after the addition is added to the transmission data.
  • Select as a perturbation term candidate to be added select as the selected perturbation term candidate, and search for a perturbation vector to be added to the transmission data vector based on the selected perturbation vector candidate. Ordering can be performed.
  • the perturbation vector search unit determines a priority order of the perturbation vectors.
  • K is the number of Gaussian integers that can be substantially selected, and the metric calculation for each term is perturbed. It is possible to limit the number of terms to M times.
  • the perturbation vector search unit searches for a perturbation vector having a minimum required transmission power.
  • the required transmission power is calculated based on transmission power calculated for a perturbation vector associated with another reference signal.
  • the required transmission power is calculated based on the transmission power calculated for the perturbation vector associated with another reference signal, the required transmission power is limited to a value of K, which is a substantially selectable number of Gaussian integers.
  • the metric calculation for each term can be limited to M times, which is the number of perturbation term candidates for each term.
  • the precoding program of the present invention is a precoding program for performing preliminary processing on transmission data transmitted from a wireless transmission device including a plurality of antennas to at least one wireless reception device, A process for generating a linear filter based on propagation path information between each antenna and the wireless receiver, a perturbation term candidate for a perturbation vector to be added to a transmission data vector, and a reference signal associated with the transmission data On the complex plane, searching for a perturbation vector to be added to the transmission data vector based on the perturbation term candidate and the reference signal expanded on the complex plane, and the transmission data vector The transmitted perturbation vector is added to and the transmission signal vector is calculated by multiplying the linear filter. That process and a series of processing, and characterized by causing a computer to execute.
  • the perturbation vector candidate added to the transmission data vector and the reference signal associated with the transmission data are expanded on the complex plane, and based on the perturbation term candidate and the reference signal expanded on the complex plane. Since the perturbation vector added to the transmission data vector is searched, the perturbation vector searched for is added to the transmission data vector, and the transmission signal vector is calculated by multiplying the linear filter, minimizing the deterioration of transmission characteristics However, the amount of calculation can be greatly reduced. In addition, even if the number of multiple terminal devices increases, the increase in the amount of computation is not an exponential increase, but only a polynomial increase. It can contribute to improvement.
  • the integrated circuit of the present invention is implemented in a wireless transmission device having a plurality of antennas, so that the wireless transmission device performs preliminary processing on transmission data to be transmitted to at least one wireless reception device.
  • An integrated circuit that performs a precoding function to be performed, the function of generating a linear filter based on propagation path information between each of the antennas and the wireless receiver, and a perturbation vector to be added to a transmission data vector
  • the perturbation term candidate and the reference signal associated with the transmission data are added to the transmission data vector.
  • a function of searching for a perturbation vector, and adding the searched perturbation vector to the transmission data vector A function of calculating and send signal vector multiplying the series of functions, characterized in that to exhibit to the wireless transmission device.
  • the perturbation vector candidate added to the transmission data vector and the reference signal associated with the transmission data are expanded on the complex plane, and based on the perturbation term candidate and the reference signal expanded on the complex plane. Since the perturbation vector added to the transmission data vector is searched, the perturbation vector searched for is added to the transmission data vector, and the transmission signal vector is calculated by multiplying the linear filter, minimizing the deterioration of transmission characteristics However, the amount of calculation can be greatly reduced. In addition, even if the number of multiple terminal devices increases, the increase in the amount of computation is not an exponential increase, but only a polynomial increase. It can contribute to improvement.
  • the present invention it is possible to realize non-linear precoding in which the amount of calculation is significantly reduced while maintaining transmission characteristics equivalent to VP.
  • the non-linear precoding of the present invention for downlink MU-MIMO whose frequency utilization efficiency is improved in proportion to the number of multiple terminals, the frequency utilization can be achieved without worrying about an increase in the amount of computation accompanying an increase in the number of multiple terminals. A significant improvement in efficiency can be realized.
  • FIG. 6 is a diagram illustrating a relationship between S u, k and ( ⁇ 2 ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane.
  • FIG. 7 is a diagram showing a relationship between S u, k and ( ⁇ 2 ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (showing ordering from the upper left) ).
  • FIG. 8 is a diagram showing a relationship between S u, k and ( ⁇ 2 ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (a state in which straight lines that divide each quadrant are drawn) Showing).
  • FIG. 7 is a diagram showing a relationship between S u, k and ( ⁇ 2 ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (a state in which the above-described quadrant division is repeatedly performed).
  • FIG. 6 is a diagram illustrating an example of a relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane.
  • FIG. 6 is a diagram illustrating a relationship between S u, k and S ⁇ u, k and ( ⁇ z u, k ) in Expression (11) according to the first embodiment of the present invention on a complex plane.
  • FIG. 6 is a diagram illustrating a relationship between S u, k and ( ⁇ z u, 1 ) in Expression (12) according to the first embodiment of the present invention on a complex plane.
  • FIG. 6 is a diagram illustrating a relationship between S u, k and ⁇ z u, 1 to z u, 5 ⁇ on a complex plane according to the first embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a relationship between Su, k and ⁇ z u, 1 to z u, 9 ⁇ on a complex plane according to the first embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a relationship between S u, k and ⁇ z u, 1 to z u, 13 ⁇ on a complex plane according to the first embodiment of the present invention. It is a flowchart explaining the perturbation term candidate search method of the u-th stage which concerns on the 1st Embodiment of this invention.
  • the base station apparatus acquires propagation path information to each terminal apparatus from the control information notified from each terminal apparatus, and pre-codes transmission data for each subcarrier based on the propagation path information.
  • the number of reception antennas of the terminal device is not limited to one.
  • the number of data streams (also referred to as the rank number) transmitted to each terminal apparatus is 1. However, the present embodiment includes a case where the rank number is larger than 2.
  • propagation path information between the base station apparatus and the terminal apparatus is defined.
  • a quasi-static frequency selective fading channel is assumed.
  • the channel matrix H (K) It is defined as
  • FIG. 1 is a block diagram showing a configuration of a base station apparatus according to the first embodiment of the present invention.
  • the base station apparatus includes a channel encoding unit 101, a data modulation unit 103, a reference signal multiplexing unit 105, an S / P conversion unit 107, a precoding unit 109, an antenna unit 111, The control information acquisition unit 113 and the CSI acquisition unit 115 are included.
  • the precoding unit 109 exists as many as the number of subcarriers N c
  • the antenna unit 111 exists as many as the number of transmission antennas N t .
  • the transmission data sequence addressed to each terminal apparatus is subjected to channel coding in channel coding section 101 and then data modulated to QPSK, 16QAM, etc. in data modulation section 103.
  • An output from data modulation section 103 is input to reference signal multiplexing section 105, and a known reference signal sequence for performing propagation path estimation in each terminal apparatus is multiplexed in reference signal multiplexing section 105.
  • the reference signals destined for each terminal device are multiplexed so as to be orthogonal to each other so that they can be separated in the received terminal device.
  • two reference signals of CRS which is a reference signal for channel estimation
  • DM-RS which is a reference signal for demodulation
  • the CRS is for estimating the propagation path matrix expressed by the equation (1)
  • the DM-RS is for estimating information related to precoding described later.
  • the multiplexing method of CRS and DM-RS is not particularly limited. However, the CRS is arranged so as to be orthogonal between the transmission antennas, and the DM-RS is arranged so as to be orthogonal between the connected terminal apparatuses.
  • time orthogonality As a method of orthogonalization, time orthogonality, frequency orthogonality, space orthogonality, code orthogonality, pseudo code orthogonality, or a combination of a plurality of orthogonal techniques can be considered.
  • the data signal and the reference signal are frequency-orthogonal, and that each terminal device can ideally estimate desired information.
  • the output of the reference signal multiplexing unit 105 is input to the S / P conversion unit 107, and serially parallel converted into Nc parallel signal sequences for each Nc sample.
  • the S / P conversion unit 107 outputs only Nc, which is the number of subcarriers, and is input to the corresponding subcarrier precoding unit 109.
  • the signal processing in the precoding unit 109 will be described later. Hereinafter, the signal processing for the output of the precoding unit 109 will be described first.
  • the output of the precoding unit 109 of each subcarrier is input to the antenna unit 111 of the corresponding transmission antenna.
  • FIG. 2 is a block diagram showing a device configuration of the antenna unit 111 according to the first embodiment of the present invention.
  • the antenna unit 111 includes an IFFT unit 201, a GI insertion unit 203, a wireless transmission unit 205, a wireless reception unit 207, and an antenna 209.
  • the output of the corresponding precoding unit 109 is input to the IFFT unit 201, and N c -point inverse fast Fourier transform (IFFT) or inverse discrete Fourier transform (IDFT) is applied to obtain N c subcarriers. Is generated and output from the IFFT unit 201.
  • IFFT inverse fast Fourier transform
  • IDFT inverse discrete Fourier transform
  • the output of the IFFT unit 201 is input to the GI insertion unit 203 and is input to the wireless transmission unit 205 after being given a guard interval.
  • the wireless transmission unit 205 the baseband transmission signal is converted into a radio frequency (RF) transmission signal.
  • the output signal of the wireless transmission unit 205 is transmitted from the antenna 209.
  • the radio reception unit 207 receives information associated with the propagation path information estimated by the terminal device and outputs the information to the control information acquisition unit 113.
  • FIG. 3 is a block diagram showing a device configuration of the precoding unit 109 according to the first embodiment of the present invention.
  • the precoding unit 109 includes a linear filter generation unit 301, a signal conversion unit 303, a perturbation vector search unit 305, and a transmission signal generation unit 307.
  • a propagation path matrix H (k) of k subcarriers is input.
  • H (k) is estimated by the terminal device based on the above-described CRS and notified to the base station device. In the following description, H (k) is ideally acquired by the CSI acquisition unit 115, and the index k is omitted for simplicity.
  • a linear filter W is generated in the linear filter generation unit 301.
  • W H H (HH H + ⁇ I) ⁇ 1
  • a -1 represents an inverse matrix of the matrix A
  • a H represents an adjoint matrix (Hermitian transpose matrix) of the matrix A.
  • ⁇ is an interference term, which is determined according to transmission power or the like. For example, ⁇ may be set to the reciprocal of the ratio of transmission power to reception noise power per terminal device. In the following, the description will be focused on the case where a linear filter based on the ZF criterion is generated.
  • the generated linear filter W is input to the signal conversion unit 303.
  • a transmission data vector d [d 1 ,..., D U ] T (A T represents a transposed matrix of the matrix A) and a linear filter W are input to the signal conversion unit 303, and a perturbation vector search is performed. Signal conversion processing is performed.
  • Transmission signal vector s [s 1 ,..., S Nt ] T after precoding when VP is applied is given by equation (2).
  • the Gaussian integer means a complex number whose real part and imaginary part are integers.
  • ⁇ is a power normalization term that keeps the transmission power constant, and is given by the inverse of the norm of the vector W (d + 2 ⁇ Z). Note that there is a method in which power normalization is performed not for each symbol but for a predetermined number of radio resources. For example, the transmission power may be controlled to be constant with 12 subcarriers. Any Gaussian integer can be set in the perturbation term that is a component of Z. The VP searches for a Z where the required transmission power is minimum. That is, Z is It is calculated by solving the minimization problem.
  • Z G represents a set of all Gaussian integer vectors.
  • Equation (3) The minimization problem expressed by equation (3) can be rewritten as equation (4).
  • L H L W H W
  • L represents a lower triangular matrix.
  • Such a lower triangular matrix L can be obtained by Cholesky decomposition.
  • the lower triangular matrix may be generated based on QL decomposition.
  • the upper triangular matrix R may be used to reduce the same minimization problem as in the equation (4).
  • Expression (5) is obtained by expanding the expression portion of Expression (4).
  • z 1 that minimizes the first term is z 1,1 .
  • the second term on the right side of Equation (5) depends only on z 2 .
  • the perturbation vector Z can be easily detected. In other words, the simultaneous estimation problem can be converted into a sequential estimation problem by modifying the equation (5).
  • the perturbation vector Z detected in this way is not optimal. Therefore, in the method based on the M algorithm, it is considered that M perturbation term candidates for each term survive.
  • stage the value of each stage, that is, Is called the stage metric of the u-th stage.
  • perturbation term candidates up to the (u ⁇ 1) th stage are already determined when calculating the stage metric of the u-th stage, and the stage metric depends only on the k-th perturbation term candidate z u, k of the u-th stage. It becomes a state.
  • the number of survivors M will be described as being the same in all stages, but a different number of survivors may be used for each stage.
  • ⁇ Z 1,1 to z 1, K ⁇ are extracted as perturbation term z 1 candidates for the first term, and the respective stage metrics ⁇ P 1,1 to P 1, K ⁇ are calculated.
  • An arbitrary Gaussian integer can be applied to the perturbation term z 1 , but here, it is assumed that the number of selectable Gaussian integers is limited to K.
  • M perturbation term candidates ⁇ z 1,1 to z 1, M ⁇ are made to survive in order of increasing stage metric.
  • the stage metric of the second stage is calculated for the perturbation term z 2 candidates ⁇ z 2,1 to z 2, K ⁇ .
  • a total of (K ⁇ M) stage metrics are calculated.
  • a path metric (representing the sum of the stage metrics of each stage) is calculated using the calculated stage metric.
  • z 1, j is selected as a candidate of z 1
  • path metric V 2 of the second stage (i, j) is the formula It will be given in (7).
  • the above is the perturbation vector search method based on the M algorithm.
  • the calculation amount of the metric in each stage is limited to (M ⁇ K)
  • the calculation amount can be significantly suppressed as compared with the case where Equation (3) is directly solved.
  • Equation (3) is directly solved.
  • One is the number K of perturbation term candidates in each term. Since the perturbation term is originally an arbitrary Gaussian integer, there are innumerable candidates for the perturbation term, but in reality, it is selected from a certain number of K candidates.
  • the optimum value of K varies depending on the propagation path environment and the like. In order to realize optimal transmission under any environment, it is necessary to set a large K, but the amount of calculation increases in proportion to the value of K.
  • a method for solving the above two problems of the perturbation vector search method by QR decomposition based on the M algorithm is disclosed.
  • the value of K is not substantially limited, and the metric calculation for each term can be limited to M times.
  • the basis of the method of the present invention is to limit the perturbation term candidates to be subjected to the metric calculation before performing the metric calculation.
  • the stage metric P u, k for the u-th stage perturbation term candidate ⁇ z u, 1 to z u, K ⁇ is calculated by Equation (8).
  • the perturbation term candidates ⁇ z 1 to z u ⁇ 1 ⁇ up to the (u ⁇ 1) stage correspond to one of the M candidate path metrics.
  • Perturbation term candidates z u, k are those that minimize Equation (9). That is, the reference signal given by equation (10) Is the search for the signal ( ⁇ z u, k ) closest to.
  • FIG. 4A is a diagram showing a relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane.
  • the complex plane extends infinitely, but here, for convenience, it is assumed to be cut off with a certain width.
  • the black circles in FIG. 4A represent S u, k , and the white circles indicate ( ⁇ z u, k ) candidates.
  • the calculation performed at the u-th stage is to detect M white circles close to the black circle. In the method based on the M algorithm, the square Euclidean distance between the black circle and all the white circles is calculated, and the white circle is calculated based on the calculation result. M are detected. However, paying attention to the state of FIG. 4A, the distance between the black circle and the white circle can be measured with a certain degree of accuracy without calculating the square Euclidean distance.
  • the white circle in the first quadrant is closer to the black circle than the white circle in the second and fourth quadrants, and the white circle in the third quadrant is a black circle. Will be the farthest. Therefore, weighting is sequentially performed on the white circles in the order of the first quadrant, the second quadrant, the fourth quadrant, and the third quadrant. The ordering between the white circles existing in the same quadrant may be appropriately performed.
  • FIG. 4B is a diagram showing the relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (ordered from the upper left). Show how they are).
  • FIG. 4C is a diagram showing the relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (straight lines dividing each quadrant) Is shown). Then, for the quadrant where the black circle exists, weights are sequentially assigned to the white circles present in the nearest quadrant.
  • FIG. 4D is a diagram showing a relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane (repeating the above quadrant division). Shows how it was done).
  • the ordering (ranking) from 1 to M can be performed on the candidate white circles of ( ⁇ z u, k ). In this way, it is possible to detect M white circles close to the black circle without calculating the square Euclidean distance.
  • FIG. 4E is a diagram illustrating an example of a relationship between S u, k and ( ⁇ z u, k ) in Expression (10) according to the first embodiment of the present invention on a complex plane.
  • a modulo operation with a modulo width 2 ⁇ is performed on Su , k before the ordering process described above. That is, A new reference signal ⁇ circumflex over (S) ⁇ u, k that satisfies the above is calculated.
  • floor (c) is a function in which the real part and the imaginary part each return a complex number that is the maximum integer not exceeding the real part and the imaginary part of the complex number c, and is also called a floor function.
  • FIG. 4F is a diagram showing the relationship between S u, k and S u u, k and ( ⁇ z u, k ) in the equation (11) according to the first embodiment of the present invention on a complex plane.
  • S ⁇ u After calculating the k, is regarded as a reference signal S ⁇ u, k, it will perform the ordering has been described above. Then, by adding B u, k to each of the ordered perturbation term candidates, the accuracy of the ordering when the black circle indicating the reference signal takes an extremely different value with respect to the perturbation term candidate point. Can be improved.
  • quadrant exploration is used for the ordering of white circles here, the ordering may be performed by another method as long as the ordering is possible by simple calculation.
  • an ordering method that is not quadrant exploration will be described.
  • a ranking method related to the perturbation term candidates in the u-th stage will be described. Referring again to FIG. 4A, the ranking for the perturbation term candidates z u, k is ranked in order from the white circle that is the candidate point closest to the reference signal S u, k represented by a black circle.
  • the candidate point z u, 1 closest to S u, k is assumed to be given by equation (12).
  • round (c) is a function that returns a complex number having integers closest to the real part and the imaginary part of c in the real part and the imaginary part, respectively.
  • FIG. 4G is a diagram showing the relationship between S u, k and ( ⁇ z u, 1 ) in Expression (12) according to the first embodiment of the present invention on a complex plane.
  • ( ⁇ z u, 1 ) is described as “1”.
  • FIG. 4H is a diagram illustrating a relationship between S u, k and ⁇ z u, 1 to z u, 5 ⁇ on a complex plane according to the first embodiment of the present invention.
  • FIG. 4I is a diagram illustrating the relationship between S u, k and ⁇ z u, 1 to z u, 9 ⁇ on a complex plane according to the first embodiment of the present invention.
  • FIG. 4J is a diagram showing the relationship between S u, k and ⁇ z u, 1 to z u, 13 ⁇ on a complex plane according to the first embodiment of the present invention. Thereafter, by adding to z u, 1 in order from the smallest Gaussian integer , ranking for candidate points can be performed without calculating the squared Euclidean distance.
  • a list in which Gaussian integers are arranged in ascending order may be prepared in advance, and ordering may be performed by adding z u, 1 to all the Gaussian integers described in the list.
  • the rankings described above are basically ordered based on the reference signal calculated at each stage.
  • the above calculation may be performed at each stage, but for a number of reference signal values, perturbation vector candidates are ordered, and the table and reference signal values are stored. It may be controlled to perform ordering by referring to.
  • Information associated with the ordering of perturbation terms in each term is output from the signal conversion unit 303 and input to the perturbation vector search unit 305.
  • FIG. 5 is a flowchart illustrating the u-stage perturbation term candidate search method according to the first embodiment of the present invention.
  • FIG. 5 shows the perturbation term candidate search method of the u-th stage in the present embodiment, which is performed in the perturbation vector search unit 305 as performing the above-described ordering.
  • the calculation up to the (u ⁇ 1) stage is completed, and M path metrics (V u ⁇ 1,1 to V u ⁇ 1, M ) at the (u ⁇ 1) stage time point. It is also assumed that M perturbation vector candidates (Z u ⁇ 1,1 to Z u ⁇ 1, M ) that give the respective path metrics have been calculated.
  • the signal conversion unit 303 orders the perturbation term candidates of the u-th stage by the above-described method based on the reference signal S u, m .
  • the perturbation vector search unit 305 updates the data (Q x ⁇ V u, k , k ⁇ k + 1, x c ⁇ x c + 1 ) (step S115). If k exceeds M (step S117: Yes), the perturbation vector search unit 305 ends the process. The perturbation vector search unit 305 returns to step S109 if k does not exceed M (step S117: No).
  • the signal processing from step S101 to step S105 is performed by the signal conversion unit 303, but is described here for convenience. In addition, it is good also as a structure which does not have the signal conversion part 303 separately, but performs all signal processing in the perturbation vector search part 305.
  • FIG. A perturbation term candidate of a certain stage is input again to the signal conversion unit 303, and signal processing in the signal conversion unit 303 is performed again. After performing the above processing from the first stage to the U-th stage, the candidate vector having the smallest path metric becomes the optimum perturbation vector Z.
  • the transmission characteristics in this embodiment greatly depend on the survival number M. Although the transmission characteristics improve in proportion to the magnitude of M, the amount of calculation also increases. Therefore, it is desirable to use as small M as possible in order to satisfy the required transmission quality.
  • the relationship between transmission quality and M can be obtained by performing a bit error rate (BER) measurement by computer simulation or the like in advance.
  • BER bit error rate
  • the precoding unit 109 may perform control so that the optimum survival number M corresponding to the number of spatially multiplexed terminals U is previously tabulated and the survival number M is determined according to the table. In general, the larger the number of spatial multiplexing, the larger M is required.
  • the terminal device described later notifies the base station device of the spatial correlation value observed by the terminal device, and based on the notified spatial correlation value,
  • the number of survivors may be controlled adaptively. For example, when the spatial correlation value is small, there is a method of controlling to use the table-like survival number described above, and when the spatial correlation value is large, control to use a value larger than the tabulated survival number. Conceivable. What is necessary is just to grasp
  • VP is precoding that is controlled so as to minimize the required transmission power in a given transmission scheme (transmission scheme in which IUI is 0 in this embodiment). It can be said that it is a method. However, this means that the reception quality varies greatly depending on the propagation path conditions, and this is a problem when applying adaptive modulation transmission using an optimal modulation scheme and coding rate according to the reception quality. There is a case. Therefore, for the minimization problem given by Equation (3), the minimization problem may be modified so as to search for a perturbation term that gives a certain arbitrary reception quality, and the required transmission power is simply minimized. Control may be performed so as to obtain an arbitrary reception quality by adding an arbitrary perturbation term to the perturbation vector to be performed.
  • MCS Modulation and Coding scheme
  • the perturbation vector is output from the perturbation vector search unit 305 by the above-described method and input to the transmission signal generation unit 307.
  • transmission signal generation section 307 transmission signal vector s is generated based on the input information and equation (2), and is output as the output of precoding section 109.
  • reference signals CRS and DM-RS
  • CRS signal processing relating to precoding is not performed, and the CRS is output as it is.
  • DM-RS the same precoding as transmission data is performed, but no perturbation vector is added.
  • FIG. 6 is a block diagram showing the configuration of the terminal apparatus according to the first embodiment of the present invention.
  • the terminal device includes an antenna 401, a radio reception unit 403, a GI removal unit 405, an FFT unit 407, a reference signal separation unit 409, a propagation path estimation unit 411, and a feedback information generation unit 413.
  • signal processing in the u-th terminal device will be described.
  • a signal received by the antenna 401 is input to the wireless reception unit 403 and converted into a baseband signal.
  • the signal converted into the baseband is input to the GI removal unit 405, and after the guard interval is removed, is input to the FFT unit 407.
  • N c point fast Fourier transform (FFT) or discrete Fourier transform (DFT) is applied to the input signal to convert it into N c subcarrier components.
  • the output of the FFT unit 407 is input to the reference signal separation unit 409.
  • the reference signal separation unit 409 separates the input signal into a data signal component, a CRS component, and a DM-RS component.
  • the data signal component is output toward the propagation path compensation unit 417, and the CRS and DM-RS are output toward the propagation path estimation unit 411.
  • the propagation path estimation unit 411 performs propagation path estimation based on the input known reference signals CRS and DM-RS.
  • a known reference signal sequence addressed to each terminal apparatus is transmitted from the base station apparatus so as to be orthogonal to each other.
  • channel estimation using CRS will be described. Since the CRS is transmitted without applying precoding, the component corresponding to each terminal device (for example, the u-th terminal device) in the channel matrix H (k) expressed by the equation (1). For example, it is possible to estimate the u-th row component of H (k).
  • CRS is thinned out and multiplexed for radio resources, it is not possible to estimate the propagation path information of all subcarriers, but appropriately in the time direction and frequency direction to satisfy the sampling theorem. By multiplexing CRS, it is possible to estimate the propagation path information of all subcarriers by appropriate interpolation.
  • a specific propagation path estimation method is not particularly limited. For example, it is conceivable to use two-dimensional MMSE propagation path estimation
  • the propagation path information estimated by CRS is input to the feedback information generation unit 413.
  • Feedback information generation section 413 generates information to be fed back to the base station apparatus according to the propagation path information format fed back by each terminal apparatus.
  • the propagation path information format is not limited to anything. For example, a method is conceivable in which estimated channel information is quantized with a finite number of bits and the quantized information is fed back.
  • Information generated by feedback information generation section 413 is input to radio transmission section 415 and notified to the base station apparatus. In this embodiment, it is assumed that feedback is performed so that the base station apparatus can grasp the propagation path matrix given by Equation (1), but the correlation of the propagation path matrix estimated by each terminal apparatus is assumed. You may control so that a matrix may be fed back.
  • control information associated with reception quality for example, Channel quality indicator (CQI) in LTE
  • control information associated with spatial correlation of propagation paths between transmission antennas for example, transmission It may be controlled to notify the spatial correlation coefficient between the antennas together.
  • the notified information can also be used when the precoding unit 109 determines the survival number M.
  • DM-RS differs from CRS in that it is transmitted with a part of precoding, so DM-RS can be used to obtain channel information to demodulate the precoded data signal. it can.
  • a matrix ⁇ (k) H () obtained by multiplying the propagation path matrix H (k) by the linear filter W (k) and further multiplying by the power normalization coefficient ⁇ (k). k) It is possible to estimate the u-th row u-column component of W (k).
  • DM-RS may be thinned out and multiplexed for radio resources in the same way as CRS, but it is possible to obtain demodulation information for all subcarrier components by appropriate interpolation.
  • Information obtained by the DM-RS is input to the propagation path compensation unit 417.
  • the propagation path information obtained by the DM-RS is input to the propagation path compensation unit 417.
  • the channel compensation unit 417 performs channel equalization processing on the data signal component.
  • h u (k) represents the u-th row component of H (k)
  • w u (k) represents the u-th column component of W (k).
  • G u (k) represents the residual IUI.
  • the residual IUI is 0, for example, when the linear filter is based on the ZF criterion.
  • N u (k) is noise.
  • G u (k) and N u (k) are omitted.
  • the equivalent channel gain H u (k) is information estimated by the DM-RS in the channel estimation unit 411 and is input from the channel estimation unit 411 to the channel compensation unit 417. Thereafter, a modulo operation with a modulo width 2 ⁇ shown in Expression (14) is performed on ⁇ R u (k) / H ⁇ u (k) ⁇ , and a soft decision value sequence ⁇ S u (k) ⁇ is output.
  • the real part and the imaginary part of the output are made larger than ⁇ and smaller than ⁇ , respectively, with respect to the input. Therefore, when the residual IUI and noise power are sufficiently small, z u (k ) + Z r, u (k) ⁇ 0, so that the influence of the perturbation term can be removed.
  • the output of the propagation path compensation unit 417 is then input to the P / S conversion unit 419 and subjected to parallel / serial conversion.
  • the output of P / S converter 419 is then input to data demodulator 421 and channel decoder 423, where data demodulation and channel decoding are performed.
  • data demodulator 421 and channel decoder 423 data demodulation and channel decoding are performed.
  • LLR log likelihood ratio
  • OFDM signal transmission is performed and precoding is performed for each subcarrier, but there is no limitation on the transmission scheme (or access scheme) and the precoding application unit.
  • the present embodiment is also applicable when precoding is performed for each resource block in which a plurality of subcarriers are grouped.
  • a single carrier-based access scheme for example, single carrier frequency division multiple access (SC- It can also be applied to FDMA).
  • the amount of calculation can be significantly reduced while minimizing the deterioration of transmission characteristics. Even if the number of multiple terminal devices increases, the increase in the amount of computation is not an exponential increase, but only a polynomial increase. Therefore, a large increase in the number of multiple terminal devices can be realized, which improves frequency utilization efficiency. Can contribute.
  • a perturbation vector search method for realizing a reduction in the amount of VP computation has been clarified.
  • the transmission characteristics in the first embodiment largely depend on the number M of surviving perturbation term candidates in each stage. In order to obtain good transmission characteristics, the value of M may be increased, but the amount of computation increases in proportion to the value of M.
  • a method capable of reducing the value of M without degrading transmission characteristics is disclosed.
  • the base station device configuration, the antenna unit 111 configuration, and the terminal device configuration are the same as those in the first embodiment, and the difference is the configuration of the precoding unit 501 and signal processing.
  • the configuration and signal processing of the precoding unit 501 according to the second embodiment will be described.
  • FIG. 7 is a block diagram showing a device configuration of the precoding unit 501 according to the second embodiment of the present invention.
  • the precoding unit 501 includes a linear filter generation unit 301, a signal conversion unit 303, a perturbation vector search unit 305, a transmission signal generation unit 307, and a propagation path matrix conversion unit 503. It is configured.
  • a propagation path matrix H (k) of k subcarriers is input.
  • H (k) is estimated by the terminal device based on the above-described CRS and notified to the base station device. In the following description, H (k) is ideally acquired by the CSI acquisition unit 115, and the index k is omitted for simplicity.
  • the channel matrix conversion unit 503 first performs matrix conversion processing on the channel matrix H input from the CSI acquisition unit 115.
  • the matrix transformation process is for reducing the surviving number M in the search for the perturbation vector.
  • Equation (5) The equation to be minimized in VP is given by Equation (5), and as described in the description of signal processing in the precoding unit 109, perturbation term candidates are listed from candidates for z 1 . .
  • the candidate for z 1 is used for calculation of the metrics of all subsequent stages, the influence on the overall transmission power is larger than that of the perturbation term candidates of the subsequent stages. Therefore, for z 1, it is important to choose the possible reliability is high candidates.
  • it is desirable that the first row and first column component L 1,1 of the lower triangular matrix L in Formula (5) is as large as possible. As one method for increasing L 1,1 , ordering for the propagation path matrix H can be considered.
  • Ordering means that each row of the propagation path matrix is exchanged, and can generally be realized by multiplication of the permutation matrix ⁇ . That is, in the propagation path matrix conversion unit 503, signal processing for outputting a matrix ⁇ H obtained by multiplying the input propagation path matrix H by the permutation matrix ⁇ as a new propagation path matrix H is performed.
  • a method for calculating an appropriate permutation matrix ⁇ as an optimal method, when the propagation path matrix H is a matrix of U rows and N t columns, all selectable permutation matrices are U! Since there are all of them, the Cholesky decomposition matrix L of the matrix ⁇ H is calculated for all of them, and the one that can maximize L 1,1 may be selected.
  • the permutation matrix may be obtained by the BLAST method or a method based on QR decomposition with sorting.
  • ⁇ H may be regarded as a propagation path matrix, ⁇ d obtained by multiplying ⁇ by the transmission symbol vector d as a new transmission symbol vector, and signal processing may be performed in another component device.
  • the signal processing in the constituent devices other than the propagation path matrix conversion unit 503 is exactly the same as the precoding unit 109 except that the propagation path matrix H and the transmission symbol vector d are updated as described above, and thus the description thereof is omitted. .
  • the lattice reduction technique is a matrix conversion technique that obtains a more orthogonal matrix by multiplying a given matrix H by a unimodal matrix T. If the matrix has high orthogonality, the diagonal component of the triangular matrix becomes larger than that of the low orthogonality matrix, and as a result, the value of the first row and first column component can also be increased.
  • the unimodular matrix is a matrix whose constituent elements are all Gaussian integers and whose determinant is 1 or -1.
  • the propagation path matrix conversion unit 503 applies the LLL algorithm to the inverse matrix H ⁇ 1 of the propagation path matrix H to calculate an inverse matrix G ⁇ 1 with higher orthogonality.
  • G T ⁇ 1 H.
  • TH is output as a new propagation path matrix from the propagation path matrix conversion unit 503, and signal processing in which TH is regarded as a propagation path matrix is performed in other constituent devices.
  • Td obtained by multiplying T by transmission signal vector d is regarded as a new transmission signal vector, and further, a modulo operation with a modulo width of 2 ⁇ is regarded as a transmission signal vector.
  • the signal processing in the constituent devices other than the propagation path matrix conversion unit 503 is exactly the same as that of the precoding unit 109 except that the propagation path matrix H and the transmission symbol vector d are updated as described above. Since they are the same, the description is omitted.
  • the propagation path matrix conversion unit 503 may perform matrix conversion using an arbitrary unimodal matrix. For example, a plurality of unimodular matrices may be preliminarily collected in a code book or the like, and control may be performed so as to use a unimodular matrix that can improve the orthogonality of the propagation path most. If the reliability of the first stage perturbation term candidates is not improved by the above-described method, the number of survivors in the first stage including the first stage may be larger than that in the second stage.
  • the surviving number M can be reduced as compared with the method of the first embodiment, so that the amount of calculation can be further reduced.
  • the second embodiment in order to further reduce the reduction in the amount of VP computation, precoding for performing matrix transformation on the propagation path matrix in advance is targeted.
  • the amount of computation of the ordering and lattice basis reduction techniques as targets is small compared to the search for the perturbation vector of VP, but becomes a size that cannot be ignored as the number of multiplexed terminals increases.
  • the third embodiment is directed to a method for reducing the amount of computation related to matrix transformation by paying attention to the correlation of the propagation path matrix between radio resources.
  • the base station device configuration, the antenna unit 111 configuration, and the terminal device configuration are the same as those in the first embodiment, and the difference is the configuration of the precoding unit 601 and signal processing.
  • the precoding unit 601 according to the third embodiment will be described.
  • FIG. 8 is a block diagram showing a device configuration of the precoding unit 601 according to the third embodiment of the present invention.
  • the precoding unit 601 includes a linear filter generation unit 301, a signal conversion unit 303, a perturbation vector search unit 305, a transmission signal generation unit 307, and a propagation path matrix conversion unit 603. It is configured.
  • a propagation path has a correlation between wireless resources. For example, in the case of OFDM transmission targeted in this embodiment, when the frequency selectivity of the propagation path is weak, the propagation path matrix H (k) of the kth subcarrier and the propagation path matrix H of the (k + 1) th subcarrier. It has a high correlation with (k + 1). This is noticed in the third embodiment.
  • the propagation path matrix conversion unit 603 matrix conversion such as ordering is performed on the propagation path matrix H in the same manner as the signal processing in the propagation path matrix conversion unit 603 in the precoding unit 501, but at this time, the propagation path matrix
  • matrix transformation is performed based on the same transformation matrix between a certain number of subcarriers. For example, when the frequency selectivity of the propagation path is weak, the unimodular matrix T is calculated only for the propagation path matrix of the seventh subcarrier for the first to twelfth subcarriers, and the unimodal for the first to twelfth subcarriers. You should always use a matrix.
  • the unimodular matrix in a certain subcarrier is calculated based on the propagation path matrix converted by the unimodular matrix calculated in the adjacent subcarriers, so that the unimodular matrix is calculated. Control may be performed to suppress the amount of calculation related to matrix calculation.
  • the propagation path has a correlation not only between subcarriers but also in the time direction, that is, between OFDM signals when the moving speed of the terminal device is low.
  • the unimodal matrix is calculated only for the first OFDM signal among the seven consecutive OFDM signals, and the k-th subcarrier of the subsequent OFDM signal is calculated.
  • the precoding unit 601 may share the unimodal matrix.
  • only one unimodular matrix may be calculated for 12 consecutive subcarriers of 7 consecutive OFDM signals, that is, 84 subcarriers in total, and shared.
  • the present invention is basically intended for frequency division duplex (FDD) in which the uplink and downlink carrier frequencies are different.
  • TDD time division duplex
  • MU-MIMO using VP based on the above is applicable.
  • the uplink transmission becomes a transmission scheme called uplink MU-MIMO.
  • uplink MU-MIMO a signal transmitted from each terminal apparatus is received in a state of being spatially multiplexed in the base station apparatus, and thus it is necessary to perform spatial separation processing similar to MIMO-SDM.
  • the V-BLAST method and the MLD method are well known. However, in any technique, by applying ordering or lattice basis reduction to the propagation path matrix estimated in advance, the space separation processing is performed. Separation accuracy can be improved. Since TDD has a strong correlation in the uplink and downlink propagation paths, the permutation matrix and the unimodular matrix used in the spatial separation processing are input to the propagation path matrix conversion section 603 of the precoding section 601 and the information May be used to perform channel matrix transformation, and information may be provided to each other and used for precoding or space separation.
  • precoding is basically performed based on the propagation path matrix H (k), that is, the instantaneous propagation path gain, but the statistical properties of the propagation path including the covariance matrix are considered.
  • matrix conversion or the like may be performed based on the covariance matrix calculated from the uplink received signal, and the precoding itself may be calculated from the uplink received signal. You may carry out based on a dispersion
  • a case where a transformation matrix for transforming a propagation path matrix is shared between radio resources is targeted. Since it is possible to reduce the number of times to calculate the transformation matrix according to the state of the propagation path, it is possible to further reduce the amount of calculation.
  • the program that operates in the mobile station apparatus and the base station apparatus related to the present invention is a program (a program that causes a computer to function) that controls the CPU and the like so as to realize the functions of the above-described embodiments related to the present invention.
  • Information handled by these devices is temporarily stored in the RAM at the time of processing, then stored in various ROMs and HDDs, read out by the CPU, and corrected and written as necessary.
  • a recording medium for storing the program a semiconductor medium (for example, ROM, nonvolatile memory card, etc.), an optical recording medium (for example, DVD, MO, MD, CD, BD, etc.), a magnetic recording medium (for example, magnetic tape, Any of a flexible disk etc. may be sufficient.
  • the processing is performed in cooperation with the operating system or other application programs.
  • the functions of the invention may be realized.
  • the program when distributing to the market, can be stored in a portable recording medium for distribution, or transferred to a server computer connected via a network such as the Internet.
  • the storage device of the server computer is also included in the present invention.
  • LSI which is typically an integrated circuit.
  • Each functional block of the mobile station apparatus and the base station apparatus may be individually made into a processor, or a part or all of them may be integrated into a processor.
  • the method of circuit integration is not limited to LSI, and may be realized by a dedicated circuit or a general-purpose processor.
  • an integrated circuit based on the technology can also be used.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Transmission System (AREA)

Abstract

L'invention concerne un dispositif de précodage visant à réduire le volume de calculs par rapport à la technique QRM-VP tout en conservant une caractéristique de transmission permettant une perturbation vectorielle (VP). Le dispositif de précodage (109) selon l'invention soumet à un traitement préliminaire des données sortantes destinées à être transmises d'un émetteur sans fil doté de plusieurs antennes à un récepteur sans fil, et comprend : un générateur de filtre linéaire (301) servant à générer un filtre linéaire à partir d'un résultat d'estimation d'un trajet de propagation entre une antenne (111) et un récepteur sans fil ; un convertisseur de signaux (303) servant à développer sur le plan complexe un terme de perturbation candidat d'un vecteur de perturbation à ajouter à un vecteur de données sortantes ainsi qu'un signal de référence associé aux données sortantes ; et une sonde de vecteur de perturbation (305) servant, à partir du terme de perturbation candidat et du signal de référence développés sur le plan complexe, à réaliser un sondage en quadrant et à extraire le vecteur de perturbation à ajouter au vecteur de données sortantes. Le dispositif de précodage selon l'invention calcule un vecteur de signaux sortants en ajoutant le vecteur de perturbation extrait au vecteur de données sortantes et en multipliant le résultat par un filtre linéaire.
PCT/JP2012/068488 2011-08-05 2012-07-20 Dispositif de précodage, programme de précodage et circuit intégré WO2013021803A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US14/236,125 US9077599B2 (en) 2011-08-05 2012-07-20 Precoding apparatus, program for precoding, and integrated circuit

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2011172228A JP5804594B2 (ja) 2011-08-05 2011-08-05 プリコーディング装置、プリコーディング用プログラムおよび集積回路
JP2011-172228 2011-08-05

Publications (1)

Publication Number Publication Date
WO2013021803A1 true WO2013021803A1 (fr) 2013-02-14

Family

ID=47668319

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/068488 WO2013021803A1 (fr) 2011-08-05 2012-07-20 Dispositif de précodage, programme de précodage et circuit intégré

Country Status (3)

Country Link
US (1) US9077599B2 (fr)
JP (1) JP5804594B2 (fr)
WO (1) WO2013021803A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150326292A1 (en) * 2014-05-12 2015-11-12 Transpacific Ip Management Group Ltd. Sparsity enhanced mismatch model for heterogeneous networks with doubly-selective fading channels

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3306826B1 (fr) * 2012-10-03 2019-06-05 Sckipio Technologies S.i Ltd Précodeur hybride
KR102045332B1 (ko) * 2013-03-26 2019-11-18 삼성전자 주식회사 이동통신 시스템에서 무선랜을 이용해서 트래픽을 오프 로드하는 방법 및 장치
JP5738338B2 (ja) * 2013-03-29 2015-06-24 株式会社Ｎｔｔドコモ 無線通信システムおよび無線基地局装置
JP2016149584A (ja) * 2013-06-10 2016-08-18 シャープ株式会社 基地局装置、端末装置、無線通信システム、集積回路
JP6405155B2 (ja) * 2014-08-27 2018-10-17 三星電子株式会社Ｓａｍｓｕｎｇ Ｅｌｅｃｔｒｏｎｉｃｓ Ｃｏ．，Ｌｔｄ． 信号処理装置、信号処理方法、及びプログラム
WO2016082871A1 (fr) * 2014-11-25 2016-06-02 Telefonaktiebolaget Lm Ericsson (Publ) Émetteur radio pour atténuation de distorsion
KR101546202B1 (ko) * 2014-12-30 2015-08-20 연세대학교 산학협력단 다중 안테나 시스템에서 신호 전송 방법 및 장치
WO2016148262A1 (fr) * 2015-03-17 2016-09-22 日本電気株式会社 Dispositif, procédé et système de communication, terminal et programme
US10574317B2 (en) 2015-06-18 2020-02-25 Cohere Technologies, Inc. System and method for providing wireless communication services using configurable broadband infrastructure shared among multiple network operators
US10892547B2 (en) 2015-07-07 2021-01-12 Cohere Technologies, Inc. Inconspicuous multi-directional antenna system configured for multiple polarization modes
EP3437197B1 (fr) * 2016-04-01 2022-03-09 Cohere Technologies, Inc. Précodage de tomlinson-harashima dans un système de communication otfs
CN107888323B (zh) * 2016-09-29 2020-01-17 电信科学技术研究院 一种信道状态信息的传输方法和设备
US20190386774A1 (en) * 2016-12-02 2019-12-19 Harman International Industries, Incorporated Communication Method and System
US11522600B1 (en) 2018-08-01 2022-12-06 Cohere Technologies, Inc. Airborne RF-head system
AU2020289462A1 (en) * 2019-06-05 2021-04-08 Cohere Technologies, Inc. Reciprocal geometric precoding
EP3761238A1 (fr) * 2019-07-01 2021-01-06 Institut Mines-Telecom Dispositifs et procédés de précodage assisté par apprentissage machine

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009278613A (ja) * 2008-03-20 2009-11-26 Toshiba Corp 無線通信装置
JP2010114605A (ja) * 2008-11-05 2010-05-20 Toshiba Corp 無線通信装置及び方法

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4640793B2 (ja) 2004-05-13 2011-03-02 株式会社エヌ・ティ・ティ・ドコモ 信号分離装置及び信号分離方法
EP1596521B1 (fr) 2004-05-13 2013-04-03 NTT DoCoMo, Inc. Dispositif et procédé de separation des signaux
WO2007061416A1 (fr) * 2005-11-23 2007-05-31 Nokia Corporation Optimisation conjointe d'un prefiltrage lineaire et d'une perturbation des vecteurs non lineaires pour un precodage multi-utilisateur entree multiple sortie multiple
KR100966522B1 (ko) * 2007-04-09 2010-06-29 삼성전자주식회사 다중안테나 시스템에서 일그러짐 없는 벡터 섭동을제공하는 장치 및 방법
GB2467143B (en) * 2009-01-22 2011-04-06 Toshiba Res Europ Ltd Wireless commication method and apparatus
JP5473131B2 (ja) * 2010-01-15 2014-04-16 シャープ株式会社 通信システム、通信装置、通信方法およびそのプロセッサ
JP5547988B2 (ja) * 2010-03-01 2014-07-16 シャープ株式会社 通信システム、送信装置、受信装置、通信方法
JP5501034B2 (ja) * 2010-03-01 2014-05-21 シャープ株式会社 通信システム、送信装置、受信装置
JP5596498B2 (ja) * 2010-11-02 2014-09-24 シャープ株式会社 基地局装置、移動局装置及びそれらを用いた無線通信システム
JP5727201B2 (ja) * 2010-11-24 2015-06-03 シャープ株式会社 基地局装置及び通信方法
JP5687524B2 (ja) * 2011-03-01 2015-03-18 シャープ株式会社 送信装置、受信装置、通信システム、通信方法、および集積回路
US9130629B2 (en) * 2011-03-04 2015-09-08 Sharp Kabushiki Kaisha Wireless communication system, base station device, and terminal device

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009278613A (ja) * 2008-03-20 2009-11-26 Toshiba Corp 無線通信装置
JP2010114605A (ja) * 2008-11-05 2010-05-20 Toshiba Corp 無線通信装置及び方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HENNING VETTER ET AL.: "Near-Optimum Vector Perturbation Precoding using a Candidate List", WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, 2009., 8 April 2009 (2009-04-08) *
SEOK-HWAN PARK ET AL.: "Decoupled Search for Vector Perturbation in Multiuser Downlink Systems", COMMUNICATIONS, 2010 IEEE INTERNATIONAL CONFERENCE, 27 May 2010 (2010-05-27) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150326292A1 (en) * 2014-05-12 2015-11-12 Transpacific Ip Management Group Ltd. Sparsity enhanced mismatch model for heterogeneous networks with doubly-selective fading channels
US9634744B2 (en) * 2014-05-12 2017-04-25 Taiwan Semiconductor Manufacturing Company, Ltd. Sparsity enhanced mismatch model for heterogeneous networks with doubly-selective fading channels

Also Published As

Publication number Publication date
US20140177751A1 (en) 2014-06-26
JP5804594B2 (ja) 2015-11-04
JP2013038554A (ja) 2013-02-21
US9077599B2 (en) 2015-07-07

Similar Documents

Publication Publication Date Title
JP5804594B2 (ja) プリコーディング装置、プリコーディング用プログラムおよび集積回路
US9008166B2 (en) Filter calculating device, transmitting device, receiving device, processor, and filter calculating method
JP5908307B2 (ja) プリコーディング装置、無線送信装置、無線受信装置、無線通信システムおよび集積回路
WO2014199989A1 (fr) Appareil de station de base, appareil terminal, système de communication sans fil et circuit intégré
WO2014069262A1 (fr) Dispositif de station de base, dispositif terminal et système de communication sans fil
JP6019298B2 (ja) 無線通信システム、無線送信装置および無線通信方法
US9673881B2 (en) Terminal device, base station device, wireless communication system, reception method, and integrated circuit
JP5859913B2 (ja) 無線受信装置、無線送信装置、無線通信システム、プログラムおよび集積回路
US8976881B2 (en) Wireless receiving apparatus and program
WO2012157393A1 (fr) Station de base, station mobile, programme de commande et circuit intégré
JP5546357B2 (ja) 送信装置、受信装置、無線通信システム、制御プログラムおよび集積回路
JP5641787B2 (ja) 端末装置及びそれを用いた無線通信システム
WO2014122850A1 (fr) Dispositif station de base, procédé de précodage, circuit intégré et système de radiocommunication
JP5909104B2 (ja) 無線送信装置、無線受信装置、無線通信システムおよびプリコーディング方法
JP6047744B2 (ja) 無線通信システム、無線通信装置および無線通信方法
JP2013123196A (ja) プリコーディング装置、無線送信装置、プリコーディング方法、プログラムおよび集積回路
JP5753041B2 (ja) 無線送信装置、無線受信装置、および無線通信システム
JP2012070172A (ja) 送信装置、受信装置、無線通信システム、制御プログラムおよび集積回路
JP5802942B2 (ja) 無線通信システム、無線送信装置および無線通信方法
JP2017034295A (ja) 基地局装置、端末装置、送信方法、および受信方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12822502

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 14236125

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12822502

Country of ref document: EP

Kind code of ref document: A1