CN102273099A - Techniques for quick access channel information loading in wireless networks - Google Patents

Techniques for quick access channel information loading in wireless networks Download PDF

Info

Publication number
CN102273099A
CN102273099A CN200980153567XA CN200980153567A CN102273099A CN 102273099 A CN102273099 A CN 102273099A CN 200980153567X A CN200980153567X A CN 200980153567XA CN 200980153567 A CN200980153567 A CN 200980153567A CN 102273099 A CN102273099 A CN 102273099A
Authority
CN
China
Prior art keywords
message
time
signaling
sequence
access channel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN200980153567XA
Other languages
Chinese (zh)
Inventor
Y·朱
X·杨
Q·李
H·尹
H·李
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intel Corp
Original Assignee
Intel Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US12/378,390 external-priority patent/US8064476B2/en
Application filed by Intel Corp filed Critical Intel Corp
Publication of CN102273099A publication Critical patent/CN102273099A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2602—Signal structure
    • H04L27/261—Details of reference signals
    • H04L27/2613—Structure of the reference signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037—Inter-user or inter-terminal allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

An embodiment of the present invention provides a method of quick access channel information loading in wireless networks, comprising mapping at least one quick access channel to one distributed resource unit of control tiles, said control tiles being spread across consecutive sub-carriers and consecutive OFDMA symbols, wherein each control tile and a predetermined number of sub carriers are used to send a bandwidth indicator and a predetermined number of sub carriers are used to send a bandwidth request message, and wherein there exist unique orthogonal sequences for the bandwidth indicator and each of the sequences are capable of being selected as a preamble sequence.

Description

In wireless network, be used for the technology that quick access channel information loads
Background technology
In wireless communication system, when the access based on scheduling was used to mobile radio station (MS) distribution physical radio resource, the scheduler that is positioned at base station (BS) needed some key messages.For example, uplink scheduler need know which MS needs PHY resource and described MS to need how many PHY resources and the urgency level that needs resource.For another example, Downlink scheduler may need to know which kind of modulation and encoding rate should be applied to the PHY resource that is used to send data to MS.This system comprises IEEE (IEEE) 802.16e, LTE and 802.16m standard present and future.
In up link (UL), need a kind of mechanism make described MS to its serving BS broadcasts send bandwidth request (BWREQ) designator and BWREQ information described data are described should be by the serving BS broadcasts that how to be dispatched to it.In the past, (for example, IEEE802.16e or LTE) if MS at first sent described bandwidth indicator and described designator is caught by described BS, and at next step, described BS authorize the PHY resource to send described bandwidth request can for described MS.In LTE, UL bandwidth request designator (perhaps the LTE term is a dispatch request) is sent (after this being called as poll) in the PHY of periodic allocation resource.
Poll has big shortcoming when bandwidth request speed is low.For example, in typical IP phone (VoIP) situation, need 0.4BWREQ/ user/second and tell described BS:UL talk burst to begin.In order to satisfy the delay requirement in the 5ms, MS needs every 5ms to have one-period PHY resource, and no matter whether it has the bandwidth request that will send.Another shortcoming is the big stand-by period.Just, catch and be used for sending bandwidth request after the PHY resource allocation of success of described bandwidth request receiving correct bandwidth indicator.
Therefore, need in wireless network, be used for the technology that quick access channel information loads strongly.
Description of drawings
It is highlighted and clearly claimed at the latter end of specification to be considered to theme of the present invention.But, the present invention's (about tissue and method of operation) and target thereof, feature and advantage can be understood by the following detailed description of reference when reading with accompanying drawing best, in the accompanying drawing:
Accompanying drawing 1 has been described quick access channel PHY structure according to an embodiment of the invention; And
Accompanying drawing 2 shows the quick feedback procedure of BS order according to an embodiment of the invention.
Should be appreciated that element illustrated in the accompanying drawings is not necessarily drawn in proportion for illustrated succinct and clear.For example, for the sake of clarity, the some of them size of component is exaggerated with respect to other elements.In addition, under situation about seeing fit, repeat reference numerals is to indicate corresponding or similar elements in the accompanying drawings.
Embodiment
In the following detailed description, many details have been set forth so that provide to comprehensive understanding of the present invention.But, one skilled in the art will appreciate that the present invention can realize under the situation of these details not having.In other cases, do not describe known method in detail, process, assembly and circuit be not so that can blur the present invention.
Although embodiments of the invention are unrestricted in this regard, but be to use such as for example " processing ", " calculating ", " computing ", " determine ", " foundation ", " analysis ", the discussion of terms such as " inspections " can refer to computer, computing platform, computing system, perhaps (one or more) of other electronic computing devices operate and/or process, described computer, computing platform, computing system, perhaps other electronic computing devices are handled the data of the register that is expressed as computer and/or the physics in the memory (for example, electronics) amount and/or are converted into similar register that is expressed as computer and/or memory or other and can store other data in order to the physical quantity in the information recording medium of the instruction of executable operations and/or process.
Although embodiments of the invention are unrestricted in this regard, term " majority " and " a plurality of " for example can comprise " a plurality of " or " two or more " as used herein.Term " majority " or " a plurality of " can be in order to describe two or more assemblies, equipment, element, unit, parameter etc. in whole specification.For example, " a plurality of station " can comprise two or more stations.
Embodiments of the invention provide and have been used for the leading sequential selection method that Fast Channel inserts, its can be in all sequences equably distributing user also avoid the sequence conflict simultaneously.Embodiments of the invention provide quick 3 steps to insert notion to IEEE802.16m, but the present invention is not limited to this aspect.Embodiments of the invention can be as 100 such enforcements the shown in substantially of accompanying drawing 1, and are as described below:
1) a quick access channel will be mapped to a distributed resource units, and described Resource Unit is made up of three 6 * 6 controll block 110,120 and 130.Cross over 6 continuous sub-carriers and 6 continuous OFDMA code element expansions for these 6 * 6.
2) each 6 * 6 controll block 110,120 and 130 and 19 subcarriers can be used to send bandwidth indicator and 17 subcarriers can be used to send bandwidth request message.
3) there is the individual unique orthogonal sequence that is used for described bandwidth indicator of L (example is 24).Each of a described L sequence can be selected as targeting sequencing.
4) described bandwidth messages can be carried N information bit.N defaults to 12, although the present invention is not limited to this.
5) a bandwidth request channel can carry L * 2 altogether NIndividual unique code word.
When quick access channel is used to the bandwidth request purpose, MS address and signaling bit all will be mapped to all available code words.Defined the general framework that information element loads below.
1) M user can be loaded into a channel altogether, and M complete MAC Id is { Id 0, Id 1, Id 2..., Id M-1;
2) channel has K unique PHY address { Ar 0, Ar 1, Ar 2..., Ar K-1M≤K;
3) channel have L unique orthogonal sequence index 0,1,2 ..., 18};
4) for any given time t, t=0,1 ..., the mapping from MAC Id to the PHY address is unique, and
5) at time t, a user can transmit a code word and be used for signaling from J code word, satisfy J * K=L * 2 N(that is, the whole effective information bits that transmitted of transmission are N+log 2(L) bit).The number that is noted that the information code word that will load equals can be by the leading and number control message packet code word.
When two MS inserted described quick access channel simultaneously and select identical targeting sequencing, conflict took place.Generally, the information loading algorithm should be in all L sequence distribution series collision probability equally.In addition, described information loading algorithm also should guarantee if two MS select identical sequence for time t, and then they are low for the probability of time t+1 selection identical sequence.This stops the sequence conflict to repeat in time.If two MS are access channel at one time, then two MS select the chance of identical sequences should be designed to be limited to 1/L.
Exist several different methods to all available code word load informations.Listed some examples below, but the present invention is not limited to these examples.
First method is described in this section.If J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0, this method loads the PHY address and load signaling bit in leading and message in message part.If MS m wants to transmit signaling code word j at time t, p=f (j t) is selected preamble index, p=0 wherein, and 1 ..., 18.F (j, t) should be designed to probability P p=i} to all users all near 1/L.And if two MS m 1And m 2Want to transmit signaling code word j respectively at time t 1And j 2And selected targeting sequencing index is identical f (j 1, t)=f (j 2, t), we should minimize f (j 1, t+1)=f (j 2, probability t+1).The possible shortcoming of this method is if described J signaling code word is not equal distribution, then f (j, t) increase that may lead to a conflict.This example is proposed according to service type grouping targeting sequencing.
Second method is described in this section.If J=2 O, K=L * 2 P, O+P=N, O 〉=0, P 〉=0, then this method loads in PHY address and the remainder in message in leading and part message and loads signaling bit, and if MS m want to transmit signaling CW j at time t, (m t) is selected preamble index to p=h, p=0 wherein, 1 ..., L-1.H (m, t) have than situation 1 simple the design of Duoing so that make P{p=i} near 1/L, and if two user m for all users 1And m 2, h (m 1, t)=h (m 2, t), we should minimize probability h (m 1, t+1)=h (m 2, t+1).The shortcoming of this method is that BS may need to carry out exhaustive search, that is, (m t), and searches unique effectively m value or determine conflict when a plurality of m values produce identical output to calculate h at given time t for all possible m value.
Third party's method is described in this section.This third party's method loads the PHY address and load signaling bit in leading and message in message.We will select preamble index according to signaling bit and PHY address.If J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0 is if user m wants to transmit signaling CW j at time t.P=f (m, j t) are selected preamble index, p=0 wherein, and 1 ..., L-1.(m, j t) are designed to make P{p=i} near 1/L for all users f, and if for two user m 1And m 2, f (m 1, j 1, t)=f (m 2, j 2, t), we should minimize probability f (m 1, j 1, t+1)=f (m 2, j 2, t+1).
This third party's method can be counted as the mixed method of method 1 and method 2, and described collision probability is better than method 1 but ratio method 2 is poor, but BS do not need as in the method 2, to calculate all h (m, t).In addition owing to from leading and message, will know the PHY address before the complete decoding signaling message, BS and MS can use the additional synchronization state information between them, shared as the input of function f () to strengthen the randomness of its output.An example of this state information is a safe context.The history of the output p that another example was successfully handled before being.
(example t) satisfies described designing requirement for m, j to provide f below.Final formula is not limited to this, as long as meet the demands.Suppose f (m, j, t)=mod (mod (j, L)+mod (m, L)+mod (floor (m/L) * t, L), L).At the receiver place, the two is successfully detected described targeting sequencing and message, thus the i that loads in the message) m and ii) j the part signaling information can by message know and iii) p=f (m, j t) can know by the sequence index that detects.(t), we can at first recover mod (j, L) (it is the part of the signaling information of the j of loading in leading) for m, j for given m and p=f; Itself and floor (j/L) are made up, and described floor (j/L) is equivalent to the signaling bit of having decoded in message part, and therefore recovers j fully.It should be noted that one MS to the leading special process that load that be not used in; It is realized to described MS by distributing unique MAC ID.Load on each sequence is controlled to BS.For example, if always total L the user in each sector if described BS distributes MAC ID 0 to L-1, then clashes never.Described BS can also ask one or more MS to adopt the QACH channel to send feedback.Need not to send MS id because this is known to BS.In message bit, need a bit to distinguish quick access and quick feedback then.The quick feedback procedure of BS order usually is depicted as 200 in the accompanying drawing 2, wherein has BS230 and MS240 and BS order 210 and feeds back 220 fast.
Main benefit is controlled with predictable from the load of a quick access channel.When described load is low, adopt described quick access channel to send the PHY resource that a small amount of signaling bit is used for saving data service.In addition, the MS signaling feedback that also may exist many BS to start.Many in them do not take place continually and can use a spot of code word to encode.An example is that event driven CQI dispatches lastingly with auxiliary dispatching.Another example can be MS power headroom (power headroom) report.When the feedback of ordering simultaneously from a plurality of MS, described BS knows in advance which which MS can use leadingly send quick feedback.So can not obscure in the BS side is who has sent the quick feedback of being ordered.
The information element that the quick feedback of ordering for BS defines can be further relevant with the information element in the described BS order.
Although special characteristic of the present invention is shown and described at this, those skilled in the art can know multiple modification, replace, and change and equivalent.Therefore, be understandable that appended claim is intended to cover all this modifications and variations that fall in the true spirit of the present invention.

Claims (28)

1. one kind is used for the method that quick access channel information loads in wireless network, comprising:
At least one quick access channel is mapped to a distributed resource units of controll block, and described controll block is extended to crosses over continuous sub-carriers and continuous OFDMA code element;
Wherein the subcarrier of each controll block and the predetermined number subcarrier that is used to send bandwidth indicator and predetermined number is used to send bandwidth request message; And
Wherein exist orthogonal sequence and each described sequence of the uniqueness that is used for described bandwidth indicator can be chosen as targeting sequencing.
2. the method for claim 1, wherein said bandwidth request message is fit to carry N information bit.
3. the method for claim 1, one of them bandwidth request channel is fit to carry L * 2 altogether NThe code word of individual uniqueness.
4. method as claimed in claim 3, wherein said quick access channel are used to bandwidth request purpose and MS address and signaling bit, and the two all is mapped to whole available codeword.
5. method as claimed in claim 4, wherein said controll block are that 6 continuous sub-carriers and 6 continuous OFDMA code elements are crossed in three 6 * 6 controll blocks and each described 6 * 6 expansion.
6. method as claimed in claim 5, wherein in each described 6 * 6 controll block, L subcarrier is used to send bandwidth indicator and 17 subcarriers are used to send bandwidth request message.
7. method as claimed in claim 6 wherein exists L to be used for the orthogonal sequence of uniqueness of described bandwidth indicator and each of a described L sequence is selected as targeting sequencing.
8. the method for claim 1, wherein said wireless network is the wireless network that is used in operation according to the IEEE802.16 standard traffic.
9. the method for claim 1, wherein the framework that loads of information element is as follows:
1) M user is loaded into a QACH altogether, and M complete MAC Id is { Id 0, Id 1, Id 2..., Id M-1;
2) channel has K unique PHY address { Ar 0, Ar 1, Ar 2..., Ar K-1M≤K;
3) channel have L unique orthogonal sequence index 0,1,2 ..., L-1};
4) for any given time t, t=0,1 ..., the mapping from MAC Id to the PHY address is unique; And
5) at time t, a user can transmit a code word and be used for signaling from J code word, wherein J * K=L * 2 N
10. method as claimed in claim 9, if wherein said information is carried in all described L sequences equally the distribution series collision probability and two MS of assurance select identical sequence for time t, then they to select the probability of this identical sequence for time t+1 be low, thereby stop the sequence conflict to repeat in time, if and two MS access channel at one time, then two MS select this identical sequence chance on be limited to 1/L.
11. method as claimed in claim 10, wherein said information loading method are selected from by lising the group of forming down:
If J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0 is if load the PHY address and load signaling bit and MS m wants to transmit signaling code word j, p=f (j at time t in leading and message in message, t) be selected preamble index, p=0,1, ..., L-1, and f (j, t), P{p=i} to all users all near 1/L, and if for two MS m 1And m 2, f (j 1, t)=f (j 2, t), we should minimize probability f (j 1, t+1)=f (j 2, t+1);
If J=2 O, K=L * 2 P, O+P=N, O 〉=0, P 〉=0 loads the PHY address and load signaling bit in message in leading and message, and if MS m want to transmit signaling CWj at time t, (m t) is selected preamble index, wherein p=0 to p=h, 1, ..., L-1 compares h (m with method 1, t) has much easier design so that make P{p=i} near 1/L, and if for two user m for all users 1And m 2, h (m 1, t)=h (m 2, t), we should minimize probability h (m 1, t+1)=h (m 2, t+1), perhaps
In message, load the PHY address and in leading and message, load signaling bit; Select preamble index according to signaling and PHY address, J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0 is if user m wants to transmit signaling CWj, then p=f (m at time t, j t) is selected preamble index, p=0 wherein, and 1 ..., L-1, (m, j t) should be designed to make P{p=i} near 1/L for all users f, and if for two user m 1And m 2, f (m 1, j 1, t)=f (m 2, j 2, t), we should minimize probability f (m 1, j 1, t+1)=f (m 2, j 2, t+1), f (m, j, example t) be f (m, j, t)=mod (mod (j, L)+mod (m, L)+mod (floor (m/L) * t, L), L).
12. a device that is suitable for providing quick access channel information loading in wireless network comprises:
Transceiver, it is suitable at least one quick access channel is mapped to a distributed resource units of controll block, and described controll block is extended to crosses over continuous sub-carriers and continuous OFDMA code element;
Wherein the subcarrier of each controll block and the predetermined number subcarrier that is used to send bandwidth indicator and predetermined number is used to send bandwidth request message; And
Wherein exist orthogonal sequence and each described sequence of the uniqueness that is used for described bandwidth indicator can be chosen as targeting sequencing.
13. device as claimed in claim 12, wherein said bandwidth request message are fit to carry N information bit.
14. device as claimed in claim 12, one of them bandwidth request channel is fit to carry L * 2 altogether NThe code word of individual uniqueness.
15. device as claimed in claim 14, wherein said quick access channel are used to bandwidth request purpose and MS address and signaling bit, and the two all is mapped to whole available codeword.
16. being three 6 * 6 controll blocks and each described 6 * 6 expansion, device as claimed in claim 15, wherein said controll block cross over 6 continuous sub-carriers and 6 continuous OFDMA code elements.
17. device as claimed in claim 16, wherein in each described 6 * 6 controll block, L subcarrier is used to send bandwidth indicator and 17 subcarriers are used to send bandwidth request message.
18. device as claimed in claim 17 wherein exists L to be used for the orthogonal sequence of uniqueness of described bandwidth indicator and each of a described L sequence is selected as targeting sequencing.
19. device as claimed in claim 12, wherein said wireless network are to be used for wireless network according to the IEEE802.16 standard traffic in operation.
20. device as claimed in claim 12, wherein the framework of information element loading is as follows:
1) M user is loaded into a QACH altogether, and M complete MAC Id is { Id 0, Id 1, Id 2..., Id M-1;
2) channel has K unique PHY address { Ar 0, Ar 1, Ar 2..., Ar K-1M≤K;
3) channel have L unique orthogonal sequence index 0,1,2 ..., L-1};
4) for any given time t, t=0,1 ..., the mapping from MAC Id to the PHY address is unique; And
5) at time t, a user can transmit a CW and be used for signaling from J CW, wherein J * K=L * 2 N
21. device as claimed in claim 20, if wherein said information is carried in all described L sequences equally the distribution series collision probability and two MS of assurance select identical sequence for time t, then they to select the probability of this identical sequence for time t+1 be low, thereby stop the sequence conflict to repeat in time, if and two MS access channel at one time, then two MS select this identical sequence chance on be limited to 1/L.
22. device as claimed in claim 21, wherein said information loading method are selected from by lising the group of forming down:
If J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0 is if load the PHY address and load signaling bit and MS m wants to transmit signaling code word j, p=f (j at time t in leading and message in message, t) be selected preamble index, p=0,1, ..., L-1, and f (j, t), P{p=i} to all users all near 1/L, and if for two MS m 1And m 2If, f (j 1, t)=f (j 2, t), we should minimize probability f (j 1, t+1)=f (j 2, t+1);
If J=2 O, K=L * 2 P, O+P=N, O 〉=0, P 〉=0 loads the PHY address and load signaling bit in message in leading and message, and if MS m want to transmit signaling CWj at time t, (m t) is selected preamble index, wherein p=0 to p=h, 1, ..., L-1 compares h (m with method 1, t) has much easier design so that make P{p=i} near 1/L, and if for two user m for all users 1And m 2If, h (m 1, t)=h (m 2, t), we should minimize probability h (m 1, t+1)=h (m 2, t+1); Perhaps
In message, load the PHY address and in leading and message, load signaling bit; Select preamble index according to signaling and PHY address, J=L * 2 O, K=2 P, O+P=N, O 〉=0, P 〉=0 is if user m wants to transmit signaling CWj at time t, if p=f is (m, j t) is selected preamble index, p=0 wherein, and 1 ..., L-1, (m, j t) should be designed to make P{p=i} near 1/L for all users f, and if for two user m 1And m 2, f (m 1, j 1, t)=f (m 2, j 2, t), we should minimize probability f (m 1, j 1, t+1)=f (m 2, j 2, t+1), f (m, j, example t) be f (m, j, t)=Mod (mod (j, L)+mod (m, L)+mod (floor (m/L) * t, L), L).
23. when accessed, making machine carry out, the machine accessible medium that instruction is provided, described instruction comprise following operation:
The quick access channel information of controlling in the wireless network by a distributed resource units that at least one quick access channel is mapped to controll block loads, and described controll block is extended to crosses over continuous sub-carriers and continuous OFDMA code element;
Wherein the subcarrier of each controll block and the predetermined number subcarrier that is used to send bandwidth indicator and predetermined number is used to send bandwidth request message; And
Wherein exist orthogonal sequence and each described sequence of the uniqueness that is used for described bandwidth indicator can be chosen as targeting sequencing.
24. machine accessible medium as claimed in claim 23, wherein said bandwidth request message are fit to carry N information bit.
25. machine accessible medium as claimed in claim 23, one of them bandwidth request channel is fit to carry L * 2 altogether NThe code word of individual uniqueness.
26. machine accessible medium as claimed in claim 25, wherein said quick access channel are used to bandwidth request purpose and MS address and signaling bit, and the two all is mapped to whole available codeword.
27. being three 6 * 6 controll blocks and each described 6 * 6 expansion, machine accessible medium as claimed in claim 26, wherein said controll block cross over 6 continuous sub-carriers and 6 continuous OFDMA code elements.
28. machine accessible medium as claimed in claim 27, wherein in each described 6 * 6 controll block, 19 subcarriers are used to send bandwidth indicator and 17 subcarriers are used to send bandwidth request message.
CN200980153567XA 2008-10-31 2009-10-31 Techniques for quick access channel information loading in wireless networks Pending CN102273099A (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US11054408P 2008-10-31 2008-10-31
US61/110544 2008-10-31
US12/378390 2009-02-13
US12/378,390 US8064476B2 (en) 2009-02-13 2009-02-13 Techniques for quick access channel information loading in wireless networks
PCT/US2009/062902 WO2010051516A2 (en) 2008-10-31 2009-10-31 Techniques for quick access channel information loading in wireless networks

Publications (1)

Publication Number Publication Date
CN102273099A true CN102273099A (en) 2011-12-07

Family

ID=42129578

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200980153567XA Pending CN102273099A (en) 2008-10-31 2009-10-31 Techniques for quick access channel information loading in wireless networks

Country Status (3)

Country Link
EP (1) EP2394375A4 (en)
CN (1) CN102273099A (en)
WO (1) WO2010051516A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103561449A (en) * 2013-11-08 2014-02-05 福建星网锐捷网络有限公司 Wireless access method and wireless access point
US8718080B2 (en) 2009-02-13 2014-05-06 Intel Corporation Techniques for quick access channel information loading in wireless networks

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080232401A1 (en) * 2007-03-20 2008-09-25 Sassan Ahmadi LOGICAL AND TRANSPORT CHANNEL STRUCTURES FOR MOBILE WiMAX WIRELESS SYSTEMS

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007149729A1 (en) * 2006-06-20 2007-12-27 Intel Corporation Random access request extension for an additional resource request
US7804799B2 (en) * 2006-12-29 2010-09-28 Intel Corporation Uplink contention based access with quick access channel

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080232401A1 (en) * 2007-03-20 2008-09-25 Sassan Ahmadi LOGICAL AND TRANSPORT CHANNEL STRUCTURES FOR MOBILE WiMAX WIRELESS SYSTEMS

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
YUAN ZHU, ETC.: "《C802.16m-08/1055r1》", 12 September 2008 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8718080B2 (en) 2009-02-13 2014-05-06 Intel Corporation Techniques for quick access channel information loading in wireless networks
CN103561449A (en) * 2013-11-08 2014-02-05 福建星网锐捷网络有限公司 Wireless access method and wireless access point

Also Published As

Publication number Publication date
WO2010051516A3 (en) 2010-07-08
WO2010051516A2 (en) 2010-05-06
EP2394375A2 (en) 2011-12-14
EP2394375A4 (en) 2015-06-17

Similar Documents

Publication Publication Date Title
CN111510954B (en) Method and device for determining scheduling timing interval
CN107852265B (en) Method and terminal for data transmission
CN110932832B (en) Method and device in wireless communication
US9629147B2 (en) Method for signaling of resource allocation to adjust granularity in cellular multi-carrier system
CN108111281B (en) Data channel parameter configuration method and device
US8195186B2 (en) Resource allocation
US8200241B2 (en) Terminal random access method for cellular radio communications system and method for generating group identifier
CN101909356B (en) Method, system and device for indicating member carrier waves
CN102487548B (en) Machine type communication system, information sending and obtaining method, base station and terminals
CN107846707B (en) Method and device in grant-free UE and base station
CN101689987A (en) Method of downlink resource allocation in a sectorized environment
CN101383657A (en) Downlink channel control signaling sending and receiving method and apparatus thereof
CN107409401A (en) Method, computer program, network node and communication equipment
CN107864479B (en) Method and equipment used in UE (user Equipment) and base station for exempting from grant
US8718080B2 (en) Techniques for quick access channel information loading in wireless networks
EP3404950B1 (en) Control information transmission method, base station, and terminal
CN109392146B (en) Method, terminal and network equipment for determining uplink transmission resources
CN109156012B (en) Method for transmitting information, method and device for receiving information
US10939425B2 (en) Configuring wireless communications resources
KR101044532B1 (en) Methods and apparatus for transitioning between states
CN102273099A (en) Techniques for quick access channel information loading in wireless networks
CN107592189B (en) Transmission method, user equipment and base station
CN102835164B (en) Method and device for synchronizing resource allocating indication information order in wireless networks
CN117615460A (en) Scheduling information indication method and communication device
CN116208223A (en) Method and device for satellite scheduling request enhancement processing

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20111207