CN104468456B - A kind of broad sense space-time based on unit matrix loop structure moves key modulation method - Google Patents

A kind of broad sense space-time based on unit matrix loop structure moves key modulation method Download PDF

Info

Publication number
CN104468456B
CN104468456B CN201410751924.5A CN201410751924A CN104468456B CN 104468456 B CN104468456 B CN 104468456B CN 201410751924 A CN201410751924 A CN 201410751924A CN 104468456 B CN104468456 B CN 104468456B
Authority
CN
China
Prior art keywords
gstsk
scattering
matrix
modulation
activated
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.)
Expired - Fee Related
Application number
CN201410751924.5A
Other languages
Chinese (zh)
Other versions
CN104468456A (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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201410751924.5A priority Critical patent/CN104468456B/en
Publication of CN104468456A publication Critical patent/CN104468456A/en
Application granted granted Critical
Publication of CN104468456B publication Critical patent/CN104468456B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • H04L1/0612Space-time modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • H04L1/0618Space-time coding
    • H04L1/0625Transmitter arrangements

Landscapes

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

Abstract

Key modulation method is moved the invention discloses a kind of broad sense space-time based on unit matrix loop structure, spatial modulation (Spatial Modulation, SM) and empty keying modulation (Space Shift Keying are moved, SSK) utilization space dimension transmits information, and more traditional MIMO scheme can obtain extra spectrum efficiency.In the modulator approach of the present invention, unit matrix is moved in collision matrix interior circulation, and collision matrix no longer needs computer to do auxiliary search.And GSTSK CI are applied to any mimo system that transmitting antenna number is more than 2, and except two kinds of special situations, the present invention can obtain transmitting diversity.GSTSK CI methods possess the lower decoding complexities of more traditional GSTSK and higher compared with SM OSTBC spectrum efficiency under identical transmitting antenna number simultaneously.Simulation result confirms theory analysis and shows that GSTSK CI are better than GSTSK and SM OSTBC schemes.

Description

Generalized space-time shift keying modulation method based on unit array cyclic structure
Technical Field
The invention belongs to the technical field of multi-antenna wireless communication, relates to a transmit diversity transmission technology in a multi-antenna wireless communication system, and particularly relates to a generalized space-time shift keying modulation method based on a unit array cyclic structure.
Background
Spatial Modulation (SM) and Space Shift Keying (SSK) utilize Spatial dimensions to transmit information, which may achieve additional spectral efficiency compared to conventional MIMO schemes. Therefore, in recent years, SM and SSK have received much attention as a novel MIMO transmission technology. However, SM and SSK only activate one antenna per transmission, so they cannot achieve transmit diversity and can rely on receive diversity only to combat channel fading.
To overcome the drawback that SM and SSK cannot achieve transmit diversity, various methods have been proposed. For example, the document generalizes the concept of SM to the spatial and temporal dimensions, and proposes a Space-Time Shift Keying (STSK) method that can obtain transmit diversity. However, the transmission rate of STSK decreases linearly with the number of transmission slots, and the optimal scattering matrix set thereof needs to be optimally searched by a computer. To further improve spectral efficiency, Sugiura et al proposed a Generalized Space-time Shift Keying modulation scheme (GSTSK) by activating multiple scattering matrices within one GSTSK signaling slot. Base et al in Space-time coded spatial modulation combines Space-time coding and SM to provide a Space-time block code spatial modulation scheme. By utilizing the orthogonality of the Alamouti space-time coding, the scheme can realize the maximum likelihood decoding with low complexity. However, in the STBC-SM scheme, in order to achieve 2 nd order transmit diversity, the rotation angle needs to be optimized, and the spectral efficiency provided by spatial dimension modulation is low. In order to improve the spectral efficiency of the STBC-SM scheme, X. Although the spectrum efficiency of the STBC-CSM is improved compared with that of the STBC-SM system, the number of angles needing to be optimized is increased correspondingly. It is obvious that the optimal search and angle optimization of the scattering matrix in the above documents increase the design responsibility of the MIMO system. Recently, m.t.le et al have proposed a high rate orthogonal STBC-SM scheme, called SM-OSTBC, by introducing the concept of spatial constellation matrices. The SM-OSTBC method can achieve transmit diversity of order 2 without any optimization of the optimal search and angle. Unfortunately, the SM-OSTBC method is only suitable for MIMO systems with an even number of transmit antennas and radio frequency chains, while the transmitting end needs to configure at least 4 radio frequency chains.
Disclosure of Invention
The invention aims to solve the problems in the prior art and provides a generalized space-time shift keying modulation method based on a unit array cyclic structure. The GSTSK-CI scheme is applicable to any MIMO system with a number of transmit antennas greater than 2, and the present invention can achieve transmit diversity except for two special cases. Meanwhile, the GSTSK-CI scheme has lower decoding complexity than the traditional GSTSK and higher spectral efficiency than SM-OSTBC under the same number of transmitting antennas. The simulation results confirm the theoretical analysis and indicate that the GSTSK-CI is superior to the GSTSK and SM-OSTBC schemes.
In order to achieve the purpose, the technical scheme adopted by the invention comprises the following steps:
a generalized space-time shift keying modulation method based on a unit matrix cyclic structure comprises the following steps:
1) for a compound containing NtRoot transmitting antenna and NrIn the GSTSK-CI system of root receiving antenna, firstly, in every T transmission time slots, B is log2f(Q,P)+Plog2M bits enter a transmitting end, and the B bits are divided into two parts after being subjected to serial-parallel conversion, wherein the two parts are respectively as follows: b is1=log2f (Q, P) and B2=Plog2M; wherein T is more than or equal to 2 and less than or equal to Nt(ii) a P is the number of scattering matrixes activated simultaneously in each T transmission time slots, and Q is the total number of the scattering matrixes;
2) b after serial-to-parallel conversion1=log2f (Q, P) bits are used to activate P from the pre-designed Q scattering matricesP1., P; wherein,the number of combinations of the total effective scattering matrix; the rest of B2=Plog2M bits are modulated into P M-PSK/QAM symbols s(p),p=1,...,P;
3) The P scattering matrixes A activated in the step 2) are used(p)With corresponding P M-PSK/QAM symbols s(p)Multiplying and adding to obtain the final GSTSK-CI transmitting code word
In the step 2), the method for designing the Q scattering matrices of the GSTSK-CI specifically comprises the following steps:
for a compound containing NtThe GSTSK-CI modulation system of a root transmitting antenna has the number of scattering matrixes Q-Nt(ii) a Each scattering matrix comprises a unit matrix ITAnd I isTMoving cyclically in a scattering matrix concentration, ITRespectively in the q-th row to the q-th row of the q-th scattering matrixLine, where q is 1, K, NtAnd is andrepresents (q + T-1) and NtThe remainder of (1); in each T transmission time slots, when P scattering matrices are simultaneously activated from Q scattering matrices, then P antennas are activated in the same time slot, and then the scattering matrix of GSTSK-CI is as follows:
compared with the prior art, the invention has the following beneficial effects:
1) the scattering matrix can be simply designed with the system, any angle optimization and computer optimal search are not needed, and the design complexity of the system is greatly reduced;
2) the invention is suitable for any MIMO system with the number of the transmitting antennas larger than 2, relaxes the limitation of SM-OSTBC on the number of the transmitting antennas and the number of the radio frequency links, and is better suitable for an actual communication system.
3) The invention can not only obtainThe transmission diversity gain of the order, higher order transmission diversity gain can also be obtained. When the scattering matrix of the GSTSK-CI is composed of second-order units I2When the loop is formed, the invention can obtain the transmission diversity order of 2 like STBC-SM, STBC-CSM and SM-OSTBC. But I2Or can be formed by3、I4Or higher order unit arrays, that is, transmit diversity orders of 3,4 or higher, that is, higher order transmit diversity gains, can be achieved.
3) The invention can obtain higher spectral efficiency. In particular, when P scattering matrices are activated from Q scattering matrices in each transmission intervalThe spectral efficiency is higher when the value of (d) is larger. For convenience of representation, N is configuredtRoot transmitting antenna, NtThe root receive antenna and the P simultaneously activated scattering matrices (P simultaneously activated transmit antennas) are denoted (N)t,NrP). Such as GSTSK-CI (16, N)r4), when using 4-QAM modulation, one can provide for 1024 effective combinations of scattering matrices, hence the spectral efficiency provided by the spatial dimensionThe spectral efficiency provided by the symbol modulation isHowever, the spectrum efficiency provided by the SC matrix and the symbol modulation in the SM-OSTBC method is B respectively14bits/s/Hz and B22 bits/s/Hz. Obviously, the total spectral efficiency of the GSTSK-CI is 9bits/s/Hz, while the total spectral efficiency of the SM-OSTBC is only 6 bits/s/Hz;
4) the maximum likelihood decoding complexity of the invention is reduced compared with GSTSK. Scattering matrix A in GSTSKq(Q1., Q) is a complex matrix obtained by computer search, whereas in GSTSK-CI, the elements in the scattering matrix contain only 0 and 1, which are real matrices, so the proposed algorithm requires less real multiplication than GSTSK,therefore, the decoding complexity can be effectively reduced.
Drawings
FIG. 1 is a block diagram of a GSTSK-CI modulation system of the present invention;
FIG. 2 shows the present invention at NtWhen the spectral efficiency is 5.5, 6 and 7.5bits/s/Hz, the BER performance of the GSTSK-CI and the SM-OSTBC is compared;
FIG. 3 is a graph comparing the BER performance of GSTSK-CI and SM-OSTBC for spectral efficiencies of 6, 6.5, 7, and 7.5bits/s/Hz according to the present invention.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings:
referring to fig. 1, both conventional M-PSK/QAM and activated scattering matrices may be used to transmit information bits. The invention constructs a scattering matrix by circularly moving a unit matrix in the matrix. Firstly, the scattering matrix of the GSTSK-CI scheme can be simply designed with a system, and meanwhile, angle optimization and optimal search by a computer are not needed; secondly, the GSTSK-CI scheme is applicable to any case where the number of transmit antennas is greater than 2, and the present invention can achieve higher spectral efficiency than existing schemes, especially when P scattering matrices are activated from Q in each transmission interval, when P scattering matrices are activatedWhen the value of (a) is larger, the spectral efficiency is higher; finally, the complexity of the maximum likelihood decoding detection algorithm at the receiving end is reduced compared with the GSTSK; simulation results show that the GSTSK-CI can obtain better bit error rate performance than many existing schemes. Fig. 2 and 3 illustrate the effect of the present invention on the improvement of system performance.
In STSK/GSTSK, both the M-PSK/QAM symbols and the index numbers of the activated scattering matrices convey information. The key to designing STSK/GSTSK is how to search for the optimal set of scattering matrices according to pre-set criteria. The search of the set of scattering matrices requires a lot of computational complexity and time, especially when the modulation order is high and the order of the scattering matrix is large. As known from the literature, the existing GSTSK scheme can support a MIMO system with the maximum number of transmitting antennas being 4 and adopting 16-QAM modulation. In the proposed GSTSK-CI scheme, the scattering matrix can be designed systematically, and a computer is not needed to conduct auxiliary search and any angle optimization, so that the proposed scheme is very suitable for future massive MIMO systems.
Specifically, the GSTSK-CI modulation process of the present invention is shown in fig. 1, and the specific modulation and detection algorithm comprises the following four steps:
the first step is as follows: for a compound containing NtRoot transmitting antenna, NrThe GSTSK-CI system of a root receiving antenna firstly processes every T (T is more than or equal to 2 and less than or equal to Nt) In one transmission time slot, B is log2f(Q,P)+Plog2M bits enter a transmitting end, and the B bits are divided into two parts after being subjected to serial-parallel conversion, wherein the two parts are respectively as follows: b is1=log2f (Q, P) and B2=Plog2M。
The second step is that: b after serial-to-parallel conversion1=log2f (Q, P) bits are used to activate P A's from the pre-designed Q scattering matrices(p)(P ═ 1.., P), whereThe number of combinations of the total effective scattering matrix; the rest of B2=Plog2M bits are modulated into P M-PSK/QAM symbols s(p)(P ═ 1.., P). The design process of the scattering matrix of the GSTSK-CI is as follows:
for a compound containing NtThe GSTSK-CI modulation system of the root transmitting antenna is designed by the scheme that the number of scattering matrixes is Q-Nt. Each scattering matrix comprises a unit matrix I2And I is2Moving cyclically in a scattering matrix concentration, I2Is non-zeroThe elements are respectively in the qth row and the qth of the qth scattering matrixLine, where q is 1, K, NtAnd is andrepresents (q +1) and NtThe remainder of (1). In every T transmission slots, when P are simultaneously activated from Q scattering matrices, then P antennas are activated in the same slot. The scattering matrix of the GSTSK-CI is shown as follows:
it is noted that in order to obtain higher transmit diversity gain, the unit matrix I in the scattering matrix of the GSTSK-CI2Can be formed by3、I4Or higher order unit arrays, i.e., transmit diversity orders of 3,4, or higher may be achieved. However, the spectral efficiency of the GSTSK-CI scheme decreases linearly with the number of slots required for transmission, so T is 2 to obtain the highest possible spectral efficiency while maintaining full diversity.
The third step: q scattering matrices designed from the second stepActivates P symbols and corresponds to P M-PSK/QAM symbols s(p)Multiplying (P ═ 1.. multidot., P) and adding to obtain the final GSTSK-CI transmitting code wordThe spectral efficiency R of the GSTSK-CI scheme is thus
The fourth step: detection of GSTSK-CI. When the GSTSK-CI scheme is adopted for transmission, the receiving end receives signalsCan be expressed as
WhereinRepresenting space-time code words sent in T symbol time slots;andrepresenting the channel and noise matrices, respectively, where the elements in H and N both obey a gaussian distribution with mean 0 and variance 1; p is the average signal-to-noise ratio at each receive antenna. The scattering matrix of the GSTSK-CI is a real matrix and only contains elements 0 and 1, so the decoding complexity is reduced compared with the GSTSK.
By vector-operating (vec ()) the signal model of the system can be converted into
Wherein, note also that K contains P non-zero values, which are all taken from the complex signal constellation of M-PSK/QAM.
According to the maximum likelihood detection rule, thenThe detection process comprises the following steps:
whereinTo representThe q-th column of (1).
The decoding complexity of the system is quantified by calculating the number of real number multiplication in the GSTSK-CI decoding process, wherein the calculation number of one complex number multiplication is equivalent to four real number multiplications. The degree of responsibility for decoding of the GSTSK-CI can be expressed as
Obviously, the coding complexity of the GSTSK-CI is lower than that of the GSTSK under the same number of transmit antennas. The specific reasons are as follows: scattering matrix A in GSTSKqThe (Q ═ 1., Q) is a complex matrix obtained by computer search, and in the GSTSK-CI, the elements in the scattering matrix only contain 0 and 1, and are real matrixes, so the proposed algorithm needs less real multiplication than the GSTSK, that is, compared with the GSTSK, the special structure of the GSTSK-CI scattering matrix and the particularity of the elements of the GSTSK-CI scattering matrix can reduce the decoding complexity.
Diversity and coding gain of the invention
The main criterion of space-time coding design under quasi-static Rayleigh fading channel is to maximize the sum of any two different GSTSK-CI code words S and SMinimum coding gain. Order toDifference matrixThe coding gain is defined as:
for having NtFor the GSTSK-CI modulation system of the root transmit antenna, the transmit signal matrix can be expressed as:
wherein c isj,kA jth row and kth column element representing S, where k 1,2, j 1j,kIs 0 or one M-PSK/QAM element. Owing to the special structure of the scattering matrix in formula (1), c can be found1,1=c2,2、c2,1=c3,2And c3,1=c4,2And so on. The signal matrix of equation (8) can therefore be rewritten as:
assuming P scattering matrices are activated from Q scattering matrices, each column of S contains P non-zero elements, and these non-zero elements are M-PSK/QAM symbols, so the difference matrix Δ can be expressed as:
whereinThen the matrix deltaHΔ is:
thus can obtain
According to the theorem of inequality of absolute value in literature, the second term of the above equation can be simplified as:
if and only ifThe time equal sign holds, whereinIs a constant coefficient. Det (Δ)HΔ) can be further simplified to:
as can be seen from the formula (14), whenThe first term of the above equation is always greater than zero, in order to demonstrate det (Δ)HΔ) is greater than zero, and the second term of equation (14) must also be greater than zero, several corresponding cases being discussed below.
Case 1, S andthe scattering matrices of (1) are identical, and case 1 can be specifically divided into the following two cases.
Case 1.1.P ═ Q. I.e. at each transmissionWithin the slot, all transmit antennas are activated. As can be seen from the formula (10), when P ═ Q,it may be true, and as can be seen from equation (14), whenWhen true, det (Δ) cannot be guaranteedHΔ)>0. Therefore, in order to obtain second-order transmit diversity, the case of P ═ Q must be removed.
Case 1.2.P < Q. In this case, it is preferable that the air conditioner,at least Q-P elements in the composition are zero, but becauseThe remaining P elements cannot be zero at the same time, in other wordsIt is unlikely to be true, so det (Δ) can be demonstratedHΔ)>0。
Case 2.S andthe scattering matrices of the intermediate activation are completely different, and the following two cases can be distinguished.
Case 2.1.P < Q/2. In this case, inThis NtOf the Q elements, only Q-2P elements are zero and the remaining 2P elements are M-PSK/QAM symbols, similar to case 1.2, det (Δ) can be demonstratedHΔ)>0。
Case 2.2.P ═ Q/2. In this case, half of the active antennas are simultaneously active during each transmission slot. Case 2.2 only in case of even number of transmitting antennas. When S is equal toWhere the activated scattering matrices are completely different, similarly to case 1.1May be true and thus det (Δ) cannot be guaranteedHΔ)>0 and thus case 2.2 must be removed.
Case 3.S andthe scattering matrices of the medium activation are not identical. Suppose that S andthe number of identical scattering matrices activated in (1) is L (0 < L < P), where U-2P-L is defined as S andthe number of elements in the set of activated scattering matrices can be specifically divided into the following two cases.
Case 3.1.U < Q. In this case, at S andin which Q-U scattering matrices are not activated, correspondinglyOf which at least Q-U elements are zero, but the remaining U elements are M-PSK/QAM symbols or M-PSK/QAM difference symbols, i.e. inCannot be equal at the same time, so det (Δ)HΔ)>0。
Case 3.2.U ═ Q. In this case, inThere are L M-PSK/QAM difference symbols, and the remaining U-L elements are M-PSK/QAM symbols. It is obvious thatCannot be established, therefore det (Δ)HΔ)>0。
From the above analysis, it can be seen that the coding gain G is greater than zero except for cases 1.1 and 2.2, so when the two cases are eliminated, it can be proved that the proposed algorithm can achieve a transmit diversity order of 2 according to the rank criterion of STBC.
Note that:
for case 3.1, there is a special possibility that needs to be discussed. When Q is even, and P is Q/2, the effective number of scattering matrix combinations isBut no longer f (Q, P). For example, when N istWhen Q is 4 and P is 2, the number of all the combinations of the scattering matrices is 6, which are (1,2), (1,3), (1,4), (2,3), (2,4) and (3,4), respectively, where (1,2) is the index number of the simultaneously activated scattering matrix, and so on. Thus, f (Q, P) ═ 4, where the first four combinations (1,2), (1,3), (1,4), (2,3) were chosen as the alternative combinations. However, as can be seen from case 2.2, when (1,4), (2,3) are selected simultaneously, transmit diversity cannot be obtained, so for the combination (1,4), (2,3), one must be discarded. It can also be seen from case 3.1 that the remaining scattering matrix combinations are valid combinations, i.e. (1,2), (1,3), (1,4) or (1,2), (1,3), (2, 3). Also, since the number of valid combinations of the scattering matrix must be an integer power of 2, the number of valid combinations is
Simulation of experiment
This section is mainly based on the simulation of different numbers of transmitting antennasThe Bit Error Rate (BER) at hand is illustrative of the performance of the GSTSK-CI scheme proposed herein and is compared to the SM-OSTBC scheme. In this section, the number of receiving antennas is set to Nr4 and all performance comparisons are at a BER of 10-4What is done at the time. It is also assumed that the channel state information H is known only to the receiving end.
FIG. 2 shows that when NtAt 6, the BER performance of GSTSK-CI was compared to C (6,4,4), C1(6,4,4) SM-OSTBC at spectral efficiencies of 5.5, 6 and 7.5 bits/s/Hz. Firstly, when the spectral efficiency is 5.5bits/s/Hz, the GSTSK-CI (6,4,4) can obtain the coding gain of about 1.5dB compared with the C (6,4, 4). Secondly, when the spectrum efficiency is 6bits/s/Hz, C1(6,4,4) needs 4 radio links, and the GSTSK-CI of the proposal only needs 3 radio links and simultaneously has about 1.5dB gain compared with C1(6,4, 4). Finally, the GSTSK-CI (6,4,4) can achieve a gain of about 3dB compared to C (6,4,4) when the spectral efficiency is 7 bits/s/Hz.
In FIG. 3, the GSTSK-CI is given herein as N number of transmit antennast8 and NtBER performance at corresponding spectral efficiencies of 6.5, 7 and 6, 7.5bits/s/Hz, respectively, were compared to the SM-OSTBC scheme at the same spectral efficiency. It is clear that GSTSK-CI can achieve better BER performance than SM-OSTBC. First, the GSTSK-CI (8,4,4) can achieve a gain of about 2.5dB over C1 (8,4,4) when the spectral efficiency is 6.5 bits/s/Hz. At a spectral efficiency of 7.5bits/s/Hz, the GSTSK-CI (10,4,4) has a gain of about 2.4 dB over C (10,4, 4). Secondly, when the spectral efficiencies are 7 and 6bits/s/Hz respectively, compared with SM-OSTBC, the GSTSK-CI of the proposed scheme can still obtain better BER performance under the condition of saving one radio frequency link, and as can be seen from FIG. 2, the GSTSK-CI can obtain coding gains of 0.9dB and 1.8dB respectively compared with the SM-OSTBC.
The above-mentioned contents are only for illustrating the technical idea of the present invention, and the protection scope of the present invention is not limited thereby, and any modification made on the basis of the technical idea of the present invention falls within the protection scope of the claims of the present invention.

Claims (1)

1. A generalized space-time shift keying modulation method based on a unit matrix cyclic structure is characterized by comprising the following steps:
1) for a compound containing NtRoot transmitting antenna and NrIn the GSTSK-CI system of root receiving antenna, firstly, in every T transmission time slots, B is log2f(Q,P)+Plog2M bits enter a transmitting end, and the B bits are divided into two parts after being subjected to serial-parallel conversion, wherein the two parts are respectively as follows: b is1=log2f (Q, P) and B2=Plog2M; wherein T is more than or equal to 2 and less than or equal to Nt(ii) a P is every T transmissionsThe number of scattering matrixes activated simultaneously in the time slot is input, Q is the total number of the scattering matrixes, and M is the modulation order of a phase shift keying PSK constellation or a quadrature amplitude modulation QAM constellation, namely the number of signal points in the PSK or QAM constellation;
2) b after serial-to-parallel conversion1=log2f (Q, P) bits are used to activate P from the pre-designed Q scattering matricesP1., P; wherein,the number of combinations of the total effective scattering matrix; the rest of B2=Plog2M bits are modulated into P M-PSK/QAM symbols s(p)P1., P; wherein,denotes the number of combinations of P from Q, symbolRepresents the integerDown to an integer power of 2;
3) the P scattering matrixes A activated in the step 2) are used(p)With corresponding P M-PSK/QAM symbols s(p)Multiplying and adding to obtain the final GSTSK-CI transmitting code word
The method for designing the Q scattering matrixes of the GSTSK-CI comprises the following steps:
for a compound containing NtThe GSTSK-CI modulation system of a root transmitting antenna has the number of scattering matrixes Q-Nt(ii) a Each scattering matrix comprises a unit matrix ITAnd I isTMoving cyclically in a scattering matrix concentration, ITIs not zero element ofQ-th to q-th rows in the q-th scattering matrixLine, where q is 1, K, NtAnd is andrepresents (q + T-1) and NtThe remainder of (2), wherein the value range of T is 2-4; in each T transmission time slots, when P scattering matrices are simultaneously activated from Q scattering matrices, then P antennas are activated in the same time slot, and then the scattering matrix of GSTSK-CI is as follows:
CN201410751924.5A 2014-12-09 2014-12-09 A kind of broad sense space-time based on unit matrix loop structure moves key modulation method Expired - Fee Related CN104468456B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410751924.5A CN104468456B (en) 2014-12-09 2014-12-09 A kind of broad sense space-time based on unit matrix loop structure moves key modulation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410751924.5A CN104468456B (en) 2014-12-09 2014-12-09 A kind of broad sense space-time based on unit matrix loop structure moves key modulation method

Publications (2)

Publication Number Publication Date
CN104468456A CN104468456A (en) 2015-03-25
CN104468456B true CN104468456B (en) 2017-10-20

Family

ID=52913844

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410751924.5A Expired - Fee Related CN104468456B (en) 2014-12-09 2014-12-09 A kind of broad sense space-time based on unit matrix loop structure moves key modulation method

Country Status (1)

Country Link
CN (1) CN104468456B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105119869B (en) * 2015-06-30 2018-11-06 深圳清华大学研究院 The empty of rectangular constellation figure moves keying communication means when based on sky
CN108234082B (en) * 2017-11-29 2020-08-04 重庆邮电大学 Space modulation-based full diversity space-time coding method
CN109889242B (en) * 2019-01-24 2021-11-12 东华大学 Central circulation weight generalized space shift keying modulation device and modulation method
CN113612505B (en) * 2021-07-16 2022-08-23 中国计量大学上虞高等研究院有限公司 Reconfigurable intelligent surface-based space-time shift keying method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1694376A (en) * 2005-03-17 2005-11-09 西安交通大学 Method for acquiring full marks set gain based on diagonal BLAST structure

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1694376A (en) * 2005-03-17 2005-11-09 西安交通大学 Method for acquiring full marks set gain based on diagonal BLAST structure

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Sphere Decoding for Generalized Space-Time Shift Key;Jianping Zheng;《IEEE》;20141013;第552-556页 *
基于Hadamard矩阵调制的空时频移键控;王磊;《电子与信息学报》;20071015;全文 *

Also Published As

Publication number Publication date
CN104468456A (en) 2015-03-25

Similar Documents

Publication Publication Date Title
Swindlehurst et al. Minimum probability-of-error perturbation precoding for the one-bit massive MIMO downlink
Taherzadeh et al. LLL reduction achieves the receive diversity in MIMO decoding
RU2341021C2 (en) Device and method of space-time block code coding/decoding in mobile communication system based on multiple input and output circuit
KR20060050438A (en) Method for transmitting and receiving data using full rate full diversity stbc
CN104935370B (en) A kind of transmission method that the space-time joint for MIMO communication system is modulated
CN104468456B (en) A kind of broad sense space-time based on unit matrix loop structure moves key modulation method
CN109327287B (en) Spatial modulation method adopting stacked Alamouti coding mapping
CN110855328B (en) Differential spatial modulation method, device and storage medium based on antenna grouping
US10271222B2 (en) Omni-directional transmission in large-scale MIMO systems
CN1860699B (en) Method for the multi-antennae emission of a signal by unitary space-time codes and receiving method
Sugiura Coherent versus non-coherent reconfigurable antenna aided virtual MIMO systems
CN101150379A (en) A low-complexity decoding method for standard orthogonal pace time packet code
US20100107031A1 (en) Multiple-input-multiple-output transmission using non-binary ldpc coding
CN113225117A (en) Multi-user Massive MIMO system signal transmitting and receiving method
CN106130613A (en) A kind of modulating method obtaining transmitting diversity flexibly based on unitary blank time code
KR101100116B1 (en) Apparatus for transmiter processing precoding using the number of transmiter antenna in open loop communication system and method for the same
US20090268854A1 (en) Method and apparatus for multiple antenna communications, and related systems and computer program
US20070082624A1 (en) System and method for transmitting/receiving signal in mobile communication system using multiple input multiple output scheme
CN101272225B (en) Method and device for implementing full velocity transmission in MIMO system
CN114826341B (en) Transmission method of multi-input multi-output system
CN108183737A (en) For the transmission based on gold code in MIMO downlink systems and coding/decoding method
Gangwar et al. Capacity and BER improvement through antenna selection in MIMO systems
CN101997791A (en) Simplified non-binary repeat-accumulate (RA) coding multiple-input multiple-output (MIMO) iterative equalization scheme
CN101729215B (en) Space-time/ space-frequency code construction method, transmitting method and device
KR20070065596A (en) Method for transmitting signals for multiple antenna system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20171020

Termination date: 20201209