CN110224729A - For removing the data transmission method of the extensive mimo system of honeycomb - Google Patents

For removing the data transmission method of the extensive mimo system of honeycomb Download PDF

Info

Publication number
CN110224729A
CN110224729A CN201910447662.6A CN201910447662A CN110224729A CN 110224729 A CN110224729 A CN 110224729A CN 201910447662 A CN201910447662 A CN 201910447662A CN 110224729 A CN110224729 A CN 110224729A
Authority
CN
China
Prior art keywords
user
matrix
base station
linear combination
user terminal
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.)
Pending
Application number
CN201910447662.6A
Other languages
Chinese (zh)
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.)
Beijing Jiaotong University
Original Assignee
Beijing 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 Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN201910447662.6A priority Critical patent/CN110224729A/en
Publication of CN110224729A publication Critical patent/CN110224729A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0426Power distribution
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H04L1/0007Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0059Convolutional codes
    • H04L1/006Trellis-coded modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The present invention provides a kind of for removing the data transmission method of the extensive mimo system of honeycomb, belongs to technical field of data transmission, user terminal encodes the nested grid that raw information is extended;Base station is decoded the linear combination of user's code word by nested grid, obtains the linear combination of user's raw information by calculating balance factor and combination coefficient;The linear combination of user's raw information is passed to center processing unit CPU by forward pass link by base station;CPU solves the raw information of each user terminal after the linear combination for receiving a certain number of user's raw informations;CPU calculates best transmission power according to the raw information of each user terminal obtained.It is limited that the present invention considers influence and forward pass link capacity of the inter-user interference to throughput of system, using the nested grid coding method based on extension, eliminate inter-user interference, avoid the expansion to forward pass link capacity demand, the total throughout for improving system, the transmission mechanism suitable for the 5th Generation Mobile Communication System.

Description

For removing the data transmission method of the extensive mimo system of honeycomb
Technical field
The present invention relates to technical field of data transmission, and in particular to one kind can not increase forward pass link capacity demand On the basis of improve overall system throughput for removing the data transmission method of the extensive mimo system of honeycomb.
Background technique
Extensive multiple-input and multiple-output (the multiple-input multiple-output of Cell-free (removing honeycomb) MIMO) system is due to the problem of can be avoided the inter-cell interference in the extensive mimo system of Small Section Mode, so that system is handled up Amount has significantly to be promoted very much, so as to cause the extensive concern of wireless communication field.In the extensive mimo system of cell-free In, due to distributed base station number far more than user number, base station between user at a distance from be shortened, lead to path Loss becomes smaller and macro diversity improves, therefore the available higher-quality service of user.Distributed base station passes through forward pass chain Road and center processing unit (central processing unit, CPU) are connected, and base station will receive in transmitting uplink data Signal CPU is sent to by forward pass link, the information of each user is recovered by CPU.
Since the number of the orthogonal pilot frequency sequence for distinguishing each user information is limited, it not can guarantee all users' Pilot frequency sequence is orthogonal, therefore can generate inter-user interference using between the user of same pilot in an uplink transmission, thus So that the handling capacity of these users reduces, the total throughout for eventually leading to system is reduced.In addition to this, since each base station can will connect The information of all users received passes to CPU, also can be very big to the capacity requirement of forward pass link.Therefore, how not increase Improving the handling capacity of system in the case where adding forward pass link capacity is the extensive mimo system urgent problem to be solved of cell-free One of.
In existing correlative study, the transmission mechanism generally used in the extensive mimo system of cell-free is that base station exists Maximal ratio combiner (maximum ratio combining, MRC) is carried out after receiving the information of user, so that base station passes through The dimension that forward pass link passes to the information of CPU is identical as at each user, and the increase due to user is avoided to lead to forward pass link The increase of capacity.But MRC mechanism can not eliminate inter-user interference.Calculate forwarding (compute-and-forward, CF) machine System utilizes structured coding, calculates the linear combination of all user informations in base station rather than directly decodes the letter of single user Breath, to eliminate influence of the inter-user interference to throughput of system.But CF mechanism requires the transmission power of all users complete It is exactly the same.However, in the extensive mimo system of cell-free, due to user between base station at a distance from it is different, by right The transmission power of user controls, i.e., user sends data with different transmission power, can significantly improve handling up for system Amount.
Summary of the invention
The purpose of the present invention is to provide one kind to make system always handle up on the basis of not increasing forward pass link capacity demand The data transmission method for being used to go the extensive mimo system of honeycomb being further enhanced is measured, to solve in above-mentioned background technique At least one existing technical problem.
To achieve the goals above, this invention takes following technical solutions:
Provided by the invention a kind of for removing the data transmission method of the extensive mimo system of honeycomb, this method includes as follows Process step:
Step S110: user terminal encodes the nested grid that raw information is extended.The raw information of user is by two It is grouped as, is the part for carrying information first, the independent and uniform distribution in the finite field that length is prime number of the element in this part. Then, to meet the limitation of the transmission power to the user, and ensure that information lossless restores, that is, meet the user to effectively making an uproar The requirement of sound tolerance, user carry out zero padding to prime information vector, and the length of the raw information vector of final all users is identical. Raw information is encoded by finite field to the ambiguity search space with the limited domain isomorphism finally, user is encoded by nested grid In.
Step S120: base station is by calculating balance factor and combination coefficient, the nested net that user terminal is sent by channel Signal after trellis coding is expressed as the linear combination of user's code word.For the code word of user by transmission to base station, base station is logical It crosses and compels whole (integer-forcing) reception, that is, the signal multiplication choosing suitable balance factor and receiving indicates signal For the sum of the Gaussian integer linear combination of user's code word and effective noise.It is limited in known channel state information and each user power Under conditions of, balance factor can be obtained by the method for least mean-square error, and in linear combination each user combination coefficient The coefficient vector of composition can be obtained by establishing the optimization problem of minimum effective noise.
Step S130: base station is decoded the linear combination of user's code word by nested grid, obtains user's original The linear combination of beginning information.Due to the geometrical property of nested grid coding, the linear combination of user's code word remains effective code Word.User terminal is already reserved by tolerance to effective noise in coding, i.e. code word is there are certain effective noise the case where Under will not be incorrectly decoded to causing information to lose.Therefore, the linear combination of user's code word passes through nested grid in base station Decoding can directly obtain the linear combination of user's raw information to original confinement.Due to base station be to user code combinatorics on words into Row decoding, rather than the code word of each user is individually decoded, therefore inter-user interference will not impact.
Step S140: the linear combination of user's raw information is passed to center processing list by forward pass link by base station First CPU;Wherein, the dimension for the data transmitted in forward pass link is suitable with the dimension of user terminal raw information.
Step S150:CPU solves each user after the linear combination for receiving a certain number of user's raw informations The raw information at end.CPU is when the order of the coefficient matrix being made of coefficient vector received is identical as number of users, it can be ensured that The information of each user is successfully solved.
Step S160:CPU calculates best transmission power, user according to the raw information of the step S150 each user terminal obtained End carries out data transmission according to the best transmission power.Channel state information is passed to CPU by channel estimation by base station. Since user information participates in decoding in the form of linear combination in base station, each user serviced by base station is to ensure letter It is identical to cease the lossless effective noise for needing to tolerate in base station.For maximize system handling capacity, at CPU to balance factor into Row optimization, finally makes the handling capacity of system get a promotion.Before CPU passes through the best transmission power for each user being calculated It passes link and passes to base station, be ultimately transferred to user.
Preferably, the step S110 is specifically included:
For M base station and L user terminal, M > L enables m ∈ { 1,2 ..., M } to indicate the number of base station, l ∈ 1, 2 ..., L indicate user terminal number;
It is k that first of user terminal, which generates length,lInformation vector Wl, WlIn element length be p finite field ZpIn solely It is vertical to be uniformly distributed;
All user terminals are by respective information vector zero padding to identical length k;
First of user terminal is by information vector WlThe code word X that length is n is encoded to by the nested grid coding method of extensionl =(Z [i]/π Z [i])n
Wherein, Z [i] indicates Gaussian integer, that is, the real number and imaginary part of element are integer, and Z [i]/π Z [i] is indicated With finite field ZpThe ambiguity search space of isomorphism;
XlIt is limited to the power limit of user terminal: E | | Xl||2≤nPl, wherein PlFor the transmission power of first of user.
Preferably, the step S120 is specifically included:
Signal y after the nested grid coding that the length that m-th of base station receives is nmAre as follows:
Wherein, gmlRepresent the channel coefficients between first of user and m-th of base station:βmlIndicate big Scale decline, hmlIndicate multipath fading;Indicate the thermal noise in m-th of base station;
The channel coefficients of all user terminals and m-th of base station are combined into channel vector:
gm=[gm1,gm2,...,gmL]T
The signal that m-th of base station receives can be represented as:
ym=XTgm+zm,;Wherein, X=[x1,x2,...xL]TFor the matrix being made of code word;
M-th of base station is by choosing suitable balance factor bm∈ C and coefficient vectorBy ymIt is expressed as the sum of integer linear combination and the effective noise of user's code word:
Wherein,Indicate effective noise.
Preferably, the step S130 is specifically included:
Decoder is housed in m-th of base stationBy ymIt is decoded to finite field umIt is linear combination of the user terminal raw information vector in finite field,Wherein, qml=[aml] modp,Table The addition being shown in confinement.
Preferably, the step S150 is specifically included:
CPU is enabled when the order of the coefficient matrix being made of coefficient vector received is identical as number of users:
It indicates in linear combination umThe real part set of the coefficient of middle user terminal raw information,It indicates in linear combination umThe imaginary part set of the coefficient of middle user terminal raw information, then base station passes through forward pass The linear combination that link is sent to user's raw information of CPU can be indicated with the form of matrix are as follows:
If CPU receives the linear combination of M user terminal raw information and matrix QRAnd QIOrder be L, then whole user terminals Raw information can be resumed out.
Preferably, in the information w for restoring first of userlWhen, there are vectorsSo that
Accordingly, wlIt can be resumed out from linear combination.
Preferably, the step S160 is specifically included:
Combination coefficient in the linear combination of the M raw information received at CPU constitutes the matrix that a dimension is M × L:
Ascending order arrangement is carried out to the variance of the effective noise of the corresponding linear combination of the every a line of A, is selected in order from M row L exercises to finally obtain outMatrix meets
Define the matrix of channel coefficient vector compositionAccording toThe sequence of middle row can obtain To withIt is corresponding
To matrix B=diag (b of balance factor composition1,...bL) optimize;
At this point, the effective noise of m-th of base station are as follows:
Wherein,Represent matrixM row,Represent matrixM row;
Enable Tr (BBHPe)=Pt, Tr (CHCP)=Pt, according to the matrix B calculating matrix P after optimizatione
Enable J=diag (| | b1||2,...||bL||2),Wherein
The matrix M and the element at (m, l) for defining a L × L be
Pass through equation P=diag (ρ) Lai Gengxin power distribution matrix P;Wherein,
ρ=(I-diag (Θ) M)-1JΘ。
Update Matrix C:
Preferably, if Θ is not converged, iteration, until obtaining optimal power distribution matrix P when Θ convergence.
Preferably, when being optimized to matrix B:
Define a complex matrix C=diag (c1,…cL), Matrix C is initialized as unit matrix, and enable each user The transmission power at end be it is identical, then, matrix B is optimized by following formula:
The invention has the advantages that: the transmission mechanisms for being suitable for the 5th Generation Mobile Communication System, it is contemplated that inter-user interference pair The influence of throughput of system and forward pass link capacity are limited, using the calculating repeater-transmitter of the nested grid coding method based on extension It makes (ECF), inter-user interference can be eliminated, avoid the expansion to forward pass link capacity demand, effectively improve always handling up for system Amount.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description Obviously, or practice through the invention is recognized.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this For the those of ordinary skill of field, without creative efforts, it can also be obtained according to these attached drawings others Attached drawing.
Fig. 1 is described in the embodiment of the present invention for removing the data transmission method flow chart of the extensive mimo system of honeycomb.
Fig. 2 is described in the embodiment of the present invention for removing the data transmission method schematic diagram of the extensive mimo system of honeycomb.
The effect picture of throughput of system when Fig. 3 is base station number difference described in the embodiment of the present invention.
The effect picture of throughput of system when Fig. 4 is forward pass link capacity difference described in the embodiment of the present invention.
Specific embodiment
It is exemplary below with reference to the embodiment of attached drawing description, for explaining only the invention, and cannot explain For limitation of the present invention.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singular " one " used herein, " one It is a ", " described " and "the" may also comprise plural form.It is to be further understood that being arranged used in specification of the invention Diction " comprising " refer to that there are the feature, integer, step, operation, element and/or modules, but it is not excluded that in the presence of or addition Other one or more features, integer, step, operation, element, module and/or their group.
Those skilled in the art of the present technique are appreciated that unless otherwise defined, all terms used herein (including technology art Language and scientific term) there is meaning identical with the general understanding of those of ordinary skill in fields of the present invention.Should also Understand, those terms such as defined in the general dictionary, which should be understood that, to be had and the meaning in the context of the prior art The consistent meaning of justice, and unless defined as here, it will not be explained in an idealized or overly formal meaning.
In order to facilitate understanding of embodiments of the present invention, further by taking specific embodiment as an example below in conjunction with attached drawing to be solved Explanation is released, and embodiment does not constitute the restriction to the embodiment of the present invention.
Those of ordinary skill in the art are it should be understood that attached drawing is the schematic diagram of one embodiment, the portion in attached drawing Part or device are not necessarily implemented necessary to the present invention.
Embodiment 1
As shown in Figure 1 to Figure 2, the data that the embodiment of the invention provides a kind of for removing the extensive mimo system of honeycomb pass Transmission method, which is characterized in that this method includes following process step:
S1: user terminal encodes the nested grid that raw information is extended.
Schematically, in the range of 1km × 1km, random distribution M base station and K user, M be much larger than K, and two The value range of person is the integer greater than 1.Enabling m ∈ { 1 ..., M } is the number of base station, and k ∈ { 1 ..., K } is the volume of user Number.Channel information is estimated using least mean-square error.
Firstly, it is k that first of user, which generates length,lInformation vector wl, wlIn element length be p finite field Middle independent and uniform distribution.All users are by the information vector zero padding of oneself to identical length k.Then, first of user is by signal Vector wlThe code word that length is n is encoded to by the nested grid coding method of extensionWhereinIndicating Gaussian integer, i.e. the real number of element and imaginary part is integer,Expression and finite fieldTogether The ambiguity search space of structure.xlIt is limited to the power limit of user:
Wherein, PlFor the transmission power of first of user.
S2: base station, which is in, receives each user after the signal of transmission by calculating balance factor and combination coefficient The signal received is expressed as to the linear combination of user's code word.The length that m-th of base station receives is the signal y of nmFor user Combination of the code word after transmission:
Wherein, gmlRepresent the channel coefficients between first of user and m-th of AP:
βmlIndicate large-scale fading, hmlIndicate multipath fading.It indicates at m-th of AP Thermal noise.
For convenience of expression, the channel coefficients of all users and m-th of base station are combined into channel vector gm=[gm1, gm2,...,gmL]T, so that the signal that m-th of base station receives can be represented as:
ym=XTgm+zm,
Wherein, X=[x1,x2,...xL]TFor the matrix being made of user's code word.Then, m-th of base station is closed by choosing Suitable balance factorWith coefficient vectorThe signal y that can will be receivedm It is expressed as the sum of integer linear combination and the effective noise of user's code word
S3: due to the geometrical property of nested grid coding, the linear combination of user's code word remains effective code word, base station The linear combination of user's code word is decoded by nested grid, the linear combination of user's raw information can be obtained.In m Decoder is housed at a APTherefore, base station can be by ymIt is decoded to finite fieldumIt is The linear combination in finite field of the information vector original to user:
Wherein, qml=[aml] modp,Indicate the addition in finite field.
S4: the linear combination of obtained user's raw information is passed to CPU by forward pass link by base station, at this time forward pass chain The dimension for the data transmitted in road is suitable with the dimension of raw information at user, and the theory to guarantee user information Lossless transport Minimum value.If base station directly decodes the information of each user respectively, pass through all subscriber signals of backhaul link transmission to CPU umDimension is L × n.Due to the calculating forwarding mechanism using the nested grid code based on extension, by calculating all subscriber signals Linear combination so that umDimension be substantially reduced to 1 × n, thus appearance needed for effectively reducing backhaul link user data transmission Amount, and have the function that inhibit multi-user interference.
S5:CPU can solve the raw information of each user parallel after receiving enough combinations.Theoretical research table Bright, when the order of the coefficient matrix being made of coefficient vector received is identical as number of users, CPU can divide recipient, that is, CPU The information of each user is not solved.
It enablesRespectively represent the real part of the coefficient of user's raw information in linear combination Point set and imaginary part set, then the linear combination for user's raw information that base station is sent to CPU by forward pass link can be with It is indicated with the form of matrix are as follows:
If CPU receives the linear combination of M user's raw information and matrix QRAnd QIOrder be L, then the letter of whole users Breath can be resumed out.In the information w for restoring first of userlWhen, there are vectorsSo that:
To wlIt can be resumed out from linear combination.
S6:CPU controls the transmission power of user.In the linear combination of the M user's raw information received at CPU Combination coefficient may be constructed a dimension be M × L matrix:
Due to only needing L linear combination, in order to improve throughput of system as far as possible, decoded linear combination is participated in Effective noise should be the smaller the better.Firstly, carrying out ascending order row to the variance of the effective noise of the corresponding linear combination of the every a line of A Column.Then, pick out what L exercised to finally obtain in order from M rowMatrix meetsDefine channel The matrix of coefficient vector compositionAccording toThe sequence of middle row, it is available withIt is corresponding
For the handling capacity for maximizing system, the matrix B=diag (b formed to balance factor is needed1,...bL) carry out it is excellent Change.Define a complex matrix C=diag (c1,...cL), Matrix C is initialized as unit matrix first, and enable each user Transmission power be identical.Then matrix B can be optimized by following formula
At this point, the effective noise of m-th of base station can be represented as
Wherein,Represent matrixM row,Represent matrixM row.Enable Tr (BBHPe)=Pt, Tr (CHCP)=Pt.After matrix B determines, matrix PeIt can determine.
Enable again J=diag (| | b1||2,…||bL||2) andWherein The matrix M and the element at (m, l) for defining a L × L be
Pass through equation P=diag (ρ) Lai Gengxin power distribution matrix P, wherein
ρ=(I-diag (Θ) M)-1JΘ。
Keep other parameters constant, Matrix C can be updated by following formula:
Finally, iteration constantly repeats if Θ is not converged, that is, it is continuously updated Matrix C.When Θ convergence, can be obtained Optimal power distribution matrix P.
Embodiment two
The embodiment 2 is the transmission mechanism carried out using method of the invention for removing the extensive mimo system of honeycomb, tool Body includes the following steps:
Scene setting: all users and base station are randomly dispersed in the square region of 1 × 1km.Propagation channel it is big Scale feature can be described by Hata-COST231 model.The fading coefficients β of large scalemlIt describes path loss and shade declines It falls:
βml=PLmlsml,
Wherein, smlRepresent to shadow fading take with 2 for bottom logarithm as a result, the standard deviation of shadow fading as σs, PLmlClothes From the path loss model (unit dB) of three-stage
Wherein, dmlRepresent the distance between m-th of base station and first of user, d0And d1It is reference distance.Needed for other All parameters such as 1 parameter setting of table show.
1 parameter setting of table
Parameter Value
Bandwidth 20MHz
σ 9dB
σs 8dB
d0、d1 50、10m
Lloss 140.7dB
L 10
Pt 2W
In l-G simulation test, using monte carlo method, 200 independent user distributions is randomly generated and are emulated.
The handling capacity of system when Fig. 3 is different base station number, referring to Fig. 3, abscissa indicates the number of base station, ordinate table Show the handling capacity of system.In the case where number of base stations difference, compared with MRC and CF mechanism, in the embodiment of the present invention, system Handling capacity is obviously improved.Fig. 4 is the handling capacity of forward pass link capacity not simultaneity factor, and referring to Fig. 4, abscissa is indicated The capacity of forward pass link, ordinate indicate the handling capacity of system.It can be seen that compared with MRC and CF mechanism, the embodiment of the present invention In, in the identical situation of demand to forward pass link capacity, the handling capacity of system has obtained significant raising.
In conclusion method described in the embodiment of the present invention is examined suitable for the transmission mechanism of the 5th Generation Mobile Communication System Influence and forward pass link capacity of the inter-user interference to throughput of system are considered to be limited, encoded using the nested grid based on extension The calculating forwarding mechanism (ECF) of method, can eliminate inter-user interference, avoid the expansion to forward pass link capacity demand, effectively The total throughout of raising system.
Those skilled in the art will be understood that above-mentioned simulation type is only for example, other are existing or are likely to occur from now on Application type is such as applicable to the embodiment of the present invention, should also be included within the scope of protection of the present invention, and herein by reference It is incorporated herein.
As seen through the above description of the embodiments, those skilled in the art can be understood that the present invention can It realizes by means of software and necessary general hardware platform.Based on this understanding, technical solution of the present invention essence On in other words the part that contributes to existing technology can be embodied in the form of software products, the computer software product It can store in storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions are used so that a computer equipment (can be personal computer, server or the network equipment etc.) executes the certain of each embodiment or embodiment of the invention Method described in part.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto, In the technical scope disclosed by the present invention, any changes or substitutions that can be easily thought of by anyone skilled in the art, It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with scope of protection of the claims Subject to.

Claims (10)

1. a kind of for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that this method includes as flowed down Journey step:
Step S110: user terminal encodes the nested grid that raw information is extended;
Step S120: it is compiled by calculating balance factor and combination coefficient, by user terminal by the nested grid that channel is sent base station Signal after code is expressed as the linear combination of user's code word;
Step S130: base station is decoded the linear combination of user's code word by nested grid, obtains the original letter of user The linear combination of breath;
Step S140: the linear combination of user's raw information is passed to center processing unit by forward pass link by base station CPU;Wherein, the dimension for the data transmitted in forward pass link is suitable with the dimension of user terminal raw information;
Step S150:CPU solves each user terminal after the linear combination for receiving a certain number of user's raw informations Raw information;
Step S160:CPU calculates best transmission power, user terminal root according to the raw information of the step S150 each user terminal obtained Carry out data transmission according to the best transmission power.
2. according to claim 1 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that institute Step S110 is stated to specifically include:
For M base station and L user terminal, M > L enables m ∈ { 1,2 ..., M } to indicate the number of base station, l ∈ { 1,2 ..., L } Indicate the number of user terminal;
It is k that first of user terminal, which generates length,lInformation vector Wl, WlIn element length be p finite field ZpMiddle independence is uniform Distribution;
All user terminals are by respective information vector zero padding to identical length k;
First of user terminal is by information vector WlThe code word X that length is n is encoded to by the nested grid coding method of extensionl=(Z [i]/πZ[i])n
Wherein, Z [i] indicates Gaussian integer, that is, the real number and imaginary part of element are integer, and Z [i]/π Z [i] is indicated and had Confinement ZpThe ambiguity search space of isomorphism;
XlIt is limited to the power limit of user terminal: E | | Xl||2≤nPl, wherein PlFor the transmission power of first of user.
3. according to claim 2 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that institute Step S120 is stated to specifically include:
Signal y after the nested grid coding that the length that m-th of base station receives is nmAre as follows:
Wherein, gmlRepresent the channel coefficients between first of user and m-th of base station:βmlIndicate large scale Decline, hmlIndicate multipath fading;Indicate the thermal noise in m-th of base station;
The channel coefficients of all user terminals and m-th of base station are combined into channel vector:
gm=[gm1,gm2,...,gmL]T
The signal that m-th of base station receives can be represented as:
ym=XTgm+zm
Wherein, X=[x1,x2,...xL]TFor the matrix being made of code word;
M-th of base station is by choosing balance factor bm∈ C and coefficient vector;Wherein, coefficient vector are as follows:
am=[am1,am2,...,amL]T∈Z[i]L,
By ymIt is expressed as the sum of integer linear combination and the effective noise of user's code word:
Wherein,Indicate effective noise.
4. according to claim 3 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that institute Step S130 is stated to specifically include:
Decoder is housed in m-th of base stationBy ymIt is decoded to finite fieldumIt is to use Family end raw information vector finite field linear combination,Wherein, qml=[aml] mod p,It indicates Addition in confinement.
5. according to claim 4 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that institute Step S150 is stated to specifically include:
CPU is enabled when the order of the coefficient matrix being made of coefficient vector received is identical as number of users:
It indicates in linear combination umThe real part set of the coefficient of middle user terminal raw information, It indicates in linear combination umThe imaginary part set of the coefficient of middle user terminal raw information, then base station is sent to by forward pass link The linear combination of user's raw information of CPU can be indicated with the form of matrix are as follows:
If CPU receives the linear combination of M user terminal raw information and matrix QRAnd QIOrder be L, then the original of whole user terminals Beginning information can be resumed out.
6. according to claim 5 for removing the data transmission method of the extensive mimo system of honeycomb, it is characterised in that:
In the information w for restoring first of userlWhen, there are vectorsSo that
To wlIt can be resumed out from linear combination.
7. according to claim 6 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that institute Step S160 is stated to specifically include:
Combination coefficient in the linear combination of the M raw information received at CPU constitutes the matrix that a dimension is M × L:
Ascending order arrangement is carried out to the variance of the effective noise of the corresponding linear combination of the every a line of A, picks out L in order from M row It exercises to finally obtainMatrix meets
Define the matrix of channel coefficient vector compositionAccording toThe sequence of middle row, it is available withIt is corresponding
To matrix B=diag (b of balance factor composition1,...bL) optimize;
At this point, the effective noise of m-th of base station are as follows:
Wherein,Represent matrixM row,Represent matrixM row;
Enable Tr (BBHPe)=Pt, Tr (CHCP)=Pt, according to the matrix B calculating matrix P after optimizatione
Enable J=diag ([| | b1||2,…||bL||2]),Wherein
The matrix M and the element at (m, l) for defining a L × L be
Pass through equation P=diag (ρ) Lai Gengxin power distribution matrix P;Wherein,
ρ=(I-diag (Θ) M)-1JΘ。
Update Matrix C:
8. according to claim 7 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that if Θ is not converged, then iteration, until obtaining optimal power distribution matrix P when Θ convergence.
9. according to claim 8 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that right When matrix B optimizes:
Define a complex matrix C=diag (c1,...cL), Matrix C is initialized as unit matrix, and enable each user terminal Send power be it is identical, then, matrix B is optimized by following formula:
10. according to claim 9 for removing the data transmission method of the extensive mimo system of honeycomb, which is characterized in that In the step S150, the quantity of the linear combination of a certain number of user's raw informations is formed with by coefficient vector Coefficient matrix order it is identical.
CN201910447662.6A 2019-05-27 2019-05-27 For removing the data transmission method of the extensive mimo system of honeycomb Pending CN110224729A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910447662.6A CN110224729A (en) 2019-05-27 2019-05-27 For removing the data transmission method of the extensive mimo system of honeycomb

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910447662.6A CN110224729A (en) 2019-05-27 2019-05-27 For removing the data transmission method of the extensive mimo system of honeycomb

Publications (1)

Publication Number Publication Date
CN110224729A true CN110224729A (en) 2019-09-10

Family

ID=67818527

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910447662.6A Pending CN110224729A (en) 2019-05-27 2019-05-27 For removing the data transmission method of the extensive mimo system of honeycomb

Country Status (1)

Country Link
CN (1) CN110224729A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113179109A (en) * 2021-04-26 2021-07-27 南京盛航海运股份有限公司 Honeycomb-removing large-scale MIMO uplink spectrum efficiency optimization method
WO2022057777A1 (en) * 2020-09-17 2022-03-24 中兴通讯股份有限公司 Signal transmission method and apparatus, access node, processing unit, system and medium
CN114650608A (en) * 2022-04-18 2022-06-21 南通大学 Multi-central processing unit cooperation method for removing cellular massive MIMO

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180014305A1 (en) * 2016-07-08 2018-01-11 Alcatel-Lucent Usa Inc. Apparatus configured to approximate a power coefficient in a cell-free massive mimo wireless system and method of performing same
CN108834113A (en) * 2018-06-20 2018-11-16 江苏大学 A kind of D2D convert communication system and its communication means towards 5G Cellular Networks safety of physical layer
WO2018210462A1 (en) * 2017-05-19 2018-11-22 Telefonaktiebolaget Lm Ericsson (Publ) Transmission power distribution

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180014305A1 (en) * 2016-07-08 2018-01-11 Alcatel-Lucent Usa Inc. Apparatus configured to approximate a power coefficient in a cell-free massive mimo wireless system and method of performing same
WO2018210462A1 (en) * 2017-05-19 2018-11-22 Telefonaktiebolaget Lm Ericsson (Publ) Transmission power distribution
CN108834113A (en) * 2018-06-20 2018-11-16 江苏大学 A kind of D2D convert communication system and its communication means towards 5G Cellular Networks safety of physical layer

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
BOBAK NAZER 等: "Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations", 《IEEE TRANSACTIONS ON INFORMATION THEORY》 *
JING ZHANG 等: "Expanded Compute-and-Forward for Backhaul-Limited Cell-Free Massive MIMO", 《2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS)》 *
WENBO HE 等: "Uplink-Downlink Duality for Integer-Forcing", 《IEEE TRANSACTIONS ON INFORMATION THEORY》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022057777A1 (en) * 2020-09-17 2022-03-24 中兴通讯股份有限公司 Signal transmission method and apparatus, access node, processing unit, system and medium
CN113179109A (en) * 2021-04-26 2021-07-27 南京盛航海运股份有限公司 Honeycomb-removing large-scale MIMO uplink spectrum efficiency optimization method
CN113179109B (en) * 2021-04-26 2022-03-29 南京盛航海运股份有限公司 Honeycomb-removing large-scale MIMO uplink spectrum efficiency optimization method
CN114650608A (en) * 2022-04-18 2022-06-21 南通大学 Multi-central processing unit cooperation method for removing cellular massive MIMO

Similar Documents

Publication Publication Date Title
Chen et al. Pattern division multiple access—A novel nonorthogonal multiple access for fifth-generation radio networks
Chen et al. Low complexity beamforming and user selection schemes for 5G MIMO-NOMA systems
Zhang et al. Improving sum-rate of cell-free massive MIMO with expanded compute-and-forward
CN101304300B (en) Method and device for quantizing multiuser MIMO system channel based on limiting feedback
CN110224729A (en) For removing the data transmission method of the extensive mimo system of honeycomb
CN103840870A (en) Method for lowering limiting feedback expenditure of 3D MIMO channel
CN104039004A (en) Method for heterogeneous user pilot frequency power optimal distribution in large-scale multi-input multi-output system
CN109302267A (en) Interpretation method, equipment and the storage medium of mimo system based on LDPC
CN105721029B (en) Multi-user dispatching method based on this Limited Feedback of dicode in 3D MU-MIMO FDD system
CN114465643B (en) Mixed precoding method of millimeter wave large-scale MIMO antenna system based on gradient descent method
CN107171709B (en) Large-scale MIMO system precoding method applied to aggregated user scene
CN108199805A (en) A kind of method for reducing Sparse Code multi-address system decoding complexity
CN105680965A (en) Obtaining method and apparatus for simultaneous information and power transfer type transceiver model
CN109004963B (en) Wireless communication user optimal scheduling method based on opportunistic interference alignment
Gharagezlou et al. Energy efficient power allocation with joint antenna and user selection in massive MIMO systems
EP3206319B1 (en) Non-orthogonal downlink signals for multiple users
CN101621357B (en) Mimo communication system and method thereof
WO2012107306A1 (en) Method for increasing quality of signals received by at least one destination device among a plurality
Feng et al. Construction of polar codes concatenated to space-time block coding in MIMO system
Hasabelnaby et al. Multi-pair computation for two-way intra cloud radio-access network communications
Tang et al. Optimal power allocation for multi-user linear network coded cooperation system
Ding et al. Joint user ordering, beamforming and power allocation for downlink MIMO-NOMA systems
CN103765805B (en) A kind of method for multi-user pre-coding and device
Cheng et al. Generalized signal-space alignment based physical-layer network coding for distributed MIMO systems
CN110311873B (en) Data transmission method based on serial interference elimination

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20190910