Efficient scheduling request channel for wireless networks
US7778151B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 3, 2007 |
| Grant date | Aug 17, 2010 |
| Priority date | — |
| Expiry date | Mar 16, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L27/26134
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In a method for transmitting a contention free scheduling request in a cellular network, a set of N frequency opportunities is defined within a scheduling request slot. A set of R CAZAC root sequences is then defined per frequency opportunity. A set of C cyclic shifts is then defined per CAZAC root sequence. Within a given cell, a unique identification number is assigned to each user equipment (UE) that is in an uplink (UL) synchronized state. Each UL synchronized UE is mapped to a unique combination of one of the N frequency opportunities, one of the R CAZAC root sequences and one of the C cyclic shifts. A cyclic shifted preamble sequence for a given UE is transmitted as a scheduling request on the mapped frequency, CAZAC root sequence and cyclic shift opportunity, wherein the unique identification number of the given UE is encoded by the combination of the frequency opportunity, CAZAC root sequence opportunity, and amount of cyclic shift, such that up to all of the plurality of UE can transmit a schedule request (SR) in a non-contentious manner in one schedule request slot.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.