CN110868244A - Low-complexity communication signal detection method based on channel puncture - Google Patents

Low-complexity communication signal detection method based on channel puncture Download PDF

Info

Publication number
CN110868244A
CN110868244A CN201911115281.4A CN201911115281A CN110868244A CN 110868244 A CN110868244 A CN 110868244A CN 201911115281 A CN201911115281 A CN 201911115281A CN 110868244 A CN110868244 A CN 110868244A
Authority
CN
China
Prior art keywords
vector
matrix
symbol
confidence coefficient
channel
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
CN201911115281.4A
Other languages
Chinese (zh)
Other versions
CN110868244B (en
Inventor
蔡兴蔚
邱玲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Science and Technology of China USTC
Original Assignee
University of Science and Technology of China USTC
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 University of Science and Technology of China USTC filed Critical University of Science and Technology of China USTC
Priority to CN201911115281.4A priority Critical patent/CN110868244B/en
Publication of CN110868244A publication Critical patent/CN110868244A/en
Application granted granted Critical
Publication of CN110868244B publication Critical patent/CN110868244B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/0452—Multi-user MIMO systems
    • 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
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0046—Code rate detection or code type detection
    • 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
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms

Landscapes

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

Abstract

The invention discloses a low-complexity confidence coefficient transmission communication signal detection method based on channel puncture in a multi-user multi-input multi-output system, which is characterized in that a specific element in a converted channel matrix is cleared by utilizing the channel puncture so as to construct a loop-free factor graph; on the basis of the loop-free factor graph, a confidence coefficient updating formula of a confidence coefficient propagation algorithm is adjusted to calculate more accurate confidence coefficient; the method can be converged within a plurality of iteration times; the hierarchical detection structure design and the assistance of the maximum likelihood detector enable the method to solve the influence of distortion noise caused by channel puncture. Compared with the existing confidence propagation detector, the confidence coefficient calculated by adopting the method of the invention is more accurate, the correlation degree of the confidence coefficient is not increased due to iteration, so the convergence is quicker, the detection performance of the optimal detector can be achieved, and simultaneously, the complexity is greatly reduced compared with the existing detector based on the confidence propagation algorithm.

Description

Low-complexity communication signal detection method based on channel puncture
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a channel puncture-based low-complexity confidence coefficient propagation communication signal detection method suitable for a multi-user multi-input multi-output system.
Background
The international institute of electrical and electronics engineers communication report ("Design of adaptive coded belief in multi-dimensional signal detection for high-order modulation." "IEEE Transactions on Communications, vol.67, No.3, pp.1986-2001,2018") states that a multiple-user multiple-input multiple-output system equipped with a large number of antennas in both transmit and receive transmissions is of interest as a potential technology to meet the ever-increasing demand for wireless communication systems. In the uplink scenario, the transmitted signal is corrupted by interference and noise from different users, and therefore a detection algorithm is needed to recover the transmitted symbols. The international society of electrical and electronics engineers communication research and review ("first layer of MIMO detection: The road to large-scale MIMOs." ieee communications systems & turbines, vol.17, No.4, pp.1941-1988,2015 ") states that even low complexity MIMO detection algorithms can impose excessive energy consumption burdens on base stations. Therefore, a detection algorithm with low complexity and high system performance is one of the requirements for practical mimo system applications. The Journal of the international society of electronic and electrical engineers (the "Journal of international electronic and electrical engineers) for specific Areas of communication," IEEE Journal on Selected Areas in communications, vol.26, No.2, pp.269-280,2008), utilizes a belief propagation algorithm to detect a mimo system, and has a better detection effect in the case of fewer loops, but in a radio communication environment with rich scattering, detection based on belief propagation may have a serious convergence problem and performance degradation. The application of QR decomposition to belief propagation algorithms in electronic promulgation ("qrrecomposion aid belief propagation detectors for MIMO systems," electronics letters, vol.51, No.11, pp.873-874, 2015 ") improves detection performance, but loops present in the factor graph still cause some gap between detection performance and optimal detectors. Meanwhile, the detection based on the confidence propagation algorithm shows more serious performance reduction under the condition that the ratio of the number of base station antennas to the total number of user number antennas is close to 1.
Disclosure of Invention
The invention aims to provide a confidence coefficient transmission communication signal detection method of a low-complexity multi-user multi-input multi-output system based on channel puncture under a multi-user multi-input multi-output system, so as to improve the convergence of a confidence coefficient transmission detection algorithm and the reduction of bit error rate performance brought by a factor graph loop in a rich scattering wireless communication environment, and reduce the calculation complexity of detection by eliminating the loop and adjusting a confidence coefficient updating formula.
The invention discloses a low-complexity confidence coefficient transmission communication signal detection method based on channel puncture under a multi-user multi-input multi-output system, which is characterized by comprising the following steps:
consider a multiple-user multiple-input multiple-output system, equipped with NrBase station service N of single receiving antennatSingle antenna user, consider NrAnd NtIn the case of equality, each user independently modulates a data sequence and then transmits it through the uplink; if the base station side has a channel matrix HcThe received signal at the base station side is represented as:
yc＝Hcxc+nc(1)
wherein HcRepresenting an independent identically distributed Rayleigh fading channel matrix whose elements obey a complex Gaussian distribution with mean 0 and variance 1, xcRepresenting a transmitted signal vector whose elements are generated independently from a constellation diagram of modulation order Q, ncRepresenting element obeys
Figure RE-GDA0002306136290000021
The noise vector of (2); for each received signal vector yc，xcThe detection process of (2) is as follows:
the first step is as follows: the model is subjected to real-value decomposition, and the decomposition rule is
Figure RE-GDA0002306136290000022
Figure RE-GDA0002306136290000023
After transformation, Nr×NtThe complex multi-user multiple-input multiple-output channel is equivalent to a real value of 2Nr×2NtA matrix;
the second step is that: performing channel puncturing on the channel matrix;
circularly shifting the real value matrix H by every two columns to obtainNrA channel matrix, for example the first channel matrix, is QR decomposed, H-QR, where Q is a 2N channel matrixr×2NrR is a 2N unitary matrixr×2NtThe upper triangular matrix of (a); according to the properties of the unitary matrix and the upper triangular matrix, the following parameters are obtained: q. q.smhn＝rmnAnd q isnhn＝rnnWherein q isnIs the nth column vector of Q, rmnIs the (m, n) th element of R; definition of
Figure RE-GDA0002306136290000024
For m 2Nt-2， m＝2Nt-3 to m-1 and corresponding N-2Nr-1，n＝2Nr-2 to n ═ m +1, the following operations being repeated: q. q.sm＝qm-qnemn，rmn＝rmn-rnnemn，
Figure RE-GDA0002306136290000025
By using
Figure RE-GDA0002306136290000026
R after the operation is finished, and Q after the operation is finished is represented by W; at this time
Figure RE-GDA0002306136290000027
Is a matrix with zero elements except the diagonal elements and the last column of elements which are not zero, and is expressed as:
Figure RE-GDA0002306136290000031
other Nr-1 matrix is processed in parallel with the same processing method;
the third step: according to the matrix obtained in the second step
Figure RE-GDA0002306136290000032
And W, combining the received signal vector y, and calculating the log-likelihood ratio of the transmitted symbol by using an improved confidence propagation method; pre-multiplying y byThe W obtained in the second step, rewriting the received signal vector is:
Figure RE-GDA0002306136290000033
vector of prior information from ith symbol node to jth factor node
Figure RE-GDA0002306136290000034
And a posteriori information vector from the jth factor node to the ith symbol node
Figure RE-GDA0002306136290000035
Are all initialized to 0;
during the course of the l-th iteration,
Figure RE-GDA0002306136290000036
is represented as follows:
Figure RE-GDA0002306136290000037
p(l)(xi＝sk) Represents the ith symbol node x in the ith iteration processiIs a symbol skIs x, andithe edge probability of (d) is expressed as:
Figure RE-GDA0002306136290000038
on the other hand, during the first iteration,
Figure RE-GDA0002306136290000039
the log likelihood ratio form of (a) is expressed as follows:
Figure RE-GDA0002306136290000041
wherein
Figure RE-GDA0002306136290000042
Is a signal vector consisting of two factor nodes corresponding to the jth factor node,
Figure RE-GDA0002306136290000043
is provided with
Figure RE-GDA0002306136290000044
A possible choice of symbols, xjOnly skAnd s0Two kinds of symbol selection are carried out,
Figure RE-GDA0002306136290000045
is that
Figure RE-GDA0002306136290000046
A response vector consisting of the jth column of non-zero elements of (a);
for i is more than or equal to 1 and less than or equal to 2Nt-1 and j ═ i update the a priori information from the ith symbol node to the jth factor node, the update formula is as follows:
Figure RE-GDA0002306136290000047
to 2NrThe update formula of each symbol node is as follows:
Figure RE-GDA0002306136290000048
updating the information of each factor node and each symbol node by using the formula (5), the formula (6) and the formula (7) until the preset iteration number L; reserved 2Nt-2 and 2Nt-1 layer confidence vector values for transmitted information symbols; to the second step in total of NrRepeating the steps by the channel matrixes, and combining the results to obtain confidence vectors of all the transmitted signal symbols;
the fourth step: checking the confidence coefficient vector of each transmitted signal symbol, presetting a selection threshold lambda of a confidence coefficient value, and selecting the symbol with the maximum confidence coefficient as an estimation for x of which the absolute value of the maximum value in the confidence coefficient vector is greater than lambda; for x with the absolute value of the maximum value in the confidence coefficient vector being smaller than lambda, setting the estimated symbol as blank; the blank symbol estimates are sent to an auxiliary maximum likelihood detector along with the determined symbols to obtain the final detection result of the transmitted vector x.
The channel puncture-based low-complexity confidence coefficient transmission communication signal detection method under the multi-user multi-input multi-output system has the advantages that the channel puncture is utilized to clear elements between the diagonal line and the last column of the channel matrix after QR decomposition, so that a complete loop-free factor graph structure is constructed; due to the information updating formula of the confidence coefficient propagation algorithm which is adjusted on the structure, compared with the existing communication signal detection method based on the confidence coefficient propagation algorithm, the method can calculate more accurate confidence coefficient information and can converge more quickly; meanwhile, the influence of distortion noise caused by channel puncture is eliminated by adopting a layered detection structure and an auxiliary maximum likelihood detector, the detection performance of the maximum likelihood detector can be achieved on the bit error rate performance, and the calculation complexity of the system is greatly reduced relative to the maximum likelihood detector.
Description of the drawings:
FIG. 1 is a diagram showing the bit error rate performance comparison between the method of the present invention and the existing multi-user MIMO system communication signal detection method under different signal-to-noise ratio (SNR) settings;
fig. 2 is a comparison diagram of the multiplication calculation numbers required by the method of the present invention and the conventional method for detecting the communication signals of the multi-user mimo system under different antenna number settings.
Detailed Description
The method for detecting a low-complexity belief propagation communication signal based on channel puncturing in a multi-user multiple-input multiple-output system according to the present invention is further described in detail and specifically illustrated in the following figures.
Example 1:
to facilitate understanding of the specific implementation of the method, a factor graph-based confidence propagation algorithm for the multi-antenna system is briefly introduced. Each symbol node corresponds to one element in the transmission information vector and independently stores the information of the symbol transmitted at the transmitting end; the factor nodes correspond to the received signals, in turn storing the signals observed at the receiver. The channel response is used to determine the coupling strength and the number of primary connections between the two nodes. The transmission signal detected at each factor node is delivered as a message (external information) to the corresponding symbol node; and adding external information at the symbol nodes for updating the prior information of each symbol node, and then sending the corresponding factor node to calculate the log-likelihood ratio of the posterior information. The process is repeated until convergence or set iteration times are reached, and finally judgment of the transmitted symbol is output.
Next, how to construct a loop-free factor graph and adjust a belief propagation algorithm based on the loop-free factor graph to achieve performance improvement and complexity reduction of a multi-user multiple-input multiple-output system is specifically described. Consider a multiple user multiple input multiple output system; base station service N equipped with Nr receiving antennastFor a single antenna user, consider Nr and NtThe case of equality; each user independently modulates a data sequence and then transmits the data sequence through an uplink; if the base station side has a channel matrix HcThe received signal at the base station side is represented as:
yc＝Hcxc+nc(1)
wherein HcRepresenting an independent identically distributed Rayleigh fading channel matrix whose elements obey a complex Gaussian distribution with mean 0 and variance 1, xcRepresenting a transmitted signal vector whose elements are generated independently from a constellation diagram of modulation order Q, ncRepresenting element obeys
Figure RE-GDA0002306136290000051
The noise vector of (2); for each received signal vector yc，xcThe detection process of (2) is as follows:
the first step is as follows: the model is subjected to real-value decomposition, and the decomposition rule is
Figure RE-GDA0002306136290000061
Figure RE-GDA0002306136290000062
After transformation, Nt×NrThe complex multi-user multiple-input multiple-output channel is equivalent to a real value of 2Nt×2NrA matrix;
the second step is that: performing channel puncturing on the channel matrix;
step 2A: circularly shifting the real value matrix H by every two columns to obtain NrA channel matrix;
and 2B, substep: taking the first channel matrix as an example, QR decomposition is performed, H — QR, where Q is a 2N channel matrixr×2NrR is a 2N unitary matrixr×2NtThe upper triangular matrix of (a); according to the properties of the unitary matrix and the upper triangular matrix, the following parameters are obtained: q. q.smhn＝rmnAnd q isnhn＝rnnWherein q isnIs the nth column vector of Q, rmnIs the (m, n) th element of R; definition of
Figure RE-GDA0002306136290000063
For m 2Nt-2，m＝2Nt-3 to m-1 and corresponding N-2Nr-1， n＝2Nr-2 to n ═ m +1, the following operations being repeated: q. q.sm＝qm-qnemn，rmn＝rmn-rnnemn，
Figure RE-GDA0002306136290000064
By using
Figure RE-GDA0002306136290000065
R after the operation is finished, and Q after the operation is finished is represented by W; at this time
Figure RE-GDA0002306136290000066
Is a matrix with zero elements except the diagonal elements and the last column of elements which are not zero, and is expressed as:
Figure RE-GDA0002306136290000067
other Nr-1 matrix is processed in parallel with the same processing method;
the third step: according to the matrix obtained in the second step
Figure RE-GDA0002306136290000068
And W, combining the received signal vector y, and calculating the log-likelihood ratio of the transmitted symbol by using an improved confidence propagation algorithm;
and step 3A: and c, multiplying y by W obtained in the second step, and rewriting the received signal vector into:
Figure RE-GDA0002306136290000069
and step 3B: vector of prior information from ith symbol node to jth factor node
Figure RE-GDA0002306136290000071
Figure RE-GDA0002306136290000072
And a posteriori information vector from the jth factor node to the ith symbol node
Figure RE-GDA0002306136290000073
Are all initialized to 0;
during the course of the l-th iteration,
Figure RE-GDA0002306136290000074
is represented as follows:
Figure RE-GDA0002306136290000075
p(l)(xi＝sk) Represents the ith symbol node x in the ith iteration processiIs a symbol skIs x, andithe edge probability of (d) is expressed as:
Figure RE-GDA0002306136290000076
on the other hand, during the first iteration,
Figure RE-GDA0002306136290000077
the log likelihood ratio form of (a) is expressed as follows:
Figure RE-GDA0002306136290000078
wherein
Figure RE-GDA0002306136290000079
Is a signal vector consisting of two factor nodes corresponding to the jth factor node,
Figure RE-GDA00023061362900000710
is provided with
Figure RE-GDA00023061362900000711
A possible choice of symbols, xjOnly skAnd s0Two kinds of symbol selection are carried out,
Figure RE-GDA00023061362900000712
is that
Figure RE-GDA00023061362900000713
A response vector consisting of the jth column of non-zero elements of (a);
for i is more than or equal to 1 and less than or equal to 2Nt-1 and j ═ i update the a priori information from the ith symbol node to the jth factor node, the update formula is as follows:
Figure RE-GDA00023061362900000714
to 2NrThe update formula of each symbol node is as follows:
Figure RE-GDA0002306136290000081
and a 3C substep: benefit toUpdating the information of each factor node and each symbol node by using an equation (5), an equation (6) and an equation (7) until the preset iteration number L; reserved 2Nt-2 and 2Nt-1 layer confidence vector values for transmitted information symbols;
a 3D substep: to the second step in total of NrCarrying out 3A-3C steps on each channel matrix, and combining results to obtain confidence vectors of all transmitted signal symbols;
the fourth step: checking the confidence coefficient vector of each transmitted signal symbol, presetting a selection threshold lambda of a confidence coefficient value, and selecting the symbol with the maximum confidence coefficient as an estimation for x of which the absolute value of the maximum value in the confidence coefficient vector is greater than lambda; for x with the absolute value of the maximum value in the confidence coefficient vector being smaller than lambda, setting the estimated symbol as blank; the blank symbol estimates are sent to an auxiliary maximum likelihood detector along with the determined symbols to obtain the final detection result of the transmitted vector x.
In the following, simulation is utilized to compare the low-complexity belief propagation communication signal detection method based on channel puncture in the multi-user multi-input multi-output system of the invention with the existing maximum likelihood detector, standard belief propagation detector and belief propagation detector based on QR decomposition. The indexes compared include: bit error rate of the system and the number of multiplications required for detection.
The simulation of the low-complexity confidence propagation communication signal detection method based on channel puncture in the multi-user multi-input multi-output system of the embodiment is specifically set as follows:
for bit error rate simulation, the number of base station antennas is 8, and the number of single antenna users served is 8. User data is modulated by QPSK, and the transmitted power is normalized. The channel is a Rayleigh fading channel, the noise is 0 in mean and the variance is N0White gaussian noise. The signal-to-noise ratio is simulated every 2 dB from 0 to 10, the number of data frames sent by each user in each simulation is 1250000, and the final bit error rate result is the average value of all frame results.
For the numerical calculation of the calculation complexity, according to the derived multiplication calculation number expressions required by different detection methods, the numerical calculation is carried out on every 2 of the antenna numbers from 4 to 16, and the multiplication calculation number expressions of the different methods are as follows:
Figure RE-GDA0002306136290000082
Figure RE-GDA0002306136290000091
the specific settings of the relevant formula parameters in the channel puncture-based low-complexity belief propagation communication signal detection method in the multi-user multiple-input multiple-output system used in the embodiment are as follows, in QPSK modulation, Q in the table above is 2, and prior information αi,jAnd posterior information βj,iAll the initial values of (a) are set to 0; the selection threshold lambda of the confidence coefficient value is 1; the number of iterations of the standard belief propagation algorithm is set to 20, the number of iterations of the QR decomposition-based belief propagation algorithm is set to 10, and the number of iterations of the channel puncture-based low-complexity belief propagation method is set to 3.
Fig. 1 shows the comparison result of the bit error rate performance between the method of the present invention and the existing detection method under different signal-to-noise ratios, where the uppermost dotted line a1 represents the standard belief propagation detector, the lowermost dotted line a2 represents the maximum likelihood detector, the middle dotted line A3 represents the belief propagation detector based on QR decomposition, and the solid line a4 represents the method of the present invention. As can be seen from the attached FIG. 1, the bit error rate of the multi-user multiple-input multiple-output system adopting the method of the present invention is lower than that of the standard belief propagation detector and the belief propagation detector based on QR decomposition under the condition that the signal-to-noise ratio is greater than 5, and is the same as that of the optimal detector maximum likelihood detector under the condition that the signal-to-noise ratio is greater than 8. At the same bit error rate level 10-4In this case, the method of the present invention has a gain of about 1.5 db over the confidence propagation detector based on QR decomposition. Therefore, the method achieves better bit error rate performance.
Fig. 2 compares the number of multiplications required by the method of the present invention with the existing method for different numbers of antennas. Wherein the uppermost and lower dashed line B1 represents a standard belief propagation detector, the lowermost dashed line B3 represents a maximum likelihood detector, the middle dashed line B3 represents a belief propagation detector based on QR decomposition, and the solid line B4 represents the inventive method. As can be seen from fig. 2, under the same number of antennas, the number of multiplications required for the detection of the mimo system using the method of the present invention is the least, and under the condition of 8 antennas, the number of multiplications required by the method is only 35.5% of that required by the maximum likelihood detector. Thus, the method has low computational complexity.
Through the above embodiments, it is proved that compared with the existing belief propagation detector, the improved belief propagation communication signal detection method of the present invention can ensure fast convergence of the algorithm and reduce the computational complexity required for detection because a complete loop-free factor graph structure is constructed by using channel puncturing and the information updating formula of the belief propagation detector is more accurate. Meanwhile, the layered detection structure and the auxiliary maximum likelihood detector adopted by the invention eliminate the influence of distortion noise caused by channel puncture, so that the detection performance of the detector can reach the level of the optimal detector.

Claims (1)

1. A low-complexity confidence coefficient transmission communication signal detection method based on channel puncture under a multi-user multi-input multi-output system is characterized in that:
consider a multiple user multiple input multiple output system; is equipped with NrBase station service N of single receiving antennatSingle antenna user, consider NrAnd NtIn the case of equality, each user independently modulates a data sequence and then transmits it through the uplink; if the base station side has a channel matrix HcThe received signal at the base station side is represented as:
yc＝Hcxc+nc(1)
wherein HcRepresents an independent identically distributed Rayleigh fading channel matrix whose elements obey a mean of 0 and a variance of1 complex gaussian distribution, xcRepresenting a transmitted signal vector whose elements are generated independently from a constellation diagram of modulation order Q, ncRepresenting element obeys
Figure RE-FDA0002306136280000011
The noise vector of (2); for each received signal vector yc，xcThe detection process of (2) is as follows:
the first step is as follows: the model is subjected to real-value decomposition, and the decomposition rule is
Figure RE-FDA0002306136280000012
Figure RE-FDA0002306136280000013
After transformation, Nr×NtThe complex multi-user multiple-input multiple-output channel is equivalent to a real value of 2Nr×2NtA matrix;
the second step is that: performing channel puncturing on the channel matrix;
circularly shifting the real value matrix H by every two columns to obtain NrA channel matrix; taking the first channel matrix as an example, QR decomposition is performed, H — QR, where Q is a 2N channel matrixr×2NrR is a 2N unitary matrixr×2NtThe upper triangular matrix of (a); according to the properties of the unitary matrix and the upper triangular matrix, the following are obtained: q. q.smhn＝rmnAnd q isnhn＝rnnWherein q isnIs the nth column vector of Q, rmnIs the (m, n) th element of R; definition of
Figure RE-FDA0002306136280000014
For m 2Nt-2，m＝2Nt-3 to m-1 and corresponding N-2Nr-1，n＝2Nr-2 to n ═ m +1, the following operations being repeated: q. q.sm＝qm-qnemn，rmn＝rmn-rnnemn，
Figure RE-FDA0002306136280000015
By using
Figure RE-FDA0002306136280000016
R after the operation is finished, and Q after the operation is finished is represented by W; at this time
Figure RE-FDA0002306136280000017
Is a matrix with zero elements except the diagonal elements and the last column of elements which are not zero, and is expressed as:
Figure RE-FDA0002306136280000021
other Nr-1 matrix is processed in parallel with the same processing method;
the third step: according to the matrix obtained in the second step
Figure RE-FDA0002306136280000022
And W, combining the received signal vector y, and calculating the log-likelihood ratio of the transmitted symbol by using an improved confidence propagation algorithm; and c, multiplying y by W obtained in the second step, and rewriting the received signal vector into:
Figure RE-FDA0002306136280000023
vector of prior information from ith symbol node to jth factor node
Figure RE-FDA0002306136280000024
And a posteriori information vector from the jth factor node to the ith symbol node
Figure RE-FDA0002306136280000025
Are all initialized to 0;
during the course of the l-th iteration,
Figure RE-FDA0002306136280000026
is represented as follows:
Figure RE-FDA0002306136280000027
p(l)(xi＝sk) Represents the ith symbol node x in the ith iteration processiIs a symbol skIs x, andithe edge probability of (d) is expressed as:
Figure RE-FDA0002306136280000028
on the other hand, during the first iteration,
Figure RE-FDA0002306136280000029
the log likelihood ratio form of (a) is expressed as follows:
Figure RE-FDA0002306136280000031
wherein
Figure RE-FDA0002306136280000032
Is a signal vector consisting of two factor nodes corresponding to the jth factor node, x2NrIs provided with
Figure RE-FDA0002306136280000033
A possible choice of symbols, xjOnly skAnd s0Two kinds of symbol selection are carried out,
Figure RE-FDA0002306136280000034
is that
Figure RE-FDA0002306136280000035
A response vector consisting of the jth column of non-zero elements of (a);
for i is more than or equal to 1 and less than or equal to 2Nt-1 and j ═ i update slaveThe prior information from the ith symbol node to the jth factor node is updated as follows:
Figure RE-FDA0002306136280000036
to 2NrThe update formula of each symbol node is as follows:
Figure RE-FDA0002306136280000037
updating the information of each factor node and each symbol node by using the formula (5), the formula (6) and the formula (7) until the preset iteration number L; reserved 2Nt-2 and 2Nt-1 layer confidence vector values for transmitted information symbols; to the second step in total of NrRepeating the steps by the channel matrixes, and combining the results to obtain confidence vectors of all the transmitted signal symbols;
the fourth step: checking the confidence coefficient vector of each transmitted signal symbol, presetting a selection threshold lambda of a confidence coefficient value, and selecting the symbol with the maximum confidence coefficient as an estimation for x of which the absolute value of the maximum value in the confidence coefficient vector is greater than lambda; for x with the absolute value of the maximum value in the confidence coefficient vector being smaller than lambda, setting the estimated symbol as blank; the blank symbol estimates are sent to an auxiliary maximum likelihood detector along with the determined symbols to obtain the final detection result of the transmitted vector x.
CN201911115281.4A 2019-11-14 2019-11-14 Low-complexity communication signal detection method based on channel puncture Active CN110868244B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911115281.4A CN110868244B (en) 2019-11-14 2019-11-14 Low-complexity communication signal detection method based on channel puncture

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911115281.4A CN110868244B (en) 2019-11-14 2019-11-14 Low-complexity communication signal detection method based on channel puncture

Publications (2)

Publication Number Publication Date
CN110868244A true CN110868244A (en) 2020-03-06
CN110868244B CN110868244B (en) 2021-07-06

Family

ID=69654146

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911115281.4A Active CN110868244B (en) 2019-11-14 2019-11-14 Low-complexity communication signal detection method based on channel puncture

Country Status (1)

Country Link
CN (1) CN110868244B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285524A (en) * 2021-12-24 2022-04-05 北京中科晶上科技股份有限公司 LLR vector quantization calculation method, device and communication system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130117623A1 (en) * 2006-05-16 2013-05-09 Core Wireless Licensing S.A.R.I. Method, Apparatus And Computer Program Product Providing Soft Interative Recursive Least Squares (RLS) Channel Estimator
CN105656538A (en) * 2015-12-30 2016-06-08 东南大学 Low-complexity belief propagation detection algorithm for large-scale MIMO system
CN108833060A (en) * 2018-09-17 2018-11-16 东南大学 A kind of extensive mimo system detection method based on EP-NSA algorithm
CN110429999A (en) * 2019-04-24 2019-11-08 西安电子科技大学 Extensive MIMO detection method based on lp-Box ADMM algorithm

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130117623A1 (en) * 2006-05-16 2013-05-09 Core Wireless Licensing S.A.R.I. Method, Apparatus And Computer Program Product Providing Soft Interative Recursive Least Squares (RLS) Channel Estimator
CN105656538A (en) * 2015-12-30 2016-06-08 东南大学 Low-complexity belief propagation detection algorithm for large-scale MIMO system
CN108833060A (en) * 2018-09-17 2018-11-16 东南大学 A kind of extensive mimo system detection method based on EP-NSA algorithm
CN110429999A (en) * 2019-04-24 2019-11-08 西安电子科技大学 Extensive MIMO detection method based on lp-Box ADMM algorithm

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JUN HU 等: "Graph-based detection algorithms for layered space-time architectures", 《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 *
SHAOSHI YANG 等: "Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs", 《IEEE COMMUNICATIONS SURVEYS & TUTORIALS》 *
TAKUMI TAKAHASHI 等: "Design of Adaptively Scaled Belief in Multi-Dimensional Signal Detection for Higher-Order Modulation", 《IEEE TRANSACTIONS ON COMMUNICATIONS 》 *
孙书琪: "QC_LDPC码的编码构造", 《中国优秀硕士学位论文全文数据库(信息科技辑)》 *
杨俊梅: "5G无线通信高效检测及译码的算法与实现研究", 《中国优秀硕士学位论文全文数据库(信息科技辑)》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114285524A (en) * 2021-12-24 2022-04-05 北京中科晶上科技股份有限公司 LLR vector quantization calculation method, device and communication system
CN114285524B (en) * 2021-12-24 2024-01-23 北京中科晶上科技股份有限公司 LLR vector quantization calculation method, device and communication system

Also Published As

Publication number Publication date
CN110868244B (en) 2021-07-06

Similar Documents

Publication Publication Date Title
CN110099017B (en) Channel estimation method of hybrid quantization system based on deep neural network
CN111181619B (en) Millimeter wave hybrid beam forming design method based on deep reinforcement learning
CN107332598B (en) MIMO system joint precoding and antenna selection method based on deep learning
US6873651B2 (en) System and method for joint maximal ratio combining using time-domain signal processing
CN106850013B (en) Signal detection method of uplink large-scale MIMO system
CN105071843B (en) Extensive mimo system low complex degree polynomial expansion matrix inversion technique and application
CN107241167B (en) Improved method based on large-scale MIMO system BP detection
CN104702390A (en) Pilot frequency distribution method in distributed compressive sensing (DCS) channel estimation
CN110855585A (en) Channel estimation method of millimeter wave large-scale MIMO system
CN105471775B (en) The channel estimation methods of low complex degree in a kind of extensive mimo system
CN104779988A (en) Quick iteration beam forming method
JP4381901B2 (en) Channel estimation and data detection method
CN107919895B (en) Distributed detection method of large-scale multi-user MIMO system
CN101026435A (en) Low-complexity maximum likelihood detecting method and device for communication system
CN101227254B (en) Method for detecting V-BLAST in MIMO system
CN114499601B (en) Large-scale MIMO signal detection method based on deep learning
Ivanov et al. Smart sorting in massive MIMO detection
EP4211824B1 (en) Wireless telecommunications network
CN110868244B (en) Low-complexity communication signal detection method based on channel puncture
CN109981151A (en) Improved Gauss tree approximation message transmission detection algorithm in extensive mimo system
TWI741619B (en) Method of parameter estimation for a mimo system based on deep learning
CN105610484A (en) Large-scale MIMO iterative receiving method with low complexity
CN107733487B (en) Signal detection method and device for large-scale multi-input multi-output system
CN106357318B (en) The adjustable extensive MIMO iteration detection method of rate of convergence
CN107302386B (en) Large-scale MIMO system downlink precoding method based on matrix polynomial

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant