CN104601210A - Data transmission method for massive antenna system - Google Patents
Data transmission method for massive antenna system Download PDFInfo
- Publication number
- CN104601210A CN104601210A CN201510054282.8A CN201510054282A CN104601210A CN 104601210 A CN104601210 A CN 104601210A CN 201510054282 A CN201510054282 A CN 201510054282A CN 104601210 A CN104601210 A CN 104601210A
- Authority
- CN
- China
- Prior art keywords
- communication node
- antenna
- numbered
- data bit
- bit flow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000005540 biological transmission Effects 0.000 title claims abstract description 30
- 238000004891 communication Methods 0.000 claims abstract description 209
- 239000000284 extract Substances 0.000 claims abstract description 24
- 239000013598 vector Substances 0.000 claims description 30
- 238000013468 resource allocation Methods 0.000 claims description 25
- 239000011159 matrix material Substances 0.000 claims description 14
- 230000017105 transposition Effects 0.000 claims description 4
- 238000012423 maintenance Methods 0.000 abstract description 4
- 230000008901 benefit Effects 0.000 description 17
- 230000008569 process Effects 0.000 description 11
- 238000004590 computer program Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 230000008859 change Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 125000004122 cyclic group Chemical group 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
Classifications
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE 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/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention is applicable to the field of communications and provides a data transmission method for a massive antenna system. The method includes the steps that a first communication node configured with M antennas transmits Y first data bit streams numbered as Bi to a second communication node numbered as Yi; the first communication node extracts Zi bits from the first data bit streams numbered as Bi in accordance with a first predetermined rule to form second data bit streams numbered as Bi; the first communication node selects N antennas from the M antennas in accordance with the selected Z1+Z2+...+ZY bit streams and a second predetermined rule to transmit Y second data bit streams to the second communication node in a multiuser multiplexed mode in the same time-frequency resource. The data transmission method for the massive antenna system can reduce the power consumption of the entire system, is low in equipment cost and maintenance cost and enables the massive antenna system to be widely used.
Description
Technical field
The invention belongs to the communications field, particularly relate to a kind of data transmission method of flood tide antenna system.
Background technology
The appearance of the intelligent terminal such as smart mobile phone, panel computer, result in the flourish of wireless communication network data applied business.And cloud computing, Internet of Things, mobile Internet, mobile phone video phone, mobile video meeting, game on line, Online Video, Online Music, picture download, microblogging, community etc., also drive the extensive increase of cordless communication network user, cause the explosive growth of wireless data service.According to authoritative institution's prediction, coming 10 years, wireless data service will increase 500-1000 doubly, and increase 1.6-2 every year on average doubly, this proposes very high requirement to the capacity of wireless communication system.
The method promoting wireless network capacitance has multiple, and conventional has: (1) increases spectral bandwidth; (2) service distributing is strengthened; (3) network density is improved; (4) promote spectrum efficiency, in these methods, the spectrum efficiency method for improving based on multi-antenna technology obtains very many concerns.
Multi-antenna technology evolves to MU-MIMO from SU-MIMO, and developing deeply is cooperative multipoint transmission technology (CoMP), and thinking of development is from improving the stability of single-link and peak flow to raising entire system flow.But COMP in the implementation, because all difficulties (such as, the resource overhead that measurement channel, data interaction etc. bring, and the imbalance etc. of multipath power) cause performance unsatisfactory, is difficult to get a desired effect.
Under this background, the communication technology based on flood tide antenna is suggested, it is expansion and the extension of MIMO technology, its essential characteristic is exactly the antenna (from tens to several thousand) at base station side configuration flood tide, utilize space division multiple access (SDMA) principle, serve multiple user simultaneously.The vast array gain brought due to flood tide antenna and AF panel gain, the spectrum efficiency making community total and the spectrum efficiency of edge customer obtain great lifting.
Flood tide antenna system is when actual transmissions data, because antenna amount is huge, very large power consumption and the increase of cost can be caused, thus the cost of equipment maintenance causing operator improves, waste day by day valuable energy resource simultaneously, do not meet the demand of following green communications.
Summary of the invention
The object of the present invention is to provide a kind of data transmission method of flood tide antenna system, to solve prior art when using flood tide antenna system, because antenna amount is huge, very large power consumption and the increase of cost can be caused, thus the cost of equipment maintenance causing operator improves, and wastes the problem of day by day valuable energy resource simultaneously.
First aspect, the invention provides a kind of data transmission method of flood tide antenna system, described method comprises:
Be configured with the first communication node transmission Y the first data bit flow of M root antenna to second communication node group, described second communication node group comprises Y second communication node, wherein, M be more than or equal to 256 integer, described first data bit flow is numbered Bi, Bi is for being more than or equal to 1, be less than or equal to the integer of Y, described second communication node serial number is Yi, Yi is for being more than or equal to 1, be less than or equal to the integer of Y, the second communication node of Yi is numbered described in the first data bit flow correspondence of the described Bi of being numbered, the reception antenna number of described second communication node is R,
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, wherein, Zi be more than or equal to 0 integer;
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data;
Each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
In the present invention, by reducing the power consumption of whole system from flood tide antenna system according to the method for predetermined rules selection some antennas transmission data, reduce equipment cost and maintenance cost, it is made to meet green communications demand, be conducive to economizing on resources, and it is more extensive that flood tide antenna system is applied.
Accompanying drawing explanation
Fig. 1 is the realization flow figure of the data transmission method of the flood tide antenna system that the embodiment of the present invention provides;
Fig. 2 is the communication flow diagram of the data transmission method of the flood tide antenna system that the embodiment of the present invention provides.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combination in any mutually.
The present invention by reducing the power consumption of whole system from flood tide antenna system according to the method for certain rules selection some antennas transmission data, reduce equipment cost, meet green communications demand, the scale of flood tide antenna system is applied becomes possibility.
Flood tide antenna system data transmission method of the present invention as shown in Figure 1, at least comprises the following steps:
Step 102, the first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, described second communication node group comprises Y second communication node, wherein, M be more than or equal to 256 integer, described first data bit flow is numbered Bi, Bi is for being more than or equal to 1, and be less than or equal to the integer of Y, described second communication node serial number is Yi, Yi is for being more than or equal to 1, be less than or equal to the integer of Y, the second communication node of Yi is numbered described in the first data bit flow correspondence of the described Bi of being numbered, the reception antenna number of described second communication node is R,
Step 104, described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, wherein, Zi be more than or equal to 0 integer;
Step 106, described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data;
Step 108, each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Further illustrate the present invention below by Fig. 2 and specific embodiment, need to illustrate, the first communication node in embodiment can be the base station of being furnished with flood tide antenna, and second communication node can be terminal.
Embodiment one
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node;
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, in this process, may there is part first data bit flow and directly become the second data bit flow, namely Zi equals 0, wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, and the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance.
Or the first pre-defined rule is for randomly drawing, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly.
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, other M-N root antennas do not send any data, such as during M=256, be divided into X=64 group, antenna sets is numbered 0 ~ 63, often the antenna that comprises of group is all not identical, when Y equals 3, each first data bit flow extracts 2 bits, form " 000001 " bit stream, four antenna transmission, 4 the second data bit flows corresponding to antenna sets then selecting antenna sets to be numbered 1 are to 4 corresponding second communication nodes, that is 4 antennas are only needed to send data in 256 antennas, all the other 252 antennas do not consume any power, thus reduce the power consumption of whole system.
Each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Preferably, the second communication node of the described Yi of being numbered receives the resource allocation information that described first communication node sends to oneself before being numbered second bit stream of Yi described in decoding is corresponding with oneself, if Zi is greater than 0, then carry precoding matrix information in described resource allocation information, if Zi equals 0, then do not carry precoding matrix information in described resource allocation information.
Embodiment two
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node;
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow in this process, part first data bit flow may be there is and directly become the second data bit flow, namely Zi equals 0, wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance, or randomly draw, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly;
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data.
Such as, when M equals 256, be divided into C
256 4=174792640 groups, antenna sets is numbered 0-174792639, the antenna that two groups of antenna sets comprise has a difference at least, when Y equals 4, each first data bit flow extracts 7 bits, forming length is the bit stream of 28, such as " 0000000000000000000000000001 ", four antenna transmission, 4 the second data bit flows corresponding to antenna sets then selecting antenna sets to be numbered 1 are to 4 corresponding second communication nodes, that is 4 antennas are only needed to send data in 256 antennas, all the other 252 antennas do not consume any power, thus reduce the power consumption of whole system.
Preferably, if when only having an antenna different between two described antenna sets, then the numbering difference between them is+1 or-1, the benefit done so effectively reduces selects the erroneous judgement of antenna on the impact of whole system performance.
Each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Preferably, the second communication node of the described Yi of being numbered receives the resource allocation information that described first communication node sends to oneself before being numbered second bit stream of Yi described in decoding is corresponding with oneself, if Zi is greater than 0, then carry precoding matrix information in described resource allocation information, if Zi equals 0, then do not carry precoding matrix information in described resource allocation information.
Embodiment three
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node.
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, Y the second data bit flow is formed.May there is part first data bit flow and directly become the second data bit flow, namely Zi equals 0, wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance, or randomly draw, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly.
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data.
Such as, when M equals 256, be divided into X=C
256 4=174792640 groups, antenna sets is numbered 0 ~ 174792639, the antenna that two groups of antenna sets comprise has a difference at least, when Y equals 4, suppose that the second communication node processing power being numbered 1 is minimum, be numbered 2 second communication node processing power the strongest, the second communication node being then numbered 1 extracts 2 bits, the second communication node being numbered 2 extracts 4 bits, the second communication node being numbered 3 extracts 8 bits, the second communication node being numbered 4 extracts 14 bits, and forming length is the bit stream of 28.
Such as " 0000000000000000000000000001 ", four antenna transmission, 4 the second data bit flows corresponding to antenna sets then selecting antenna sets to be numbered 1 are to 4 corresponding second communication nodes, that is 4 antennas are only needed to send data in 256 antennas, all the other 252 antennas do not consume any power, thus reduce the power consumption of whole system.
Preferably, if when only having an antenna different between two described antenna sets, then the numbering difference between them is+1 or-1, the benefit done so effectively reduces selects the erroneous judgement of antenna on the impact of whole system performance.
Preferably, each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Preferably, the second communication node of the described Yi of being numbered is before being numbered second bit stream of Yi described in decoding is corresponding with oneself, receive the resource allocation information that described first communication node sends to oneself, if Zi is greater than 0, then carry precoding matrix information in described resource allocation information, if Zi equals 0, then do not carry precoding matrix information in described resource allocation information.
Embodiment four
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node;
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, likely there is part first data bit flow and directly become the second data bit flow, namely Zi equals 0.Wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance, or randomly draw, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly;
Preferably, described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data.
Preferably, each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Preferably, the second communication node of the described Yi of being numbered receives the resource allocation information that described first communication node sends to oneself before being numbered second bit stream of Yi described in decoding is corresponding with oneself, if Zi equals 0, precoding matrix information is not carried in described resource allocation information, the second communication node being numbered Yi then does not need to judge that described first communication node selects the second bit stream described in which N root antenna transmission from described M root antenna, and the first data bit flow that is this second communication node is corresponding is not extracted any bit.
Embodiment five
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node.
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, likely there is part first data bit flow and directly become the second data bit flow, namely Zi equals 0.Wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance, or randomly draw, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly.
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data.
Preferably, each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
Preferably, described in be numbered the channel information H of the known described M root antenna of second communication node to oneself of Yi, dimension is R*M, and the baseband signal obtained from described running time-frequency resource is D, and dimension is R*1, described in be numbered Yi second communication node pass through H
h* D computing obtains M*1 and ties up antenna judgement vector, judge to select N number of element of amplitude maximum vector from described antenna and record the position that they to judge at described antenna in vector, described N number of element is defined as N number of antenna that described first communication node is selected from described M root antenna in the position that described antenna judges in vector, and then determine the antenna sets T at described N number of antenna place, wherein, (.)
hfor conjugate transposition operation.
Such as M=128, N=4, Y=4, all antennas are divided into X=C
256 4=174792640 groups, antenna sets is numbered 0 ~ 174792639, and the second communication node being numbered 1 passes through H
h* D computing obtains 128*1 and ties up antenna and judge that the maximum N number of element of vector magnitude is arranged in described antenna and judges vector position 1, position 5, position 100, position 160, then the second communication node being numbered 1 judges that the first communication node selects these 4 antennas to send data as oneself from described 128 antennas.
Suppose that the antenna sets that these four antennas are corresponding is numbered 1, after decimal number 1 being converted to 28 binary bit stream " 0000000000000000000000000001 ", be numbered front 8 bits " 00000000 " of second communication sensor selection problem of 1 as the bit sequence extracted from the first bit stream of oneself correspondence, in like manner, according to this method, be numbered 2, 3, the second communication node of 4 also successfully can judge that 4 antennas that antenna sets is numbered in 1 send data as oneself, bit sequence is selected to be " 00000000 " successively, " 00000000 ", " 00000001 " is as the bit sequence extracted from the first bit stream of oneself correspondence.
Preferably, carry in described resource allocation information described in be numbered Yi second communication node be converted to the initial bits position of Zi bit corresponding in binary bit stream in described T value.
Preferably, the initial bits location expression information that described resource allocation information cyclic redundancy check bits sequence and described T value are converted to Zi corresponding with the second communication node of the described Yi of being numbered in a binary bit stream bit carries out xor operation, and corresponding second communication node needs when carrying out cyclic redundancy check (CRC) to determine described original position by blind check.
Preferably, according to the numbering Yi of oneself, described second communication node determines that described T value is converted to the initial bits position of Zi bit of oneself correspondence in binary bit stream.
Preferably, part second communication node determination antenna sets code T is only needed in described second communication node group, described part second communication node will comprise the message notice of described antenna sets code T to the other-end in described second communication node group again, such as Y=4, only need the second communication node determination antenna sets numbering being numbered 1, then this terminal again by the message notice comprising described antenna sets code T in described second communication node group be numbered 2/3/4 terminal, the benefit done like this is that of avoiding the operation that multiple second communication node all does repetition, add the stand-by time of second communication node.
Embodiment six
The first communication node being configured with M root antenna needs transmission Y the first data bit flow to second communication node group, and described second communication node group comprises Y second communication node;
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, likely there is part first data bit flow and directly become the second data bit flow, namely Zi equals 0.Wherein, Zi be more than or equal to 0 integer.
Preferably, described first pre-defined rule is extracted at equal intervals, the benefit done like this realizes simple, effectively can resist the impact of channel sudden change, elevator system performance, or randomly draw, or generate according to the system parameter message of described first communication node, or described first communication node and described second communication node negotiate are determined, the benefit done like this extracts the bit of correct position, more flexibly;
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data.
Each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource, preferably, the second communication node of the described Yi of being numbered receives the resource allocation information that described first communication node sends to oneself before being numbered second bit stream of Yi described in decoding is corresponding with oneself, carries precoding matrix information in described resource allocation information.
Preferably, the described channel information H of the known described M root antenna of second communication node to oneself being numbered Yi, dimension is R*M, the baseband signal obtained from described running time-frequency resource is D, dimension is R*1, from described resource allocation information, obtain pre-coding matrix Pi, described in be numbered Yi second communication node pass through H
h* D computing obtains M*1 and ties up antenna judgement vector, judge to select the C of an amplitude maximum element vector from described antenna and record their positions in described antenna judgement vector, from a described C element, select N number of element to form Q dimension is the vector of N*1, in Q vector Qj, makes Pi
h* N number of element that the vector of amplitude maximum that obtains of Qj is corresponding, described N number of element is defined as N number of antenna that described first communication node is selected from described M root antenna in the position that described antenna judges in vector, and then determine the antenna sets T at described N number of antenna place, wherein, (.)
hfor conjugate transposition operation, such as M=128, N=4, Y=4, C=5, all antennas are divided into X=C
256 4=174792640 groups, antenna sets is numbered 0 ~ 174792639, and the second communication node being numbered 1 passes through H
h* D computing obtains 128*1 and ties up antenna and judge that maximum 5 elements of vector magnitude form the vector of 5 dimensions as 4*1, by publicity Pi
h* (the arbitrary vectors in 5 vectors) obtain 5 amplitudes, the vector of amplitude maximum is arranged in described antenna and judges vector position 1, position 5, position 100, position 160, the second communication node being then numbered 1 judges that the first communication node selects these 4 antennas to send data as oneself from described 128 antennas, suppose that the antenna sets that these four antennas are corresponding is numbered 1, after decimal number 1 being converted to 28 binary bit stream " 0000000000000000000000000001 ", be numbered front 8 bits " 00000000 " of second communication sensor selection problem of 1 as the bit sequence extracted from the first bit stream of oneself correspondence, in like manner, according to this method, be numbered 2, 3, the second communication node of 4 also successfully can judge that 4 antennas that antenna sets is numbered in 1 send data as oneself, bit sequence is selected to be " 00000000 " successively, " 00000000 ", " 00000001 " is as the bit sequence extracted from the first bit stream of oneself correspondence.
Preferably, carry in described resource allocation information described in be numbered Yi second communication node be converted to the initial bits position of Zi bit corresponding in binary bit stream in described T value.
Preferably, the initial bits location expression information that described resource allocation information cyclic redundancy check bits sequence and described T value are converted to Zi corresponding with the second communication node of the described Yi of being numbered in a binary bit stream bit carries out xor operation, and corresponding second communication node needs when carrying out cyclic redundancy check (CRC) to determine described original position by blind check.
Preferably, according to the numbering Yi of oneself, described second communication node determines that described T value is converted to the initial bits position of Zi bit of oneself correspondence in binary bit stream.
Preferably, part second communication node determination antenna sets code T is only needed in described second communication node group, described part second communication node will comprise the message notice of described antenna sets code T to the other-end in described second communication node group again, such as Y=4, only need the second communication node determination antenna sets numbering being numbered 1, then this terminal again by the message notice comprising described antenna sets code T in described second communication node group be numbered 2/3/4 terminal, the benefit done like this is that of avoiding the operation that multiple second communication node all does repetition, add the stand-by time of second communication node.
By the method that this patent proposes, under the prerequisite meeting future communications demand, power consumption and the cost of whole system can be reduced, meet green communications demand, make the scale commercialization of flood tide antenna system become possibility.
If the method and apparatus supporting to improve data packet transmission performance described in the embodiment of the present invention using the form of software function module realize and as independently production marketing or use time, also can be stored in a computer read/write memory medium.Based on such understanding, those skilled in the art should understand, the embodiment of the application can be provided as method, system or computer program.Therefore, the application can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And, the application can adopt in one or more form wherein including the computer program that the computer-usable storage medium of computer usable program code is implemented, described storage medium includes but not limited to USB flash disk, portable hard drive, read-only memory (ROM, Read-Only Memory), magnetic disc store, CD-ROM, optical memory etc.
The application is that the flow chart of method, equipment (system) and computer program according to the embodiment of the present application and/or block diagram describe.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or square frame.These computer program instructions can being provided to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computer or other programmable data processing device produce device for realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make on computer or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computer or other programmable devices is provided for the step realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
Accordingly, the embodiment of the present invention also provides a kind of computer-readable storage medium, wherein stores computer program, and this computer program improves the method and apparatus of data packet transmission performance for the support performing the embodiment of the present invention.
The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.
Claims (10)
1. a data transmission method for flood tide antenna system, is characterized in that, described method comprises:
Be configured with the first communication node transmission Y the first data bit flow of M root antenna to second communication node group, described second communication node group comprises Y second communication node, wherein, M be more than or equal to 256 integer, described first data bit flow is numbered Bi, Bi is for being more than or equal to 1, be less than or equal to the integer of Y, described second communication node serial number is Yi, Yi is for being more than or equal to 1, be less than or equal to the integer of Y, the second communication node of Yi is numbered described in the first data bit flow correspondence of the described Bi of being numbered, the reception antenna number of described second communication node is R,
Described first communication node extracts Zi bit from described being numbered first data bit flow of Bi according to the first pre-defined rule, second data bit flow of Bi is numbered described in the bit stream removed in first data bit flow of the described Bi of being numbered after a described Zi bit is formed, by that analogy, form Y the second data bit flow, wherein, Zi be more than or equal to 0 integer;
Described first communication node is according to the Z1+Z2+ selected ... + ZY bit stream selects N root antenna to send described Y the second data bit flow to described second communication node group by the mode of multiuser multiplexing on identical running time-frequency resource according to the second pre-defined rule from described M root antenna, and other M-N root antennas do not send any data;
Each second communication node in described second communication node group is decoded described first data bit flow of oneself correspondence on described running time-frequency resource.
2. method according to claim 1, is characterized in that, described first communication node extracts Zi bit step according to the first pre-defined rule and is from first data bit flow of the described Bi of being numbered:
Described first communication node from first data bit flow of the described Bi of being numbered according to extracted at equal intervals, to randomly draw or according to the system parameters of described first communication node, or determined by the first communication node and second communication node negotiate, extract Zi bit.
3. method according to claim 1, it is characterized in that, described second pre-defined rule comprises: described M root antenna is divided into X antenna sets, antenna sets is numbered Gj, wherein, Gj is the integer being more than or equal to 0 and being less than X, and each antenna sets comprises N root antenna, according to described (Z1+Z2+ ... + ZY) the N root antenna that comprises of the antenna sets code T corresponding after becoming decimal number of individual bits switch is as described N root antenna.
4. method according to claim 3, is characterized in that having an antenna difference at least between every two antenna sets in a described X antenna sets, or does not have an antenna identical between every two antenna sets in X antenna sets.
5. method according to claim 3, it is characterized in that, described method also comprises:
If described in be numbered Yi the resource allocation information that receives of second communication node in carry precoding matrix information Pi, then described second communication node needs to determine that described first communication node selects described group # to be the antenna sets of T from a described X antenna sets is oneself service, finds the Zi corresponding with oneself bit after described T value is converted to binary bit stream from described binary bit stream.
6. method according to claim 5, is characterized in that:
Carry the initial bits position of Zi bit in described resource allocation information, described Zi is converted in binary bit stream corresponding with the second communication node being numbered Yi in described T value;
Described second communication node, according to the numbering Yi of oneself, is converted in binary bit stream in described T value, determines the initial bits position of Zi the bit that the numbering Yi of described second communication node is corresponding.
7. method according to claim 5, it is characterized in that, described method also comprises:
The second communication node of the described Yi of being numbered obtains the channel information H of described M root antenna to oneself, its dimension is R*M, pre-coding matrix Pi is obtained from described resource allocation information, its dimension is N*1, baseband signal D is obtained from described running time-frequency resource, its dimension is R*1, described in be numbered Yi second communication node pass through H
h* D computing obtains M*1 and ties up antenna judgement vector, judge to select the C of an amplitude maximum element vector from described antenna and record their positions in described antenna judgement vector, from a described C element, select N number of element to form Q dimension is the vector of N*1, in Q vector Qj, makes Pi
h* N number of element that the vector of amplitude maximum that obtains of Qj is corresponding, described N number of element is defined as N number of antenna that described first communication node is selected from described M root antenna in the position that described antenna judges in vector, and then determine the antenna sets T at described N number of antenna place, wherein, C is more than or equal to N, is less than M, (.)
hfor conjugate transposition operation.
8. method according to claim 5, it is characterized in that, described method also comprises:
The described channel information H of the known described M root antenna of second communication node to oneself being numbered Yi, dimension is R*M, pre-coding matrix Pi is obtained from described resource allocation information, dimension is N*1, the baseband signal obtained from described running time-frequency resource is D, dimension is R*1, described in be numbered Yi second communication node pass through H
h* D computing obtains M*1 and ties up antenna judgement vector, judge to select N number of element of amplitude maximum vector from described antenna and record the position that they to judge at described antenna in vector, described N number of element is defined as N number of antenna that described first communication node is selected from described M root antenna in the position that described antenna judges in vector, and then determine the antenna sets T at described N number of antenna place, wherein, (.)
hfor conjugate transposition operation.
9. method according to claim 1, it is characterized in that, described method also comprises:
The second communication node of the described Yi of being numbered receives the resource allocation information that described first communication node sends to oneself before being numbered second bit stream of Yi described in decoding is corresponding with oneself, if Zi is greater than 0, then carry precoding matrix information in described resource allocation information, if Zi equals 0, then do not carry precoding matrix information in described resource allocation information.
10. method according to claim 1, is characterized in that, the disposal ability of the described second communication node that the bit number extracted from each first data bit flow of Y described first data bit flow is corresponding with this first data bit flow is directly proportional.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510054282.8A CN104601210B (en) | 2015-01-30 | 2015-01-30 | A kind of data transmission method of flood tide antenna system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510054282.8A CN104601210B (en) | 2015-01-30 | 2015-01-30 | A kind of data transmission method of flood tide antenna system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104601210A true CN104601210A (en) | 2015-05-06 |
| CN104601210B CN104601210B (en) | 2018-07-27 |
Family
ID=53126760
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510054282.8A Expired - Fee Related CN104601210B (en) | 2015-01-30 | 2015-01-30 | A kind of data transmission method of flood tide antenna system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104601210B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108200556A (en) * | 2018-01-16 | 2018-06-22 | 深圳职业技术学院 | A kind of highly reliable business transmitting method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938301A (en) * | 2009-06-29 | 2011-01-05 | 大唐移动通信设备有限公司 | Method and equipment for sending multi-user MIMO |
| CN102316597A (en) * | 2010-06-30 | 2012-01-11 | 中兴通讯股份有限公司 | Resource scheduling method and device for multiple input multiple output (MIMO) system |
| CN103516486A (en) * | 2012-06-19 | 2014-01-15 | 中兴通讯股份有限公司 | Vector selection modulation-based multi-antenna transmission method, receiving method and device |
| CN103532607A (en) * | 2013-10-23 | 2014-01-22 | 东南大学 | Method of massive MIMO system for selecting base station antenna and user terminal |
| US20140307814A1 (en) * | 2013-04-15 | 2014-10-16 | Broadcom Corporation | Antenna Systems and Methods for massive MIMO Communication |
| CN104113366A (en) * | 2014-07-29 | 2014-10-22 | 北京邮电大学 | Antenna selection method aiming at energy effectiveness of Massive MIMO (Multiple Input Multiple Output) communication system |
| WO2014187388A1 (en) * | 2013-12-16 | 2014-11-27 | 中兴通讯股份有限公司 | Reference signal transmission method, device and computer storage medium |
| CN104184561A (en) * | 2014-01-13 | 2014-12-03 | 中兴通讯股份有限公司 | Precoding pilot processing method and device, base station and terminal |
-
2015
- 2015-01-30 CN CN201510054282.8A patent/CN104601210B/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938301A (en) * | 2009-06-29 | 2011-01-05 | 大唐移动通信设备有限公司 | Method and equipment for sending multi-user MIMO |
| CN102316597A (en) * | 2010-06-30 | 2012-01-11 | 中兴通讯股份有限公司 | Resource scheduling method and device for multiple input multiple output (MIMO) system |
| CN103516486A (en) * | 2012-06-19 | 2014-01-15 | 中兴通讯股份有限公司 | Vector selection modulation-based multi-antenna transmission method, receiving method and device |
| US20140307814A1 (en) * | 2013-04-15 | 2014-10-16 | Broadcom Corporation | Antenna Systems and Methods for massive MIMO Communication |
| CN103532607A (en) * | 2013-10-23 | 2014-01-22 | 东南大学 | Method of massive MIMO system for selecting base station antenna and user terminal |
| WO2014187388A1 (en) * | 2013-12-16 | 2014-11-27 | 中兴通讯股份有限公司 | Reference signal transmission method, device and computer storage medium |
| CN104184561A (en) * | 2014-01-13 | 2014-12-03 | 中兴通讯股份有限公司 | Precoding pilot processing method and device, base station and terminal |
| CN104113366A (en) * | 2014-07-29 | 2014-10-22 | 北京邮电大学 | Antenna selection method aiming at energy effectiveness of Massive MIMO (Multiple Input Multiple Output) communication system |
Non-Patent Citations (1)
| Title |
|---|
| YAN NI,WENCE ZHANG,MING CHEN: "Antenna Subset Selection in MU large-scale MIMO Systems", 《2013 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108200556A (en) * | 2018-01-16 | 2018-06-22 | 深圳职业技术学院 | A kind of highly reliable business transmitting method |
| CN108200556B (en) * | 2018-01-16 | 2019-05-21 | 深圳职业技术学院 | A kind of highly reliable business transmitting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104601210B (en) | 2018-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102811107B (en) | Pilot frequency sequence collocation method and the network equipment | |
| CN105007126A (en) | Method, system and device for measuring channel state information | |
| CN104782062B (en) | Sequence for cell special reference (CRS) generates | |
| CN103248468A (en) | Demodulation pilot signal processing method, base station and user equipment | |
| CN105375962B (en) | A kind of method sending and receiving reference signal and communication node | |
| CN102255705A (en) | Uplink precoding information indication method and device | |
| CN105978655A (en) | Packet data transmission method and system in wireless network | |
| Dabiri et al. | Dynamic SCMA codebook assignment methods: A comparative study | |
| CN102957490B (en) | For interference elimination method and the equipment of enhancement mode downlink physical Dedicated Control Channel | |
| CN101675636B (en) | Method and device for allocating resources in OFDM network | |
| CN108462519A (en) | A kind of channel state information feedback method, UE and access network entity | |
| CN103023545A (en) | Wireless data transmission method and network-side equipment | |
| CN102340336A (en) | User pairing method of MU-MIMO based on SLNR | |
| EP3240343A1 (en) | Channel acquisition signal configuring and channel acquisition signal generating method and device | |
| CN103916340A (en) | Noise power estimation method and network-side equipment | |
| Shi et al. | Performance analysis of MIMO-NOMA systems with randomly deployed users | |
| CN109495148A (en) | A kind of method of codebook subset limitation | |
| CN104601210A (en) | Data transmission method for massive antenna system | |
| CN104348764B (en) | The method and apparatus that computing unit is distributed in data receiver link | |
| CN103312401A (en) | Pre-coding method and device of enhanced physical downlink control channel (E-PDCCH) | |
| CN101841410A (en) | Sampling point signal selection method and receiving end | |
| CN107592676B (en) | Data generation method and device, transmitter and terminal | |
| US9264194B2 (en) | Preamble generation method and apparatus of station, and data frame generation method | |
| CN104753573A (en) | Space division multiplexing implementation method, system, base station and terminal | |
| CN109495209A (en) | Bit Interleave, de-interweaving method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| 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: 20180727 |