CN106130690A - Mimo system joint-detection interpretation method in conjunction with polarization code - Google Patents

Abstract

The present invention discloses the mimo system joint-detection interpretation method of a kind of combination polarization code, comprises the steps: 1) initialization path list and PED list thereof；2) structure reduction tree3) successively carry out Path extension, update path list and PED list thereof；5), after completing the Path extension of all layers, firmly input or soft input decoding.The inventive method combines the encoding characteristics of polarization code, it is to avoid the extension of Invalid path and renewal, reduces the computation complexity of entirety, improves the BER performance of system simultaneously.

Description

Mimo system joint-detection interpretation method in conjunction with polarization code

Technical field

The invention belongs to wireless communication technology field, be the low-complexity joint of the mimo system being applied to polarization code coding Detection interpretation method.

Background technology

Mobile communication experienced by first generation analogue communication (1G), second filial generation cellular digital communication (2G), third generation CDMA loose The development course of band communication (3G), has had been enter into the application stage of forth generation mobile communication (4G) industrialization at present.Mobile communication Just towards two-forty, high power capacity, the direction of spectral efficient and low-power consumption develops, constantly meet the growing data of people and Video requirement.According to major carrier and authority's advisory organization prediction: mobile broadband service flow will increase by 1000 at coming 10 years Times.Existing 4G technology the aspect such as transfer rate and resource utilization still cannot meet future demand, its wireless coverage and Consumer's Experience also needs to be improved further.Countries in the world promote 4G industrialization work while, the 5th third-generation mobile communication technology (5G) study hotspot of domestic and international wireless communication field has been had become as.

The significant key technology of 5G mobile communication be mainly reflected in the Radio Transmission Technology of EHP and high density without Line network technology.Radio Transmission Technology based on extensive multiple-input and multiple-output (MIMO) is it would be possible to make spectrum efficiency and power Efficiency promotes a magnitude on the basis of 4G again.Meanwhile, high-performance, high efficiency channel coding technology also will become 5G An important research direction.As first chnnel coding that can reach Shannon capacity, polarization code is information theory and nothing The important breakthrough of the line communications field, causes the extensive concern of academia and industrial quarters.Whole new set of applications field in 5G mobile communication Under scape, polarization code will replace Turbo code and LDPC code, becomes the candidate of channel error correction coding.Research is applicable to polarization code The joint-detection interpretation method of the mimo system of coding has great theory significance and using value.

In pertinent literature about mimo system detection, have in a large number for preferable error performance, low complex degree and low delay The correlational study of MIMO detector.Maximum likelihood detector (ML) is ideal detector, and its computation complexity is along with launching sky The increase of line is in exponential increase.The K-best of soft output and globular decoding (SD) algorithm, due to the detection performance of its near-optimization With reduce complexity and become the study hotspot of mimo system.In recent years, the list polarization code decoder of successive elimination is because of it Cause pay close attention to widely close to optimum detection performance.In the mimo system of polarization code coding, detector is first from connecing The signal received is estimated send symbol.Then, decoder recovers information bit from the symbol estimated.MIMO in conjunction with polarization code Technology will be greatly improved power system capacity and data rate.Meanwhile, this also considerably increases the complexity of receiver.Ordinary circumstance Under, detect and decode and be often considered as two independent processing modules.Output information is mutual iteration between two standalone modules, Thus improve BER performance.But, the detection decoding of iteration will increase system delay.Therefore, research combines the associating of polarization code MIMO detection decoding technique is significant.

Summary of the invention

Goal of the invention: in order to overcome the problems referred to above of existing independent MIMO detection decoder, the present invention proposes a kind of low The joint-detection interpretation method of complexity, in conjunction with the encoding characteristics of polarization code, reduces route searching in tradition K-best detection Scope.

Technical scheme: in the present invention, it is contemplated that launching antenna number is N_t, reception antenna number is N_rMIMO up-link. Employing code check R=1/2 (N, K,) polarization code coding, wherein N, K,WithRepresent that code length, information bit are long respectively Degree, the set of information bit and idle ratio paricular value.For the K-Best algorithm of breadth-first, choose every time and there is least part Europe The K of formula distance (PED)_pPaths list P_newAs path candidate, corresponding path metric value list is L_new.Launch complex value to Each symbol in amount takes from rectangle quadrature amplitude modulation (QAM) constellation set Θ,Wherein, Q is modulation star Seat spot size, M_cBit number is comprised for each transmitting symbol.With the method for real-valued decomposition (RVD), N_t×N_rComplex value mimo system 2N can be equivalent to_t×2N_rReal-valued system, the collection launching real-valued symbol is combined into Ω.

In joint-detection decoding (JDD) algorithm, n channel realizes needing to consider simultaneously.The transmitting vector of i-th channel For x_i, channel matrix is H_i, additive white Gaussian noise is n_i, receiving vector is y_i.Through channel matrix QR decomposing H_i=Q_iR_i, z_i =Q^H _iy_i, the deformation z receiving vector of n channel is represented by z=Rx+n, i.e.

K information bit is encoded obtains the output of N number of coded-bit.For each code word, channel realizes number n=N/ (N_tM_c), detailed system configures as shown in Figure 1.Therefore, the search number of plies of tree is by 2N_tIncrease to 2N_tn.It should be noted that The 1st layer of search tree represents the 2N of matrix R_tN row, the 2N of search tree_tN-layer represents the 1st row of matrix R.

Being different from traditional iterative detection decoding algorithm based on factor graph, the present invention proposes a kind of combination polarization code Mimo system tree-like joint-detection interpretation method, specifically includes following steps:

1) initialization path list and PED list: P thereof₀=[0,0 ..., 0], PED₀=[0,0 ..., 0].

2) structure reduction treeEncode in conjunction with polarization code, 2^NIndividual code word contains only 2^KIndividual effective code word, i.e. preferable ML inspection SurveySearching route in only havePaths results from effective code word, referred to as active path, in Path extension process In, the tree that only extremely efficient path is constituted is referred to as reducing tree.

3) reduction tree is combinedI-th (i > 0) layer, to the i-th-1 layerIn each Its active path of Path extension, obtains the path list updatedAccording to PED_i-1Updated PED listWherein K_pRepresent each layer of survivor path number, P_i,jRepresent The j bar survivor path of i-th layer, PED_i,jRepresenting the metric of the j bar survivor path of i-th layer, Q represents modulation constellation spot size；

According to PED_i-1Obtain PED_newSpecific formula for calculation be:

${\mathrm{PED}}_{\mathrm{new}}={\mathrm{PED}}_{i-1}+{\left|\right|z_{2n{N}_t+1-i}-\underset{j=2n{N}_t+1-i}{\overset{2n{N}_t}{\mathrm{\Σ}}}{r}_{\mathrm{lj}}{x}_j\left|\right|}^2---\left(11\right)$

Wherein, N_tFor launching antenna number, x_jThe transmitting symbol of data stream, z is launched for jth_jData stream is received for jth Reception signal, R is that channel matrix QR decomposes the upper triangular matrix that obtains, r_ljL row j column element for upper triangular matrix R.

4) detection has been judged whether, if i=2N_tN, represents and arrives leaf node layer, then output path candidate listAnd PED listOtherwise, PED list PED is chosen_newThe K of middle minimum_pIndividual value constitutes PED_i, The K of its correspondence_pPaths is as the path candidate list P of i-th layer_i, make i=i+1, return step 3 and carry out next layer of path expansion Exhibition, wherein N_rRepresenting reception antenna number, n is the number of channel.

5) firmly input or soft input decodes: when using hard input decoding, output optimal path The path that i.e. in the path metric value vector of last layer, the minima of each is corresponding, carries out reflection by the path of its correspondence and penetrates Obtaining launching code word, input SSC decoder i.e. obtains decoding result；When using soft input decoding, first combineIn K_p The PED value of paths, calculates the LLP receiving vector y, and then input SCL decoder recovers information bit；

The concrete formula calculating the LLP receiving vector y is:

Wherein,The symbol x of data stream is launched for kth_kIth bit,For all symbols that ith bit is b Set, b ∈ { 0,1}, σ²For the variance of noise n, z is the deformation receiving vector by n channel, and R is that channel matrix QR divides The upper triangular matrix that solution obtains, x is the transmitting vector of n channel.

Beneficial effect: MIMO technology is combined by the present invention with the polarization code up to shannon capacity, improves system Capacity and data rate.Encoding characteristics in conjunction with polarization code, it is to avoid the extension of Invalid path and renewal, reduces the meter of entirety Calculate complexity, improve the BER performance of system simultaneously.Additionally, the JDD algorithm using SSC firmly to decode, use efficient streamline Encoder completes decoded operation, reduce further hard-wired complexity, improves system throughput, is ensureing preferably Under BER performance premise, it is adaptable to high-throughput and the application scenarios of low complex degree.

Accompanying drawing explanation

Fig. 1 is mimo system configuration in JDD algorithm；

Fig. 2 is the tree search process (16-QAM) of 2 × 2 mimo system joint-detection decoding algorithms；

Fig. 3 is the performance comparison (4-QAM) of 4 × 4 mimo system difference detection decoding algorithms；

Fig. 4 is the performance comparison (16-QAM) of 4 × 4 mimo system SDD and JDD algorithm.

Detailed description of the invention

Below in conjunction with being embodied as case, it is further elucidated with the present invention, it should be understood that these embodiments are merely to illustrate this Bright rather than limit the scope of the present invention, after having read the present invention, those skilled in the art are various etc. to the present invention's The amendment of valency form all falls within the application claims limited range.

In order to be better understood from the present invention, first each method that the present invention relates to simply is introduced.

In mimo system pretreatment, the QR being ranked up channel matrix decomposes (SQRD).There is highest signal to noise ratio (SNR) signal is detected at first, and the signal with minimum SNR is finally detected, thus reduces error propagation.At SQRD Reason, the Maximum Likelihood Detection problem of mimo system can be converted into a 2N_tThe tree search problem of layer.The inspection of this breadth-first Survey method is referred to as K-best algorithm.

In hard decision, K-best detector selects the path at leaf node with least part Euclidean distance (PED) As optimal path, and output estimation symbol.The symbol estimated obtains coded-bit by demodulation, and coded-bit is again through once The information bit that polarization code code restoration is original.This method is referred to as the polarization code decoding of hard input.Soft-decision is exported, leaf All survivor paths at child node are combined, and calculate the log-likelihood probability (LLP) receiving vector y.Polarization code continuous Eliminate list (SCL) decoder and recover information bit according to the Soft Inform ation LLP received.This method is referred to as the polarization of soft input Code decoding.

In separate detection decoding (SDD) algorithm, each channel realizes the transmitting vector that individual processing obtains estimating.Mesh Front common joint-detection decoder is that iteration based on factor graph realizes mostly.In the present invention, the joint-detection of proposition is translated Code (JDD) algorithm tree structure based on breadth-first search.This algorithm needs to consider that several channels realize simultaneously.For pole Change the mimo system of code coding, it is assumed that the path that can produce effective polarization code is active path.In traditional K-best detection In, each layer is required for extensionPaths.Encoding in conjunction with polarization code, these paths are also not all effective.Calculate at JDD In method, each layer needs only to the path of extremely efficient, thereby produces the tree of reduction.Tree based on this reduction, carries out path Extension and renewal.Based on performance and implementation complexity, JDD method uses two kinds of interpretation methods of SCL and SSC to recover raw information ratio Special.

Polarization code coding and decoding

Assuming that decoder input isIt is output asG_NAnd B_NRepresent respectively Generator matrix and bit inverted sequence reset permutation matrix.Then the coding of polarization code is represented by:

$x_1^N=u_1^N{G}_N=u_1^N{F}^{\⊗n_s}{B}_N,---\left(2\right)$

Wherein,n_sRepresent the exponent number of decoder,RepresentKronecker amass.

Being similar to K-best algorithm, SCL decoding is also the searching algorithm of breadth-first, successively extends also on full binary tree Select optimal path.Therefore, SCL decoding can be in conjunction with K-best algorithm, it is achieved joint-detection decodes.

SDD algorithm

If in equivalent real-valued mimo system, launch vector be x, channel matrix is H, and additive white Gaussian noise is n, reception to Amount is y.The QR exploded representation of channel matrix is H=QR.Wherein, Q is 2N_r×2N_tMatrix, R is 2N_t×2N_tUpper three angular moments Battle array.In K-best detector, estimate vectorIt is represented by:

$\hat{x}=\underset{\hat{x}\∈\mathrm{\Ω}}{\mathrm{argmin}}\left|\right|z-Rx|{|}^2=\underset{\hat{x}\∈\mathrm{\Ω}}{\mathrm{argmin}}\underset{l=1}{\overset{2N_t}{\mathrm{\Σ}}}||z_l-\underset{j=l}{\overset{2N_t}{\mathrm{\Σ}}}{r}_{lj}{x}_j|{|}^2---\left(3\right)$

Formula (3) can regard a 2N as_tThe tree search problem of layer, each node hasIndividual child nodes.In tree Each layer, retains K_pBar has the path of minimum PED value as survivor path.At i-th layer of tree, the PED of extensions path can table It is shown as:

${\mathrm{PED}}_i=\underset{l=1}{\overset{2N_t-i+1}{\mathrm{\Σ}}}\left|\right|z_l-\underset{j=1}{\overset{2N_t}{\mathrm{\Σ}}}{r}_{lj}{x}_j|{|}^2---\left(4\right)$

In SDD algorithm, all of path candidate of leaf node layer is combined, and calculates the LLP receiving vector y.False Determine symbol x_kIth bit be designated asThen the LLP of y is calculated as follows:

Wherein,Represent the set of all symbols that ith bit is b, b ∈ { 0,1}, σ²Variance for noise n.SCL translates Code device is according to the Soft Inform ation LLP original information bit of recovery received.SSD algorithm is only to have mimo system K-best inspection Survey the simple cascade of device and polarization code SCL decoder, the benchmark of the joint-detection decoding algorithm that can propose as the present invention.

The present invention proposes the mimo system tree-like joint-detection interpretation method of a kind of combination polarization code, and operating procedure is as follows:

1) initialization path list and PED list: P thereof₀=[0,0 ..., 0], PED₀=[0,0 ..., 0].

2) structure reduction treeEncode in conjunction with polarization code, 2^NIndividual code word contains only 2^KIndividual effective code word.That is, ideal ML inspection SurveySearching route in only havePaths results from effective code word, referred to as active path.In Path extension process In, the tree that only extremely efficient path is constituted is referred to as reducing tree.

3) reduction tree is combinedI-th (i > 0) layer, to the i-th-1 layerIn each Its active path of Path extension, obtains the path list updatedAnd obtain more according to formula 4 New PED list

4) detection has been judged whether, if i=2N_tN, represents and arrives leaf node layer, then output path candidate listAnd PED listOtherwise, PED list PED is chosen_newThe K of middle minimum_pIndividual value constitutes PED_i, The K of its correspondence_pPaths is as the path candidate list P of i-th layer_i, make i=i+1, return step 3 and carry out next layer of path expansion Exhibition.

5) firmly input or soft input decodes: when using hard input decoding, output optimal path The path that i.e. in the path metric value vector of last layer, the minima of each is corresponding, carries out reflection by the path of its correspondence and penetrates Obtaining launching code word, input SSC decoder i.e. obtains decoding result；When using soft input decoding, first combineIn K_p The PED value of paths, calculates the LLP receiving vector y according to formula 5, and then input SCL decoder recovers information bit.

SCL decoder operation principle is as follows:

1) initialization path list: path₀=[0,0 ..., 0], metric list:

2) successively Path extension: at i-th (i > 0) layer, to the i-th-1 layer path list path_i-1=[path_(i-1),1, path_(i-1),2,...,path_(i-1),L] each paths in (L represents every layer of survivor path number), add one " 0 " and " 1 " respectively Be expanded path list path_i=[path_i1,path_i,2,...,path_i,2L], and measured according to following iterative formula Value list

$\{\begin{array}{c}{w}_N^{(2i-1)}(y_1^N,{\hat{u}}_1^{2i-2}|u_{2i-1})={\max }^{*}\{w_{N/2}^{\left(i\right)}(y_1^{N/2},{\hat{u}}_{1,o}^{2i-2}\⊕{\hat{u}}_{1,e}^{2i-2}|u_{2i-1})+w_{N/2}^{\left(i\right)}(y_{N/2+1}^N,{\hat{u}}_{1,e}^{2i-2}|0)\\ w_{N/2}^{\left(i\right)}(y_1^{N/2},{\hat{u}}_{1,o}^{2i-2}\⊕{\hat{u}}_{1,e}^{2i-2}|{\stackrel{\‾}{u}}_{2i-1})+w_{N/2}^{\left(i\right)}(y_{N/2+1}^N,{\hat{u}}_{1,e}^{2i-2}|1)\}\\ w_N^{\left(2i\right)}(y_1^N,{\hat{u}}_1^{2i-1}|u_{2i})=w_{N/2}^{\left(i\right)}(y_1^{N/2},{\hat{u}}_{1,o}^{2i-2}\⊕{\hat{u}}_{1,e}^{2i-2}|u_{2i-1}\⊕u_{2i})+w_{N/2}^{\left(i\right)}(y_{N/2+1}^N,{\hat{u}}_{1,e}^{2i-2}|u_{2i})\end{array},---\left(6\right)$

Wherein,Represent decoder and receive vector,Represent encoder input bit special, u_i Representation vectorIn i-th,Represent the estimated value that encoder input bit is special,RepresentUnder middle odd number The vector that mark corresponding bit is constituted,RepresentThe vector that middle even index corresponding bit is constituted,Represent u_2i-1Bit Upset,Represent bit xor operation, max^*Representative takes maximum.

3) decoding terminates judge and choose path candidate: if i==N, chooseFor maximum metric Path, i.e. can obtain decoding outputOtherwise, path selection metric listL value of middle maximum constitutes candidate metrics value ListThe L paths of its correspondence is as the path candidate list of i-th layer；Make i=i+1, return step 2), carry out next Layer extension.

Simplify SSC decoding

Considering the robustness that hardware realizes and calculates, the simple version SC of SCL can implement on log-domain.Transmitted codewords Log-likelihood ratioCan pass through following formula iterative computation:

$L_N^{(2i-1)}(y_1^N,{\hat{u}}_1^{2i-2})\≈\mathrm{sgn}\left(L_1\right)\mathrm{sgn}\left(L_2\right)min\left(\right|L_1|,|L_2\left|\right)---\left(7\right)$

$L_N^{\left(2i\right)}(y_1^N,{\hat{u}}_1^{2i-1})={(-1)}^{{\hat{u}}_{2i-1}}{L}_1+L_2---\left(8\right)$

Wherein,

$\left\{\begin{array}{c}{L}_1=L_{N/2}^{\left(i\right)}(y_1^{N/2},{\hat{u}}_{1,o}^{2i-2}\⊕{\hat{u}}_{1,e}^{2i-2})\\ L_2=L_{N/2}^{\left(i\right)}(y_{N/2+1}^N,{\hat{u}}_{1,e}^{2i-2})\end{array}\right.---\left(9\right)$

For some low complex degrees and the application scenarios of high-throughput, SC (SSC) decoding of simplification is a preferable choosing Select.In order to improve hardware efficiency further, the value of LLR can represent with its symbol simply, available binary system input Decoder, is referred to as firmly inputting decoding.Formula above in formula (7) can be reduced to:

$c=a\⊕b---\left(10\right)$

Wherein, a, b and c represent respectivelyL₁And L₂Sign bit.

Fig. 2 is as a example by 2 × 2MIMO system, and the joint-detection decoding of the mimo system describing polarization code coding in detail is calculated Method.Wherein, have employed 16-QAM modulation and (8,4) polarization code encodes.Every 4 bits of encoded become the code word of 8 bits, and then modulation is arrived The constellation point of 16-QAM.According to formula (1), the tree of this reduction only comprises 2⁴Bar active path.In equivalent real-valued system, this contracting The tree construction subtracted is represented byWherein, the number of each symbol in every paths For even number.At each layer of tree, there is K_pArticle=4, survivor path.At ground floor, 4 nodes are all effective, as joint of surviving Point.It follows that as a example by node-3, extend its child node at the 2nd layer.Tree according to reductionExpression, only node-3 It is effective with 3.Two other node directly abandons, and no longer calculates and carries out the renewal of PED and compare.In like manner, can to node-1, 1 and 3 carry out child node extension.After having extended, update the PED of active path and select 4 paths with minimum PED value to make For path candidate.This operation successively performs, until the leaf node layer of tree.Finally, hard input or soft input are used Polarization code decoder recovers original information bits.

Simulation result and analysis:

In the Rayleigh fading mimo channel of 4 × 4, the survivor path number of K-best detection and SCL decoding is set to 4.For The basic SSD algorithm of detector decoder simple cascade and the JDD algorithm of proposition, do not implement iteration between detecting and decoding.Right In 4-QAM modulating system, using the polarization code of (8,4), the BER performance comparison of algorithms of different is as shown in Figure 3.Wherein, Uncoded Curve represents without the BER performance of K-best detection in chnnel coding mimo channel.From the figure 3, it may be seen that the SSC decoding that the present invention proposes The basic SSD algorithm of JDD algorithm and SCL decoding there is basically identical BER performance.The JDD using SCL soft input decoding calculates Method BER performance is better than the basic SSD algorithm of SCL decoding, at BER=10^-4Place, SNR improves about 2dB.

For 16-QAM modulating system, use the BER performance of the polarization code of (16,8), JDD algorithm and basic SDD algorithm Contrast is as shown in Figure 4.In like manner understanding, the performance of soft input SCL decoding is better than SSC decoding；The JDD algorithm performance proposed is better than base This SDD algorithm.Therefore, for different mimo systems, if Rational choice antenna configurations and polarization code parameter, proposition The BER performance of JDD algorithm is always better than SDD algorithm.

Assuming that the code check of the polarization code of Rational choice is 1/2.The basic SSD algorithm of detector and decoder simple cascade with The computational complexity of the JDD algorithm that the present invention proposes is more as shown in table 1.Wherein, PED.SCL and PED.COM represents PED respectively Calculating and number of comparisons.Comparing SDD algorithm, the complexity of JDD algorithm tree search reduces about 50%.For hard input Polarization code decoding, it is only necessary to perform complexity beBinary arithmetic operation, efficient hardware frame can be passed through Structure realizes, and improves system throughput.Polarization code for soft input decodes, and SCL decoding needs substantial amounts of arithmetical operation, calculates multiple Miscellaneous degree isMeanwhile, SCL decoding is introduced into bigger decoding delay.Understand in conjunction with simulation result: at identical bar Under part, comparing SDD algorithm, the JDD algorithm of proposition is obtained in that more preferable BER performance, reduces complexity simultaneously.

The complexity of table 1:SDD and JDD algorithm compares

Thinking ratio with existing polarization decoder, the present invention combines the encoding characteristics of polarization code, reduces tradition K-best detection Middle route searching scope, it is proposed that the joint-detection interpretation method of a kind of low complex degree, constitutes searching of reduction by effective path Suo Shu, reduces the complexity of Path extension and calculating, improves the BER performance of system simultaneously.Hard input SSC decoding, reduces Hard-wired complexity, improves system throughput.Antenna configurations and code check for Rational choice are the polarization of 1/2 Code, the complexity of the JDD algorithm that the present invention proposes is compared basic SSD algorithm and is reduced about 50%.Higher at BER performance requirement Actual scene in, the JDD algorithm of soft input can be used.In the actual scene of high-throughput and low complex degree, use the most defeated The JDD algorithm entered has a good application prospect.

Claims (3)

1. the mimo system joint-detection interpretation method combining polarization code, it is characterised in that comprise the steps:

1) initialization path list and PED list: P thereof₀=[0,0 ..., 0], PED₀=[0,0 ..., 0]；

2) structure reduction treeI.e. during Path extension, the tree that only extremely efficient path is constituted；

3) reduction tree is combinedI-th layer, to the i-th-1 layerIn each paths extend it Active path, obtains the path list updatedAccording to PED_i-1Obtain the PED list updatedWherein i > 0, P_i,jRepresent the j bar survivor path of i-th layer, PED_i,jTable Show the metric of the j bar survivor path of i-th layer, K_pRepresenting each layer of survivor path number, Q represents modulation constellation spot size；

4) detection has been judged whether, if i=2N_tN, represents and arrives leaf node layer, then output path candidate list P_2Ntn= P_newAnd PED list PED_2Ntn=PED_new；Otherwise, PED list PED is chosen_newThe K of middle minimum_pIndividual value constitutes PED_i, it is corresponding K_pPaths is as the path candidate list P of i-th layer_i, make i=i+1, return step 3 and carry out next layer of Path extension, wherein N_rRepresenting reception antenna number, n is the number of channel；

5) firmly input or soft input decodes: when using hard input decoding, output optimal path The path that i.e. in the path metric value vector of last layer, the minima of each is corresponding, carries out reflection by the path of its correspondence and penetrates Obtaining launching code word, input SSC decoder i.e. obtains decoding result；When using soft input decoding, first combine PED_2NtnIn K_pBar The PED value in path, calculates the LLP receiving vector y, and then input SCL decoder recovers information bit.

The mimo system joint-detection interpretation method of combination polarization code the most according to claim 1, it is characterised in that according to PED_i-1Obtain PED_newSpecific formula for calculation be:

${\mathrm{PED}}_{new}={\mathrm{PED}}_{i-1}+\left|\right|z_{2{\mathrm{nN}}_t+1-i}-\underset{j=2{\mathrm{nN}}_t+1-i}{\overset{2{\mathrm{nN}}_t}{\Σ}}{r}_{lj}{x}_j|{|}^2---\left(11\right)$

Wherein, N_tFor launching antenna number, x_jThe transmitting symbol of data stream, z is launched for jth_jConnecing of data stream is received for jth The collection of letters number, r_ljThe l row j column element of the upper triangular matrix R obtained is decomposed for channel matrix QR.

The mimo system joint-detection interpretation method of combination polarization code the most according to claim 1, it is characterised in that calculate The concrete formula of the LLP receiving vector y is:

Wherein,Data symbol stream x is launched for kth_kIth bit,For the set of all symbols that ith bit is b, b ∈ { 0,1}, σ²For the variance of noise n, z is the deformation receiving vector by n channel, and R is that channel matrix QR decomposition obtains Upper triangular matrix, x be n channel transmitting vector.