CN107835068A - A kind of low complexity orthogonal spatial modulation globular decoding detection algorithm with transmitting diversity - Google Patents
A kind of low complexity orthogonal spatial modulation globular decoding detection algorithm with transmitting diversity Download PDFInfo
- Publication number
- CN107835068A CN107835068A CN201711063638.XA CN201711063638A CN107835068A CN 107835068 A CN107835068 A CN 107835068A CN 201711063638 A CN201711063638 A CN 201711063638A CN 107835068 A CN107835068 A CN 107835068A
- Authority
- CN
- China
- Prior art keywords
- matrix
- node
- spatial domain
- activation
- detection
- 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
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 45
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 27
- 239000011159 matrix material Substances 0.000 claims abstract description 101
- 230000004913 activation Effects 0.000 claims abstract description 25
- 238000000034 method Methods 0.000 claims abstract description 17
- 230000005540 biological transmission Effects 0.000 claims description 15
- 230000014509 gene expression Effects 0.000 claims description 8
- 239000013598 vector Substances 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 4
- 238000013139 quantization Methods 0.000 claims 1
- 238000007476 Maximum Likelihood Methods 0.000 description 8
- 230000001186 cumulative effect Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000005562 fading Methods 0.000 description 3
- 230000000750 progressive effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000003213 activating effect Effects 0.000 description 1
- 238000012152 algorithmic method Methods 0.000 description 1
- 230000003321 amplification Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000003199 nucleic acid amplification method Methods 0.000 description 1
- 238000007634 remodeling Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03178—Arrangements involving sequence estimation techniques
- H04L25/03203—Trellis search techniques
- H04L25/03242—Methods involving sphere decoding
-
- 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/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
-
- 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/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
- H04L1/0618—Space-time coding
- H04L1/0631—Receiver arrangements
-
- 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/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
- H04L1/0618—Space-time coding
- H04L1/0637—Properties of the code
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Radio Transmission System (AREA)
Abstract
The invention discloses a kind of low complexity orthogonal spatial modulation globular decoding detection algorithm (DQSM SD) with transmitting diversity, this method is on the basis of traditional QSM activates antenna, activation space-time matrix is converted into realize transmitting diversity, activation in combination with spatial domain matrix is combined, increase searches for zero point to shorten the search procedure of tree-like globular decoding, so as to reduce detection complexity.
Description
Technical field
The invention belongs to communication technical field, is related to building method and the reception of a kind of wireless connection system transmitting end signal
End signal detection method, more particularly to a kind of low complexity orthogonal spatial modulation globular decoding detection algorithm with transmitting diversity
(DQSM-SD)。
Background technology
Orthogonal intersection space modulation (Quadrature spatial modulation QSM) not only almost remains all of SM
Advantage, also by increasing a Spatial Dimension, i.e., the real part imaginary part of modulation symbol is loaded on two carrier waves and separately transmitted, carried
High the efficiency of transmission m of spatial modulation, i.e. m=log2(Nt 2M).Wherein NtFor transmission antenna, M is planisphere dimension.Believe in height
Make an uproar than when, QSM performances compared with SM are more preferable.With generalized space modulation (Generalized spatial modulation,
GSM channel disturbance (Inter channel interference ICI) difference) is produced, although QSM also using two transmission
Antenna, it but successfully avoid ICI.This is due to that the symbol transmitted on two antennas has orthogonality, i.e., in modulation carrier wave transmitting
When, a part is loaded into cosine carrier transmission, and a part is loaded into sinusoidal carrier transmission.In addition, QSM is carried compared with GSM
High efficiency of transmission.QSM has stronger robustness for channel estimation error compared to SM.Based on these advantages, QSM has been at present
It is applied to cognitive communications system and amplification forward collaboration communication system.And under Nakagami-m fading channels, various small chis
Spend fading channel environment under and interchannel interference in terms of deployment analysis.Result of study shows that QSM systems are relative to SM systems
There is more superior performance with gsm system.But there is two shortcomings for QSM systems：(1) from the progressive Average Error Probabilities of QSM
Expression formula can be seen that QSM and only receive diversity, but not have transmitting diversity；(2) detection method is searched using ML traversals at present
Suo Fangfa, the complexity of this method can be bigger, and to detect 4 variables, be respectively carry symbol real part antenna index,
Carry antenna index, symbol real part, the imaginary part of symbol of the imaginary part of symbol.In order to reduce QSM detection complexity, it is proposed that based on pressure
Contract the detection algorithm perceived, although complexity is greatly reduced, under low signal-to-noise ratio, still exists with ML detection algorithms
Under the same order of magnitude, and thresholding is provided with very big relation.
On the other hand, the present invention is improved to QSM systems, algorithm will activate antenna and be converted into activation space-time matrix to realize hair
Diversity is penetrated, while travels through the problem of detection complexity is excessive for ML and proposes a kind of low complex degree globular decoding detection algorithm.Its
Feature is to carry out depth-first globular decoding while judge that activating spatial domain matrix combines, and according to the activation feature of spatial domain matrix more
Change the number of search node, and the complexity of algorithm is reduced on the premise of ensureing that performance is not lost.
The content of the invention
The present invention does not have transmitting diversity for the transmission end of orthogonal intersection space modulating system and ML detection of complex is excessive asks
A kind of topic, it is proposed that low complexity orthogonal spatial modulation globular decoding detection algorithm (DQSM-SD) with transmitting diversity.
The present invention has the low complexity orthogonal spatial modulation globular decoding detection algorithm of transmitting diversity, including following step
Suddenly：
1) QSM system transmitting antenna numbers are set first as Nt, reception antenna number is Nr, modulated using M-QAM.According to
QSM system performances activate N every timetIn two real and imaginary parts for being transmitted modulation symbol.It is general by the progressive average errors of QSM
Rate expression formula can be seen that QSM and only receive diversity, without transmitting diversity.This scheme of the invention is proposed activation is transmitted into day
Line is converted into activation spatial domain matrix A to increase transmitting diversity, A=(A1,A2,...,AQ) it is NtRow T is arranged and each row and column only have one
The antenna array of individual nonzero element, number Q.
2) information bit B is divided into B1,B2,B3Three parts, according toTable
Show downward rounding operation, obtain B1,B2Value, the value represent the bit number of activation spatial domain matrix.lengthB3=log2M, obtain B3
Value, the value represents to be mapped as modulation symbol s bit number.Real part information bit after modulationWith B1The space matrix selected
A(1)Multiplication obtains signal matrixImaginary part information bitWith B2The space matrix A selected(2)Multiplication obtains signal square
Battle arrayIt is overlapped to obtain transmission signal matrix S with latter two signal matrix(t)。
Work as A(1)=A(2)When S(t)Each list be shown as (1),Represent the matrix of activation
Index：
Work as A(1)≠A(2)When, S(t)Each list be shown as (2)：
3) under the influence of multiple Gauss noise N, the signal that reception antenna receives is expressed as signal：
Y=HS(t)+N (3)
Wherein,For mimo channel matrix, CN (0,1) multiple Gauss distribution is obeyed,
For noise matrix, CN (0, σ is obeyed2) multiple Gauss distribution, σ2For noise variance.
4) for the ease of the detection of signal, the DQSM-SD that linearizes equivalent system model and will represent in the matrix form is utilized
System is equivalent to the system represented in the form of vectors, then is represented by
WhereinThe vectorization of vec () representing matrix, wherein
Kron () expressions carry out kronecker operation to matrix,Represent Q spatial domain square
Combinatorial matrix after array vector.Work as A(1)=A(2)When, K=[0 ..., s, 0 ..., 0]T∈CQ×1；Work as A(1)≠A(2)When,Wherein the number of nonzero element combines with the space matrix that real part imaginary part is chosen
It is relevant.Nonzero element position is activated corresponding with which spatial domain matrix.5) according to biography
The thought of system globular decoding, corresponding search procedure can be equivalent to：
||U(Z-Y′)||≤d2 (5)
WhereinU∈CQ×QFor upper triangular matrix, ()HExpression takes the associate matrix of a certain matrixExpression takes matrixPseudo inverse matrix, Z=CQ×1Represent to participate in the candidate searched for
Vector, its structure is as K.D is the search radius of globular decoding, and its initial value is equal to tired when searching root node for the first time
Product metric value.
6) detection process is searched from the 4th layer does node and does, and the minimum node of metric is searched for as third layer after sequence
Root node.The unactivated state of zero point representing matrix is added in detection process.Position correspondence where nonzero element is corresponding
Spatial domain matrix.In search procedure, when first detection node is modulation symbol, show the spatial domain matrix of real part imaginary part activation
To be identical, i.e.,：A(1)=A(2), that remaining search node will automatically become zero；Equally, if first detection node accords with for modulation
Number real part or imaginary part, then the node for remaining next position must be corresponding real part or imaginary part, remaining candidate's section
Point is corresponding to be reduced.
According to the method for transmitting signals of above-mentioned OFDM index modulation system, beneficial effects of the present invention are：
1) QSM activation antenna transmission signals are converted into activation spatial domain matrix by the scheme of the invention, and hair is added for QSM systems
Penetrate diversity；
2) method of addition zero point has been used to represent the position of un-activation spatial domain matrix in the globular decoding detection of receiving terminal,
The corresponding spatial domain matrix of positional representation where nonzero element is activated.While modulation symbol is detected, matrix is judged
Activation scheme.
3) detect search node during, according to if node be modulation symbol if real part imaginary part activate spatial domain matrix phase
Together, search node is successively shortened the characteristics of surplus next node must be its imaginary part or real part if node is real part or imaginary part
Number, further reduce the detection complexity of receiving terminal.
Brief description of the drawings
Fig. 1 is the reality transmitted according to the transmitter signal proposed by the present invention with transmitting diversity orthogonal intersection space modulating system
Illustration is applied to be intended to.
Fig. 2 is that have transmitting diversity, the detection of low complexity orthogonal spatial modulation globular decoding according to proposed by the present invention
The detection node search embodiment schematic diagram of algorithmic method.
Fig. 3 is to be applied to have in QSM systems transmitting diversity and Maximum Likelihood Detection without transmitting diversity and spherical
The performance comparison figure of decoding.
Fig. 4 is that three kinds of detection algorithms are constant in transmitting antenna number, complexity comparison diagram when order of modulation changes.
Fig. 5 is that three kinds of detection algorithms are constant in order of modulation, complexity comparison diagram when transmitting antenna number changes.
Embodiment
The specific embodiment of the present invention is described in detail below in conjunction with accompanying drawing.
According to the low complexity orthogonal spatial modulation globular decoding detection algorithm proposed by the present invention with transmitting diversity, its
Thinking is as shown in figure 1, follow these steps to carry out：
1) QSM system transmitting antenna numbers are set first as Nt, reception antenna number is Nr, modulated using M-QAM.According to
QSM system performances activate N every timetIn two real and imaginary parts for being transmitted modulation symbol.It is general by the progressive average errors of QSM
Rate expression formula can be seen that QSM and only receive diversity, without transmitting diversity.This scheme of the invention is proposed activation is transmitted into day
Line is converted into activation spatial domain matrix A to increase transmitting diversity, A=(A1,A2,...,AQ) it is NtRow T is arranged and each row and column only have one
The antenna array of individual nonzero element, number Q；
2) information bit B is divided into B1,B2,B3Three parts, according toTable
Show downward rounding operation, obtain B1,B2Value, the value represent the bit number of activation spatial domain matrix.lengthB3=log2M, obtain B3
Value, the value represents to be mapped as modulation symbol s bit number.Real part information bit after modulationWith B1The space matrix selected
A(1)Multiplication obtains signal matrixImaginary part information bitWith B2The space matrix A selected(2)Multiplication obtains signal square
Battle arrayIt is overlapped to obtain transmission signal matrix S with latter two signal matrix(t).Work as A(1)=A(2)When S(t)It is each
List is shown as (1),Represent the matrix index of activation：
Work as A(1)≠A(2)When, S(t)Each list be shown as (2)：
3) under the influence of multiple Gauss noise N, the signal that reception antenna receives is expressed as signal：
Y=HS(t)+N (3)
Wherein,For mimo channel matrix, CN (0,1) multiple Gauss distribution is obeyed,
For noise matrix, CN (0, σ is obeyed2) multiple Gauss distribution, σ2For noise variance.
4) for the ease of the detection of signal, the DQSM-SD that linearizes equivalent system model and will represent in the matrix form is utilized
System is equivalent to the system represented in the form of vectors, then is represented by
WhereinThe vectorization of vec () representing matrix, wherein
Kron () expressions carry out kronecker operation to matrix,Represent Q spatial domain matrix
Combinatorial matrix after column vector.Work as A(1)=A(2)When, K=[0 ..., s, 0 ..., 0]T∈CQ×1；Work as A(1)≠A(2)When,Wherein the number of nonzero element combines with the space matrix that real part imaginary part is chosen
It is relevant.Nonzero element position is activated corresponding with which spatial domain matrix.5) according to tradition
The thought of globular decoding, corresponding search procedure can be equivalent to：
||U(Z-Y′)||≤d2 (5)
WhereinU∈CQ×QFor upper triangular matrix, ()HExpression takes the associate matrix of a certain matrix,Expression takes matrixPseudo inverse matrix, Z=CQ×1Represent to participate in the candidate searched for
Vector, its structure is as K.D is the search radius of globular decoding, and its initial value is equal to tired when searching root node for the first time
Product metric value.
According to the low complexity orthogonal spatial modulation globular decoding detection algorithm side proposed by the present invention with transmitting diversity
The detection node search embodiment of method, as shown in Fig. 2 with following embodiment explanations：
Embodiment 1
With transmitting antenna number Nt=4, spatial domain matrix dimensionality T=4, spatial domain matrix total number Q=4, modulation system 4QAM
System exemplified by.Than number be 2 for selecting the spy of spatial domain matrix, the Choice number of spatial domain matrix is 4 according to system model.
Choice is defined as a matrix F=[F1,F2,F3,F4], wherein Fq(q=1,2,3,4) it is spatial domain matrix activation scheme.
Assuming thatWherein " 1 " represents that spatial domain matrix corresponding to position is activated and carries constellation and modulates symbol
Number, " 0 " represents that spatial domain matrix corresponding to position is not activated.
1) invention is searched for since the root node shown in globular decoding tree search composition Fig. 2 first, participates in the time of search
It is four constellation symbols and their real part imaginary part and a zero point to select symbol.Stain represents modulation symbol in tree structure figure
Number, ash point represents the real part or imaginary part of modulation symbol, and hollow dots represent zero point.Numerical value beside each node represents to search
The metric of this node it is cumulative and.
1) metric is ranked up at the 4th layer first, the minimum node of metric is searched for as third layer after sequence
Root node is when third layer scans for using symbol corresponding to the 4th layer of grey point of minimum degree value one (now for 0.15) as base
Plinth continues search for, before third layer scans for, invention first to according to the spatial domain matrix Choice in matrix F to the 4th layer
Node corresponding to minimum degree value is judged.Because the 4th layer is a grey point, according to another transmission symbol of inventive feature
Should be also that ash is put and will not repeated, so calculating apart from and sorting candidate symbol is reduced to 4 when third layer is searched for；
When searching third layer, point is grey point corresponding to minimum degree value, i.e., the two point spatial domain matrixes corresponding to position are swashed
It is living.By with various scheme comparisons, only F in F matrix2Scheme meets the 4th, the 3rd spatial domain matrix and is activated, so according to
F2Second, first spatial domain arranged in matrix can be unactivated state, i.e. [1 10 0] by schemeTCumulative metric value in corresponding diagram
For 1.9 this paths.
2) after the search of a fullpath is completed in invention, search radius d value is set to 1.9, returns to last layer node
Continue search for, record every layer of cumulative metric value and search radius d contrasts, if cumulative metric value is smaller than d, update d value.Such as
Shown in Fig. 2, when this paths search that cumulative metric value is 1.7 finishes, renewal d is further continued for searching for other nodes for 1.7, due to
Other node searching cumulative metric values under 4th layer of first node have been above 1.7, just need not be further continued for down searching for.3)
When invention in the 4th layer of second small metric is 0.5 be less than d, and it is a modulation symbol for a stain expression.That is A(1)=
A(2), real and imaginary parts activation spatial domain matrix it is identical.By with various scheme comparisons, only F in F matrix1Scheme meets the 4th
Individual spatial domain matrix is simultaneously activated, so according to F1Remaining three spatial domain arranged in matrix can be unactivated state by scheme, i.e.,
[1 0 0 0]T, successively search for and contrast cumulative metricses value and d, it is 2.1 this paths to obtain cumulative metric value.It can finally see
Go out, 2.1 are less than 1.7.Therefore it is the point that is passed through of (0.15,0.8,1.1,1.7) this paths to obtain result, most spatial domain matrix at last
Activation position separates progress inverse mapping with the bit entrained by constellation symbol and obtains transmission signal.
The present invention program instantiation is verified, and illustrated by the bit error rate.Fig. 3 is to be applied to DQSM systems
The Maximum Likelihood Detection and the performance comparison figure of low complex degree globular decoding having in system.Four kinds of algorithms are respectively to have transmitting point
The Maximum Likelihood Detection of collection, without the Maximum Likelihood Detection of transmitting diversity, traditional spheroidal decoding, there is the low complexity of transmitting diversity
Spend globular decoding.Emulation is in Nt=4, NrCarry out under=4, M=4, Q=4, T=4 system, modulated using 4QAM, assumed simultaneously
Channel is systems of quasi-static flat Rayleigh fading channels.It can be seen that in the case of order of modulation identical, there is transmitting diversity
The performance of DQSM-ML algorithms is best, than QSM-ML algorithm the bit error rate be 10-4When have nearly 1dB superiority.And DQSM-SD is calculated
Method and the performance of QSM-ML algorithms are also very close to.Simultaneously it can be seen that four kinds of algorithm performances are essentially identical in low signal-to-noise ratio,
Margi n pulls big during higher than 6dB.Because transmitting diversity improves the reliability of transmission, therefore it is more suitable for selecting with the serious frequency that declines
Property mode.
In addition, Fig. 4, Fig. 5 are Maximum Likelihood Detection under different situations, without the Maximum Likelihood Detection of transmitting diversity, have
These three algorithms of the low complex degree globular decoding of transmitting diversity obtain computation complexity comparison schematic diagram.This hair in complicated degree of analysis
It is bright to be measured using real multiplications calculation times.Such as：For A × B,It is respectively necessary for
4mnp and 2n computing.Therefore the complexity of maximum likelihood algorithm is under QSM systems：
CDQSM-ML=8Nr×Nt 2×M (1)
Compared with QSM-ML, DQSM-ML algorithms more a spatial domain dimension T, DQSM-ML complexity formula are as follows：
CDQSM-ML=8Nr×Nt 2×T×M (2)
Complexity formula under DQSM-SD systems is as follows：
CDQSM-SD=20/3 × Q3+22×Q3+4Nt×Nr×Q×T (3)
Fig. 4 compared for three kinds of algorithms and be fixed in transmitting antenna number, the complexity under order of modulation change conditions.It can be seen that
There is obvious difference with the increasing three complexity of order of modulation, ramped not with M with Maximum Likelihood Detection complexity
Together, DQSM-SD algorithms are judged spatial domain matrix activation combination, substantially reduced by introducing zero point, detection while debugging symbol
Detection complexity.Fig. 5 compared for three kinds of algorithms in M=8, situation when transmitting antenna number changes.It can be seen that three examines
Complexity all increasing and increase with transmitting antenna number are surveyed, when transmitting antenna number is bigger, DQSM-SD advantage is more obvious.
The specific embodiment of the present invention is described in detail above in conjunction with accompanying drawing.But the present invention is not limited to above-mentioned
Embodiment.In the case of the spirit and scope of patent requirements of the application are not departed from, those skilled in the art can make respectively
Kind modification or remodeling.
Claims (1)
1. a kind of low complexity orthogonal spatial modulation globular decoding detection algorithm (DQSM-SD) with transmitting diversity, its feature
It is, it comprises the following steps：
1) QSM system transmitting antenna numbers are set first as Nt, reception antenna number is Nr, modulated using M-QAM；According to QSM systems
System characteristic activates N every timetIn two real and imaginary parts for being transmitted modulation symbol, will activation transmission antenna be converted into activation
Spatial domain matrix A increases transmitting diversity, A=(A1,A2,...,AQ) it is NtRow T is arranged and each row and column only have nonzero element
Antenna array, number Q；
2) it is B to divide information bit B1,B2,B3Three parts, according to Represent downward
Rounding operation, obtain B1,B2Value, the value represent the bit number of activation spatial domain matrix, lengthB3=log2M, obtain B3Value, should
Value represents to be mapped as modulation symbol s bit number；Real part information bit after modulationWith B1The space matrix A selected from A(1)
Multiplication obtains signal matrixImaginary part information bitWith B2The space matrix A selected from A(2)Multiplication obtains signal
MatrixTwo signal matrix are overlapped to obtain transmission signal matrix S(t), i.e.,
Work as A(1)=A(2)When S(t)Each row S(t) columnFormula (1) is expressed as,Represent activation
Matrix index：
When selection matrix A(1)≠A(2)When, S(t)Each list be shown as formula (2)：
3) under the influence of multiple Gauss noise N, the signal that reception antenna receives is expressed as signal：
Y=HS(t)+N (3)
Wherein,For mimo channel matrix, CN (0,1) multiple Gauss distribution is obeyed,For noise
Matrix, obey CN (0, σ2) multiple Gauss distribution, σ2For noise variance.
4) for the ease of the detection of signal, the DQSM-SD systems that linearizes equivalent system model and will represent in the matrix form are utilized
The system represented in the form of vectors is equivalent to, is expressed as
<mrow>
<mover>
<mi>Y</mi>
<mo>~</mo>
</mover>
<mo>=</mo>
<mover>
<mi>H</mi>
<mo>^</mo>
</mover>
<mi>&zeta;</mi>
<mi>K</mi>
<mo>+</mo>
<mover>
<mi>N</mi>
<mo>~</mo>
</mover>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
WhereinThe vectorization of vec () representing matrix, whereinkron
() represents to carry out kronecker operation, ζ=[vec (A to matrix1)…vec(AQ)]∈CNtT×QRepresent Q spatial domain rectangular array to
Combinatorial matrix after quantization；Work as A(1)=A(2)When, K=[0 ..., s, 0 ..., 0]T∈CQ×1；Work as A(1)≠A(2)When,Wherein the number of nonzero element combines with the space matrix that real part imaginary part is chosen
It is relevant, nonzero element position be activated with which spatial domain matrix it is corresponding,
5) thought decoded according to traditional spheroidal, corresponding search procedure can be equivalent to：
||U(Z-Y′)||≤d2 (5)
WhereinU∈CQ×QFor upper triangular matrix, ()HExpression takes the associate matrix of a certain matrix, Expression takes matrixPseudo inverse matrix, Z=CQ×1Represent to participate in the candidate searched for
Vector, for its structure as K, d is the search radius of globular decoding, and its initial value is equal to tired when searching root node for the first time
Product metric value；
6) detection process is done from the 4th layer of search node, using the minimum node of metric as third layer after being sorted by metric
The root node of search, the unactivated state of zero point representing matrix, the position correspondence where nonzero element are added in detection process
Corresponding spatial domain matrix, in search procedure, when first detection node is modulation symbol, show the sky of real part imaginary part activation
Domain matrix is identical, i.e.,：A(1)=A(2), that remaining search node will automatically become zero；Equally, if first detection node is
The real part or imaginary part of modulation symbol, then the node for remaining next position must be corresponding real part or imaginary part, remaining
Both candidate nodes are reduced accordingly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711063638.XA CN107835068B (en) | 2017-11-02 | 2017-11-02 | Low-complexity orthogonal space modulation spherical decoding detection algorithm with transmit diversity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711063638.XA CN107835068B (en) | 2017-11-02 | 2017-11-02 | Low-complexity orthogonal space modulation spherical decoding detection algorithm with transmit diversity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107835068A true CN107835068A (en) | 2018-03-23 |
| CN107835068B CN107835068B (en) | 2020-10-16 |
Family
ID=61651603
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711063638.XA Active CN107835068B (en) | 2017-11-02 | 2017-11-02 | Low-complexity orthogonal space modulation spherical decoding detection algorithm with transmit diversity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107835068B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108900450A (en) * | 2018-08-08 | 2018-11-27 | 京东方科技集团股份有限公司 | ESL system, wireless communication system and its receiving end and signal acceptance method |
| CN111106860A (en) * | 2019-12-13 | 2020-05-05 | 重庆邮电大学 | Low-complexity generalized spatial modulation spherical decoding detection method |
| CN112217552A (en) * | 2020-10-10 | 2021-01-12 | 电子科技大学 | Detection method for hypersphere continuous phase modulation signal |
| CN112769463A (en) * | 2020-12-21 | 2021-05-07 | 西安交通大学 | Orthogonal index modulation method based on diagonal space-frequency codes |
| CN113438191A (en) * | 2021-06-23 | 2021-09-24 | 安徽师范大学 | Zero codeword assisted sphere decoding method and system for SM-SCMA system uplink |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130010546A1 (en) * | 2011-07-06 | 2013-01-10 | Arm Limited | Apparatus and method for receiving a differential data strobe signal |
| CN106788626A (en) * | 2016-12-02 | 2017-05-31 | 西安交通大学 | A kind of improvement orthogonal intersection space modulation transmission method for being obtained in that second order transmitting diversity |
| CN106850012A (en) * | 2016-12-12 | 2017-06-13 | 西安交通大学 | A kind of safe transmission method of physical layer of utilization space modulation technique |
| CN106911374A (en) * | 2017-01-16 | 2017-06-30 | 重庆邮电大学 | A kind of low complexity soft exports spatial modulation detection method |
| CN106953674A (en) * | 2017-03-29 | 2017-07-14 | 中国电子科技集团公司第七研究所 | Modulating method and system |
-
2017
- 2017-11-02 CN CN201711063638.XA patent/CN107835068B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130010546A1 (en) * | 2011-07-06 | 2013-01-10 | Arm Limited | Apparatus and method for receiving a differential data strobe signal |
| CN106788626A (en) * | 2016-12-02 | 2017-05-31 | 西安交通大学 | A kind of improvement orthogonal intersection space modulation transmission method for being obtained in that second order transmitting diversity |
| CN106850012A (en) * | 2016-12-12 | 2017-06-13 | 西安交通大学 | A kind of safe transmission method of physical layer of utilization space modulation technique |
| CN106911374A (en) * | 2017-01-16 | 2017-06-30 | 重庆邮电大学 | A kind of low complexity soft exports spatial modulation detection method |
| CN106953674A (en) * | 2017-03-29 | 2017-07-14 | 中国电子科技集团公司第七研究所 | Modulating method and system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108900450A (en) * | 2018-08-08 | 2018-11-27 | 京东方科技集团股份有限公司 | ESL system, wireless communication system and its receiving end and signal acceptance method |
| CN111106860A (en) * | 2019-12-13 | 2020-05-05 | 重庆邮电大学 | Low-complexity generalized spatial modulation spherical decoding detection method |
| CN112217552A (en) * | 2020-10-10 | 2021-01-12 | 电子科技大学 | Detection method for hypersphere continuous phase modulation signal |
| CN112217552B (en) * | 2020-10-10 | 2021-09-07 | 电子科技大学 | Detection method for hypersphere continuous phase modulation signal |
| CN112769463A (en) * | 2020-12-21 | 2021-05-07 | 西安交通大学 | Orthogonal index modulation method based on diagonal space-frequency codes |
| CN112769463B (en) * | 2020-12-21 | 2022-04-22 | 西安交通大学 | Orthogonal index modulation method based on diagonal space-frequency codes |
| CN113438191A (en) * | 2021-06-23 | 2021-09-24 | 安徽师范大学 | Zero codeword assisted sphere decoding method and system for SM-SCMA system uplink |
| CN113438191B (en) * | 2021-06-23 | 2023-06-30 | 安徽师范大学 | Method and system for decoding spherical codes assisted by zero code words of uplink of SM-SCMA system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107835068B (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107835068A (en) | A kind of low complexity orthogonal spatial modulation globular decoding detection algorithm with transmitting diversity | |
| JP3604981B2 (en) | Wireless communication method | |
| KR100679860B1 (en) | Low-complexity joint transmit/receive antenna selection method for mimo systems | |
| CN102546088B (en) | A kind of block diagonalization method for precoding and device | |
| CN108234380B (en) | Frequently-mode-dummy status Multidimensional and Hybrid modulation radio communication signal method | |
| CN105827293A (en) | Multi-user generalized space modulation system linearity zero-forcing precoding method | |
| US8831128B2 (en) | MIMO communication system signal detection method | |
| CN107204831B (en) | A kind of low complex degree detection method for MIMO-SCMA system | |
| CN106788626B (en) | Improved orthogonal space modulation transmission method capable of obtaining second-order transmit diversity | |
| CN110011946A (en) | Support the orthogonal intersection space modulator approach of the enhanced available transmitting diversity of fast decoding | |
| JP2001094489A (en) | Wireless differential communication method | |
| CN101834827B (en) | Signal detection method and device in multiple-input multiple-output system | |
| CN109412670A (en) | Low complex degree detection method in GSM-MBM system based on relaxative iteration | |
| Jiang et al. | Generalized 3-D spatial scattering modulation | |
| CN107888271A (en) | A kind of wave beam determines method and device | |
| CN101252419A (en) | Capacity evaluating method using channel statistical information in multi-aerial transmission system | |
| CN109660325A (en) | Data processing method and device | |
| CN106411796B (en) | Multiple terminals signal detecting method and base station in a kind of access of non-orthogonal multiple | |
| CN114513234A (en) | Waveform generation method and equipment | |
| CN113794492A (en) | Space-time shift keying method based on code index modulation | |
| CN103765805B (en) | A kind of method for multi-user pre-coding and device | |
| CN107196741B (en) | A kind of detection method for MIMO-SCMA system | |
| CN111505613A (en) | MIMO radar transmitting antenna arrangement method based on virtual antenna Kuhn-Munkres algorithm | |
| CN104113499B (en) | A kind of low complex degree memory space constraint detection method based on probability sorting | |
| CN117118479A (en) | Spread spectrum communication method, system, medium and device based on intelligent reflecting surface |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240108 Address after: Room 407-10, floor 4, building 2, Haichuang science and technology center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province, 311100 Patentee after: Zhejiang Zhiduo Network Technology Co.,Ltd. Address before: 310018 No. 258, Xue Yuan Street, Jianggan Economic Development Zone, Hangzhou, Zhejiang. Patentee before: China Jiliang University |