Section division operating point determination method for multicarrier communication systems

• US 6,400,773 B1
• Filed: 06/04/1999
• Issued: 06/04/2002
• Est. Priority Date: 06/04/1999
• Status: Expired due to Term

• Current Assignee: Board of Trustees of The University of Illinois
• Original Assignee: Board of Trustees of The University of Illinois
• Inventors: Jones, Douglas L., Krongold, Brian Scott, Ramchandran, Kannan
• Primary Examiner(s): Le, Amanda T.
• Application Number:
  US09/326,246
• Time in Patent Office: 1,096 Days
• Field of Search: 375/260, 375/295, 370/480, 370/484
• US Class Current: 375/260
• CPC Class Codes: H04L 5/0044 allocation of payload

Abstract

Optimum bit rates and power levels are determined for subchannels in multicarrier communication systems. A tangent of the rate-power curve has a slope λ. The slope is defined by the quotient difference between high/low power and high/low rate. A particular λ is evaluated to find its corresponding total power followed by an update of λ, in the form of an increase or decrease, to get closer to the optimal solution. Each λ is evaluated to find the optimal operating point for each subchannel on the rate-power curve by summing the power allocated to the subchannels, and comparing the result to the power budget. Look-up tables are stored for individual channels, but similarity between channels permits joint use of look-up tables by multiple channels. The tables are used to determine the rate-power characteristics at each iteration. An optimal solution is found when either a newly chosen power allocation meets the power budget exactly or a newly chosen power budget equals the high or low power of a previous iteration.

Claims

1. A method for allocating transmission performance quantities among discrete multicarrier modulation communication channels, the method comprising steps of:

determining and storing a set of Lagrange multiplier λ

data correlating bit rate to allocated power for a plurality of subchannels;

choosing a starting value of λ

, and high and low values surrounding λ

;

evaluating λ

to determine its performance based upon stored allocated performance quantity data;

updating λ

with a section search that alters one of the high and low values to converge toward λ

;

repeating said steps of updating and evaluating until one of the following conditions is demonstrated by said step of evaluating,

(a) a newly chosen λ

meets a performance quantity budget indicated by said performance quantity data;

(b) a newly chosen λ

equals a previous high or low value for λ

, or

(c) a predetermined number of updates have been conducted; and

allocating a performance quantity based upon the λ

meeting a condition defined in said step of repeating.

2. The method according to claim 1, wherein said step of updating performs a bisection search.

3. The method according to claim 2, wherein said performance quantity comprises a target power budget.

4. The method according to claim 2, wherein said performance quantity comprises a target bit rate.

5. The method according to claim 1, wherein said performance quantity comprises a target power budget.

6. The method according to claim 1, wherein said performance quantity comprises a target bit rate.

7. The method according to claim 1, wherein said step of evaluating comprises evaluating λ

to find the optimal operating point for every communication system subchannel for each rate-power curve point by summing performance quantity allocated to every communication system subchannel and comparing the result to a target performance quantity.

8. A method for allocating power among discrete multicarrier modulation communication channels, the method comprising steps of:

defining a look-up table having parameters defining an optimal operating points on bit rate versus signal-to-noise ratio curves for a plurality of subchannels; and

finding a line for given slope λ

tangent to any one signal to noise ratio curve to allocate power to an associated subchannel for a predetermined power budget by,

(a) selecting predetermined high and low slopes above and below the power budget; and

(b) performing an iterative section search between high and low slopes to determine an optimal power allocation.

9. The method according to claim 8, wherein said substep of performing comprises:

computing a new slope which bisects the predetermined high and low slopes;

comparing to find whether the new slope is above or below the power budget;

then

updating the high slope with the new slope if the new slope exceeds the power budget;

updating the low slope with the new slope if the new slope is less than the power budget; and

repeating said computing, comparing and said updating until the new slope equals either the high slope, the low slope or a power budget, or a predetermined number of iterations have been conducted.

10. A method for allocating bit rate among discrete multicarrier modulation communication channels, the method comprising steps of:

defining a look-up table having parameters defining optimal operating points on bit rate versus signal-to-noise ratio curves for a plurality of subchannels; and

finding a slope tangent to any one signal to noise ratio curve to allocate bit rate to an associated subchannel for a predetermined power by,

(a) selecting predetermined high and low slopes above and below rate-power characteristics for the slope;

(b) evaluating bit rate from the look-up table for the slope; and

(c) performing an iterative section search to converge between high and low slopes to determine an optimal bit rate.

11. The method according to claim 10, wherein said section search is a bisection search.

12. A method for allocating bit rate among discrete multicarrier modulation communication channels, the method comprising steps of:

(a) obtaining initial values of λ

_low and λ

_high,

(b) calculate the following equations;

${\mathrm{\beta <br><br>}}_{\mathrm{low}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{low}}}{{\mathrm{CNR}}_i};<br><br>$${\mathrm{\beta <br><br>}}_{\mathrm{high}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{high}}}{{\mathrm{CNR}}_i};<br><br>$${\stackrel{\_}{P}}_{\mathrm{low}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{low}}^i\right)}{{\mathrm{CNR}}_i},{\stackrel{\_}{P}}_{\mathrm{low}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>{\stackrel{\_}{P}}_{\mathrm{low}}^i$${\stackrel{\_}{P}}_{\mathrm{high}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{high}}^i\right)}{{\mathrm{CNR}}_i},{\stackrel{\_}{P}}_{\mathrm{high}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>{\stackrel{\_}{P}}_{\mathrm{high}}^i$$R_{\mathrm{low}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{low}}^i\right),R_{\mathrm{low}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{low}}^i$$R_{\mathrm{high}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{high}}^i\right),R_{\mathrm{high}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{high}}^i$

(c) verify that R_low,≦

R_target≦

R_high;

if it is, go to (d);

if not, go back to (b) with new estimates of λ

_low and λ

_high;

(d) calculating λ

_new, where ${\mathrm{\lambda <br><br>}}_{\mathrm{new}}=\frac{{\stackrel{\_}{P}}_{\mathrm{high}}-{\stackrel{\_}{P}}_{\mathrm{low}}}{R_{\mathrm{high}}-R_{\mathrm{low}}}$

(e) determining a lookup parameter β

_i for i=1, . . . N from stored data and obtaining rate-power characteristics {overscore (P)}_newⁱ and R_newⁱ from a stored look-up table using the lookup parameter β

_i, where ${\mathrm{\beta <br><br>}}_{\mathrm{new}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{new}}}{{\mathrm{CNR}}_i},R_{\mathrm{new}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{new}}^i\right),{\stackrel{\_}{P}}_{\mathrm{new}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{new}}^i\right)}{{\mathrm{CNR}}_i}$

(f) computing the total rate for λ

_new and comparing it to R_low, R_high, and R_target;

$R_{\mathrm{new}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{new}}^i,{\stackrel{\_}{P}}_{\mathrm{new}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>{\stackrel{\_}{P}}_{\mathrm{new}}^i$

 

if R_new equals R_target, then go to step (g), else, if R_new<

R_target, then set {overscore (P)}_low={overscore (P)}_new and R_low=R_new and go to step (d), else, set {overscore (P)}_high={overscore (P)}_new, and R_high=R_new and go to step (d); and

(g) completing rate allocation by assigning R_newⁱ to the ith subchannel, allocating power and computing the optimal performance margin γ

_m (dB) as $P_i=\frac{P_{\mathrm{budget}}}{{\stackrel{\_}{P}}_{m<br><br>\text{\hspace{1em}<br><br>}<br><br>i<br><br>\text{\hspace{1em}<br><br>}<br><br>n}}<br><br>{\stackrel{\_}{P}}_{\mathrm{new}}^i$${\mathrm{\gamma <br><br>}}_m<br><br>\mathrm{dB}=10<br><br>\text{\hspace{1em}<br><br>}<br><br>{\log }_{10}<br><br>\left(\frac{P_{\mathrm{budget}}}{{\stackrel{\_}{P}}_{m<br><br>\text{\hspace{1em}<br><br>}<br><br>i<br><br>\text{\hspace{1em}<br><br>}<br><br>n}}\right).$

13. The method according to claim 12, wherein said initial values are chosen based upon prior operating knowledge.

14. The method according to claim 12, wherein said initial low and high values are respectively set to zero and infinity.

15. The method according to claim 12, wherein said initial values are based upon estimates related to general communication system knowledge.

16. A method for allocating power among discrete multicarrier modulation communication channels, the method comprising steps of:

(a) obtaining initial values of λ

_low and λ

_high;

(b) calculate the following equations;

${\mathrm{\beta <br><br>}}_{\mathrm{low}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{low}}}{{\mathrm{CNR}}_i};<br><br>$${\mathrm{\beta <br><br>}}_{\mathrm{high}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{high}}}{{\mathrm{CNR}}_i};<br><br>$$P_{\mathrm{low}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{low}}^i\right)}{{\mathrm{CNR}}_i},P_{\mathrm{low}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>P_{\mathrm{low}}^i;<br><br>$$P_{\mathrm{high}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{high}}^i\right)}{{\mathrm{CNR}}_i},P_{\mathrm{high}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>P_{\mathrm{high}}^i;<br><br>$$R_{\mathrm{low}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{low}}^i\right),R_{\mathrm{low}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{low}}^i$$R_{\mathrm{high}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{high}}^i\right),R_{\mathrm{high}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{high}}^i$

(c) verify that P_low≦

P_budget≦

P_high;

if it is, go to (d);

if not, go back to (b) with new estimates of λ

_low and λ

_high;

(d) calculating a λ

_new, where ${\mathrm{\lambda <br><br>}}_{\mathrm{new}}=\frac{P_{\mathrm{high}}-P_{\mathrm{low}}}{R_{\mathrm{high}}-R_{\mathrm{low}}}$

(e) determining a lookup parameter β

_i for i=1, . . . N from stored data and obtaining rate-power characteristics P_newⁱ and R_newⁱ from a stored look-up table using the lookup parameter β

_i, where ${\mathrm{\beta <br><br>}}_{\mathrm{new}}^i=\frac{{\mathrm{\lambda <br><br>}}_{\mathrm{new}}}{{\mathrm{CNR}}_i},R_{\mathrm{new}}^i=R<br><br>\left({\mathrm{\beta <br><br>}}_{\mathrm{new}}^i\right),P_{\mathrm{new}}^i=\frac{\mathrm{SNR}<br><br>\left({\mathrm{\beta <br><br>}}_i\right)}{{\mathrm{CNR}}_i}$

(f) computing the total power allocation for λ

_new and comparing it to P_low, P_high, or P_target, as follows;

$P_{\mathrm{new}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>P_{\mathrm{new}}^i,R_{\mathrm{new}}=\underset{i=1}{\overset{N}{\sum <br><br>}}<br><br>\text{\hspace{1em}<br><br>}<br><br>R_{\mathrm{new}}^i$

 

if P_new equals either P_low, P_high, or P_budget then go to step (g), else, if P_new<

P_budget, then set P_low=P_new and R_low=R_new, store P_lowⁱ and R_lowⁱ and go to step (d), else, set P_high=P_new, and R_high=R_new and go to step (d); and

(g) assigning P_newⁱ and R_newⁱ to the ith subchannel if P_new=P_budget, otherwise assigning P_lowⁱ and R_lowⁱ to the ith subchannel.

17. The method according to claim 16, wherein said initial values are chosen based upon prior operating knowledge.

18. The method according to claim 16, wherein said initial low and high values are respectively set to zero and infinity.

19. The method according to claim 16, wherein said initial values are based upon estimates related to general communication system knowledge.