Publication number | US20030227889 A1 |

Publication type | Application |

Application number | US 10/400,882 |

Publication date | 11 Dec 2003 |

Filing date | 28 Mar 2003 |

Priority date | 7 Jun 2002 |

Also published as | US9125061, US20040125772, WO2003105513A2, WO2003105513A3 |

Publication number | 10400882, 400882, US 2003/0227889 A1, US 2003/227889 A1, US 20030227889 A1, US 20030227889A1, US 2003227889 A1, US 2003227889A1, US-A1-20030227889, US-A1-2003227889, US2003/0227889A1, US2003/227889A1, US20030227889 A1, US20030227889A1, US2003227889 A1, US2003227889A1 |

Inventors | Jianming Wu, Wen Tong, Daniel Boudreau |

Original Assignee | Jianming Wu, Wen Tong, Daniel Boudreau |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (33), Referenced by (66), Classifications (13), Legal Events (3) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 20030227889 A1

Abstract

A method of allocating bandwidth is provided which involves for each sector of a plurality of sectors in a cell, using a respective subset of a total bandwidth; wherein for any two adjacent sectors, the respective subsets only partially overlap. A scheduling method is provided which involves for each sector, scheduling users for transmission on the respective subset of the total bandwidth by: for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity; generating and transmitting a signal in which each of the at least two users has the respective fraction of capacity.

Claims(58)

for each sector of a plurality of sectors in a cell, using a respective subset of a total bandwidth;

wherein for any two adjacent sectors, the respective subsets only partially overlap.

for each cell, sub-dividing the total frequency bandwidth into a plurality of fixed sub-bands;

for each sector, allocating the respective subset to be at least two of the fixed sub-bands.

in each sector, transmitting a respective user transmission on each of the sub-bands.

for pairs of sectors that face each other of different cells, allocating respective subsets which only partially overlap.

for each sector, scheduling users for transmission on the respective subset of the total bandwidth by:

for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity;

generating and transmitting a signal in which each of the at least two users has the respective fraction of capacity.

proportional fairness, proportional fairness for FTP traffic, adaptive scheduler, adaptive scheduler for video service.

for each pair of users indicated by k_{0 }and k_{1 }associating respective F_{i0 }and F_{i1}, and respective bandwidths of

determining a transmission rate for each selected user in each slot to be R_{k} _{ 0 }and R_{k} _{ 1 }, when using the available frequency bandwidth W, and with sub-bandwidths of

determining transmission rates

according to

performing optimization which maximizes sector throughput, applied to two users per sector or generalized to N users per sector, where N>=3.

where T_{k }is an average user throughput for user k over a long period of time and α and β are indices used to control the fairness for scheduling, applied for two users, or generalized to schedule N users in the transmission interval, where N>=3.

in each sector, transmitting an OFDM signal using the respective subset of the total OFDM bandwidth.

generating the OFDM signal from content of at least two users.

mapping symbols from each user into a time domain representation;

converting the time domain representation into the OFDM signal.

for each sector, performing an optimization to identify the at least two users, and to determine for each user a respective number of symbols to be mapped into said time domain representation.

for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity;

generating and transmitting a signal in which each of the at least two users has the respective fraction of capacity.

proportional fairness, proportional fairness for FTP traffic, adaptive scheduler, adaptive scheduler for video service.

for each pair of users indicated by k_{0 }and k_{1 }with respective sub-bandwidths of W_{k} _{ 0 }and W_{k} _{ 1 }, determining a transmission rate for each user in each slot to be R_{k} _{ 0 }and R_{k} _{ 1 }, when using the available frequency bandwidth W, and with sub-bandwidths of W_{k} _{ 0 }and W_{k} _{ 1 }, the transmission rates R_{k} _{ 0 }and R_{k} _{ 0 }are given by

performing optimization which maximizes sector throughput.

receiving a channel quality indication from each user being considered for scheduling;

for each permutation of two users, calculating transmission rates according to adaptive modulation and coding as a function of the channel quality indications and using the calculated transmission rates in the optimization

where T_{k }is an average user throughput for user k over a long period of time and α and β are the indices used to control the fairness for scheduling.

for each sector of a plurality of sectors in a cell, using a respective subset of a total bandwidth;

wherein for any two adjacent sectors, the respective subsets only partially overlap.

respectively and at transmission rate for each R_{k} _{ 0 }and R_{k} _{ 1 }respectively when using all N available codes, whereby the transmission rates

with orthogonal codes

can be obtained

where T_{k }is an average user throughput for user k, and α and β are the indices used to control the fairness for scheduling.

a respective transmitter and antenna for each sector of a plurality of sectors in a cell, each transmitter using a respective subset of a total bandwidth, wherein for any two adjacent sectors, the respective subsets only partially overlap.

for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity.

a symbol selector for selecting symbols for each of the at least two users;

an interleaver for mapping the bits from the at least two users to a time domain representation;

an IFFT function for converting the time domain representation into the OFDM signal.

an optimizer adapted to scheduling users for transmission on a respective available bandwidth for each antenna by for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity;

signal generation circuitry for generating a signal in which each of the at least two users have the respective fraction of capacity;

a transmitter for transmitting the signal.

a plurality of Walsh code spreaders adapted to perform Walsh code spreading with a respective Walsh code of a set of Walsh codes, wherein the CDMA signal is generated from content of at least two users by modulating content of each user with a respective subset of the set of Walsh codes.

Description

- [0001]This application claims the benefit of U.S. Provisional Application No. 60/386,477 filed Jun. 7, 2002.
- [0002]The invention relates to systems and methods for channel allocation for forward-link multi-user systems.
- [0003]Orthogonal frequency division multiplexing (OFDM) [1] is a special case of multi-carrier transmission, where a single data-stream is transmitted over a number of lower rate sub-carriers. One of the main reasons for using OFDM in recent wireless communication developments is to increase the robustness against frequency selective fading or narrowband interference. On the downlink, OFDM techniques can provide very high-speed downlink packet access by means of a high-speed downlink shared channel based on adaptive modulation and coding (AMC) [2]. However, OFDM requires high signal-to-noise ratio (SNR) in order to provide high-speed packet data transmission.
- [0004]High-speed downlink packet access (HSDPA) [2] and 1xEV-DV systems [3] based on CDMA techniques have been used to transmit data information. With these schemes, the serving base-station (BS) allocates an active channel (N PN Walsh codes) to a particular served mobile. Such systems, however, do not consider the optimum allocation of Walsh codes for multiple users in each slot.
- [0005]In the next deployment phase of current cellular systems, such as HSDPA and 1xEV-DV, the frequency assignment is based on the reuse-1, where each sector in each cell utilizes the entire frequency band. This may result in low SNRs for many users, due to the interference from other cells. An OFDM system requires high SNRs to support high-speed data rate transmission.
- [0006]The frequency reuse-1 scheme is illustrated diagramatically in FIG. 1 where a cell generally indicated by
**10**has three sectors**12**,**14**and**16**. All three of these sectors are operating on the same frequency band “F”. - [0007]According to one broad aspect, the invention provides a method of allocating bandwidth comprising: for each sector of a plurality of sectors in a cell, using a respective subset of a total bandwidth; wherein for any two adjacent sectors, the respective subsets only partially overlap.
- [0008]In some embodiments, the method comprises: for each cell, sub-dividing the total frequency bandwidth into a plurality of fixed sub-bands; for each sector, allocating the respective subset to be at least two of the fixed sub-bands.
- [0009]In some embodiments, the fixed sub-bands are equal in size.
- [0010]In some embodiments, the method further comprises: in each sector, transmitting a respective user transmission on each of the sub-bands.
- [0011]In some embodiments, the method further comprises: for pairs of sectors that face each other of different cells, allocating respective subsets which only partially overlap.
- [0012]In some embodiments, two thirds of the total frequency bandwidth is allocated to each of the three sectors such that each sector shares one third of the total frequency bandwidth with each adjacent sector.
- [0013]In some embodiments, the method further comprises: for each sector, scheduling users for transmission on the respective subset of the total bandwidth by: for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity; generating and transmitting a signal in which each of the at least two users has the respective fraction of capacity.
- [0014]In some embodiments, the optimization is performed every transmission interval, and the optimization maximizes sector throughput.
- [0015]In some embodiments, the scheduler design is selected from a group comprising: proportional fairness, proportional fairness for FTP traffic, adaptive scheduler, adaptive scheduler for video service.
- [0016]In some embodiments, the optimization performs a maximization of proportional factors relative to user transmission rate and average user throughput, while keeping a total frequency bandwidth constant.
- [0017]In some embodiments, the method further comprises in performing the optimization, using an unconstrained optimization obtained by using a Lagrangian of a constrained optimization.
- [0018]In some embodiments, the optimization comprises: for each pair of users indicated by k
_{0 }and k_{1 }associating respective F_{i0 }and F_{i1}, and respective bandwidths of${W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\ue89e\text{\hspace{1em}}\ue89e\mathrm{and}\ue89e\text{\hspace{1em}}\ue89e{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)};\ue89e\text{\hspace{1em}}$ - [0019]determining a transmission rate for each selected user in each slot to be R
_{k}_{ 0 }and R_{k}_{ 1 }, when using the available frequency bandwidth W, and with sub-bandwidths of${W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\ue89e\text{\hspace{1em}}\ue89e\mathrm{and}\ue89e\text{\hspace{1em}}\ue89e{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)},$ - [0020]
- [0021]
- [0022]and performing optimization which maximizes sector throughput, applied to two users per sector or generalized to N users per sector, where N>=3.
- [0023]In some embodiments, the optimization is formulated as follows:
$\underset{{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)},{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)},{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)$ $\mathrm{Subject}\ue89e\text{\hspace{1em}}\ue89e\mathrm{to}:\text{\hspace{1em}}\ue89e{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}+{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}=W,{k}_{0}\ne {k}_{1}$ - [0024]where T
_{k }is an average user throughput for user k over a long period of time and α and β are indices used to control the fairness for scheduling, applied for two users, or generalized to schedule N users in the transmission interval, where N>=3. - [0025]In some embodiments, the method further comprises using a Lagrangian of the optimization to obtain the following unconstrained optimization formula:
$\begin{array}{c}\begin{array}{c}\begin{array}{c}\underset{{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)\\ \mathrm{where}\ue89e\text{\hspace{1em}}\ue89e{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}=\frac{\Gamma \ue89e\text{\hspace{1em}}\ue89eW}{1+\Gamma},\end{array}\\ {W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}=\frac{\text{\hspace{1em}}\ue89eW}{1+\Gamma},\end{array}\\ \Gamma ={\left[\frac{{\left({T}_{{k}_{0}}\right)}^{\beta}\xb7{\left({R}_{{k}_{1}}\right)}^{\alpha}}{{\left({T}_{{k}_{1}}\right)}^{\beta}\xb7{\left({R}_{{k}_{0}}\right)}^{\alpha}}\right]}^{\frac{1}{\alpha -1}},\\ {k}_{0}\ne {k}_{1}.\end{array}$ - [0026]In some embodiments, the method further comprises: in each sector, transmitting an OFDM signal using the respective subset of the total OFDM bandwidth.
- [0027]In some embodiments, in each sector, transmitting an OFDM signal using the respective subset of the total OFDM bandwidth comprises: generating the OFDM signal from content of at least two users.
- [0028]In some embodiments, in each sector generating the OFDM signal from content of at least two users comprises: mapping symbols from each user into a time domain representation; converting the time domain representation into the OFDM signal.
- [0029]In some embodiments, mapping symbols from each user into a time domain representation comprises interleaving.
- [0030]In some embodiments, the method further comprises: for each sector, performing an optimization to identify the at least two users, and to determine for each user a respective number of symbols to be mapped into said time domain representation.
- [0031]According to another broad aspect, the invention provides a method of scheduling users for transmission on an available bandwidth comprising: for a given transmitter, allocating a respective fraction of capacity associated with the available bandwidth to each of at least two users selected from a plurality of users by performing an optimization for a selected scheduler design, the optimization selecting the at least two users and the optimization determining for each user the respective fraction of capacity; generating and transmitting a signal in which each of the at least two users has the respective fraction of capacity.
- [0032]In some embodiments, the optimization is performed every transmission interval, and the optimization maximizes sector throughput.
- [0033]In some embodiments, the scheduler design is selected from a group comprising: proportional fairness, proportional fairness for FTP traffic, adaptive scheduler, adaptive scheduler for video service.
- [0034]In some embodiments, the optimization performs a maximization of proportional factors relative to user transmission rate and average user throughput, while keeping a total frequency bandwidth constant.
- [0035]In some embodiments, the method further comprises in performing the optimization, using an unconstrained optimization obtained by using a Lagrangian of a constrained optimization.
- [0036]In some embodiments, the signal is an OFDM signal, the method further comprising generating the OFDM signal from content of at least two users by mapping with interleaving symbols from each user into a time domain representation and converting the time domain representation into the OFDM signal.
- [0037]In some embodiments, for each sector, the optimization determines for each of the selected users a respective number of symbols to be mapped into the time domain representation, the respective number of symbols comprising said respective fraction of capacity.
- [0038]In some embodiments, the optimization performs a maximization of proportional factors relative to user transmission rate and average user throughput, while keeping a total frequency bandwidth constant.
- [0039]In some embodiments, the optimization comprises: for each pair of users indicated by k
_{0 }and k_{1 }with respective sub-bandwidths of W_{k}_{ 0 }and W_{k}_{ 1 }, determining a transmission rate for each user in each slot to be R_{k}_{ 0 }and R_{k}_{ 1 }, when using the available frequency bandwidth W, and with sub-bandwidths of W_{k}_{ 0 }and W_{k}_{ 1 }, according to$\begin{array}{c}{R}_{{k}_{0}}={R}_{{k}_{0}}\xb7\frac{{W}_{{k}_{0}}}{W}\\ {R}_{{k}_{1}}={R}_{{k}_{1}}\xb7\frac{{W}_{{k}_{1}}}{W}\end{array}$ - [0040]and performing optimization which maximizes sector throughput.
- [0041]In some embodiments, the method is generalized to schedule N users per sector, where N>=3.
- [0042]In some embodiments, the method further comprises: receiving a channel quality indication from each user being considered for scheduling; for each permutation of two users, calculating transmission rates according to adaptive modulation and coding as a function of the channel quality indications and using the calculated transmission rates in the optimization.
- [0043]In some embodiments, the channel quality indications comprise SNR (signal-to-noise ratio) values.
- [0044]In some embodiments, the optimization is formulated as follows:
$\underset{{W}_{{k}_{0}},{W}_{{k}_{1}},{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{{k}_{0}}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{{k}_{1}}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)$ $\mathrm{Subject}\ue89e\text{\hspace{1em}}\ue89e\mathrm{to}:\text{\hspace{1em}}\ue89e{W}_{{k}_{0}}+{W}_{{k}_{1}}=W,{k}_{0}\ne {k}_{1}$ - [0045]where T
_{k }is an average user throughput for user k over a long period of time and α and β are the indices used to control the fairness for scheduling. - [0046]In some embodiments, the method is generalized to schedule N users in the transmission interval, where N>=3.
- [0047]In some embodiments, the method further comprises using a Lagrangian of the above optimization to obtain the following unconstrained optimization formula:
$\begin{array}{c}\begin{array}{c}\begin{array}{c}\underset{{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{{k}_{0}}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{{k}_{1}}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)\\ \mathrm{where}\ue89e\text{\hspace{1em}}\ue89e{W}_{{k}_{0}}=\frac{\Gamma \ue89e\text{\hspace{1em}}\ue89eW}{1+\Gamma},\end{array}\\ {W}_{{k}_{1}}=\frac{\text{\hspace{1em}}\ue89eW}{1+\Gamma},\end{array}\\ \Gamma ={\left[\frac{{\left({T}_{{k}_{0}}\right)}^{\beta}\xb7{\left({R}_{{k}_{1}}\right)}^{\alpha}}{{\left({T}_{{k}_{1}}\right)}^{\beta}\xb7{\left({R}_{{k}_{0}}\right)}^{\alpha}}\right]}^{\frac{1}{\alpha -1}},\\ {k}_{0}\ne {k}_{1}.\end{array}$ - [0048]In some embodiments, the method is generalized to schedule N users in the transmission interval, where N>=3.
- [0049]In some embodiments, the method further comprises allocating bandwidth by: for each sector of a plurality of sectors in a cell, using a respective subset of a total bandwidth; wherein for any two adjacent sectors, the respective subsets only partially overlap.
- [0050]In some embodiments, said signal is a CDMA signal, the method further comprising generating the CDMA signal from content of at least two users by modulating content of each user to a respective subset of a set of orthogonal codes.
- [0051]In some embodiments, for each sector, the optimization determines for each of the at least two users a respective number of orthogonal codes in the respective subset, the respective number of orthogonal codes comprising said respective fraction of capacity.
- [0052]In some embodiments, the optimization performs a maximization of proportional factors relative to user transmission rate and average user throughput, while keeping the total frequency bandwidth constant.
- [0053]
- [0054]
- [0055]
- [0056]
- [0057]In some embodiments, the method is generalized to schedule M users each scheduling period.
- [0058]In some embodiments, proportional fairness as a user scheduler is employed, and the optimization maximizes a proportional factor relative to user transmission rate and average user throughput, while keeping the total number of orthogonal codes constant.
- [0059]In some embodiments, the optimization is be formulated as follows:
$\underset{{N}_{{k}_{0}}^{\left(L\right)},{N}_{{k}_{1}}^{\left(L\right)},{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{N}_{{k}_{0}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{N}_{{k}_{1}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)$ $\mathrm{subject}\ue89e\text{\hspace{1em}}\ue89e\mathrm{to}\ue89e\text{:}\ue89e\text{\hspace{1em}}\ue89e{N}_{{k}_{0}}^{\left(L\right)}+{N}_{{k}_{1}}^{\left(L\right)}=N,{k}_{0}\ne {k}_{1}$ - [0060]where T
_{k }is an average user throughput for user k, and α and β are the indices used to control the fairness for scheduling. - [0061]In some embodiments, the method further comprises using a Lagrangian of the optimization to obtain the following unconstrained optimization formula:
$\underset{{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{N}_{{k}_{0}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{N}_{{k}_{1}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)$ $\mathrm{where}$ ${N}_{{k}_{0}}^{\left(L\right)}=\frac{\Phi \ue89e\text{\hspace{1em}}\ue89eN}{1+\Phi},\text{}\ue89e{N}_{{k}_{1}}^{\left(L\right)}=\frac{\text{\hspace{1em}}\ue89eN}{1+\Phi},\text{}\ue89e\Phi ={\left[\frac{{\left({T}_{{k}_{0}}\right)}^{\beta}\xb7{\left({R}_{{k}_{1}}\right)}^{\alpha}}{{\left({T}_{{k}_{1}}\right)}^{\beta}\xb7{\left({R}_{{k}_{0}}\right)}^{\alpha}}\right]}^{\frac{1}{\alpha -1}},\text{}\ue89e{k}_{0}\ne {k}_{1}.$ - [0062]In some embodiments, the orthogonal codes are Walsh codes.
- [0063]In other broad aspects of the invention, an apparatus is provided which implements any one of the above summarized methods. In some implementations the apparatus is implemented as part of a base station, antenna subsystem, Node-B, or multi-sector transmitter to name a few examples.
- [0064]Preferred embodiments of the invention will now be described with reference to the attached drawings in which:
- [0065][0065]FIG. 1 is an example of a cell showing conventional frequency reuse-1;
- [0066][0066]FIG. 2A is a cell showing frequency reuse-3 in accordance with an embodiment of the invention;
- [0067][0067]FIG. 2B is a block diagram of a system implementing the cell of FIG. 2A;
- [0068][0068]FIG. 2C is a flowchart of a method of scheduling which can be employed by the base station of FIG. 2B;
- [0069][0069]FIG. 3 shows how multiple cells in accordance with FIG. 2 can be combined to provide a coverage strategy;
- [0070][0070]FIG. 4 shows a cell in which frequency reuse-3 is employed, but unequal bandwidths are allocated to different users in a given sector;
- [0071][0071]FIG. 5A illustrates an example of unequal bandwidth assigned to two users in a sector;
- [0072][0072]FIG. 5B is a block diagram of a system implementing the assignment of bandwidth in accordance with FIG. 5A;
- [0073][0073]FIG. 6A is an example of optimum frequency allocation for OFDM systems, in accordance with an embodiment of the invention;
- [0074][0074]FIG. 6B is a block diagram of a wireless transmitter implementing the optimum frequency allocation for OFDM systems in accordance with FIG. 6A;
- [0075][0075]FIG. 6C is a block diagram showing further details of the OFDM transmitter of FIG. 6B and the bit selector of
**6**B; - [0076][0076]FIG. 7A is an example of Walsh code allocation for a CDMA system in accordance with an embodiment of the invention;
- [0077][0077]FIG. 7B is block diagram of a system implementing the Walsh code allocation scheme for a CDMA system in accordance with FIG. 7A; and
- [0078][0078]FIGS. 8 through 11 provide simulation results.
- [0079]Frequency Reuse
- [0080]An embodiment of the invention provides a frequency reuse-3 technique, to limit the interference and to increase the SNR. In a given cell, it is assumed that the bandwidth available is “F”, and this has been divided into three sub-bands F1,F2,F3 each of which occupy a third of the available bandwidth F. However, each sector is only allowed to use two of the sub-bands, and for each pair of adjacent sectors (within the same cell or between cells) there will always be at least one sub-band assigned to each sector which is not common between the pair.
- [0081]An example of frequency reuse-3 is shown in FIG. 2A. Here, a cell generally indicated by
**20**has three sectors**22**,**24**,**26**. Sector**22**is operating with frequencies F2 and F3. Sector**24**operates with frequencies F1 and F3. Sector**26**operates with frequencies F1 and F2. It can be seen that with this particular frequency assignment, adjacent sectors each have one(more generally at least one) frequency or sub-band in common and one (more generally at least one) frequency or sub-band which is not in common. Other numbers of sectors and/or sub-bands per cell may be employed. - [0082][0082]FIG. 2B is a very basic block diagram of a transmitter, such as a base station, adapted to implement the frequency reuse-3 plan discussed above. In this example, there are three sector transmitters, namely sector one transmitter
**200**, sector two transmitter**202**and sector three transmitter**204**. Each transmitter is connected to respective sector antenna**206**,**208**,**210**. Sector one transmitter**200**operates using frequencies F1,F3. Sector two transmitter**202**operates with frequencies F1,F2. Sector three transmitter**204**operates with frequencies F2,F3. User scheduling function**221**is shown. This is responsible for performing the above discussed optimization process to determine which users are to be scheduled and on which frequency for each sector. It is to be understood that different numbers of sectors and different numbers of frequency sub-bands could be employed. - [0083]An example deployment of a number of cells with frequency assignments as shown in FIG. 2A is shown in FIG. 3. Here, each cell has sectors with sub-bands assigned in accordance with the above-described example. Furthermore, the cells are arranged such that the sectors of adjacent cells also include at least one sub-band assigned to the sectors which is not common between the pair. For example, cells
**40**and**42**have sectors**44**and**46**which are adjacent. These sectors share sub-band F2, but sector**44**also includes sub-band F1 which is not in common with sub-band F3 of sector**46**. - [0084]In some embodiments, each sub-band is assigned to a given user's transmission during each scheduling period. Preferably, active users are assigned based on the maximum received average CIR (Geometry) with consideration given to the—best cell, best sector, and best frequency sub-band. For example, assume there are N users in each sector of FIG. 3 (in which there are 57 sectors), resulting in N*57 users in the entire system. In some embodiments, the users to be scheduled are selected based on not only the geometry from 57-sectors but also from the different frequency bands. This achieves both space and frequency diversities. Preferably, the selection is implemented very slowly and is referred to below as slow hand-off.
- [0085][0085]FIG. 2C is a very simple flowchart for an example scheduling method. In this example, at step
**2**C-**1**the geometry is determined for all users in the sector and for each sub-band allocated to the sector. Next, at step**2**C-**2**, for each sector and sub-band, the user with the best geometry is selected such that no user is scheduled twice. While the figure assumes that the user geometry is employed for scheduling, it is to be understood that other performance parameters could alternatively be employed. - [0086]In another embodiment of the invention, a bandwidth is defined for each sector which overlaps similar to that of the embodiment of FIG. 2A. Thus, one sector has a bandwidth F1+F3, another sector has a bandwidth F1+F2, and another sector has a bandwidth F2+F3. However, in this embodiment individual users are not assigned equal amounts of bandwidth. Rather, subsets, potentially unequal, of the assigned bandwidth in a given sector are assigned to users using an optimization process. The manner by which this type of cell layout is used is illustrated in FIG. 4. In FIG. 4, the 2/3 F assigned to each sector are different, and may involve the above described F1,F2,F3 allocation for example.
- [0087]With frequency reuse-3, two active users in each sector are scheduled slot by slot, to transmit the data signal, and each user occupies the frequency bandwidth F
_{ik}, where i and k indicate the sector number and the active user number, respectively, and i=0,1,2 and k=0,1. The frequency bandwidth assigned to each user is controllable. For example this might depend on the reported SNR. The control would be subject to the constraint that$\begin{array}{cc}\frac{2}{3}\ue89eF={F}_{\mathrm{i0}}+{F}_{\mathrm{i1}},\text{\hspace{1em}}\ue89ei=\text{0,1,2}& \text{Equation1}\end{array}$ - [0088][0088]FIG. 4 shows a cell
**50**with three sectors**52**,**54**and**56**. Two users are assigned to sector**52**with frequencies F_{10 }and F_{11 }respectively. Similarly, two users are assigned to sector**54**with sub-bands F_{00 }and F_{01 }respectively. Finally, for sector**56**two users are assigned with sub-bands F_{20 }and F_{21 }respectively. While the actual values for each F_{ik }can change from slot to slot, the sum of the assigned bandwidth in a given sector occupies a constant bandwidth. Furthermore, the bandwidth will share a portion of the bandwidth with adjacent sectors, but will also include a portion which is not in common. - [0089]The above-described embodiments have assumed that the entire frequency band F has been divided into three sub-bands of which two are assigned to each sector. This allows the scheduling of two active users per sector per slot. This can be extended to accommodate more users per slot if the entire frequency band F is divided into more sub-frequency bands. For example, if k=0,1,2, . . . , K−1, the number of active users could be K.
- [0090]Active User Determination Based on Slow Handoff
- [0091]In HSDPA and 1xEV-DV system, each mobile has to determine its serving BS based on the received long-term average pilot power corresponding to path loss and shadowing. That is, the mobile picks up a BS, which provides a strongest received power among all sectors. However, with respect to the active user determination with frequency reuse-3, as shown in FIG. 1, the additional frequency selection should be taken into account. That is, the mobile has to determine not only the best BS among all sectors, but also the best frequency allocation. This provides frequency diversity between the carriers due to the different long-term average interference in different frequency bands.
- [0092]Optimum Frequency Allocation Scheme
- [0093]Another embodiment of the invention provides a method of selecting users to be scheduled during a given slot and selecting the transmission bandwidth to be assigned for each user during the slot.
- [0094]For the purpose of description, the embodiment will be described with respect to one sector within which two active users are to be scheduled. The optimum frequency allocation in other sectors can be performed using the same procedure. Also, the number of active users can be extended to more, if the entire frequency band F is divided into a larger number of frequency sub-bands.
- [0095]It is assumed that pairs of users in the serving sector are indicated by k
_{0 }and k_{1 }are to be individually selected to transmit the data in frequency band F_{i0 }and F_{i1}, with respective bandwidths of${W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\ue89e\text{\hspace{1em}}\ue89e\mathrm{and}\ue89e\text{\hspace{1em}}\ue89e\text{\hspace{1em}}\ue89e{W}_{{k}_{0}}^{\left({F}_{\mathrm{i1}}\right)}.$ - [0096]It is further assumed that the transmission rate for each selected user in each slot is R
_{k}_{ 0 }and R_{k}_{ 1 }, when using the entire frequency bandwidth W. - [0097]This is illustrated in FIG. 5A where a total frequency bandwidth, W is indicated at
**70**and this is divided into two bandwidths**72**,**74**which are assigned to user k_{0 }and k_{1 }respectively. - [0098]
- [0099]
- [0100]are given by
$\begin{array}{cc}{R}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}={R}_{{k}_{0}}\xb7\frac{{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}}{W}& \text{Equation2}\\ {R}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}={R}_{{k}_{1}}\xb7\frac{{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}}{W}& \text{Equation3}\end{array}$ - [0101]For proportional fairness user scheduling, the following optimization can be made. The optimization performs the maximization of proportional factors relative to user transmission rate and average user throughput, while keeping the total frequency bandwidth constant. This optimization can be formulated as follows:
$\begin{array}{cc}\underset{{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)},{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)},{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{k}^{\left({F}_{\mathrm{i0}}\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{k}^{\left({F}_{\mathrm{i1}}\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)& \text{Equation4}\\ \text{subjectto:}\ue89e\text{\hspace{1em}}\ue89e\begin{array}{c}{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)},{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}=W,\\ {k}_{0}\ne {k}_{1}\end{array}& \text{Equation5}\end{array}$ - [0102]where T
_{k }is the average user throughput over a long period of time (for example, in 1xEV-DV, it is over 1.5 seconds), and α and β are the indices used to control the fairness for scheduling. Note that the ratio of R_{k}^{α}/T_{k}^{β}is used to determine an active user based on the conventional proportional fairness scheduling. - [0103]By using the Lagrangian of the above constrained optimization [4], the following unconstrained optimization formula is obtained:
$\begin{array}{cc}\underset{{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)\ue89e\text{}\ue89e\mathrm{where}& \text{Equation6}\\ {W}_{{k}_{0}}^{\left({F}_{\mathrm{i0}}\right)}=\frac{\Gamma \ue89e\text{\hspace{1em}}\ue89eW}{1+\Gamma},& \text{Equation7}\\ {W}_{{k}_{1}}^{\left({F}_{\mathrm{i1}}\right)}=\frac{\text{\hspace{1em}}\ue89eW}{1+\Gamma},& \text{Equation8}\\ \Gamma ={\left[\frac{{\left({T}_{{k}_{0}}\right)}^{\beta}\xb7{\left({R}_{{k}_{1}}\right)}^{\alpha}}{{\left({T}_{{k}_{1}}\right)}^{\beta}\xb7{\left({R}_{{k}_{0}}\right)}^{\alpha}}\right]}^{\frac{1}{\alpha -1}},{k}_{0}\ne {k}_{1}.& \text{Equation9}\end{array}$ - [0104]This optimization for user scheduling is updated slot by slot. Different scheduling mechanisms can be chosen. For example, instead of proportional fairness, the adaptive scheduler used for video service could be employed [5].
- [0105][0105]FIG. 5B is a block diagram of a transmitter adapted to implement the above discussed optimization process. Shown is a sector transmitter
**502**and optimization process**500**. An input to the optimization process**500**is any parameters required for the process, such as α and β in the above discussed example. These could be hard coded into the system. Another input to the process are the above discussed user specific values T_{k }and R_{k }which are maintained, for example in memory**504**. The output of the optimization process**500**consists of values k_{0}, W_{k}_{ 0 }and k_{1}, W_{k}_{ 1 }. These values are used by the sector transmitter**504**to obtain the appropriate amount of transmit data from each user and to generate the appropriate transmit signal for transmission over transmit antenna**506**. - [0106]Implementation of Optimum Frequency Allocation for OFDM System
- [0107]Another embodiment of the invention provides a method of optimum frequency allocation for OFDM systems which is very similar to the above described optimization method. This OFDM embodiment can be employed for both conventional frequency reuse-1 frequency assignment to split frequency allocation between two or more users in a sector. Alternatively, if frequency reuse-3 is employed, the OFDM embodiment still splits the assigned sector bandwidth between the two or more users.
- [0108]This is shown by way of example in FIG. 6 where the data bits (more generally symbols) for user k
_{0 }are generally indicated by**80**and the data bits for user k_{1 }are generally indicated by**82**. Depending upon the fraction of bandwidth assigned to each user, the number of bits (symbols) each user will be allowed to transmit will be different. The users bits (symbols) are mapped in the time domain to sequence**84**. After OFDM modulation, these bits (symbols) are mapped to OFDM symbol**86**. It can be seen that for the OFDM embodiment, the frequency bandwidth assigned for a given sector will not necessarily be divided into contiguous blocks to be used by each user. Rather, each sector will have a respective band which may or may not overlap partially or completely with the band used by adjacent sectors and the users selected to transmit on the band of that sector will have their data spread throughout the band. - [0109]For this embodiment, each receiver needs to know where to look for its data and this can be achieved with a forward signalling channel. For example, in one embodiment, as long as the receiver knows the ratio of data information for two users, it can extract its own bits from the OFMD symbols. For example, if we have N bits with the ratio of 1/3 for two users, the bit locations for the two users might be bits ‘X’ for the first user and bits ‘Y’ for the second user defined as follows: XYYYXYYYXYYY . . . . Of course, if this were to be variably defined, a forward-signaling channel would be required to indicate this ratio.
- [0110]On the up-link, each mobile reports the received SNR to its serving base-station (BS) slot by slot with a certain delay (for example, two slot delay). For each permutation of two users, the BS determines the transmission rate and modulation (called adaptive modulation and coding (AMC)) based on the reported CIR. The resulting transmission rate is used in equation 9 to determine Γ, and in equations 7 and 8 to determine the optimum frequency bandwidths. After this has been done for all pairs of users, the two active users, are selected by choosing the largest value obtained from equation 6.
- [0111]If there are N users for scheduling, N(N−1) times calculations must be conducted, from which the largest ones are selected to be active users.
- [0112]In the BS transmitter, the data signal generated from the two active users is modulated by OFDM sub-carriers, resulting in an OFDM symbol as shown in FIG. 6. Note that the following relationship has to be maintained
$\begin{array}{cc}\frac{{N}_{{k}_{0}}}{{N}_{{k}_{1}}}=\frac{{W}_{{k}_{0}}}{{W}_{{k}_{1}}}& \text{Equation10}\end{array}$ - [0113]where N
_{k}_{ 0 }and N_{k}_{ 1 }are the number of bits for user k_{0 }and k_{1 }transmitted. It is noted that for the OFDM embodiment, the entire frequency band is shared by the users, so it is more proper to not refer to frequency bands F_{i0 }and F_{i1 }for this embodiment. All of the above equations are the same, except these frequency band references can be removed. - [0114][0114]FIG. 6B is a block diagram of an OFDM base system employing optimization as provided by an embodiment of the invention. Shown here again is optimization process
**600**which performs optimization as a function of input values T_{k}, R_{k }indicated generally at**606**. However, in this case the values R_{k }are determined by obtaining SNR readings**604**(or other suitable quality measures) for each mobile station, and then for each mobile station determining a rate to be employed based on adaptive coding and modulation, as indicated generally at**602**. With the rates thus determined, the optimization process**600**proceeds to generate values N_{k}_{ 0 }, k_{0}, and N_{k}_{ 1 }, k_{1}. These values are fed to a bit selector (more generally symbol selector) function**608**which is responsible for obtaining the required number of bits from the selected users. It is to be understood that there would be many methods of implementing this, but it simply amounts to obtaining N_{k}_{ 0 }bits from user k_{0 }and obtaining N_{k}_{ 1 }bits for user k_{1}. These bits are fed to an OFDM transmitter**610**which generates an OFDM signal and transmits this on antenna**612**. Further details of the bit selection and OFDM transmission are provided in FIG. 6C. Here, the bit selector**608**is shown to have the above discussed input**601**output by the optimization process**600**, and also has the user input data streams**609**. The appropriately selected bits, generally indicated at**611**are fed to the OFDM transmitter**610**. These bits are combined and interleaved by multiplexer**620**and interleaver**622**and fed to an IFFT function**624**which generates the signal for transmission over antenna**612**. - [0115]In the mobile receiver side, demodulation is performed with the entire OFDM symbol. Each active user discards the other user's data bits and picks up its own data bits by applying the inverse mapping indicated in FIG. 6A.
- [0116]Optimum PN Code Allocation for CDMA
- [0117]Another embodiment of the invention provides a method of PN code allocation for CDMA systems. An example of PN Walsh code allocation in a given sector with two active users is illustrated in FIG. 7.
- [0118]
- [0119]respectively. We further assume that the transmission rate for each selected user is R
_{k}_{ 0 }and R_{k}_{ 1 }when using all codes N, whereby the transmission rates${R}_{{k}_{0}}^{\left(L\right)}\ue89e\text{\hspace{1em}}\ue89e\mathrm{and}\ue89e\text{\hspace{1em}}\ue89e{R}_{{k}_{1}}^{\left(L\right)}$ - [0120]
- [0121]
- [0122]If we consider the proportional fairness model for user scheduling, the following optimization can be made. The optimization performs the maximization of the proportional factor relative to user transmission rate and average user throughput, while keeping the total number of Walsh codes constant. This optimization can be formulated as follows:
$\begin{array}{cc}\underset{{N}_{{k}_{0}}^{\left(L\right)},{N}_{{k}_{1}}^{\left(L\right)},{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{N}_{{k}_{0}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{N}_{{k}_{1}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)& \text{Equation13}\\ \text{subjectto:}\ue89e\text{\hspace{1em}}\ue89e\begin{array}{c}{N}_{{k}_{0}}^{\left(L\right)}+{N}_{{k}_{1}}^{\left(L\right)}=N,\\ {k}_{0}\ne {k}_{1}\end{array}& \text{Equation14}\end{array}$ - [0123]where T
_{k }is the average user throughput, and α and β are the indices used to control the fairness for scheduling. Note that the ratio of R_{k}^{α}/T_{k}^{β}is used to determine an active user based on the conventional proportional fairness scheduling. - [0124]By using the Lagrangian of the above constrained optimization [4], the following unconstrained optimization formula is obtained:
$\begin{array}{cc}\underset{{k}_{0},{k}_{1}}{\mathrm{Max}}\ue8a0\left(\frac{{\left({R}_{{k}_{0}}\xb7{N}_{{k}_{0}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{0}}^{\beta}}+\frac{{\left({R}_{{k}_{1}}\xb7{N}_{{k}_{1}}^{\left(L\right)}\right)}^{\alpha}}{{T}_{{k}_{1}}^{\beta}}\right)\ue89e\text{}\ue89e\mathrm{where}& \text{Equation15}\\ {N}_{{k}_{0}}^{\left(L\right)}=\frac{\Phi \ue89e\text{\hspace{1em}}\ue89eN}{1+\Phi},& \text{Equation16}\\ {N}_{{k}_{1}}^{\left(L\right)}=\frac{\text{\hspace{1em}}\ue89eN}{1+\Phi},& \text{Equation17}\\ \Phi ={\left[\frac{{\left({T}_{{k}_{0}}\right)}^{\beta}\xb7{\left({R}_{{k}_{1}}\right)}^{\alpha}}{{\left({T}_{{k}_{1}}\right)}^{\beta}\xb7{\left({R}_{{k}_{0}}\right)}^{\alpha}}\right]}^{\frac{1}{\alpha -1}},{k}_{0}\ne {k}_{1}.& \text{Equation18}\end{array}$ - [0125]This optimization for user scheduler is updated slot by slot. The same process is followed as was described previously for the OFDM embodiment.
- [0126][0126]FIG. 7B is a block diagram of a system in which the Walsh code selection is employed. Here, again the optimization process is indicated generally at
**702**and this generates an output**703**consisting of an identification of two users and a corresponding number of Walsh codes for each user. These values are input to the bit selector**704**which selects the bits from the user input streams and passes these to a CDMA transmitter**708**which generates the CDMA signal using the appropriate number of Walsh codes for each user. The output is then transmitted on transmit antenna**710**. As before, the input to the optimization process in this case consists of values T_{k}, and R_{k}, generally indicated at**706**. - [0127]Other Applications Based on Lagrangian Optimization
- [0128]The schedulers discussed in the previous sections are based on proportional fairness. Other forms of schedulers can be chosen. For example, we may employ the adaptive scheduler used for video service [5]. Some applications using the Lagrangian optimization could be FTP traffic service with proportional fairness scheduler, or real time video service using an adaptive scheduler [5] considering the transmission rate and packet delay. With different schedulers, however, equations like Equation 6 and Equation 9, and Equation 15 and Equation 18 would need to be modified accordingly.
- [0129]Some very specific examples have been given above of block diagrams of transmitters adapted to implement various methods. It is to be understood that each of these block diagrams are simplified in the sense that a real implementation would typically include many functions not shown. These functions are not shown since they are not essential to the invention. It is further to be understood that while the block diagrams show a specific interconnectivity of functional blocks, these functional blocks could be implemented using any combination of hardware, software, firmware, etc. and the physical interconnections between the two might be different than specifically shown. Additional functions may also change the interconnections.
- [0130]Performance Studies
- [0131]Simulation Assumption
- [0132]The simulation assumptions are mainly based on 1xEV-DV as discussed in [3]. Besides, the additional assumptions for our simulation are listed in Table 1.
TABLE 1 Simulation assumptions. Number of users 20 Control factor α 0.8 Control factor β 1.0 Traffic Service Full Buffer FTP - [0133]Simulation Results for Frequency Reuse
- [0134]The simulation results presented provide the average CIR (Geometry) results to back up the first approach of frequency reuse for OFDM systems.
- [0135]To investigate the performance using frequency reuse-1 and reuse-3, the system level simulation results are expressed in terms of the system “geometry”. The geometry is a measurement which corresponds to the long-term average CIR received by each mobile.
- [0136][0136]FIG. 8 shows the geometry as a function of distance between the mobile and base-station for frequency reuse-1 and reuse-3, and FIG. 9 shows the cumulative density function (CDF) of the geometry for frequency reuse-1 and reuse-3. It can be seen from FIG. 8 that the geometry achieved by frequency reuse-3 is much higher then that achieved by frequency reuse-1 due to a lower interference from other cells. From FIG. 9, in addition, it can be seen that the geometry gain achieved by frequency reuse-3 over frequency reuse-1 is about.
- [0137]Simulation Results for Optimum Walsh Code Allocation
- [0138]Simulation results were obtained for the optimum Walsh code allocation based on the Lagrangian optimization approach in terms of user throughput and residual frame error rate (FER).
- [0139][0139]FIG. 10 shows the user throughput as a function of geometry with and without Lagrangian optimization. Several observations can be made. For both results with or without the optimum allocation, when the geometry increases, the user throughput increases as well. In addition, there are some diverging tendencies for the same geometry of users. This is because users with different channel models have different user throughput, some is higher and some is lower even with the same geometry. Lagrangian optimization algorithm achieves about 7% cell throughput gain as opposed to the regular proportional fairness scheduler.
- [0140][0140]FIG. 11 shows the residual FER as a function of geometry with and without Lagrangian optimization. Several observations can be made. The results, with or without the optimum allocation, indicate that the residual FER behave differently. One method shows a higher FER valuethan the other. This is because different channel models use different velocity for the mobile, resulting in difference results even with the same geometry. If the velocity is higher, the MCS decision will be inaccurate resulting in a higher FER even with three retransmissions (maximum transmission). The Lagrangian optimization approach can reduce the average residual FER by half as compared to the regular proportional fairness scheduler.
- [0141]Performance Summary for Optimum Walsh Code Allocation
- [0142]The simulation results relative to average sector throughput and average residual FER are listed in Table 2.
TABLE 2 Cell throughput and residual FER with and without Lagrangian Optimization. Proportional Lagrangian Fairness Optimization Gain Av. Sector 777.46 830.23 6.9% Throughput (kbps) (kbps) Av. Residual 2.58-e02 1.13-e02 2.3x FER - [0143]References
- [0144][1] Richard Van Nee and Ramjee Prasad, OFDM for Wireless Multimedia Communication, Artech House Boston-London, 2000.
- [0145][2] 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical layer aspects of UTRA High Speed Downlink Packet Access (Release 4), 3GPP TR 25.848, V4.0.0, March 2001.
- [0146][3] 1xEV-DV Evaluation Methodology—Addendum (V6), Jul. 25, 2001.
- [0147][4] David G. Luenberger, Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Inc., Second Edition, 1984.
- [0148][5] J. Wu and W. Tong, A data streaming service using adaptive transmission scheduling, Nortel Networks Patent, 14809RO, August 2001.
- [0149]Numerous modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practised otherwise than as specifically described herein.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US5063445 * | 19 Apr 1990 | 5 Nov 1991 | Nippon Hoso Kyokai | Multiple sub-sampling transmitting/receiving system performing interfield and interframe offset sub-sampling of a broad bandwidth television signal |

US5506916 * | 25 Nov 1992 | 9 Apr 1996 | Kabushiki Kaisha Toshiba | Image compression apparatus using a lossy compression method |

US5511233 * | 5 Apr 1994 | 23 Apr 1996 | Celsat America, Inc. | System and method for mobile communications in coexistence with established communications systems |

US5574750 * | 14 Sep 1993 | 12 Nov 1996 | Pacific Communication Sciences, Inc. | Methods and apparatus for detecting a cellular digital packet data (CDPD) carrier |

US5719902 * | 18 Apr 1995 | 17 Feb 1998 | Pacific Communication Sciences, Inc. | Methods and apparatus for detecting cellular digital packet data (CDPD) |

US5850608 * | 8 Nov 1996 | 15 Dec 1998 | Nothern Telecom Limited | Directional frequency assignment in a cellular radio system |

US5974323 * | 13 Sep 1996 | 26 Oct 1999 | Airnet Communications Corporation | Frequency plan for wireless communication system that accommodates demand growth to high efficiency reuse factors |

US5974324 * | 10 Feb 1997 | 26 Oct 1999 | Ericsson Inc. | Adaptive frequency reuse plan |

US6014545 * | 27 Mar 1997 | 11 Jan 2000 | Industrial Technology Research Institute | Growable architecture for high-speed two-way data services over CATV networks |

US6028884 * | 14 Oct 1998 | 22 Feb 2000 | Qualcomm Incorporated | Method and apparatus for measuring nonlinear effects in a communication system |

US6047186 * | 6 Oct 1997 | 4 Apr 2000 | Nortel Networks Corporation | Method and system for solving cellular communications frequency planning problem |

US6061568 * | 1 Oct 1996 | 9 May 2000 | Ericsson Inc. | Method and apparatus for mitigating intermodulation effects in multiple-signal transmission systems |

US6088592 * | 25 Mar 1996 | 11 Jul 2000 | Airnet Communications Corporation | Wireless system plan using in band-translators with diversity backhaul to enable efficient depolyment of high capacity base transceiver systems |

US6094425 * | 21 Jan 1998 | 25 Jul 2000 | Thomson-Csf | Self-adaptive method for the transmission of data, and implementation device |

US6154654 * | 7 May 1998 | 28 Nov 2000 | Ericsson Inc. | System and method for frequency reuse in a four cell plan |

US6275704 * | 3 Mar 1997 | 14 Aug 2001 | Xircom, Inc. | Multiple access communication system with polarized antennas |

US6522885 * | 29 Sep 2000 | 18 Feb 2003 | Nortel Networks Limited | Method and system for solving cellular communications frequency planning problem |

US6529488 * | 24 Jun 1999 | 4 Mar 2003 | Motorola, Inc. | Multiple frequency allocation radio frequency device and method |

US6539203 * | 2 Nov 1999 | 25 Mar 2003 | Lucent Technologies Inc. | Method for determining cellular radio channel assignments to minimize interference due to intermodulation products |

US6556829 * | 29 Jun 1998 | 29 Apr 2003 | Telefonaktiebolaget Lm Ericsson (Publ) | Mobile communications system |

US6560459 * | 18 Dec 1998 | 6 May 2003 | Nortel Networks Limited | CDMA frequency planning for fixed wireless application |

US6564061 * | 1 Sep 2000 | 13 May 2003 | Nokia Mobile Phones Ltd. | Class based bandwidth scheduling for CDMA air interfaces |

US6606500 * | 24 Aug 2000 | 12 Aug 2003 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and a device for improving the capacity of a GSM base station |

US6657980 * | 12 Apr 2001 | 2 Dec 2003 | Qualcomm Incorporated | Method and apparatus for scheduling packet data transmissions in a wireless communication system |

US6714780 * | 12 Jun 2001 | 30 Mar 2004 | Qualcomm Incorporated | System and method for reducing call dropping rates in a multi-beam communication system |

US6842440 * | 25 Apr 2002 | 11 Jan 2005 | Interdigital Technology Corporation | Subscriber RF telephone system for providing multiple speech and/or data signals simultaneously over either a single or a plurality of RF channels |

US6892068 * | 1 Aug 2001 | 10 May 2005 | Mobile Satellite Ventures, Lp | Coordinated satellite-terrestrial frequency reuse |

US6917580 * | 30 Jul 2001 | 12 Jul 2005 | Sony International (Europe) Gmbh | Frequency reuse scheme for OFDM system |

US7099413 * | 1 Feb 2001 | 29 Aug 2006 | At&T Corp. | Method for near optimal joint channel estimation and data detection for COFDM systems |

US7280473 * | 28 Jun 2002 | 9 Oct 2007 | Nortel Networks Limited | Data streaming method and apparatus using adaptive transmission scheduling |

US7453801 * | 28 Apr 2003 | 18 Nov 2008 | Qualcomm Incorporated | Admission control and resource allocation in a communication system supporting application flows having quality of service requirements |

US7499397 * | 11 Nov 2007 | 3 Mar 2009 | Entropic Communications Inc. | Broadband network for coaxial cable using multi-carrier modulation |

US20030050067 * | 10 Sep 2001 | 13 Mar 2003 | Jack Rozmaryn | Wireless systems frequency reuse planning using simulated annealing |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US7230991 * | 10 Dec 2003 | 12 Jun 2007 | Nec Laboratories America, Inc. | Scheduling method with tunable throughput maximization and fairness guarantees in resource allocation |

US7257406 | 22 Dec 2004 | 14 Aug 2007 | Qualcomm, Incorporated | Restrictive reuse set management |

US7437164 | 20 Oct 2004 | 14 Oct 2008 | Qualcomm Incorporated | Soft handoff for reverse link in a wireless communication system with frequency reuse |

US7542722 | 19 Dec 2003 | 2 Jun 2009 | Telefonaktiebolaget Lm Ercisson (Publ) | Method and arrangement for minimizing intracell interference in a data transmission system |

US7548752 | 22 Dec 2004 | 16 Jun 2009 | Qualcomm Incorporated | Feedback to support restrictive reuse |

US7564820 * | 8 Nov 2004 | 21 Jul 2009 | Motorola, Inc. | Method and apparatus for resource allocation and scheduling |

US7586990 | 22 Nov 2005 | 8 Sep 2009 | Motorola, Inc. | Method and system for allocating subcarriers to subscriber devices |

US7680475 | 7 Jun 2005 | 16 Mar 2010 | Qualcomm Incorporated | Dynamic ASBR scheduler |

US7702031 | 4 Mar 2005 | 20 Apr 2010 | Nextnet Wireless, Inc. | System and method for adaptive modulation |

US7738422 * | 23 Aug 2005 | 15 Jun 2010 | Alcatel-Lucent Usa Inc. | Interference-reducing method of forward link scheduling for wireless networks |

US7995529 | 4 Aug 2008 | 9 Aug 2011 | Clear Wireless Llc | System and method for cell planning in a wireless communication network |

US8032145 | 12 Aug 2005 | 4 Oct 2011 | Qualcomm Incorporated | Restrictive reuse set management algorithm for equal grade of service on FL transmission |

US8059589 | 8 Jun 2005 | 15 Nov 2011 | Qualcomm Incorporated | Dynamic restrictive reuse scheduler |

US8116756 * | 3 Jun 2009 | 14 Feb 2012 | Fujitsu Limited | Method for reducing interference between adjacent sectors, and base station apparatus |

US8165983 * | 25 Mar 2008 | 24 Apr 2012 | International Business Machines Corporation | Method and apparatus for resource allocation among classifiers in classification systems |

US8265647 * | 19 Sep 2008 | 11 Sep 2012 | Fujitsu Limited | Communication terminal and device |

US8320352 * | 2 Mar 2007 | 27 Nov 2012 | Qualcomm Incorporated | Robust transmission scheme for wireless networks |

US8320354 | 30 Jan 2012 | 27 Nov 2012 | Qualcomm Incorporated | Robust transmission scheme for wireless networks |

US8483691 | 18 Jun 2008 | 9 Jul 2013 | Qualcomm Incorporated | Restrictive reuse for a wireless communication system |

US8526963 * | 18 Jun 2004 | 3 Sep 2013 | Qualcomm Incorporated | Restrictive reuse for a wireless communication system |

US8565161 | 3 Oct 2005 | 22 Oct 2013 | Nokia Corporation | Adaptive frequency reuse scheme |

US8675509 | 3 Jun 2009 | 18 Mar 2014 | Qualcomm Incorporated | Feedback to support restrictive reuse |

US8938246 * | 10 Feb 2010 | 20 Jan 2015 | Alcatel Lucent | Method for scheduling terminals in a radio communication network, and corresponding base station |

US8971899 * | 21 Oct 2004 | 3 Mar 2015 | Nokia Solutions And Networks Gmbh & Co. Kg | Method for signaling a path to radio stations of a radio communications system |

US9215669 | 29 Oct 2008 | 15 Dec 2015 | Qualcomm Incorporated | Preamble design for a wireless signal |

US9264976 * | 29 Oct 2008 | 16 Feb 2016 | Qualcomm Incorporated | Preamble design for a wireless signal |

US9585023 | 1 Jun 2004 | 28 Feb 2017 | Qualcomm Incorporated | Layered reuse for a wireless communication system |

US9801188 | 29 Oct 2008 | 24 Oct 2017 | Qualcomm Incorporated | Backhaul signaling for interference avoidance |

US20050111488 * | 8 Nov 2004 | 26 May 2005 | Subramanian Vijay G. | Method and apparatus for resource allocation and scheduling |

US20050130664 * | 10 Dec 2003 | 16 Jun 2005 | Nec Laboratories America, Inc. | Scheduling method with tunable throughput maximization and fairness guarantees in resource allocation |

US20050271012 * | 20 Oct 2004 | 8 Dec 2005 | Avneesh Agrawal | Soft handoff for reverse link in a wireless communication system with frequency reuse |

US20060072122 * | 30 Sep 2004 | 6 Apr 2006 | Qingying Hu | Method and apparatus for measuring shape of an object |

US20060140217 * | 30 Nov 2005 | 29 Jun 2006 | Samsung Electronics Co., Ltd. | Method for adaptively allocating frequency resource in communication system using orthogonal frequency division multiple access scheme |

US20060159004 * | 12 Aug 2005 | 20 Jul 2006 | Ji Tingfang | Restrictive reuse set management algorithm for equal grade of service on FL transmission |

US20060205412 * | 9 Mar 2006 | 14 Sep 2006 | Samsung Electronics Co., Ltd. | System and method for controlling resource allocation in a multicell communication system |

US20060268755 * | 3 Oct 2005 | 30 Nov 2006 | Nokia Corporation | Adaptive frequency reuse scheme |

US20070047569 * | 23 Aug 2005 | 1 Mar 2007 | Suman Das | Interference-reducing method of forward link scheduling for wireless networks |

US20070116139 * | 22 Nov 2005 | 24 May 2007 | Subramanian Vijay G | Method and system for allocating subcarriers to subscriber devices |

US20070133452 * | 21 Oct 2004 | 14 Jun 2007 | Hui Li | Method for signaling a path to radio stations of a radio communications system |

US20070167191 * | 19 Dec 2003 | 19 Jul 2007 | Telefonaktiebolaget Lm Ericsson | Method and arrangement for minimizing intracell interference in a data transmission system |

US20080168462 * | 25 Mar 2008 | 10 Jul 2008 | International Business Machines Corporation | Method and Apparatus for Resource Allocation Among Classifiers in Classification Systems |

US20080212460 * | 2 Mar 2007 | 4 Sep 2008 | Qualcomm Incorporated | Robust transmission scheme for wireless networks |

US20080240032 * | 25 Mar 2008 | 2 Oct 2008 | Clearwire Corporation | System and method for condensed frequency reuse in a wireless communication system |

US20090011711 * | 19 Sep 2008 | 8 Jan 2009 | Fujitsu Limited | Communication device and terminal |

US20090129350 * | 29 Oct 2008 | 21 May 2009 | Qualcomm Incorporated | Preamble design for a wireless signal |

US20090239540 * | 3 Jun 2009 | 24 Sep 2009 | Tsuyoshi Yoneta | Method For Reducing Interference Between Adjacent Sectors, And Base Station Apparatus |

US20100002597 * | 3 Jun 2009 | 7 Jan 2010 | Qualcomm Incorporated | Feedback to support restrictive reuse |

US20100081441 * | 30 Sep 2008 | 1 Apr 2010 | Zhifeng Tao | Dynamic Radio Frequency Allocation for Base Station Cooperation with Interference Management |

US20120003984 * | 10 Feb 2010 | 5 Jan 2012 | Bozo Cesar | Method for scheduling terminals in a radio communication network, and corresponding base station |

US20150009955 * | 28 Jul 2014 | 8 Jan 2015 | Sparkmotion Inc. | Fractional frequency reuse deployment method for wireless system |

CN100586213C | 19 Dec 2003 | 27 Jan 2010 | 艾利森电话股份有限公司 | Method for minimizing intracell interference in a data transmission system |

EP1571795A2 * | 7 Mar 2005 | 7 Sep 2005 | Samsung Electronics Co., Ltd. | Method for allocating a subchannel in an orthogonal frequency division multiple access cellular communication system |

EP1571795A3 * | 7 Mar 2005 | 8 May 2013 | Samsung Electronics Co., Ltd. | Method for allocating a subchannel in an orthogonal frequency division multiple access cellular communication system |

EP1662826A1 * | 30 Nov 2005 | 31 May 2006 | Samsung Electronics Co., Ltd. | Method for adaptively allocating frequency resource in an OFDMA communication system |

EP2091165A1 * | 8 Dec 2006 | 19 Aug 2009 | Fujitsu Limited | Method for reducing interference between adjacent sectors, and base station apparatus |

EP2091165A4 * | 8 Dec 2006 | 5 Sep 2012 | Fujitsu Ltd | Method for reducing interference between adjacent sectors, and base station apparatus |

WO2005060295A1 * | 19 Dec 2003 | 30 Jun 2005 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and arragement for minimizing intracell interferenec in a data transmission system |

WO2005122628A1 * | 8 Jun 2005 | 22 Dec 2005 | Qualcomm Incorporated | Soft handoff for reverse link in a wireless communication system with frequency reuse |

WO2006012537A1 * | 22 Jul 2005 | 2 Feb 2006 | Qualcomm Incorporated | Restrictive reuse set management |

WO2006069302A1 * | 22 Dec 2005 | 29 Jun 2006 | Qualcomm Incorporated | Minimizing feedback by sending a quality indicator for a non-restrictive reuse set and a vectored quality indicator for other reuse sets |

WO2006129174A1 * | 31 May 2006 | 7 Dec 2006 | Nokia Corporation | Adaptive frequency reuse scheme |

WO2007021950A1 * | 10 Aug 2006 | 22 Feb 2007 | Qualcomm Incorporated | Restrictive reuse set management algorithm for equal grade of service on forward link transmission |

WO2009099076A1 | 28 Jan 2009 | 13 Aug 2009 | Mitsubishi Electric Corporation | Method for allocating bandwidth from radio frequency spectrum in cellular network including set of cells |

WO2010017219A2 * | 4 Aug 2009 | 11 Feb 2010 | Clearwire Legacy Llc | System and method for cell planning in a wireless communication network |

WO2010017219A3 * | 4 Aug 2009 | 27 May 2010 | Clearwire Legacy Llc | System and method for cell planning in a wireless communication network |

WO2011095060A1 * | 31 Jan 2011 | 11 Aug 2011 | China Mobile Communications Corporation | Networking method and device for frequency reuse |

Classifications

U.S. Classification | 370/335, 370/341, 455/447 |

International Classification | H04L12/56, H04W16/24, H04W72/04, H04W72/12, H04W16/12, H04W16/02 |

Cooperative Classification | H04W16/12, H04W72/0453, H04W72/1257 |

European Classification | H04W16/12 |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

28 Mar 2003 | AS | Assignment | Owner name: NORTEL NETWORKS LIMTIED, CANADA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WU, JIANMING;TONG, WEN;BOUDREAU, DANIEL;REEL/FRAME:013917/0001 Effective date: 20030327 |

28 Oct 2011 | AS | Assignment | Owner name: ROCKSTAR BIDCO, LP, NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:027143/0717 Effective date: 20110729 |

28 Jul 2012 | AS | Assignment | Owner name: APPLE INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ROCKSTAR BIDCO, LP;REEL/FRAME:028664/0179 Effective date: 20120511 |

Rotate