CN1960198A - Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system - Google Patents

Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system Download PDF

Info

Publication number
CN1960198A
CN1960198A CNA2006101521675A CN200610152167A CN1960198A CN 1960198 A CN1960198 A CN 1960198A CN A2006101521675 A CNA2006101521675 A CN A2006101521675A CN 200610152167 A CN200610152167 A CN 200610152167A CN 1960198 A CN1960198 A CN 1960198A
Authority
CN
China
Prior art keywords
user
subcarrier
allocated
mtd
sub
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
Application number
CNA2006101521675A
Other languages
Chinese (zh)
Other versions
CN1960198B (en
Inventor
田辉
张平
高有军
徐海博
陶小峰
谢怀遥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BEIJING STARPOINT TECHNOLOGY Co Ltd
Original Assignee
Beijing University of Posts and Telecommunications
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 University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN2006101521675A priority Critical patent/CN1960198B/en
Publication of CN1960198A publication Critical patent/CN1960198A/en
Application granted granted Critical
Publication of CN1960198B publication Critical patent/CN1960198B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The method includes the following steps: distributing the sub-carrier number on the base of the power reduction value while the user adds a sub-carrier so as to decide the sub-carrier number needed by users; according to this decided number, calculating the mean bit number on a sub-carrier sent by all users; according to the power needed for sending this mean bit number, distributing the practical sub-carrier to all users. Via water injection algorithm of single user, the method carries out bit-loads for every user.

Description

Subcarrier, bit and power distribution method for orthogonal frequency division multiple access system
Technical Field
The present invention relates to an Orthogonal Frequency Division Multiple Access (OFDMA) system, and more particularly, to a subcarrier, bit, and power allocation method for an OFDMA system.
Background
With the rapid development of mobile communication technology and the rapid increase of user demand, multimedia services such as audio, video, image, and internet will become the leading services of future mobile communication, and the requirements of these services for the transmission capability of wireless link are significantly increased (peak service rate is greater than 20Mbps), in this case, Orthogonal Frequency Division Multiplexing (OFDM) technology is gradually emerging. OFDM technology modulates a high-speed data stream into multiple parallel low-speed data streams that are spectrally overlapped for transmission. Since the OFDM symbol period is significantly increased, the resistance of the OFDM symbol to multipath delay is improved, and inter-symbol interference (ISI) caused by multipath delay can be completely removed by introducing a guard interval, the OFDM technique has been adopted by several standards at present, and has been basically recognized as one of physical layer basic techniques of B3G (super-third generation mobile communication system). An Orthogonal Frequency Division Multiple Access (OFDMA) system is one of multiple access schemes that may be most likely used in a B3G system because an orthogonal adjacent subcarrier is flexibly allocated to different users, so that simultaneous access of multiple users is realized in a communication system, system capacity is improved, a resource allocation scheme can be dynamically changed, and rate transmission capability in a large dynamic range and quality of service (QoS) requirements of multiple users and multiple services in a future mobile communication system are met.
For the subcarrier, bit and power allocation method of the OFDMA system, the method with better performance in the prior art is a multi-user greedy water injection method. The method firstly allocates bits to be transmitted to all subcarriers according to a single-user water filling algorithm for transmission, then lists the subcarriers allocated to a plurality of users simultaneously as 'collision subcarriers' according to the principle that a plurality of users cannot share one subcarrier simultaneously, and then reallocates the bits loaded on the 'collision subcarriers' to other subcarriers, thereby causing the increase of power, most seriously causing complex processing procedures caused for solving the 'collision subcarriers', and the allocation method cannot meet the requirements of improving the system performance and reducing the cost of a future mobile communication system.
Disclosure of Invention
The task of the present invention is to provide a low-complexity subcarrier, bit and power allocation method for an Orthogonal Frequency Division Multiple Access (OFDMA) system, which significantly reduces the power consumption of information transmitted by a transmitting end of a communication system and the complexity of radio resource allocation, thereby improving the performance of the communication system and reducing the economic cost.
In the subcarrier, bit and power allocation method according to the present invention, the number of subcarriers required for each user is first determined. In order to ensure the fairness of users, the number of subcarriers allocated to each user is assumed to be 1, the average channel gain of each user is firstly calculated by combining channel information, then subcarriers are added to the users one by one according to the idea of the water injection principle, and the number of the subcarriers of the user with the largest transmission power reduction after one subcarrier is added by 1 until the number of all the subcarriers is completely allocated in each user.
The subcarriers specifically allocated to the user are then determined. According to the number of subcarriers already allocated to the users, the average number of bits sent by each user on each subcarrier can be obtained, and for each user, the power required for sending the number of bits on each subcarrier can be further obtained; and traversing all users, finding out the subcarrier with the minimum required transmitting power and the corresponding user thereof, then allocating the subcarrier to the user, and continuously allocating the rest subcarriers by adopting the same method until the subcarriers are all allocated to the user. In order to further reduce the complexity of the operation, in this step, the subcarriers may be allocated according to the channel gain corresponding to each subcarrier, that is, all users are traversed, the subcarrier corresponding to the maximum channel gain is found and allocated to the corresponding user, and the remaining subcarriers are continuously allocated by the same method until all subcarriers are allocated to the users.
And transmitting the bits required to be transmitted by each user on the allocated subcarriers according to a single-user water filling algorithm.
The method of the invention combines the channel information, adopts three steps to reduce the power required by the sending end when sending the information, each step leads the sending power to be the minimum in average meaning, and the three-step combined distribution scheme can also achieve the obvious reduction of the complexity. Therefore, the method according to the invention not only achieves low complexity, but also has better performance than other allocation methods.
According to the present invention, there is provided a subcarrier, bit and power allocation method for an ofdma system, comprising the steps of: distributing the number of the subcarriers based on the power reduction amount caused by adding one subcarrier to each user, thereby determining the number of the subcarriers required by each user; calculating the average bit number sent by each user on one subcarrier according to the determined subcarrier number of each user, and determining the subcarrier specifically allocated to each user according to the power value required by sending the average bit number; for each user, bit loading is performed according to a single-user water filling algorithm.
Drawings
The invention is further described in connection with preferred embodiments with reference to the accompanying drawings. Wherein:
fig. 1 shows a block diagram of an OFDMA system which can be used for the allocation method according to the present invention.
Fig. 2 shows a flow chart of a resource allocation method according to the present invention.
Detailed Description
Fig. 1 shows a system block diagram that can be used for the allocation method according to the invention. This system is an OFDMA system. Fig. 1 shows the subcarrier, bit and power allocation modules in the system in detail.
Fig. 2 shows a flow chart of a subcarrier, bit, power allocation method according to the present invention. As shown in fig. 2, the allocation method according to the present invention first determines the number of subcarriers required by each user by allocating the number of subcarriers according to the water-filling principle in combination with the average channel gain according to the power reduction caused by adding one subcarrier to each user. The subcarriers specifically allocated to each user are then determined based on the power value required to transmit the number of bits that each user transmits on average over each subcarrier allocated to it. And finally, carrying out bit loading according to a single-user water filling algorithm.
Each step in the allocation method according to the invention minimizes the transmission power in an average sense and such a three-step joint allocation scheme can also achieve a significant reduction in complexity.
The subcarrier, bit, power allocation method according to the present invention is described in detail below. Assume that there are K users and N subcarriers in the system. The bit number of user k to be transmitted is Rk
In the first step, the number of subcarriers required by each user is determined.
It is first assumed that the number of subcarriers initially allocated to each user is 1. The process described in detail below is then performed to determine a user, and the number of sub-carriers allocated to this user is increased by 1. This determination is repeated until all N subcarriers are allocated.
This determination is described below:
assume that, for user k, the number of subcarriers allocated to user k is N before performing the determination processkThen the average number of bits transmitted per subcarrier is Rk/NkWherein R iskThe total number of bits that need to be transmitted for user k. Suppose that user k is added with one subcarrier, Nk=Nk+1, the average number of bits transmitted per subcarrier is Rk/(Nk+1). According to the following formulas (1) and (2):
<math> <mrow> <msub> <mi>f</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <mi>r</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <msub> <mi>N</mi> <mn>0</mn> </msub> <mn>3</mn> </mfrac> <msup> <mrow> <mo>[</mo> <msup> <mi>Q</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mrow> <mo>(</mo> <mfrac> <msub> <mi>BER</mi> <mi>k</mi> </msub> <mn>4</mn> </mfrac> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mn>2</mn> </msup> <mo>&CenterDot;</mo> <mrow> <mo>(</mo> <msup> <mn>2</mn> <mi>r</mi> </msup> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein f isk(rkN) is r transmitted on subcarrier n by the receiving end in order to receive user kk,nReceived power required for one bit, N0Is the noise power spectral density, BERkIs the bit error rate QoS requirement of the traffic.
P k , n = f k ( r k , n ) g k , n 2 - - - ( 2 )
Wherein, Pk,nFor the corresponding transmit power of the transmitting end, gk,nIs the channel gain corresponding to the subcarrier. It can be obtained that when the number of subcarriers allocated to user k is from NkIncreasing Nk+1Then R is transmitted within one OFDM symbolkReduction of power required for one bit Δ PkIs composed of
<math> <mrow> <mi>&Delta;</mi> <msub> <mi>P</mi> <mi>k</mi> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo>*</mo> <msub> <mi>f</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>k</mi> </msub> <mo>/</mo> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>*</mo> <msub> <mi>f</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>R</mi> <mi>k</mi> </msub> <mo>/</mo> <mrow> <mo>(</mo> <msub> <mi>N</mi> <mi>k</mi> </msub> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> <msup> <msub> <mover> <mi>g</mi> <mo>~</mo> </mover> <mi>k</mi> </msub> <mn>2</mn> </msup> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </math>
Wherein,
Figure A20061015216700074
is the root mean square of the subcarrier channel gains assigned to user k, i.e.:
<math> <mrow> <msub> <mover> <mi>g</mi> <mo>~</mo> </mover> <mi>k</mi> </msub> <mo>=</mo> <msqrt> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msup> <mrow> <mo>|</mo> <mrow> <mo>(</mo> <msub> <mi>g</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>|</mo> </mrow> <mn>2</mn> </msup> <mo>/</mo> <mi>N</mi> </msqrt> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>
according to the above equation (3), the power reduction value Δ P when the number of subcarriers thereof is increased by 1 is calculated for all userskAnd reducing the value Δ P from the power of all userskThe maximum value is picked, that is, the number of sub-carriers allocated to the user corresponding to the maximum value is determined to be added by 1.
And then repeating the above determining process, and distributing the rest sub-carriers to the users one by adopting the same method for comparing the power reduction values until all the N sub-carriers are distributed.
And secondly, after the number of the sub-carriers required by each user in the system is determined, selecting the required specific sub-carriers from the sub-carriers available in the system for each user.
Suppose that for user k, the number of subcarriers allocated to that user is determined to be N in the previous stepkThen send on the nth sub-carrier (R)k/Nk) The power required for each bit is:
P k , n = f k ( R k / N k ) g 2 k , n - - - ( 5 )
thus, for each user and for each subcarrier, N x K power values P can be obtainedk,nComposed matrix P
<math> <mrow> <mi>P</mi> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>P</mi> <mn>1,1</mn> </msub> </mtd> <mtd> <msub> <mi>P</mi> <mn>1,2</mn> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>P</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>P</mi> <mn>2,1</mn> </msub> </mtd> <mtd> <msub> <mi>P</mi> <mn>2,2</mn> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>P</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>P</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> </mtr> <mtr> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>P</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>P</mi> <mrow> <mi>K</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>P</mi> <mrow> <mi>K</mi> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>
By Pk,n *Representing the minimum value P in the matrix Pk,n. Finding Pk,n *And allocates the corresponding subcarrier n to the corresponding user k because of the minimum value Pk,nMeaning that user k requires the least power to transmit information on subcarrier n. And set Pk,nInfinity. Continuing to find P in matrix P by the same methodk,n *Until each user is allocated the desired sub-carriersAnd (4) counting.
And a third step of loading the bit information to be transmitted by the user on the allocated sub-carriers. Since the sub-carriers allocated to the users have been determined by the first two steps, a single-user water-filling algorithm can be used for bit loading. Define by ΩkDenotes the set of sub-carriers, Δ P, to which user k is allocatedk,nFor user k, in subcarrier n (n belongs to Ω)k) The amount of power increase when more than one bit is loaded, i.e.
<math> <mrow> <mi>&Delta;</mi> <msub> <mi>P</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>f</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>r</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>f</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>r</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>)</mo> </mrow> </mrow> <msubsup> <mi>g</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> <mn>2</mn> </msubsup> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
Find out omegakMiddle smallest Δ Pk,nAnd adding 1 to the corresponding subcarrier by the transmitted bit number. Repeating the above process, and loading the bits to be sent of user k to omegakOn the sub-carriers of (a). The bit loading method of other users is the same.
The complete procedure of the subcarrier, bit, power allocation method according to the present invention has been described in detail above.
However, in the allocation method according to the present invention, in order to further reduce the computational complexity, the second step, i.e. the step of determining specific subcarriers for the user, may be modified.
Because of the information transmittedThe required power is mainly given by the channel gain gk,nSo that the channel gain can be substituted for the transmit power, i.e. the matrix P mentioned above is replaced by the following matrix G
<math> <mrow> <mi>G</mi> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>g</mi> <mn>1,1</mn> </msub> </mtd> <mtd> <msub> <mi>g</mi> <mn>1,2</mn> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>g</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>g</mi> <mn>2,1</mn> </msub> </mtd> <mtd> <msub> <mi>g</mi> <mn>2,2</mn> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>g</mi> <mrow> <mn>2</mn> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>g</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> </mtr> <mtr> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>g</mi> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>g</mi> <mrow> <mi>K</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msub> <mi>g</mi> <mrow> <mi>K</mi> <mo>,</mo> <mi>N</mi> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
However, due to Pk,nAnd g2 k,nInversely proportional, so in this case, g needs to be determinedk,nIs measured. By gk,n *Represents the maximum value g in Pk,n. Find out gk,n *And allocates the corresponding sub-carrier n to the corresponding user k because of the maximum value gk,nMeaning that the signal gain of user k is the largest for n on the sub-carriers and thus that the power required by user k to transmit information on n on the sub-carriers is the least. Set up gk,n═ infinity. The same method is adopted to continuously search for G in the matrix Gk,n *Until each user is allocated the required number of sub-carriers.
It can be known from theoretical analysis and computer simulation experiment verification that the subcarrier, bit and power allocation method according to the invention has obvious advantages in terms of saving transmission power and information processing complexity compared with the multi-user greedy water injection method in the prior art, especially under the conditions that the number of information bits of each user is fixed and the number of users is changed, and under the conditions that the number of users in the system is fixed and the number of information bits of each user is changed.

Claims (7)

1. A sub-carrier, bit and power distribution method for an orthogonal frequency division multiple access system comprises the following steps:
distributing the number of the subcarriers based on the power reduction amount caused by adding one subcarrier to each user, thereby determining the number of the subcarriers required by each user;
calculating the average bit number sent by each user on one subcarrier according to the determined subcarrier number of each user, and determining the subcarrier specifically allocated to each user according to the power value required by sending the average bit number;
for each user, bit loading is performed according to a single-user water filling algorithm.
2. The method of claim 1, wherein the subcarrier number allocation step comprises:
calculating a power reduction value caused when each user adds a subcarrier;
determining a maximum of the calculated power reduction values;
and adding 1 to the number of the sub-carriers allocated to the user corresponding to the maximum value.
3. The method of claim 2, wherein in the subcarrier number allocation step, an initial value of the number of subcarriers allocated to each user is 1; and repeating the subcarrier number allocation step until all the subcarriers are allocated.
4. A method according to any of claims 1 to 3, wherein the step of determining the sub-carriers specifically allocated to respective users comprises:
respectively calculating the power required by each subcarrier for sending the average bit number of each user;
determining a minimum value of the calculated powers;
allocating the sub-carrier corresponding to the minimum value to the corresponding user, and setting the minimum value to infinity, wherein the sub-carrier can not be allocated to other users;
the previous two steps are repeated until each user is allocated the determined number of subcarriers.
5. A method according to any of claims 1 to 3, wherein the step of determining the sub-carriers specifically allocated to respective users comprises:
respectively determining the channel gain corresponding to each subcarrier when each subcarrier is allocated to each user;
determining a maximum value of the determined channel gains;
allocating the sub-carrier corresponding to the maximum value to the corresponding user, and setting the maximum value to be infinitesimal, wherein the sub-carrier can not be allocated to other users;
the previous two steps are repeated until each user is allocated the determined number of subcarriers.
6. The method of claim 1, wherein the bit loading step comprises:
calculating the power increment of each subcarrier allocated to a user when one bit is additionally loaded;
determining a minimum value of the calculated power increase amount;
and adding 1 to the bit number of the subcarrier corresponding to the minimum value.
7. The method of claim 6, wherein in the bit loading step, an initial value of the number of bits allocated to each subcarrier is 1; and repeating the bit loading step until all bits are loaded.
CN2006101521675A 2006-09-15 2006-09-15 Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system Active CN1960198B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2006101521675A CN1960198B (en) 2006-09-15 2006-09-15 Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2006101521675A CN1960198B (en) 2006-09-15 2006-09-15 Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system

Publications (2)

Publication Number Publication Date
CN1960198A true CN1960198A (en) 2007-05-09
CN1960198B CN1960198B (en) 2011-10-05

Family

ID=38071711

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2006101521675A Active CN1960198B (en) 2006-09-15 2006-09-15 Analysis method of sub carrier wave, bits, power in use for orthogonal frequency division multiple access system

Country Status (1)

Country Link
CN (1) CN1960198B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102333317A (en) * 2011-10-09 2012-01-25 电子科技大学 Transitional water-filling algorithm
CN101364856B (en) * 2007-08-07 2012-04-25 鼎桥通信技术有限公司 Resource distribution method and apparatus
CN102057626B (en) * 2008-06-30 2014-06-18 熵敏通讯股份有限公司 Dynamic bitloading

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100384190C (en) * 2005-01-07 2008-04-23 北京邮电大学 A bit and power distribution algorithm for self-adaptive modulation of MC-CDMA system

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364856B (en) * 2007-08-07 2012-04-25 鼎桥通信技术有限公司 Resource distribution method and apparatus
CN102057626B (en) * 2008-06-30 2014-06-18 熵敏通讯股份有限公司 Dynamic bitloading
CN102333317A (en) * 2011-10-09 2012-01-25 电子科技大学 Transitional water-filling algorithm
CN102333317B (en) * 2011-10-09 2014-01-08 电子科技大学 Transitional water-filling algorithm

Also Published As

Publication number Publication date
CN1960198B (en) 2011-10-05

Similar Documents

Publication Publication Date Title
JP4907721B2 (en) Wireless communication method and apparatus for assigning training signals and information bits
CN1285189C (en) Method and device for allocating a communication signal to multiple carrier frequencies in a multi carrier communication scheme
KR100754593B1 (en) Apparatus and method for allocating sub-channel and power in a orthogonal frequency division multiplexing access system
RU2315433C1 (en) Device and method for receiving/transmitting pilot-signal through communication uplink in communication system using orthogonal frequency division multi-access circuit
CN1812353A (en) Method for sending channel quality information in a multi-carrier radio communication system, corresponding mobile terminal and base station
CN1684457A (en) Channel state information feedback method for multi-carrier communication system
CN1701530A (en) Transmission apparatus and method for use in mobile communication system based on orthogonal frequency division multiplexing scheme
CN1655543A (en) Apparatus and method for controlling adaptive modulation and coding in an orthogonal frequency division multiplexing communication system
CN1719929A (en) The resource allocation methods that is used for downlink transmission in the code division multiple address communication system
CN1728696A (en) Communication system
CN1610333A (en) Method for subcarrier allocation and for modulation scheme selection in a wireless multicarrier transmission system
CN1909537A (en) Method for increasing capacity of multiple districts crossing frequency division multiple address-time division multiple address system
CN1943151A (en) Channel estimation apparatus and method for ofdm/ofdma receiver
CN1890906A (en) Subcarrier and bit allocation for real time services in multiuser orthogonal frequency division multiplex (ofdm) systems
CN1833388A (en) Radio communication apparatus and subcarrier assignment method
CN101057474A (en) Apparatus and method for processing a digital signal in mobile communication system using orthogonal frequency division multiplexing access
CN1649337A (en) OFDM communication system and method
CN1968492A (en) Method for allocating resouce in a mobile communication system
CN1540882A (en) Wireless communicatoon device of using multiple transceiver antenna system and method thereof
CN1691654A (en) Pilot-based channel estimation method for mc-cdma system using frequency interleaving
CN108847917B (en) Orthogonal frequency division multiplexing transmission method modulated by pilot frequency pattern
EP1839128A1 (en) Exploiting multiuser diversity through phase modulation multiplexing
WO2008095409A1 (en) Method and apparatus for optimizing sub-carriers of soft frequency reuse
CN1773897A (en) Resource distributing method and apparatus of dynamic time-frequency and code sequence
CN1893345A (en) Multi-carrier-wave TDD system channel distribution method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: BEIJING STAR POINT TECHNOLOGY CO., LTD.

Free format text: FORMER OWNER: BEIJING POSTAL AND TELECOMMUNICATIONS UNIV.

Effective date: 20120217

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100876 HAIDIAN, BEIJING TO: 100102 CHAOYANG, BEIJING

TR01 Transfer of patent right

Effective date of registration: 20120217

Address after: 100102 Beijing city two Chaoyang District Lize Road No. 2 A block three layer

Patentee after: BEIJING STARPOINT TECHNOLOGY CO., LTD.

Address before: 100876 Beijing city Haidian District Xitucheng Road No. 10

Patentee before: Beijing University of Posts and Telecommunications