# US 2006/0153309 A1 · Gradient based method and apparatus for OFDM sub-carrier power optimization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0153309 A1
- Document ID: US20060153309A1
- Status: Published application
- Kind: A1
- Application number: 11/035,297
- Filed: 2005-01-12
- Published: 2006-07-13
- Earliest claimed: 2005-01-12
- Assignees: Nokia Corporation
- Inventors: Clive Tang; Victor Stolpman
- Web page: https://patentgrep.com/patent/US20060153309A1

## CPC

- H04L 5/0044: {Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

In one aspect thereof this invention provides a method to increase data throughput in an Orthogonal Frequency Division Multiplex (OFDM) wireless communications system. The method includes modeling data throughput as a function of received Signal to Noise Ratio (SNR) with a sigmoid function to produce a throughput curve characterized as having a lower knee region and an upper knee region; and performing a gradient ascent search along the throughput curve by varying the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region.

## Claims

### Claim 1

A method to increase data throughput in an orthogonal frequency division multiplex (OFDM) wireless communications system, comprising:
modeling data throughput as a function of received Signal to Noise Ratio (SNR) with a sigmoid function to produce a throughput curve characterized as having a lower knee region and an upper knee region; and
performing a gradient ascent search along the throughput curve by varying the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region.

### Claim 2 (depends on 1)

The method of claim 1, where different modulation and coding schemes are used in individual sub-carriers at different times.

### Claim 3 (depends on 1)

The method of claim 1, further comprising improving error rate performance by disabling any sub-carrier whose power is removed.

### Claim 4 (depends on 2)

The method of claim 2, further comprising improving error rate performance by disabling any sub-carrier whose power is removed.

### Claim 5 (depends on 1)

The method of claim 1, further comprising, for sub-carriers between the upper and lower sigmoid curve knee regions, increasing the power of the sub-carriers within a total power constraint so as to be to the right of the sigmoid curve upper knee region.

### Claim 6 (depends on 1)

The method of claim 1, where performing the gradient ascent search comprises:
initializing the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value;
evaluating a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value;
finding a search direction vector gn;
determining a step size αn;
updating the transmitted power vector P(n);
evaluating a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and
if the updated data throughput value is improved relative to the first data throughput value, completing an iteration of the gradient ascent search, incrementing n, and returning to finding the search direction vector to perform another iteration, else if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed, terminating the gradient ascent search.

### Claim 7 (depends on 6)

The method of claim 6, where after terminating the gradient ascent search P(n) is a final power vector that dictates the power in the plurality of sub-carriers, each of the sub-carriers is loaded with a data symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, where the transmitted power vector P(n) is maintained unchanged throughout the transmission of the set of packets, and upon completion of a frame of OFDM symbols, returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next set of packets.

### Claim 8 (depends on 6)

The method of claim 6, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, the method further comprising:
spreading a plurality of data packets across the sub-carriers, where the plurality of packets spread across the sub-carriers form an OFDM symbol;
transmitting the OFDM symbol through a channel;
maintaining the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol,
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next OFDM symbol.

### Claim 9 (depends on 8)

The method of claim 8, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 10 (depends on 6)

The method of claim 6, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, the method further comprising:
selecting a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval;
spreading a first plurality of data packets across the sub-carriers, where the first plurality of packets spread across the sub-carriers form a first OFDM symbol;
transmitting the first OFDM symbol through a channel;
spreading a second plurality of data packets across the sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol;
transmitting the second OFDM symbol through the channel;
continuing to successively spread pluralities of data packets across the sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next time interval.

### Claim 11 (depends on 10)

The method of claim 10, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 12 (depends on 2)

The method of claim 2, where performing the gradient ascent search comprises:
initializing the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value;
evaluating a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value;
finding a search direction vector gn;
determining a step size αn;
updating the transmitted power vector P(n);
updating the received SNR for each sub-carrier using the sub-carrier's power allocation as indicated by the updated transmitted power vector P(n); sub-channel frequency function; and noise power;
comparing the updated received SNR for each sub-carrier to a look-up table created with cross-over points of the sigmoid curves and selecting sigmoid parameters that result in highest throughput for the sub-carrier;
evaluating a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and
if the updated data throughput value is improved relative to the first data throughput value, completing an iteration of the gradient ascent search, incrementing n, and returning to finding the search direction vector to perform another iteration, else if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed, terminating the gradient ascent search.

### Claim 13 (depends on 12)

The method of claim 12, where after terminating the gradient ascent search P(n) is a final power vector that dictates the power in the plurality of sub-carriers, each of the sub-carriers is loaded with a data symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, where the transmitted power vector P(n) is maintained unchanged throughout the transmission of the set of packets, and upon completion of a frame of OFDM symbols, returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next set of packets.

### Claim 14 (depends on 12)

The method of claim 12, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, the method further comprising:
spreading a plurality of data packets across the sub-carriers, where the plurality of packets spread across the sub-carriers form an OFDM symbol;
transmitting the OFDM symbol through a channel;
maintaining the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol,
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next OFDM symbol.

### Claim 15 (depends on 14)

The method of claim 14, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 16 (depends on 12)

The method of claim 12, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, the method further comprising:
selecting a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval;
spreading a first plurality of data packets across the sub-carriers, where the first plurality of packets spread across the sub-carriers form a first OFDM symbol;
transmitting the first OFDM symbol through a channel;
spreading a second plurality of data packets across the sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol;
transmitting the second OFDM symbol through the channel;
continuing to successively spread pluralities of data packets across the sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next time interval.

### Claim 17 (depends on 16)

The method of claim 16, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 18 (depends on 3)

The method of claim 3, where performing the gradient ascent search occurs in stages, where during a first stage the method identifies sub-carriers to be disabled, and where during a second stage the method allocates power to retained sub-carriers at the expense of disabled sub-carriers.

### Claim 19 (depends on 3)

The method as in claim 3, where performing the gradient ascent search comprises:
initiating a first stage of the gradient ascent search by initializing the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value;
evaluating a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value;
finding a search direction vector gn;
determining a step size αn;
updating the transmitted power vector P(n);
evaluating a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and
if the updated data throughput value is improved relative to the first data throughput value, completing an iteration of the gradient ascent search, incrementing n, and returning to finding the search direction vector to perform another iteration, else if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed,
initiating a second stage of the gradient ascent search by evaluating the received SNR of every sub-carrier resultant from the transmitted power vector P(n);
if the received SNR of a particular one of the sub-carriers is less than a predetermined threshold, identifying that sub-carrier as one to be disabled;
re-assigning power from any identified sub-carriers to remaining sub-carriers; and
returning to finding the search direction vector to form the second stage gradient ascent search for the remaining sub-carriers.

### Claim 20 (depends on 19)

The method of claim 19 where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, each of the retained sub-carriers is loaded with a data symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, where the transmitted power vector P(n) is maintained unchanged throughout the transmission of the set of packets, and upon completion of a frame of OFDM symbols, returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next set of packets.

### Claim 21 (depends on 19)

The method of claim 19, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, the method further comprising:
spreading a plurality of data packets across the retained sub-carriers, where the plurality of packets spread across the retained sub-carriers form an OFDM symbol;
transmitting the OFDM symbol through a channel;
maintaining the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol,
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next OFDM symbol.

### Claim 22 (depends on 21)

The method of claim 21, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 23 (depends on 19)

The method of claim 19, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, the method further comprising:
selecting a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval;
spreading a first plurality of data packets across the retained sub-carriers, where the first plurality of packets spread across the sub-carriers form a first OFDM symbol;
transmitting the first OFDM symbol through a channel;
spreading a second plurality of data packets across the retained sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol;
transmitting the second OFDM symbol through the channel;
continuing to successively spread pluralities of data packets across the retained sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next time interval.

### Claim 24 (depends on 23)

The method of claim 23, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 25 (depends on 4)

The method as in claim 4, where performing the gradient ascent search comprises:
initiating a first stage of the gradient ascent search by initializing the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value;
evaluating a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value;
finding a search direction vector gn;
determining a step size αn;
updating the transmitted power vector P(n);
updating the received SNR for each sub-carrier using the sub-carrier's power allocation as indicated by the updated transmitted power vector P(n); sub-channel frequency function; and noise power;
comparing the updated received SNR for each sub-carrier to a look-up table created with cross-over points of the sigmoid curves and selecting sigmoid parameters that result in highest throughput for the sub-carrier;
evaluating a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and
if the updated data throughput value is improved relative to the first data throughput value, completing an iteration of the gradient ascent search, incrementing n, and returning to finding the search direction vector to perform another iteration, else if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed,
initiating a second stage of the gradient ascent search by evaluating the received SNR of every sub-carrier resultant from the transmitted power vector P(n);
if the received SNR of a particular one of the sub-carriers is less than a predetermined threshold established for that sub-carrier, identifying that sub-carrier as one to be disabled;
re-assigning power from any identified sub-carriers to remaining sub-carriers; and
returning to finding the search direction vector to form the second stage gradient ascent search for the remaining sub-carriers.

### Claim 26 (depends on 25)

The method of claim 25 where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, each of the retained sub-carriers is loaded with a data symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, where the transmitted power vector P(n) is maintained unchanged throughout the transmission of the set of packets, and upon completion of a frame of OFDM symbols, returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next set of packets.

### Claim 27 (depends on 25)

The method of claim 25, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, the method further comprising:
spreading a plurality of data packets across the retained sub-carriers, where the plurality of packets spread across the retained sub-carriers form an OFDM symbol;
transmitting the OFDM symbol through a channel;
maintaining the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol,
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next OFDM symbol.

### Claim 28 (depends on 27)

The method of claim 27, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 29 (depends on 25)

The method of claim 25, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, the method further comprising:
selecting a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval;
spreading a first plurality of data packets across the retained sub-carriers, where the first plurality of packets spread across the sub-carriers form a first OFDM symbol;
transmitting the first OFDM symbol through a channel;
spreading a second plurality of data packets across the retained sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol;
transmitting the second OFDM symbol through the channel;
continuing to successively spread pluralities of data packets across the retained sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and
returning to initialize the power of all sub-carriers to be equal and repeating the gradient ascent search for a next time interval.

### Claim 30 (depends on 29)

The method of claim 29, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 31

Apparatus operable to increase data throughput in an orthogonal frequency division multiplex (OFDM) wireless communications system, comprising at least one data processor operating under control of a stored program, and coupled to OFDM transmission circuitry, to model data throughput as a function of received Signal to Noise Ratio (SNR) with a sigmoid function to produce a throughput curve characterized as having a lower knee region and an upper knee region; and to perform a gradient ascent search along the throughput curve by varying the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region.

### Claim 32 (depends on 31)

The apparatus of claim 31, where different modulation and coding schemes are used in individual sub-carriers at different times.

### Claim 33 (depends on 31)

The apparatus of claim 31, where said at least one data processor is further operable to improve error rate performance by disabling any sub-carrier whose power is removed.

### Claim 34 (depends on 32)

The apparatus of claim 32, where said at least one data processor is further operable to improve error rate performance by disabling any sub-carrier whose power is removed.

### Claim 35 (depends on 31)

The apparatus of claim 31, where said at least one data processor is further operable, for sub-carriers between the upper and lower sigmoid curve knee regions, to increase the power of the sub-carriers within a total power constraint so as to be to the right of the sigmoid curve upper knee region.

### Claim 36 (depends on 31)

The apparatus of claim 31, where said at least one data processor is operable while performing the gradient ascent search to initialize the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value; to evaluate a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value; to find a search direction vector gn; to determine a step size αn; to update the transmitted power vector P(n); to evaluate a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and if the updated data throughput value is improved relative to the first data throughput value, to complete an iteration of the gradient ascent search, to increment n, and to return to finding the search direction vector to perform another iteration; else, if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed, to terminate the gradient ascent search.

### Claim 37 (depends on 36)

The apparatus of claim 36, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, where said at least one data processor is further operable to load sub-carriers with a symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, to maintain the transmitted power vector P(n) unchanged throughout the transmission of set of packets, and upon completion of a frame of OFDM symbols, to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next set of packets.

### Claim 38 (depends on 36)

The apparatus of claim 36, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, and where the at least one data processor is further operable to spread a plurality of data packets across the sub-carriers, where the plurality of packets spread across the sub-carriers form an OFDM symbol; to transmit the OFDM symbol through a channel; to maintain the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol, to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next OFDM symbol.

### Claim 39 (depends on 38)

The apparatus of claim 38, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 40 (depends on 36)

The apparatus of claim 36, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the plurality of sub-carriers, and where the at least one data processor is further operable to select a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval; to spread a first plurality of data packets across the sub-carriers, where the first plurality of packets spread across the sub-carriers form a first OFDM symbol; to transmit the first OFDM symbol through a channel; to spread a second plurality of data packets across the sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol; to transmit the second OFDM symbol through the channel; to continue to successively spread pluralities of data packets across the sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next time interval.

### Claim 41 (depends on 40)

The apparatus of claim 40, where the data packets are spread across the sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 42 (depends on 34)

The apparatus of claim 34, where said at least one data processor is operable while performing the gradient ascent search to perform the search in stages, where during a first stage said at least one data processor is operable to identify sub-carriers to be disabled, and where during a second stage said at least one data processor is operable to allocate power to retained sub-carriers at the expense of disabled sub-carriers.

### Claim 43 (depends on 34)

The apparatus of claim 34, where said at least one data processor is operable while performing a first stage of the gradient ascent search to initialize the power of all sub-carriers to be equal, such that all elements of a transmitted power vector P(n) are set to have the same value; to evaluate a resultant total data throughput using a current value of the transmitted power vector P(n) to obtain a first data throughput value; to find a search direction vector gn; to determine a step size αn; to update the transmitted power vector P(n); to evaluate a total data throughput with the updated transmitted power vector P(n) to obtain an updated data throughput value; and if the updated data throughput value is improved relative to the first data throughput value, to complete an iteration of the gradient ascent search, to increment n, and to return to finding the search direction vector to perform another iteration, else if the updated data throughput value is not improved relative to the first data throughput value, or if some predetermined number of interactions have been completed, said at least one data processor is further operable to initiate a second stage of the gradient ascent search by evaluating the received SNR of every sub-carrier resultant from the transmitted power vector P(n) and if the received SNR of a particular one of the sub-carriers is found to be less than a predetermined threshold, to identify that sub-carrier as one to be disabled; to re-assign power from any identified sub-carriers to remaining sub-carriers; and to return to finding the search direction vector to perform the second stage gradient ascent search for the remaining sub-carriers.

### Claim 44 (depends on 43)

The apparatus of claim 43, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, where said at least one data processor is further operable to load retained sub-carriers with a symbol from an associated packet of a set of packets forming an OFDM symbol to be transmitted through a channel, to maintain the transmitted power vector P(n) unchanged throughout the transmission of set of packets, and upon completion of a frame of OFDM symbols, to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next set of packets.

### Claim 45 (depends on 43)

The apparatus of claim 43, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, and where the at least one data processor is further operable to spread a plurality of data packets across the retained sub-carriers, where the plurality of packets spread across the retained sub-carriers form an OFDM symbol; to transmit the OFDM symbol through a channel; to maintain the transmitted power vector P(n) unchanged throughout the transmission of the OFDM symbol; and upon completion of transmission of the OFDM symbol, to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next OFDM symbol.

### Claim 46 (depends on 45)

The apparatus of claim 45, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 47 (depends on 43)

The apparatus of claim 43, where after terminating the gradient ascent search the transmitted power vector P(n) is a final power vector that dictates the power in the retained sub-carriers, and where the at least one data processor is further operable to select a time interval corresponding to the time required to transmit at least two OFDM symbols in succession, where the transmitted power vector P(n) will be maintained unchanged throughout the selected time interval; to spread a first plurality of data packets across the retained sub-carriers, where the plurality of packets spread across the retained sub-carriers form a first OFDM symbol; to transmit the first OFDM symbol through a channel; to spread a second plurality of data packets across the retained sub-carriers, where the second plurality of packets spread across the sub-carriers form a second OFDM symbol; to transmit the second OFDM symbol through the channel; to continue to successively spread pluralities of data packets across the retained sub-carriers and to transmit the resulting OFDM symbols through the channel until the selected time interval is reached; and to return to initialize the power of all sub-carriers to be equal and to repeat the gradient ascent search for a next time interval.

### Claim 48 (depends on 47)

The apparatus of claim 47, where the data packets are spread across the retained sub-carriers in a manner to ensure that the data packets share similar error probabilities.

### Claim 49

A computer readable memory medium storing computer program instructions for increasing data throughput in an orthogonal frequency division multiplex (OFDM) wireless communications system, comprising operations of performing a gradient ascent search along a data throughput curve, where the data throughput curve is modeled using a received Signal to Noise Ratio (SNR) as a sigmoid function to produce the data throughput curve to be characterized as having a lower knee region and an upper knee region, said gradient ascent search operating to vary the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region.

### Claim 50

A computer readable memory medium storing computer program instructions for increasing data throughput in an orthogonal frequency division multiplex (OFDM) wireless communications system, comprising operations of performing a multi-stage gradient ascent search along a data throughput curve, where the data throughput curve is modeled using received Signal to Noise Ratio (SNR) as a sigmoid function to produce the data throughput curve to be characterized as having a lower knee region and an upper knee region, said gradient ascent search operating to vary the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region, where during a first stage of the gradient ascent search an operation identifies sub-carriers to be disabled, and where during a second stage of the gradient ascent search a further operation allocates power only to retained sub-carriers at the expense of disabled sub-carriers.

### Claim 51

Apparatus operable to increase data throughput in an orthogonal frequency division multiplex (OFDM) wireless communications system, comprising data processor means operating under control of a stored program, and coupled to OFDM transmission circuitry, for modeling data throughput as a function of received Signal to Noise Ratio (SNR) with a sigmoid function to produce a throughput curve characterized as having a lower knee region and an upper knee region; and for performing a gradient ascent search along the throughput curve by varying the power of a plurality of sub-carriers so as to remove power from any sub-carrier having a received SNR to the left of the lower knee region, and to re-allocate the removed power to sub-carriers having a received SNR to the right of the lower knee region.
