CN106788893B - Sparse interleaving multiple access method - Google Patents

Sparse interleaving multiple access method Download PDF

Info

Publication number
CN106788893B
CN106788893B CN201611182132.6A CN201611182132A CN106788893B CN 106788893 B CN106788893 B CN 106788893B CN 201611182132 A CN201611182132 A CN 201611182132A CN 106788893 B CN106788893 B CN 106788893B
Authority
CN
China
Prior art keywords
user
code word
time
sparse
access
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.)
Active
Application number
CN201611182132.6A
Other languages
Chinese (zh)
Other versions
CN106788893A (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.)
Tsinghua University
Original Assignee
Tsinghua 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 Tsinghua University filed Critical Tsinghua University
Priority to CN201611182132.6A priority Critical patent/CN106788893B/en
Publication of CN106788893A publication Critical patent/CN106788893A/en
Application granted granted Critical
Publication of CN106788893B publication Critical patent/CN106788893B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • 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/0047—Decoding adapted to other signal detection operation
    • H04L1/0048—Decoding adapted to other signal detection operation in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder

Landscapes

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

Abstract

The invention provides a sparse interleaving multiple access method, belonging to the technical field of non-orthogonal multiple access mobile communication. The method comprises the steps that firstly, all access users occupy K resource particles and T time domain symbols when transmitting data blocks, then channel coding is carried out on data block information transmitted by each user, the coded data are divided into a plurality of sub bit streams and are mapped into code word vectors; zero padding is carried out on each code word vector to obtain a K-dimensional sparse code word vector; obtaining a K-dimensional sparse sending codeword vector according to a sparse time-frequency interleaver; at each moment, each user transmits and sends a corresponding component in the code word vector according to the transmission resource given by the system; the receiver estimates active users and channel gains thereof, and acquires sparse time-frequency interleaver information thereof; the receiver decodes to obtain the transmission data block of each access user. The method ensures that each user only occupies a small part of the total time-frequency resources when accessing transmission, and reduces the complexity of multi-user detection of the receiver in a large-scale access scene.

Description

Sparse interleaving multiple access method
Technical Field
The invention relates to the technical field of non-orthogonal Multiple Access mobile communication, and particularly provides a Sparse Interlace Division Multiple Access (SIDMA).
Background
The performance of the conventional Code Division Multiple Access (CDMA) is limited due to Multiple Access Interference (MAI) and inter-symbol interference (ISI). The existing main research foothold proposes a new multi-user detection (MUD) method to reduce the impact of MAI and ISI on performance. In several documents, it is proposed to improve the performance by allocating different interleavers to different users, so that there is a conventional interleaved multiple access method (IDMA). It has the advantages of conventional CDMA, namely combating fading through diversity and mitigating the worst case user interference problem for other cells. Furthermore, due to the different random interleaving used by different users, adjacent chips are approximately uncorrelated, allowing the receiver to perform relatively simple chip-by-chip iterative MUD techniques. The system obtains performance close to the shannon limit through soft information exchange iteration between an Elementary Signal Estimator (ESE) and a posterior probability Decoder (DEC) of each user. However, the conventional IDMA method requires that users occupy all available resources to transmit data, which may cause severe collision of orthogonal resources in case of large-scale access, so that the complexity of multi-user detection (MUD) is extremely high.
In recent years, research has been conducted to combine IDMA with Multi-antenna technology (Multi-Input Multi-Output, MIMO) to further improve system capacity and reception performance.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a Sparse Interlace Division Multiple Access (SIDMA). The method of the invention only occupies a small part of the total time-frequency resources when each user accesses transmission, thereby reducing the complexity of multi-user detection of the receiver in a large-scale access scene.
The sparse interleaving multiple access method is characterized in that the method firstly enables all access users to occupy K resource particles and T time domain symbols in total when transmitting data blocks, then carries out channel coding on data block information transmitted by each user, divides the coded data into a plurality of sub bit streams and maps the sub bit streams into code word vectors; zero padding is carried out on each code word vector to obtain a K-dimensional sparse code word vector; obtaining a K-dimensional sparse sending codeword vector according to a sparse time-frequency interleaver; at each moment, each user transmits and sends a corresponding component in the code word vector according to the transmission resource given by the system at the corresponding moment; the receiver estimates active users and channel gains thereof, and acquires sparse time-frequency interleaver information thereof; and the receiver decodes the received signals to obtain the transmission data blocks of all the access users. The method comprises the following steps:
(1) the method comprises the steps that T time domain symbols symbol are allowed to be occupied totally when all access users transmit data blocks, and K resource elements RE are contained;
(2) any access user uiChannel coding the information of the data block to be transmitted in the access to obtain an information bit vectorHaving a length of
Figure BDA00011853746800000211
A bit; will vector
Figure BDA00011853746800000212
Per log2M bits are divided into a group, wherein M is an integral multiple of 4 and represents a modulation order; according to the codebook, vectors are encoded
Figure BDA00011853746800000213
Is mapped to a length of
Figure BDA00011853746800000214
Code word vector of
Figure BDA0001185374680000021
Ni< K; wherein the code word vector
Figure BDA00011853746800000215
Each component ofTransmitting through 1 RE;
(3) access user uiFor the code word vector obtained in the step (2)
Figure BDA00011853746800000216
Zero filling is carried out to fill the original NiZero-filling of dimensional codeword vectors into K-dimensional sparse codeword vectors
Figure BDA0001185374680000023
Wherein K is the total number of RE;
(4) access user uiTime-frequency interleaver according to sparseness
Figure BDA0001185374680000024
For the K-dimensional sparse code word vector obtained in the step (3)
Figure BDA0001185374680000025
Performing interleaving mapping to obtain a K-dimensional sparse sending code word vector:
wherein N isiOne position being non-zero, i.e. corresponding to N in step (2)iA component;
(5) for any time T, T equals 1,2, …, T in T symbols, access user uiTransmitting the sending code word vector according to the transmission resource given by the corresponding time system
Figure BDA0001185374680000027
W (t) components, where w (t) is the number of subcarriers at time t, and is satisfied according to a preset of the system
Figure BDA0001185374680000028
(6) The receiver identifies active users, namely the users accessed this time, from all potential users registered in the network, performs channel estimation, and obtains a sparse time-frequency interleaver corresponding to each active user according to the user identification result
Figure BDA0001185374680000029
(7) At each time T, T is 1,2, …, T, the user access situation at the current time is obtained according to the identification result of step (6), and the receiver decodes the received signal y (T), wherein y (T) is a vector of dimension w (T), and represents a signal obtained by multiplying w (T) components of a transmitted code word vector transmitted at the time T corresponding to the access user received by the receiving end by the channel gain of the corresponding user and then superimposing; and (5) jointly performing channel decoding on the decoding results of y (t) obtained at all the moments to finally obtain the sending data block of each access user.
The invention has the characteristics and beneficial effects that:
the invention provides a sparse interleaving multiple access (SIDMA) method after improving the traditional IDMA. By introducing the sparsity occupied by resources, the additional degree of freedom is increased, when the number of users is small, the probability of user collision at the resource is reduced, and the decoding complexity is low; when the number of users is large, the collision can be tolerated; compared with the traditional IDMA which requires the consistency of the data rates of all users, the SIDMA allows the data volume transmitted by each user to be variable, namely, the resources can be dynamically occupied according to the actual data volume to be transmitted, the variable rate is supported, and the method is more flexible.
Drawings
FIG. 1 is a flow chart of an embodiment of the method of the present invention.
Fig. 2 is a diagram illustrating an example of allocation of data blocks RE according to an embodiment of the present invention.
Fig. 3 is a diagram of an example of a sparse time-frequency interleaver for different users in a given RE according to an embodiment of the present invention.
Detailed Description
The present invention is a sparse interleaving multiple access method, which is described in more detail below with reference to the accompanying drawings and specific embodiments.
The process of the sparse interleaving multiple access method provided by the invention is shown in figure 1, and comprises the following steps:
(1) the method comprises the steps of allowing all access users to occupy T time domain symbols (symbols) in total when transmitting data blocks, wherein the symbols comprise K Resource Elements (REs). Fig. 2 is an exemplary diagram of RE allocation of a data block, which shows an example of RE allocation of different numbers of subcarriers provided by different time systems, where each square represents an RE, there are k REs in total, and all squares collectively represent the total available resources for randomly accessing all users at a time; each column of squares occupies one symbol time in the time domain, for a total of T symbols. Wherein, the number of squares in each column represents the number of available subcarriers in the corresponding symbol time.
(2) Any access user uiChannel coding the information of the data block to be transmitted in the access to obtain an information bit vector
Figure BDA0001185374680000031
Having a length ofAnd each bit can be used for transmitting vectors with different lengths by different users according to actual requirements. The vector is divided into
Figure BDA0001185374680000033
Per log2M bits are grouped into one group, where M (where M is an integer multiple of 4, 8, 16, …) is the modulation order; according to the codebook, the vector is divided into
Figure BDA0001185374680000034
Is mapped to a length of
Figure BDA0001185374680000035
Code word vector ofWherein the code word vector
Figure BDA0001185374680000037
Each component ofNeeds to transmit over 1 RE, thus requiring Ni< K, i.e.
Figure BDA0001185374680000039
The codebook acquiring method may include, but is not limited to, in the case of random access, a fixed codebook allocated when a user uses a registered network; in the case of access by scheduling, the user uses a codebook allocated at the time of system scheduling.
(3) Access user uiFor the code word vector obtained in the step (2)
Figure BDA00011853746800000310
Zero filling is carried out to fill the original NiZero-filling of dimensional codeword vectors into K-dimensional sparse codeword vectors
Figure BDA00011853746800000311
Wherein K is the total number of REs.
(4) Access user uiTime-frequency interleaver according to sparseness
Figure BDA00011853746800000312
For the K-dimensional sparse code word vector obtained in the step (3)
Figure BDA00011853746800000313
Performing interleaving mapping to obtain a K-dimensional sparse sending code word vector:
wherein only N is presentiA position being non-zero, i.e. carrying step (2)
Figure BDA0001185374680000042
N in (1)iAnd (4) a component. The sparse time-frequency interleaver may include, but is not limited to, a fixed sparse time-frequency interleaver allocated when a user uses a registered network access in the case of random access; in the case of access by scheduling, the user uses a sparse time-frequency interleaver allocated when the system schedules.
FIG. 3 is a diagram of an example sparse time-frequency interleaver for different users given resource REs, and FIG. 3 shows a possible 3 users u1，u2，u3Given K40 REs, the per-person transmission length is
Figure BDA0001185374680000043
Using M-16-QAM modulation, their codeword vectorsEach length is N1＝N2＝N 310. Under the given K-40 transmission resources RE, the zero padding is performed to obtain a 40-dimensional sparse codeword vector, that is, the input of each sparse time-frequency interleaver is:
Figure BDA0001185374680000045
and the output is a sparse 40-dimensional transmitted codeword vector as shown in figure 3
Figure BDA0001185374680000046
i is 1,2, and 3, and all the positions are 0 except 10 positions corresponding to the shading which contain the input 10 code words. Definition of
Figure BDA0001185374680000047
Indicating how sparse the user transmits the codeword.
(5) For any time T, T equals 1,2, …, T in T symbols, access user uiTransmitting the sending code word vector according to the transmission resource given by the corresponding time systemW (t) components, where w (t) is the number of subcarriers at time t, and is satisfied according to a preset of the system
Figure BDA0001185374680000049
For the case shown in fig. 3, w (t) 4, t 1,2, 10, and
Figure BDA00011853746800000410
i.e. the system is allocated 4 REs at each instant. User u1，u2，u3The column vector of length 4 of the tth column shown in fig. 2 may be transmitted at the corresponding time t.
(6) The receiver identifies active users (namely users accessed this time) from all potential users registered in the network and carries out channel estimation, and a sparse time-frequency interleaver corresponding to each active user is obtained according to the user identification result
Figure BDA00011853746800000411
(7) And (3) at each time T, T is 1,2, …, T, acquiring the user access situation at the current time according to the identification result in the step (6), and decoding the received signal y (T) by the receiver, wherein y (T) is a vector of dimension w (T), and represents a signal obtained by multiplying w (T) components of a transmitted codeword vector transmitted by the access user at the corresponding time T and received by the receiver by the channel gain of the corresponding user and then superimposing the components, and further, noise may be included according to the transmission environment. Finally, jointly carrying out channel decoding on the decoding results of y (T), T1, 2, … and T obtained at all times to obtain the transmission data block of each access user.
The decoding method used in this embodiment may be, but is not limited to, using a Message Passing Algorithm (MPA).

Claims (2)

1. A sparse interleaving multiple access method is characterized in that the method firstly makes all access users occupy K resource particles and T time domain symbols when transmitting data blocks, then carries out channel coding on the data block information transmitted by each user, divides the coded data into a plurality of sub bit streams and maps the sub bit streams into code word vectors; zero padding is carried out on each code word vector to obtain a K-dimensional sparse code word vector; obtaining a K-dimensional sparse sending codeword vector according to a sparse time-frequency interleaver; at each moment, each user transmits and sends a corresponding component in the code word vector according to the transmission resource given by the system at the corresponding moment; the receiver estimates active users and channel gains thereof, and acquires sparse time-frequency interleaver information thereof; and the receiver decodes the received signals to obtain the transmission data blocks of all the access users.
2. A method according to claim 1, characterized in that the method comprises the steps of:
(1) the method comprises the steps that T time domain symbols symbol are allowed to be occupied totally when all access users transmit data blocks, and K resource elements RE are contained;
(2) any access user uiChannel coding the information of the data block to be transmitted in the access to obtain an information bit vector
Figure FDA0002185771970000011
Having a length ofA bit; will vector
Figure FDA0002185771970000013
Per log2M bits are divided into a group, wherein M is an integral multiple of 4 and represents a modulation order; according to the codebook, vectors are encoded
Figure FDA0002185771970000014
Is mapped to a length ofCode word vector of
Figure FDA0002185771970000016
Ni< K; wherein the code word vector
Figure FDA0002185771970000017
Each component of
Figure FDA0002185771970000018
Transmitting through 1 RE;
(3) access user uiFor the code word vector obtained in the step (2)
Figure FDA0002185771970000019
Zero filling is carried out to fill the original NiZero-filling of dimensional codeword vectors into K-dimensional sparse codeword vectors
Figure FDA00021857719700000110
Wherein K is the total number of RE;
(4) access user uiTime-frequency interleaver according to sparseness
Figure FDA00021857719700000111
For the K-dimensional sparse code word vector obtained in the step (3)
Figure FDA00021857719700000112
Performing interleaving mapping to obtain a K-dimensional sparse sending code word vector:
Figure FDA00021857719700000113
wherein N isiOne position being non-zero, i.e. corresponding to N in step (2)iA component;
(5) for any time T, T equals 1,2, …, T in T symbols, access user uiTransmitting the sending code word vector according to the transmission resource given by the corresponding time systemW (t) components, where w (t) is the number of subcarriers at time t, and is satisfied according to a preset of the system
Figure FDA00021857719700000115
(6) The receiver identifies active users, namely the users accessed this time, from all potential users registered in the network, performs channel estimation, and obtains a sparse time-frequency interleaver corresponding to each active user according to the user identification result
(7) At each time T, T is 1,2, …, T, the user access situation at the current time is obtained according to the identification result of step (6), and the receiver decodes the received signal y (T), wherein y (T) is a vector with the length w (T) and represents a signal obtained by multiplying the w (T) components of the transmitted code word vector transmitted by the access user at the corresponding time T received by the receiving end by the channel gain of the corresponding user and then superimposing; and (5) jointly performing channel decoding on the decoding results of y (t) obtained at all the moments to finally obtain the sending data block of each access user.
CN201611182132.6A 2016-12-20 2016-12-20 Sparse interleaving multiple access method Active CN106788893B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611182132.6A CN106788893B (en) 2016-12-20 2016-12-20 Sparse interleaving multiple access method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611182132.6A CN106788893B (en) 2016-12-20 2016-12-20 Sparse interleaving multiple access method

Publications (2)

Publication Number Publication Date
CN106788893A CN106788893A (en) 2017-05-31
CN106788893B true CN106788893B (en) 2020-02-14

Family

ID=58890978

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611182132.6A Active CN106788893B (en) 2016-12-20 2016-12-20 Sparse interleaving multiple access method

Country Status (1)

Country Link
CN (1) CN106788893B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109495131B (en) * 2018-11-16 2020-11-03 东南大学 Multi-user multi-carrier short wave modulation method based on sparse codebook spread spectrum
CN111064500B (en) * 2019-11-08 2021-11-09 杭州电子科技大学 Precoding codebook design method based on channel coding in large-scale MIMO system
CN111711510B (en) * 2020-03-11 2021-06-22 中山大学 Low-complexity multi-user detection method for asynchronous interleaving multi-address system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104869094A (en) * 2015-04-29 2015-08-26 清华大学 Upstream multiple access method combined with orthogonal multiple access and nonorthogonal multiple access
CN105359443A (en) * 2013-11-29 2016-02-24 华为技术有限公司 Transmission and receiving method in a wireless communication system
CN105472752A (en) * 2016-01-21 2016-04-06 清华大学 Uplink random access method
CN105554901A (en) * 2015-12-11 2016-05-04 清华大学 Random access method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2840749B1 (en) * 2013-08-23 2020-09-30 Alcatel Lucent Receiver and receive method for a filtered multicarrier signal

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105359443A (en) * 2013-11-29 2016-02-24 华为技术有限公司 Transmission and receiving method in a wireless communication system
CN104869094A (en) * 2015-04-29 2015-08-26 清华大学 Upstream multiple access method combined with orthogonal multiple access and nonorthogonal multiple access
CN105554901A (en) * 2015-12-11 2016-05-04 清华大学 Random access method
CN105472752A (en) * 2016-01-21 2016-04-06 清华大学 Uplink random access method

Also Published As

Publication number Publication date
CN106788893A (en) 2017-05-31

Similar Documents

Publication Publication Date Title
US9130635B2 (en) Wireless communication system, wireless communication device, and wireless communication method
US10425111B2 (en) Polar code interleaving and bit selection
CN101984570B (en) Codebook selection and modulation method being applied under MIMO-OFDM system to overcome weak scattering
JP2008512053A (en) Coded bit scrambling for multi-stream communication in a MIMO channel
WO2017206663A1 (en) Unlicensed transmission method and device
JP5356073B2 (en) Encoding device, receiving device, wireless communication system, puncture pattern selection method and program thereof
KR101578935B1 (en) Method and appraratus for receiving in multiple input multiple output system
GB2560461A (en) Reordering of a beamforming matrix
CN106788893B (en) Sparse interleaving multiple access method
CN108737307B (en) Multi-access method, transmitter and receiver
CN106953671B (en) Multi-address access method and device for signal in mobile communication
CN108260215B (en) Low-density code NOMA (non-orthogonal multiple access) channel condition optimization resource allocation method
CN102136886A (en) Encoding/decoding method and device for orthogonal repeated accumulate codes
CN106998308B (en) Code hopping transmission method in sparse code multiple access based on time-varying codebook
Iqbal et al. Analysis and design of coding and interleaving in a MIMO-OFDM communication system
CN106788626B (en) Improved orthogonal space modulation transmission method capable of obtaining second-order transmit diversity
WO2020132892A1 (en) Method and device for acquiring downlink channel information
CN100345405C (en) Method for testing aerrays system in use for multiple inputs and multiple outputs
CN109660325B (en) Data processing method and device
Uppal et al. Code design for MIMO broadcast channels
KR101346423B1 (en) Method for transmitting data in multiple antenna system
US11539463B2 (en) Methods and computing device for facilitating multiple access in a wireless communication network
TW201906382A (en) Transmission device, reception device, transmission method, and reception method
Tripathi et al. An Approach to Mitigate Fading Issues for Underwater Communication using MIMO-OFDMIDMA Scheme
Wang et al. A novel codeword grouped SCMA

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