METHOD, COMMUNICATION DEVICE AND COMMUNICATION SYSTEM FOR MIMO COMMUNICATION

Abstract

A method, a communication device and a communication system for multiple-input-multiple-output (MIMO) communication. In the method, Antenna information and channel information of the communication device are obtained. Eigenvalues of an intermediate matrix according to the antenna information and the channel information are determined, where the intermediate matrix is related to an L-term approximated matrix for Neumann series expansion of a matrix inversion, the matrix inversion is an inverse of a KK matrix, L is a positive integer, and K is a positive integer according to the antenna information. Coefficients of the L-term approximated matrix are determined from the eigenvalues of the intermediate matrix by calculating a coefficient approximation. The matrix inversion according to the L-term approximated matrix with the determined coefficients of the L-term approximated matrix are determined. Accordingly, the precision of matrix inverse approximation (MIA) in MIMO system would be enhanced with low complexity.

Claims

1. A method for multiple-input-multiple-output (MIMO) communication, adapted for a communication device, comprising: obtaining antenna information and channel information of the communication device; determining eigenvalues of an intermediate matrix according to the antenna information and the channel information, wherein the intermediate matrix is related to an L-term approximated matrix for Neumann series expansion of a matrix inversion, the matrix inversion is an inverse of a KK matrix, L is a positive integer, and K is a positive integer according to the antenna information; determining coefficients of the L-term approximated matrix from the eigenvalues of the intermediate matrix by calculating a coefficient approximation, wherein the coefficient approximation is mathematically expressed as $\left[\begin{array}{c}\frac{1}{1-{}_1}\\ \frac{1}{1-{}_2}\\ M\\ \frac{1}{1-{}_K}\end{array}\right]\left[\begin{array}{cccc}1& {}_1& & {}_1^{L-1}\\ 1& {}_2& & {}_2^{L-1}\\ M& M& M& M\\ 1& {}_K& & {}_K^{L-1}\end{array}\right]\left[\begin{array}{c}{}_0\\ {}_1\\ M\\ {}_{L-1}\end{array}\right],$ .sub.1.sup..sub.K are the eigenvalues of the intermediate matrix, and .sub.1.sup..sub.K are the coefficients of the L-term approximated matrix; determining the matrix inversion according to the L-term approximated matrix with the determined coefficients of the L-term approximated matrix; and applying the matrix inversion for precoding transmit data or equalization on received data.

2. The method for MIMO communication as claimed in claim 1, wherein determining the eigenvalues of the intermediate matrix according to the antenna information and the channel information comprises: determining the eigenvalues of the intermediate matrix according to an eigenvalue transformation, wherein the eigenvalue transformation is mathematically expressed as ${}_{k}1-\frac{{}_k}{N}=1-\frac{N.Math..Math.{\hat{c}}^2}{},$ k is a positive integer where 1kK, .sub.k is eigenvalue of the KK matrix, N is a positive integer according to the antenna information, .sub.k=/.sup.2, ={square root over (K/P.sub.H)}, and P.sub.H is an average power of channel matrix according to the channel information.

3. The method for MIMO communication as claimed in claim 1, wherein calculating the coefficient approximation comprises: determining an optimized result of the coefficient approximation through a curve fitting procedure.

4. The method for MIMO communication as claimed in claim 3, wherein the curve fitting procedure is a least-squares approximation.

5. The method for MIMO communication as claimed in claim 1, wherein the L-term approximated matrix is mathematically expressed as $D^{-1/2}\left(\underset{=0}{\overset{L-1}{.Math.}}.Math.{}_{}.Math.B^{}\right).Math.D^{-1/2},$ D is a diagonal matrix related to the KK matrix, .sub. is the coefficient of the L-term approximated matrix, and B is the intermediate matrix.

6. (canceled)

7. A communication device for MIMO communication, comprising: a transmitting module, transmitting data; a receiving module, receiving data; and a processor, coupled to the transmitting module and the receiving module, and configured at least for: obtaining antenna information and channel information; determining eigenvalues of an intermediate matrix according to the antenna information and the channel information, wherein the intermediate matrix is related to an L-term approximated matrix for Neumann series expansion of a matrix inversion, the matrix inversion is an inverse of a KK matrix, L is a positive integer, and K is a positive integer according to the antenna information; determining coefficients of the L-term approximated matrix from the eigenvalues of the intermediate matrix by calculating a coefficient approximation, wherein the coefficient approximation is mathematically expressed as $\left[\begin{array}{c}\frac{1}{1-{}_1}\\ \frac{1}{1-{}_2}\\ M\\ \frac{1}{1-{}_K}\end{array}\right]\left[\begin{array}{cccc}1& {}_1& & {}_1^{L-1}\\ 1& {}_2& & {}_2^{L-1}\\ M& M& M& M\\ 1& {}_K& & {}_K^{L-1}\end{array}\right]\left[\begin{array}{c}{}_0\\ {}_1\\ M\\ {}_{L-1}\end{array}\right],$ .sub.1.sup..sub.K are the eigenvalues of the intermediate matrix, and .sub.1.sup..sub.K are the coefficients of the L-term approximated matrix; determining the matrix inversion according to the L-term approximated matrix with the determined coefficients of the L-term approximated matrix; and applying the matrix inversion for precoding transmit data or equalization on received data.

8. The communication device for MIMO communication as claimed in claim 7, wherein the processor is further configured at least for: determining the eigenvalues of the intermediate matrix according to an eigenvalue transformation, wherein the eigenvalue transformation is mathematically expressed as $\begin{array}{cc}{}_{k}1-\frac{{}_k}{N}=1-\frac{N.Math..Math.{\hat{c}}^2}{},& \end{array}$ k is a positive integer where 1kK, .sub.k is eigenvalue of the KK matrix, N is a positive integer according to the antenna information, .sub.k=/.sup.2, ={square root over (K/P.sub.H)}, and P.sub.H is an average power of channel matrix according to the channel information.

9. The communication device for MIMO communication as claimed in claim 7, wherein the processor is further configured at least for: determining an optimized result of the coefficient approximation through a curve fitting procedure.

10. The communication device for MIMO communication as claimed in claim 9, wherein the curve fitting procedure is a least-squares approximation.

11. The communication device for MIMO communication as claimed in claim 7, wherein the L-term approximated matrix is mathematically expressed as $D^{-1/2}\left(\underset{=0}{\overset{L-1}{.Math.}}.Math.{}_{}.Math.B^{}\right).Math.D^{-1/2},$ D is a diagonal matrix related to the KK matrix, .sub. is the coefficient of the L-term approximated matrix, and B is the intermediate matrix.

12. (canceled)

13. A communication system for MIMO communication, comprising: K first communication devices, each of the communication devices comprising single antenna, and K being a positive integer; a second communication device, comprising N antennas, wherein N is a positive integer, and the second communication device is configured at least for: obtaining antenna information and channel information; determining eigenvalues of an intermediate matrix according to the antenna information and the channel information, wherein the intermediate matrix is related to an L-term approximated matrix for Neumann series expansion of a matrix inversion, the matrix inversion is an inverse of a KK matrix, L is a positive integer, and K is determined according to the antenna information; determining coefficients of the L-term approximated matrix from the eigenvalues of the intermediate matrix by calculating a coefficient approximation, wherein the coefficient approximation is mathematically expressed as $\left[\begin{array}{c}\frac{1}{1-{}_1}\\ \frac{1}{1-{}_2}\\ M\\ \frac{1}{1-{}_K}\end{array}\right]\left[\begin{array}{cccc}1& {}_1& & {}_1^{L-1}\\ 1& {}_2& & {}_2^{L-1}\\ M& M& M& M\\ 1& {}_K& & {}_K^{L-1}\end{array}\right]\left[\begin{array}{c}{}_0\\ {}_1\\ M\\ {}_{L-1}\end{array}\right],$ .sub.1.sup..sub.K are the eigenvalues of the intermediate matrix, and .sub.1.sup..sub.K are the coefficients of the L-term approximated matrix; determining the matrix inversion according to the L-term approximated matrix with the determined coefficients of the L-term approximated matrix; and applying the matrix inversion for precoding transmit data or equalization on received data.

14. The communication system for MIMO communication as claimed in claim 13, wherein the second communication device is further configured at least for: determining the eigenvalues of the intermediate matrix according to an eigenvalue transformation, wherein the eigenvalue transformation is mathematically expressed as ${}_{k}1-\frac{{}_k}{N}=1-\frac{N.Math..Math.{\hat{c}}^2}{},$ k is a positive integer where 1kK, .sub.k is eigenvalue of the KK matrix, N is a positive integer according to the antenna information, .sub.k=/.sup.2, ={square root over (K/P.sub.H)}, and P.sub.H is an average power of channel matrix according to the channel information.

15. The communication system for MIMO communication as claimed in claim 13, wherein the second communication device is further configured at least for: determining an optimized result of the coefficient approximation through a curve fitting procedure.

16. The communication system for MIMO communication as claimed in claim 15, wherein the curve fitting procedure is a least-squares approximation.

17. The communication system for MIMO communication as claimed in claim 13, wherein the L-term approximated matrix is mathematically expressed as $D^{-1/2}\left(\underset{=0}{\overset{L-1}{.Math.}}.Math.{}_{}.Math.B^{}\right).Math.D^{-1/2},$ D is a diagonal matrix related to the KK matrix, .sub. is the coefficient of the L-term approximated matrix, and B is the intermediate matrix.

18. (canceled)

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0008] The accompanying drawings are included to provide a further understanding of the disclosure, and are incorporated in and constitute a part of this specification. The drawings illustrate embodiments of the disclosure and, together with the description, serve to explain the principles of the disclosure.

[0009] FIG. 1 is a schematic diagram illustrating a communication system according to a preferred embodiment of the present disclosure.

[0010] FIG. 2 is a block diagram of a base station according to the preferred embodiment of the present disclosure.

[0011] FIG. 3 is a block diagram of one of communication devices according to the preferred embodiment of the present disclosure.

[0012] FIG. 4 is a flow chart of a method for MIMO communication according to the preferred embodiment of the present disclosure.

DETAILED DESCRIPTION OF THE DISCLOSURE

[0013] Reference will now be made in detail to the present preferred embodiments of the disclosure, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the description to refer to the same or like parts.

[0014] FIG. 1 illustrates a communication system 1 for multiple-input-multiple-output (MIMO) communication according to a preferred embodiment of the present disclosure. Referring to FIG. 1, the communication system 1 may include but not limited to a base station 20 and K user equipments 30, where K is a positive integer.

[0015] The term base station (BS) such as the BS 20 in this disclosure could represent various embodiments which for example could include but not limited to a Home Evolved Node B (HeNB), an eNB, an advanced base station (ABS), a base transceiver system (BTS), an access point, a home base station, a relay station, a scatterer, a repeater, an intermediate node, an intermediary, and/or satellite-based communication base stations. As illustrated in FIG. 2, the BS 20 would include at least but not limited to N antennas 21, a transmitting module 23, a receiving module 25, an analog-to-digital (A/D)/digital-to-analog/(D/A) converter 27 and a processing module 29. The transmitting module 23 and the receiving module 25 are used for transmitting and receiving modulated signals respectively, which could be wireless radio frequency (RF) signals through one or more antennas 21. The transmitting module 23 and the receiving module 25 may also perform operations such as low noise amplifying, impedance matching, frequency mixing, up or down frequency conversion, filtering, amplifying, and other related functions. The A/D and D/A converter 27 is configured to convert an analog signal format to a digital signal format during uplink communication and from a digital signal format to an analog signal format during downlink communication. The processing module 29 is configured to process digital signal and to perform a proposed method for MIMO system described as follows in accordance with exemplary embodiments of the present disclosure. Also, the processing module 29 may optionally be coupled to a non-transitory memory module 22 to store programming codes, configurations, channel information, antenna information, eigenvalues, coefficients, parameters, and so forth. The functions of the processing module 29 could be implemented by using programmable units such as a micro-processor, a micro-controller, a DSP chips, FPGA, etc. The functions of the processing module 29 may also be implemented with separate electronic devices or ICs, and functions performed by the processing module 29 may also be implemented within the domains of either hardware or software.

[0016] As illustrated in FIG. 3, the term user equipment (UE) such as the UEs 30 in this disclosure could represent various embodiments which for example could include but not limited to a mobile station, an advanced mobile station (AMS), a server, a client, a desktop computer, a laptop computer, a network computer, a workstation, a personal digital assistant (PDA), a tablet personal computer (PC), a scanner, a telephone device, a pager, a camera, a television, a hand-held video game device, a musical device, a wireless sensor, a mobile/portable communication device and so forth. In some applications, UE 30 may be a fixed device operating in a mobile environment, such as a bus, train, an airplane, a boat, a car, and etc. Each UE 30 may be represented by at least the functional elements as illustrated in FIG. 3 in accordance with an embodiment of the present disclosure. Each UE 30 would include at least but not limited to an antenna 31, a memory module 32, a transmitting module 33, a receiving module 35, an A/D/D/A converter 37 and a processing module 39. The detailed description of functional elements of UE 30 may be referred to the description of functional elements of the BS 20 in FIG. 2, and therefore detailed descriptions for each element will not be repeated.

[0017] In one scenario, downlink communication is considered, the processing module 29 of the BS 20 precodes a complex-valued symbol vector s.sup.K.sup..sup.1 to a data vector (x=Fs) by a linear precoder (F={tilde over (F)}, {tilde over (F)}.sup.N.sup..sup.K, ={square root over (P)}/{tilde over (F)}.sub.F) and then transmits the data vector x through the transmitting module 23 and the antennas 21 over a downlink channel. It is assumed that the components of s are normalized to unit energy. The matrix {tilde over (F)} denotes an unnormalized precoder, and is a power scaling factor to restrain total transmit power E{x.sup.2}=P. If a channel matrix H.sub.DL .sup.K.sup..sup.N for the downlink channel is considered, the unnormalized precoder using zero-forcing (ZF) precoding would be represented as {tilde over (F)}=H.sub.DL.sup.H(H.sub.DLH.sub.DL.sup.H).sup.1.

[0018] On the other hand, in another scenario where uplink communication is considered, the received data vector over a uplink channel by the receiving module 25 of the BS 20 can be concisely described as y.sub.BS=H.sub.ULs+w.sub.BS, where H.sub.UL.sup.N.sup..sup.K denotes the channel matrix for the uplink channel, and w.sub.BS is noise vector. It is assumed that a linear detection is deployed by the processing module 29 of the BS 20, the detected symbol from the kth UE 30 is obtained as .sub.k=Q([Wy.sub.BS].sub.k), where Q(.) denotes the operation that quantizes each element of the input vector to the nearest symbol in a constellation set, and W.sup.K.sup..sup.N denotes an equalizer of the BS 20. If a ZF equalization is implemented, the equalizer would be represented as W=(H.sub.UL.sup.HH.sub.UL).sup.1 H.sub.UL.sup.H.

[0019] According to the aforementioned scenarios, for both equalizer and precoder implementing ZF equalization/precoding, the matrix inverse operation for (H.sub.DLH.sub.DL.sup.H).sup.1 and (H.sub.UL.sup.HH.sub.UL).sup.1 may need to be performed by the processing module 29 of the BS 20. Therefore, providing a method for the matrix inverse operation with high precision and low complexity would be an objective which communication relevant industries and researchers want to achieve. The following description would introduce the proposed method for the matrix inverse operation briefly. For convenience, in the following description, the BS 20 would be considered as an exemplary entity for implementing the proposed method of the disclosure. In addition, it is defined that a channel matrix HH.sub.UL for uplink transmission and HH.sub.DL for downlink transmission, and a matrix inversion is considered as G.sup.1 which is an inverse of a KK matrix G (GH.sup.HH). With the aforementioned notation, both uplink and downlink scenarios would be investigated under a unified context.

[0020] Neumann series expansion of the matrix inversion G.sup.1 can be mathematically expressed as follows:

[00004]$\begin{array}{cc}{G}^{-1}=\underset{l=0}{\overset{}{.Math.}}.Math.{\left(-D^{-1}.Math.E\right)}^l.Math.D^{-1},& \left(1\right)\end{array}$

where D is a diagonal matrix related to the KK matrix G in which D=diag{[G].sub.1,1, [G].sub.2,2, . . . , [G].sub.K,K}, E is an off diagonal matrix related to the KK matrix G in which G=D+E.

[0021] An L-term Neumann series expansion is used as an approximation for to the matrix inversion G.sup.1, and the L-term Neumann series expansion of the matrix inversion G.sup.1 can be mathematically expressed as follow:

[00005]$\begin{array}{cc}{G}^{-1}\underset{l=0}{\overset{L-1}{.Math.}}.Math.{\left(-D^{-1}.Math.E\right)}^l.Math.D^{-1},& \left(2\right)\end{array}$

where L is a finite positive integer.

[0022] FIG. 4 is a flow chart illustrating method for MIMO communication in accordance with an embodiment of the present disclosure. In step S41, the processing module 29 of the BS 20 obtains antenna information and channel information. The antenna information may include not only the number N of the antennas 21 but also the number K of the UEs 30. The channel information may include the average power of the channel matrix H.

[0023] In step S43, the processing module 29 of the BS 20 determines eigenvalues .sub.k of an intermediate matrix B according the antenna information and the channel information, where the intermediate matrix B is related to an L-term approximated matrix A.sub.L for Neumann series expansion of the matrix inversion G.sup.1. Specifically, according to (1), the matrix inversion G.sup.1 can also be mathematically expressed as follow:

G.sup.1=D.sup.1/2(I+B+B.sup.2+ . . . )D.sup.1/2(3),

where I is an identity matrix, the intermediate matrix B is defined as BD.sup.1/2ED.sup.1/2, and D.sup.1/2 is the matrix square root of D.sup.1. It is worthwhile noted that the intermediate matrix B and D.sup.1E process identical eigenvalues and hence the series (3) converges if and only if (1) converges.

[0024] In order to improve performance, a modified L-term approximated matrix for Neumann series expansion of the matrix inversion G.sup.1 is considered, which is mathematically expressed as follows:

[00006]$\begin{array}{cc}{A}_L.Math.\stackrel{}{=}.Math..Math.D^{-1/2}\left(\underset{l=0}{\overset{L-1}{.Math.}}.Math.{}_l.Math.B^l\right).Math.D^{-1/2}& .Math.\left(4\right)\\ =.Math.\underset{l=0}{\overset{L-1}{.Math.}}.Math.{{}_l\left(-D^{-1}.Math.E\right)}^l.Math.D^{-1}& .Math.\left(5\right)\end{array}$

where are coefficients of the L-term approximated matrix A.sub.L.

[0025] In the present disclosure, a coefficient approximation is a coefficient estimation procedure to calculate the coefficients of the L-term approximated matrix A.sub.L, and the coefficient approximation can be mathematically expressed as follows:

[00007]$\begin{array}{cc}\left[\begin{array}{c}\frac{1}{1-{}_1}\\ \frac{1}{1-{}_2}\\ \mathrm{.Math.}\\ \frac{1}{1-{}_K}\end{array}\right]\left[\begin{array}{cccc}1& {}_1& \mathrm{.Math.}& {}_1^{L-1}\\ 1& {}_2& \mathrm{.Math.}& {}_2^{L-1}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ 1& {}_K& \mathrm{.Math.}& {}_K^{L-1}\end{array}\right]\left[\begin{array}{c}{}_0\\ {}_1\\ \mathrm{.Math.}\\ {}_{L-1}\end{array}\right],& \left(6\right)\end{array}$

where .sub.1.sub.K are the eigenvalues of the intermediate matrix B, and .sub.1.sub.K are the coefficients of the L-term approximated matrix A.sub.L.

[0026] The processing module 29 of the BS 20 may determine the eigenvalues .sub.k of the intermediate matrix B according to an eigenvalue transformation which is mathematically expressed as follows:

[00008]$\begin{array}{cc}{}_{k}1-\frac{{}_k}{N}=1-\frac{N.Math..Math.{\hat{c}}^2}{},& \left(7\right)\end{array}$

k is a positive integer where 1kK, .sub.k is eigenvalue of the KK matrix G, .sub.k=/.sup.2, ={square root over (K/P.sub.H)}, and P.sub.H is the average power of the channel matrix H according to the channel information in which P.sub.H=tr{HH.sup.H}. The approximation for the eigenvalue follows the Marcenko-Pastur law based on the random matrix theory. If a normalized random matrix is considered with the number N of the antennas 21 and the number K of the UEs 30 approaching infinity, the distribution of eigenvalues may approach Marcenko-Pastur distribution. The probability density function of Marcenko-Pastur distribution can be approximated to a K-bin probability histogram with non-uniform bin-widths where each bin is designed to contain 1/K of probability mass. Therefore, the approximation for the eigenvalue can be obtained according to the probability histogram.

[0027] It should be noticed that, there may be lots of methods for calculating eigenvalues .sub.k of the KK matrix G or eigenvalues .sub.k of the intermediate matrix B. For example, if the channel matrix H is correlated, the coefficient correlation of the channel matrix H would be taken into account, and the eigenvalue transformation would need to be modified; alternatively, Bisection method, Laguerre iteration, and the like may be implemented with the needed information. However, the proposed eigenvalue transformation has a less computational complexity.

[0028] In step S45, the processing module 29 of the BS 20 determines the coefficients .sub.k of the L-term approximated matrix A.sub.L from the eigenvalues .sub.k of the intermediate matrix B by calculating the coefficient approximation (such as equation (6)). In the present embodiment, the eigenvalues .sub.k of the intermediate matrix B determined at step S43 is obtained, and then the processing module 29 determines an optimized result of the coefficient approximation through a curve fitting procedure which is a least-squares (LS) approximation.

[0029] It should be noted that, for curve fitting procedure, LS approximation is adopted because of its low complexity. In LS approximation, the L2 norm of the residual (i.e. left-hand side of coefficient approximation minus the right-hand side of coefficient approximation) is minimized. One can also minimizes L1 norm, or the L-infinity norm instead, which both can be converted to linear-programming problems and can be solved using Simplex methods or interior point methods (with higher complexity). Another possible way for curve fitting procedure is to use total-least-squares (TLS) approximation instead of LS approximation. However, LS approximation has less computational complexity than TLS approximation.

[0030] In step S47, the processing module 29 of the BS 20 determines the matrix inversion G.sup.1 according to the L-term approximated matrix with the determined coefficients .sub.k. In other words, the coefficients .sub.k determined at step S45 is used to construct the L-term approximated matrix A.sub.L, so as to determine the matrix inversion G.sup.1. As a result, the matrix inversion G.sup.1 can be applied on ZF precoding or equalization such as the unnormalized precoder {tilde over (F)} and the equalizer W. For example, the matrix inversion G.sup.1=(H.sup.HH).sup.1 is substituted in the equalizer W=(H.sub.UL.sup.HH.sub.UL).sup.1H.sub.UL.sup.H.

[0031] It should be noted that, while the proposed method of the present embodiment is developed for finding an approximation for the matrix inversion (G.sup.1=(H.sup.HH).sup.1), it can be extended in other embodiments to find an approximation for G.sup.1 with =G+I.sub.K, where >0 is a constant that appears in minimum-mean-square-error (MMSE) or regularized ZF precoders/equalizers. The modified eigenvalue transformation would be

[00009]${\stackrel{.Math.}{}}_k={\mathrm{eig}}_k\left(\stackrel{.Math.}{B}\right)=\frac{N}{N+}-\frac{\left(N+\right).Math.{\hat{c}}^2}{}.$

[0032] In the proposed method, only the antenna information such as the number N of the antennas 21 and the number K of the UEs 30 would be needed for determining the eigenvalues .sub.k of an intermediate matrix B, and the determined result can be pre-stored in the memory module 22, so that the processing module 29 would not need to determine the eigenvalues .sub.k. In addition, the eigenvalue transformation is merely related to the average power P.sub.H of the channel matrix H instead of instant values of the channel matrix H. Comparing with the instant values of the channel matrix H, the average power P.sub.H has less variation, so that the processing module 29 does not need to update the average power P.sub.H or calculate the average power P.sub.H all the time. Furthermore, the implementation complexity of the L-term approximated matrix is almost the same with the conventional Neumann series expansion based method, but the presented method has higher precision.

[0033] It should be noted that, aforementioned embodiment is used for the communication system 1 including K first communication devices with single antenna such as the UEs 30 and a second communication device with N antennas such as the BS 20. However, based on the spirit of the aforementioned embodiment, the proposed method may be utilized on the UEs 30 or other UE with multiple antennas. It means the processing module of UEs 30 or other UE with multiple antennas such as processing module 39 may perform the operation of equalizer/precoder.

[0034] In conclusion, the present disclosure provides the method for MIMO system. In contrast to the existing methods which are mostly derived from the Neumann series expansion framework, additional coefficients have been introduced in the proposed method to enhance the precision of approximation. Efficient algorithm for the coefficient design is presented which includes the eigenvalue transformation based on the random matrix theory and the curve fitting procedure for optimizing the coefficients. With the enhancement of the approximation precision, lower error probability and higher spectrum efficiency would be achieved. In addition, the proposed method exhibits practically similar computational complexity while achieving substantial performance enhancement compared to other existing method.

[0035] The above description represents merely the preferred embodiment of the present disclosure, without any intention to limit the scope of the present disclosure. The simple variations and modifications not to be regarded as a departure from the spirit of the disclosure are intended to be included within the scope of the following claims.