[go: up one dir, main page]

TWI336195B - Method and apparatus for carrier allocation and management in multi-carrier communication systems - Google Patents

Method and apparatus for carrier allocation and management in multi-carrier communication systems Download PDF

Info

Publication number
TWI336195B
TWI336195B TW095135848A TW95135848A TWI336195B TW I336195 B TWI336195 B TW I336195B TW 095135848 A TW095135848 A TW 095135848A TW 95135848 A TW95135848 A TW 95135848A TW I336195 B TWI336195 B TW I336195B
Authority
TW
Taiwan
Prior art keywords
reverse link
access terminal
carrier
carriers
access
Prior art date
Application number
TW095135848A
Other languages
Chinese (zh)
Other versions
TW200723807A (en
Inventor
Donna Ghosh
Rashid Ahmed Akbar Attar
Christopher G Lott
Ramin Rezaiifar
Juan Montojo
Original Assignee
Qualcomm Inc
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 US11/371,274 external-priority patent/US20060203724A1/en
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Publication of TW200723807A publication Critical patent/TW200723807A/en
Application granted granted Critical
Publication of TWI336195B publication Critical patent/TWI336195B/en

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Description

九、發明說明: 【發明所屬之技術領域】 本揭示案大體上係關於無線通信系統。更具體言之,本 文所揭示之實施例係關於多載波通信系統中之載波分配及 管理。 【先前技術】 已開發出通信系統以允許將來自起源台之資訊信號傳輸 至實體上不同之目標台。在經由通信通道而傳輸來自起源 台之資訊信號時,首先將該資訊信號轉換為一適於經由該 通信通道進行有效傳輸之形式。資訊信號之轉換或調變涉 及以一使得將所得調變載波之波譜限於通信通道頻寬内之 方式而根據該資訊信號來改變載波之參數。在目標台處, 自經由通信通道而接收之調變載波來複製原始資訊信號。 該複製通常係藉由使用由起源台所採用之調變過程的反向 過程來達成。 調變亦有助於多向近接,例如,若干信號經由共同通信 通道之同時傳輸及/或接收。舉例而言,多向近接通信系 統可包括需要對共同通信通道之間歇服務而非連續存取的 複數個遠端用戶單元(或存取終端機)。多向近接技術可包 括劃碼多向近接(CDMA)、劃時多向近接(TDMA)、劃頻多 向近接(FDMA)、正交劃頻多向近接(〇FDMA)及其他多向 近接技術。 多向近接通信系統可為無線及/或有線的,且可載運語 曰資料#等。可將通信系統設計成實施-或多個標 11503 丨.doc 1336195 準。 隨著對多媒體服務及南速率資料之需求快速地增長,已 提議在無線通信系統中之多載波調變。存在提供有效且穩 固之多載波通信系統之挑戰。 【發明内容】 本文所揭示之實施例係關於多载波通信系統中之載波分 配及管理。在某些實施例中,在一前向鏈路上被指派至一 存取終端機之載波的數目可藉由一存取網路來判定,且在 一反向鏈路上被指派至該存取終端機之載波的數目可基於 該存取終端機與該存取網路之間的一協作過程。在其他實 施例中’在該反向鏈路上被指派至該存取终端機之載波的 數目亦可(例如)關於自該存取終端機所接收之排程資訊而 藉由該存取網路來判定。 【實施方式】 本文所揭示之實施例係關於通信系統中用於載波分配及 管理之方法及裝置。 本文所揭示之存取點(AP)可包括及/或實施基地台收發 器系統(BTS)、存取網路收發器(ANT)、數據機集區收發器 (MPT)或節點b(例如,在W-CDMA型系統中)等等之功能。 小區(cell)可指由AP所服務之覆蓋區域。小區可進一步包 括或夕個扇區。為簡潔及清晰起見,術語"扇區"在本文 中可用於指由AP所服務之小區或小區之區段。另外,存取 網路控制器(ANC)可指經組態以與核心網路(例如,封包資 料網路)建立介面並在存取終端機(AT)與核心網路之間投 11503l.doc ·: s > 1336195 送資料封包、執行各種無線電存取及鏈路維護功能(例 如’軟交遞)、控制無線電傳輸器及接收器等等之通信系 統的部分。ANC可包括及/或實施諸如在第2、第3或第4代 無線網路中所發現之基地台控制器(BSC)的功能。ANC與 一或多個AP可構成存取網路(AN)之一部分。 本文所描述之存取終端機(AT)可指各種類型之器件,包 括(但不限於)無線電話、蜂巢式電話、膝上型電腦、多媒 體無線器件、無線通信個人電腦(PC)卡、個人數位助理 (PDA)、外部或内部數據機,等等。Ατ可為經由無線通道 及/或經由有線通道(例如,藉由光纖或同軸電纜)而通信之 任何資料器件。AT可具有各種名稱,諸如存取單元、存取 節點、用戶單元、行動台、行動器件、行動單元、行動電 話、行動體、遠端台、遠端終端機、遠端單元、使用者器 件、使用者設備、掌上型器件,等等。不同Ατ可併入於一 系統中。AT可為行動的或固定的,且可分散於整個通信系 統中。AT可在給定時刻在前向鏈路及/或反向鏈路上與一 或多個AP通信《前向鏈路(或下行鏈路)係指自Ap至八丁之 傳輸。反向鏈路(或上行鏈路)係指自AT至Ap之傳輸。 圖1說明一經組態以支援許多使用者之無線通信系統 100,其中如下文進一步所描述,可實施各種所揭示之實 施例及態樣。以實例說明之,系統100為許多小區1〇2(包 括小區102A-102G)提供通信,其中每一小區係由相應Ap 104(諸如AP 104A-104G)所服務。每一小區可進一步劃分 為一或多個扇區。包括AT 106A-106K之各種Ατ 1〇6分散於 115031.doc 整個系統中。舉例而言,視Ατ县不士 L ^ 仇A1疋否有效且其是否處於軟交 遞而定,每 一 AT 106可术仏·令π*·»·ι J在,、,。疋時刻在前向鏈路及/或反向 鏈路上與一或多個AP 1 〇4通信。 圖1中以實例說明之’帶有箭頭之實線可指示自AP至AT 之資訊(例如,資料)傳輸。帶有箭頭之虛線可指示at正在 自ΑΡ接收導引及其他信號傳輸/參考信號(但非資料傳 輸)。為清晰及簡潔起見,圖!中未明確地展示反向鏈路通 信。 ΑΡ 104可各裝備有一或多個接收天線及一或多個傳輸天 線。在ΑΡ 104處可存在傳輸天線與接收天線之任何組合。 類似地,每一 AT 1 06可裝備有一或多個接收及傳輸天線或 其組合。 系統100可經組態以支援一或多個標準,例如,H95、IX. INSTRUCTIONS OF THE INVENTION: TECHNICAL FIELD OF THE INVENTION The present disclosure relates generally to wireless communication systems. More specifically, the embodiments disclosed herein relate to carrier allocation and management in a multi-carrier communication system. [Prior Art] A communication system has been developed to allow information signals from an origin station to be transmitted to physically different target stations. When transmitting an information signal from the originating station via the communication channel, the information signal is first converted into a form suitable for efficient transmission via the communication channel. The conversion or modulation of the information signal involves changing the parameters of the carrier in accordance with the information signal in such a manner that the spectrum of the resulting modulated carrier is limited to the bandwidth of the communication channel. At the target station, the original information signal is copied from the modulated carrier received via the communication channel. This duplication is usually achieved by using the reverse process of the modulation process employed by the origin station. Modulation also facilitates multi-directional proximity, for example, simultaneous transmission and/or reception of several signals via a common communication channel. For example, a multi-directional proximity communication system may include a plurality of remote subscriber units (or access terminals) that require intermittent service to a common communication channel rather than continuous access. Multi-directional proximity technology may include coded multi-directional proximity (CDMA), time-of-flight multi-directional proximity (TDMA), frequency-multidirectional proximity (FDMA), quadrature-frequency multi-directional proximity (〇FDMA), and other multi-directional proximity technologies. . The multi-directional proximity communication system can be wireless and/or wired, and can carry the language 曰 data# and the like. The communication system can be designed to implement - or multiple standards 11503 丨.doc 1336195. As the demand for multimedia services and south rate data has grown rapidly, multi-carrier modulation in wireless communication systems has been proposed. There is a challenge to provide an efficient and robust multi-carrier communication system. SUMMARY OF THE INVENTION Embodiments disclosed herein relate to carrier allocation and management in a multi-carrier communication system. In some embodiments, the number of carriers assigned to an access terminal on a forward link can be determined by an access network and assigned to the access terminal on a reverse link. The number of carriers of the machine may be based on a collaborative process between the access terminal and the access network. In other embodiments, the number of carriers assigned to the access terminal on the reverse link may also be, for example, with respect to scheduling information received from the access terminal by the access network. To judge. [Embodiment] The embodiments disclosed herein relate to a method and apparatus for carrier allocation and management in a communication system. An access point (AP) disclosed herein may include and/or implement a base station transceiver system (BTS), an access network transceiver (ANT), a data center hub transceiver (MPT), or a node b (eg, In the W-CDMA type system) and so on. A cell may refer to a coverage area served by an AP. The cell may further include or a sector. For the sake of brevity and clarity, the term "sector" may be used herein to refer to a segment of a cell or cell served by an AP. In addition, an access network controller (ANC) may be configured to interface with a core network (eg, a packet data network) and to place 11503l.doc between the access terminal (AT) and the core network. ·: s > 1336195 A portion of a communication system that sends data packets, performs various radio access and link maintenance functions (eg, 'soft handover'), controls radio transmitters and receivers, and the like. The ANC may include and/or implement functions such as a Base Station Controller (BSC) found in a 2nd, 3rd or 4th generation wireless network. The ANC and one or more APs may form part of an access network (AN). An access terminal (AT) as described herein may refer to various types of devices including, but not limited to, a wireless telephone, a cellular telephone, a laptop, a multimedia wireless device, a wireless communication personal computer (PC) card, an individual. Digital Assistant (PDA), external or internal data machine, and more. Ατ can be any data device that communicates via a wireless channel and/or via a wired channel (e.g., via fiber optic or coaxial cable). The AT can have various names such as access units, access nodes, subscriber units, mobile stations, mobile devices, mobile units, mobile phones, mobiles, remote stations, remote terminals, remote units, user devices, User equipment, handheld devices, and more. Different Ατ can be incorporated into a system. The AT can be mobile or fixed and can be dispersed throughout the communication system. The AT can communicate with one or more APs on the forward link and/or the reverse link at a given time. The forward link (or downlink) refers to the transmission from Ap to Octopus. Reverse link (or uplink) refers to the transmission from AT to Ap. 1 illustrates a wireless communication system 100 that is configured to support a number of users, in which various disclosed embodiments and aspects can be implemented as described further below. By way of example, system 100 provides communication for a number of cells 1 (including cells 102A-102G), each of which is served by a respective Ap 104, such as AP 104A-104G. Each cell can be further divided into one or more sectors. The various Ατ 1〇6 including AT 106A-106K are dispersed throughout the 115031.doc system. For example, depending on whether Ατ县不士 L ^ 仇 A1 is valid and whether it is in soft delivery, each AT 106 can be programmed to make π*·»·ι J in , , . The time is communicated with one or more APs 〇4 on the forward link and/or the reverse link. The solid line with an arrow illustrated by way of example in Figure 1 may indicate the transmission of information (e.g., data) from the AP to the AT. A dashed line with an arrow indicates that at is receiving pilot and other signal transmission/reference signals (but not data transmission). For clarity and simplicity, the map! Reverse link communication is not explicitly shown. The ΑΡ 104 may each be equipped with one or more receiving antennas and one or more transmission antennas. There may be any combination of transmit and receive antennas at ΑΡ 104. Similarly, each AT 106 can be equipped with one or more receive and transmit antennas or a combination thereof. System 100 can be configured to support one or more standards, such as H95,

cdma2000、IS-856,W-CDMA、TD-SCDMA、IEEE 802.11a、802.llg、802.11η、802.16e、802.20、其他標準 或其組合。舉例而言,在一實施例中,系統1 〇〇可為諸如 在 2006 年 5 月第 1 版之 3GPP2 C.S0024-B 中的”cdma2000 High Rate Packet Data Air Interface Specification"中所指 定之高速率封包資料(HRPD)系統(亦稱作"ixEV-DO"或"IS-856"型系統)。另外’各種演算法及方法可用於將傳輸進 行排程並有助於系統100中之通信。下文進一步描述用於 1 xEV-DO系統中之此等演算法及方法的細節。 圖2說明通信系統中之AN 204及AT 206的實施例。以實 例說明之,AT 206可(例如)在包括反向訊務通道208之反向 115031.doc 鏈路上與AN 204進行無線通信。反向訊務通道2〇8為將資 訊自AT 206載運至AN 204之反向通道的部分。除了反向訊 務通道208以外,該反向通道還可包括其他通道°另外’ AT 206可在包括複數個通道(例如,導引、訊務及其他通 道)之前向鏈路上與AN 204進行無線通信,其未明碎地展 示於圖2中。 可將由AT 206所執行之功能性組織為層堆疊。圖3說明 AT 306上之層堆疊。在該等層之間為一媒體存取控制 (MAC)層308。較高層310位於MAC層308上方。MAC層308 向較高層310提供某些服務,包括與反向訊務通道2〇8之操 作有關的服務。MAC層308包括反向訊務通道(RTC)MAC 協定314之一實施例。RTC MAC協定3 14提供由AT 306遵循 以傳輸反向訊務通道208及由AN 204遵循以接收反向訊務 通道208之程序。 實體層312位於MAC層308下方。MAC層308自實體層 312請求某些服務。此等服務與對AN 204之封包的實體傳 輸有關。 圖4説明AT 406上之較高層410、MAC層408與實體層412 之間的例示性相互作用。如圖所示,MAC層408自較高層 41〇操收一或多個流416。流416為具有預定傳輸需求(例 >,與特定應用程式相關聯)之來自使用者源的資料流β 舉例而言’流416對應於一特定應用程式,諸如語音 IP(V〇lP)、視訊電話學、擋案傳送協定(FTP)、遊戲’等 等0 n5031.doc -10· 1336195 以封包开>式將來自AT 406上之流416的資料傳輸至AN 2〇4。根據RTC MAC協定414,MAC層判定一用於每一封 包之流集合418。有時,AT 406上之多個流416具有待同時Cdma2000, IS-856, W-CDMA, TD-SCDMA, IEEE 802.11a, 802.11g, 802.11n, 802.16e, 802.20, other standards, or a combination thereof. For example, in one embodiment, System 1 may be a high rate as specified in the "cdma2000 High Rate Packet Data Air Interface Specification" in 3GPP2 C.S0024-B, 1st edition, May 2006. Packet Data (HRPD) system (also known as "ixEV-DO" or "IS-856" type system.) In addition, 'various algorithms and methods can be used to schedule transmissions and facilitate communication in system 100. Details of such algorithms and methods for use in a 1 xEV-DO system are further described below. Figure 2 illustrates an embodiment of AN 204 and AT 206 in a communication system. By way of example, AT 206 can be, for example, The reverse 115031.doc link including the reverse traffic channel 208 is in wireless communication with the AN 204. The reverse traffic channel 2〇8 is the portion of the reverse channel that carries information from the AT 206 to the AN 204. In addition to the traffic channel 208, the reverse channel can also include other channels. In addition, the AT 206 can wirelessly communicate with the AN 204 on the link before including a plurality of channels (eg, navigation, traffic, and other channels). Unclear exhibition In Figure 2, the functionality performed by AT 206 can be organized as a layer stack. Figure 3 illustrates a layer stack on AT 306. Between these layers is a Media Access Control (MAC) layer 308. Higher layer 310 Located above the MAC layer 308. The MAC layer 308 provides certain services to the higher layer 310, including services related to the operation of the reverse traffic channel 202. The MAC layer 308 includes a reverse traffic channel (RTC) MAC protocol 314. An embodiment. The RTC MAC protocol 3 14 provides a procedure followed by the AT 306 to transmit the reverse traffic channel 208 and followed by the AN 204 to receive the reverse traffic channel 208. The physical layer 312 is located below the MAC layer 308. The MAC layer 308 Some services are requested from the entity layer 312. These services are related to the physical transport of the packets of the AN 204. Figure 4 illustrates an exemplary interaction between the higher layer 410, the MAC layer 408, and the physical layer 412 on the AT 406. As shown, the MAC layer 408 operates one or more streams 416 from a higher layer 41. Stream 416 is a stream of data from a user source having a predetermined transmission requirement (example > associated with a particular application) For example, 'stream 416 corresponds to a specific application, such as voice IP (V 〇lP), video telephony, file transfer protocol (FTP), game 'etc. 0 n5031.doc -10· 1336195 Transfer the data from stream 416 on AT 406 to AN 2〇4 in packet open > . According to the RTC MAC protocol 414, the MAC layer determines a stream set 418 for each packet. Sometimes, multiple streams 416 on the AT 406 have to be simultaneously

傳輸之資料。封包可包括來自一個以上之流416的資料。 g而,有時,在AT 406上可存在具有待傳輸之資料但未包 括於封包中的一或多個流416。封包之流集合418指示AT 406上之待包括於彼封包中之流416。下文將描述用於判定 封包之流集合418的例示性方法。 MAC層408亦判定每一封包之有效負載大小42〇。封包之 有效負載大小420指示來自流集合418之資料有多少包括於 封包中。 MAC層408亦判定封包之功率位準422。在某些實施例 中,相對於反嚮導引通道之功率位準而判定封包之功率位 準 422。 對於傳輸至AN 204之每—封包,MAC層4〇8將待包括於 封包中之流集合418、封包之有效負載大小42〇及封包之功 率位準422傳達至實體層412。實體層412接著根據由Mac 層408所提供之資訊來實現封包至AN 2〇4之傳輸。 圖5A及圖5B說明自AT 506傳輸至AN 5〇4之封包524。封 包524可以若干可能傳輸模式(TM)中之—者來傳輸。舉例 而言,在某些實施財’存在兩個可能傳龍式:高容量 傳輸模式及低等待時間傳輪模式15A說明—傳輸至賴 504之高容量封包524a(亦即,以高容量模式而傳輸之封勺 524a)。圖5B說明一傳輪至AN 5〇4之低等待時間封^ 115031.doc •11· 1336195 524b(亦即,以低等待時間模式而傳輸之封包52仆卜 可使用低等待時間(LoLat)傳輸模式來發送來自延遲敏感 流(LoLat流)之資料。可使用高容量(HiCap)傳輸模式來發 送來自延遲允許流(HiCap流)之資料。低等待時間封包 524b與相同封包大小之高容量封包52牦相比係以更高之功 率位準422來傳輸。因此,低等待時間封包52仆很可能將 比高容量封包524a更快地到達AN 5〇4。然而,低等待時間 封包524b與高容量封包524a相比會對系統1〇〇導致更大的 負載。 圖6說明可存在於AT 6〇6上之不同類型之流616。在某些 實施例中,AT 606上之每一流616與一特定傳輸模式相關 聯。在可能傳輸模式為高容量傳輸模式及低等待時間傳輸 模式之處,AT 606可包括一或多個高容量流616&及/或一或 多個低等待時間流616b。較佳地以高容量封包524a來傳輸 高容量流616a ^較佳地以低等待時間封包52仆來傳輸低等 待時間流616 b。 圖7說明用於高容量封包724a之流集合718的實例。在某 些實施例中,僅當具有待傳輸之資料的所有流716為高容 量流716a時,才以高容量模式來傳輸封包72牦。因此在 該等貫施例中’高容量封包724a中之流集合718僅包括高 容量流716a〇或者,隨AT 6〇6的意思,低等待時間流61讣 可包括於高容量封包724a中。如此進行之一例示性原因為 在低等待時間流616b未獲得足夠輸送量時。舉例而言,可 能偵測到低等待時間流616b之佇列正在積聚β該流可改為 115031.doc -12-Information transmitted. The packet may include data from more than one stream 416. g, and sometimes, there may be one or more streams 416 on the AT 406 that have data to be transmitted but are not included in the packet. The set of packets 418 indicates the stream 416 on the AT 406 to be included in the packet. An exemplary method for determining a stream set 418 of packets is described below. The MAC layer 408 also determines the payload size of each packet 42 〇. The payload size 420 of the packet indicates how much of the data from the stream set 418 is included in the packet. The MAC layer 408 also determines the power level 422 of the packet. In some embodiments, the power level of the packet is determined 422 relative to the power level of the reverse pilot channel. For each packet transmitted to the AN 204, the MAC layer 4〇8 communicates the stream set 418 to be included in the packet, the payload size 42 of the packet, and the power level 422 of the packet to the physical layer 412. The physical layer 412 then implements the transmission of the packet to the AN 2〇4 based on the information provided by the Mac layer 408. 5A and 5B illustrate a packet 524 transmitted from the AT 506 to the AN 5〇4. Packet 524 can be transmitted in a number of possible transmission modes (TM). For example, in some implementations, there are two possible Chuanlong: high-capacity transmission mode and low-latency transmission mode 15A description--transmission to the high-capacity packet 524a of the 504 (ie, in high-capacity mode) Transfer spoon 524a). Figure 5B illustrates a low latency block of 115-5.doc • 11· 1336195 524b (i.e., packet 52 transmitted in low latency mode can be transmitted using low latency (LoLat) transmission. Mode to transmit data from a delay-sensitive stream (LoLat stream). High-capacity (HiCap) transmission mode can be used to transmit data from a delayed allowed stream (HiCap stream). Low latency packet 524b and high-capacity packet of the same packet size 52牦 is transmitted at a higher power level 422. Therefore, the low latency packet 52 is likely to arrive at AN 5〇4 faster than the high-capacity packet 524a. However, the low latency packet 524b and high capacity The packet 524a will result in a greater load on the system 1 . Figure 6 illustrates different types of streams 616 that may be present on the AT 6〇 6. In some embodiments, each stream 616 and one on the AT 606 The particular transmission mode is associated. Where the possible transmission mode is a high capacity transmission mode and a low latency transmission mode, the AT 606 can include one or more high capacity streams 616 & and/or one or more low latency streams 616b. Preferably The high-capacity packet 524a transmits the high-capacity stream 616a. Preferably, the low-latency packet 620b transmits the low latency stream 616b. Figure 7 illustrates an example of a stream set 718 for the high-capacity packet 724a. In some implementations In the example, the packet 72 is transmitted in the high capacity mode only when all of the streams 716 having the data to be transmitted are the high capacity stream 716a. Therefore, in the respective embodiments, the stream set 718 in the high capacity packet 724a. Include only the high-capacity stream 716a, or, as with AT 6〇6, the low latency stream 61讣 may be included in the high-capacity packet 724a. One exemplary reason for doing so is that sufficient flow is not achieved at the low latency stream 616b. For example, it may be detected that the queue of low latency stream 616b is accumulating β. The stream can be changed to 115031.doc -12-

S ,由使^容量模式以增加等待時間為代價來改良 量0 ' 疋 圖8說明一用於低等待時間封包824b之例示性流集合 818 ^在某些實施例中,若存在具有待傳輸之資料的至少 低等待時間流816b,則以低等待時間模式來傳輸封包 824b。低等待時間封包“4b中之流集合818包括具有待傳 輸之身料的每—低等待時間流816b。具有待傳輸之資料的 或多個向容量流8163亦可包括於流集合818中。然而, 八有待傳輸之資料的一或多個高容量流816a可能不包括於 流集合818中。 ' 將並行低等待時間流與高容量流合併於每一反向鏈路載波 中之實體層封包中 當AT 906含有多個不同終止目標流時出現合併。因為每 一實體封包可具有一終止目標,所以規則可用於判定何時 可將流合併於相同封包中。用於將並行低等待時間流及高 容量流合併於封包中之規則取決於流優先權及扇區負載。 圖9說明可維持於Ατ 9〇6處以判定高容量流916&是否包括 於低等待時間封包824b之流集合818中的資訊。Ατ 9〇6上 之每一高容量流916a具有可用於傳輸之某量的資料926。 又,可為AT 906上之每一高容量流916a界定合併臨限值 928。此外,可為at 906整體上界定合併臨限值93〇 ^最 終’可在扇區之負載位準的估計小於臨限值時發生高容量 流之合併。(下文將論述如何判定扇區之負載位準的估 計。)亦即,當扇區被足夠輕微地負載時,合併之效率損 115031.doc 13 1336195 流916a。相反地’若將用於高容量流916a之合併臨限值 92 8设定為非常小之值,則此意味著高容量流9丨6&幾乎始 終包括於低等待時間封包824b中。因此,該等高容量流 916a可經歷非常小之傳輸延遲^然而,該等高容量流916& 用盡更多之扇區資源來傳輸其資料。 在某些實施例中,可將用於AT 9〇6上之某些高容量流 916a的合併臨限值928設定為非常大之值,而將用於Ατ 906上之某些其他高容量流916&的合併臨限值928設定為非 常小之合併臨限值928。該設計係有利的,因為某些類型 之高容量流916a可具有嚴格qoS需求,而其他類型可能不 具有。具有嚴格QoS需求並可以高容量模式來傳輸之流916 的一實例為即時視訊。即時視訊具有高頻寬需求,其使得 以低等待時間模式之傳輸效率低。然而,對於即時視訊不 需要任意傳輸延遲《不具有嚴格q〇s延遲需求且可以高容 量模式來傳輸之流916的一實例為最佳努力(best eff〇rth^ 916。 設定給定反向鏈路載波中之封包的功率位準 圖10說明扇區1032内之一 AN 1004及複數個AT 1006。扇 區1032為可藉由AT 1006接收來自AN 1004之信號且反之亦 然之地理區域。 諸如CDM系統之某些無線通信系統的一特性為傳輸彼此 干擾。因此’為確保相同扇區1〇32内之AT 1〇〇6之間不存 在太多干擾,存在AN 1004處所接收之可由AT 1006全體使 用之有限量的功率。為確保Ατ 1〇〇6保持於此限制内,某 115031.doc •15- ^ S * 1336195 ' 量之功率1034可用於扇區1032内之每一 AT 1006以用於在 反向訊務通道20 8上之傳輸°每一 AT 1006設定其在反向訊 務通道208上所傳輸之封包524之功率位準422 ’以便不會 超過其總可用功率1034 βS, the amount is modified by the capacity mode to increase latency. FIG. 8 illustrates an exemplary stream set 818 for the low latency packet 824b. In some embodiments, if there is a to-be-transmitted At least the low latency stream 816b of the data transmits the packet 824b in a low latency mode. The low latency packet "stream set 818 in 4b includes a per-low latency stream 816b having a body to be transmitted. The or multiple capacity stream 8163 having the material to be transmitted may also be included in the stream set 818. One or more high-capacity streams 816a of the eight data to be transmitted may not be included in the stream set 818. 'Consolidate parallel low latency streams and high-capacity streams into physical layer packets in each reverse link carrier Merging occurs when AT 906 contains multiple different termination target streams. Since each entity packet can have a termination target, the rules can be used to determine when streams can be merged into the same packet. Used to parallel low latency flows and high The rules for combining the capacity streams into the packets depend on the flow priority and the sector load. Figure 9 illustrates information that can be maintained at Ατ 9〇6 to determine whether the high-capacity stream 916& is included in the stream set 818 of the low latency packet 824b. Each of the high-capacity streams 916a on Ατ 9〇6 has a certain amount of data 926 that can be used for transmission. Also, a merge threshold 928 can be defined for each high-capacity stream 916a on the AT 906. The merge threshold can be defined for at 906 as a whole. Finally, the combination of high-capacity flows can occur when the estimate of the load level of the sector is less than the threshold. (How to determine the load level of the sector is discussed below. Estimate.) That is, when the sector is loaded slightly enough, the combined efficiency loss 115031.doc 13 1336195 flows 916a. Conversely 'if the merge threshold 92 8 for the high-capacity stream 916a is set to Very small value, this means that the high-capacity stream 9丨6& is almost always included in the low latency packet 824b. Therefore, the high-capacity streams 916a can experience very small transmission delays. However, such high-capacity streams 916& uses more sector resources to transmit its data. In some embodiments, the merge threshold 928 for certain high-capacity streams 916a on AT 9〇6 can be set to a very large value. The merge threshold 928 for some other high-capacity streams 916 & τ on the τ 906 is set to a very small merge threshold 928. This design is advantageous because certain types of high-capacity streams 916a may Have strict qoS requirements, while other types may not An example of a stream 916 having strict QoS requirements and capable of being transmitted in a high capacity mode is instant video. Instant video has a high frequency bandwidth requirement, which makes transmission efficiency in a low latency mode low. However, no random transmission is required for instant video. An example of a flow 916 that delays transmission without a strict q〇s delay requirement and can be transmitted in a high-capacity mode is best effort (best eff〇rth^ 916. Setting the power level of a packet in a given reverse link carrier) FIG. 10 illustrates one AN 1004 and a plurality of ATs 1006 within sector 1032. Sector 1032 is a geographic area that can receive signals from AN 1004 by AT 1006 and vice versa. A feature of some wireless communication systems, such as CDM systems, is that transmissions interfere with one another. Therefore, to ensure that there is not much interference between AT 1〇〇6 in the same sector 1〇32, there is a limited amount of power received by AN 1004 that can be used by the entire AT 1006. To ensure that Ατ 1〇〇6 remains within this limit, a 115031.doc •15-^S* 1336195 'power 1034 can be used for each AT 1006 in sector 1032 for use in reverse traffic channel 20 Transmission on 8 Each AT 1006 sets its power level 422 ' of the packet 524 transmitted on the reverse traffic channel 208 so as not to exceed its total available power 1034 β

分配至ΑΤ 1006之功率位準1034可能不確切地等於由AT 1006用於在反向訊務通道上傳輸封包524之功率位準 422。舉例而言,在某些實施例中’在判定封包524之功率 位準422時,存在AT 1〇〇6所選自之一組離散功率位準。用 # 於八丁 1006之總可用功率1034可能不確切地等於任何離散 功率位準。 允許在任何給定時間未使用之總可用功率1034積聚’使 得其可用於隨後時間。因此’在該等實施例中’用於AT 1006之總可用功率1〇34(約略地)等於當前功率分配1034&加 上積聚功率分配1034b之至少某部分。AT 1006判定封包 524之功率位準422,使得其不超過用於AT 1 〇 〇 6之總可用 功率1034。 • 用於AT 1006之總可用功率1034可能不始終等於AT 1006 之當前功率分配l〇34a加上AT 1006之積聚功率分配 1034b。在某些實施例中’ AT 1006之總可用功率1034可受 限於峰值分配1034c。用於AT 1006之峰值分配1034c可等 於用於AT 1006之當前功率分配1034&乘以某限制因子。舉 例而言,若限制因子為2 ’則AT 1006之峰值分配1034<^等 於其當前功率分配1034a之兩倍。在某些實施例中’限制 因子為用於AT 1006之當前功率分配1034&的函數。 115031.doc • 16- 1336195 提供用於AT之峰值分配i〇34c可限制允許AT 1〇〇6之傳輸 如何"叢發"(bursty)。舉例而言,可能發生的係,AT 1〇〇6 在某時段期間不具有待傳輸之資料。在此時段期間,可向 AT 1〇06繼續分配功率。因為無待傳輸之資料,所以所分 配之功率積聚。在某點處,AT 1006可突然具有相對較大 量的待傳輸之資料。在此點處,積聚功率分配丨〇34b可相 對較大。若允許AT 1006使用整個積聚功率分配1〇3413,則 AT 1〇〇6之傳輸功率422可經歷突然的快速增加。然而,若 AT 1006之傳輸功率422增加得太快速,則此可影響系統 1〇〇之穩定性。因此,在諸如此類之情況下,可向AT 1 006 提供峰值分配1034c以限制Ατ 1〇〇6之總可用功率ι〇34。應 注意,積聚功率分配10341)仍可用,但其使用在峰值分配 l〇34c受限時擴展於更多封包。 整理單一反向鏈路載波中之資料流 圖11說明—可用於判定AT 206之總可用功率1〇34的例示 性機制。該機制涉及虛擬”桶"1136之使用。此RLMAc桶係 用於每一資料流以整理資料流以及控制流存取。首先在資 料域中調節由應用程式流所產生之資料。整理功能確保由 流所使用之平均及峰值資源小於或等於限制值。整理資料 流使用以下方法來操作。以週期性間隔將新的當前功率分 配1034a添加至桶1136。由AT 2〇6所傳輸之封包μ#的功率 位準422亦以週期性間隔而退出桶1136。當前功率分配 1034a超過封包之功率位準422的量為積聚功率分配 1034b。積聚功率分配1〇34b仍處於桶丨丨刊中直至將其使 115031.doc 17 1336195 用為止。 總可用功率1034減去當前功率分配1034a為來自桶1136 之總潛在抽取。AT 1〇〇6確保其所傳輸之封包524的功率位 準422不會超過用於AT 1006之總可用功率1034。如先前所 指示,在某些情況下,總可用功率1〇34小於當前功率分配 l〇34a與積聚功率分配1〇3朴之總和。舉例而言,總可用功 率1034可受限於峰值功率分配1〇34c。 積聚功率分配103 4b可受限於飽和位準1135。在某些實 施例中,飽和位準1135為允許Ατ 1〇〇6利用其峰值功率分 配1034(:之時間量的函數。超過飽和位準1135之桶1136可 指示歸因於三個原因中之一者的過分配:i)pA頂部空間 (headroom)或資料限制;ii)T2PInfl〇w 1035衰變至 AN 1004 控制之最小值;或iii)T2Pflow 1035在流不再被過分配時開 始增加。T2PInfl〇w 1〇35被定義為網路中之當前被指派至 流的資源位準。因此,丁2?11^1〇评1035 =新資源入流(基於 AN 1 004指派之流優先權之長期T2P資源)。 藉由在與每一反向鏈路載波中之AT 1206相關聯之多個流 之間分配資源的流存取控制The power level 1034 assigned to ΑΤ 1006 may not be exactly equal to the power level 422 used by the AT 1006 to transmit the packet 524 on the reverse traffic channel. For example, in some embodiments, when determining the power level 422 of the packet 524, there is a set of discrete power levels selected by AT 1〇〇6. The total available power 1034 with #八八丁1006 may not be exactly equal to any discrete power level. The total available power 1034 that is not used at any given time is allowed to accumulate so that it can be used for subsequent times. Thus, the total available power for the AT 1006 in the embodiments is approximately 等于34 (approximately) equal to the current power allocation 1034& plus at least some portion of the accumulated power allocation 1034b. The AT 1006 determines the power level 422 of the packet 524 such that it does not exceed the total available power 1034 for AT 1 〇 〇 6. • The total available power 1034 for AT 1006 may not always be equal to the current power allocation l〇34a of AT 1006 plus the accumulated power allocation 1034b of AT 1006. In some embodiments, the total available power 1034 of AT 1006 may be limited to peak allocation 1034c. The peak allocation 1034c for AT 1006 can be equal to the current power allocation 1034& for AT 1006 multiplied by a certain limiting factor. For example, if the limiting factor is 2' then the peak allocation of AT 1006 is 1034 <^ equal to twice its current power allocation 1034a. In some embodiments the 'limit factor is a function of the current power allocation 1034& for AT 1006. 115031.doc • 16- 1336195 Provides peak distribution for AT i〇34c can limit the transmission of AT 1〇〇6. How to "bursty" For example, a system that may occur, AT 1〇〇6 does not have data to be transmitted during a certain period of time. During this time period, power can continue to be allocated to AT 1〇06. Since there is no data to be transmitted, the allocated power accumulates. At some point, the AT 1006 can suddenly have a relatively large amount of data to be transmitted. At this point, the accumulated power distribution 丨〇 34b can be relatively large. If the AT 1006 is allowed to use the entire accumulated power allocation 1〇3413, the transmission power 422 of the AT 1〇〇6 may experience a sudden rapid increase. However, if the transmission power 422 of the AT 1006 increases too quickly, this can affect the stability of the system. Thus, in the case of such, a peak allocation 1034c may be provided to AT 1 006 to limit the total available power 〇 34 of Ατ 1〇〇6. It should be noted that the accumulated power allocation 10341) is still available, but its use is extended to more packets when the peak allocation l〇34c is limited. Aligning Data Flows in a Single Reverse Link Carrier Figure 11 illustrates an exemplary mechanism that can be used to determine the total available power of the AT 206, 1〇34. This mechanism involves the use of virtual "buckets" 1136. This RLMAc bucket is used for each data stream to organize data streams and control stream access. First, the data generated by the application stream is adjusted in the data field. The average and peak resources used by the stream are less than or equal to the limit value. The collated data stream is operated using the following method. The new current power allocation 1034a is added to the bucket 1136 at periodic intervals. The packet transmitted by the AT 2〇6 μ The power level 422 of # also exits the bucket 1136 at periodic intervals. The current power allocation 1034a exceeds the power level 422 of the packet by the accumulated power allocation 1034b. The accumulated power allocation 1〇34b is still in the barrel magazine until It uses 115031.doc 17 1336195. The total available power 1034 minus the current power allocation 1034a is the total potential extraction from bucket 1136. AT 1〇〇6 ensures that the power level 422 of the packet 524 it transmits does not exceed The total available power of AT 1006 is 1034. As indicated previously, in some cases, the total available power 1〇34 is less than the current power allocation l〇34a and the accumulated power distribution 1〇3 Park For example, the total available power 1034 can be limited to the peak power allocation 1 〇 34c. The accumulated power allocation 103 4b can be limited to the saturation level 1135. In some embodiments, the saturation level 1135 is allowed Ατ 1 〇〇6 utilizes its peak power distribution as a function of the amount of time 1010. The bucket 1136 above the saturation level 1135 may indicate over-allocation due to one of three reasons: i) pA headroom or Data limit; ii) T2PInfl〇w 1035 decays to the minimum value of AN 1004 control; or iii) T2Pflow 1035 begins to increase when the stream is no longer over-allocated. T2PInfl〇w 1〇35 is defined as the current assignment in the network The resource level of the current flow. Therefore, Ding 2?11^1 comment 1035 = new resource inflow (long-term T2P resource based on the flow priority assigned by AN 1 004). With each reverse link carrier Flow access control for allocating resources between multiple streams associated with AT 1206

圖12說明扇區1232内之至少一些AT 1206包括多個流 1216之實施例。以維持品質保證(q0s)之方式來分配與AT 1206相關聯之多個流之間的資源。在該實施例中,可為AT 1206上之每一流1216判定獨立量的可用功率1238 »可根據 先前結合圖10-11所描述之方法來判定用於AT 12〇6上之流 1216的可用功率1238 »每一流將一用於儲存未使用之T2P 115031.doc < S :, 1336195 綱桶維持至高達某最大位準。當流資料到達時,將桶 - 資源用於以基於峰值對平均存取控制之最大桶抽取率為條 件來分配封包。以此方式,平均資源使用受限於 T2PInfl〇w 1G35,但局部叢發性分配可對受益於其之資料 源而力,進行峰值對平均控制(稱作BucketFactor)限制 AN 1004接收之功率可自每一流如何叢發。 舉例而言,用於流1216之總可用功率1238可包括一用於 流1216之當前功率分配1238a加上用於流1216之積聚功率 # 分配12遍的至少某部分。此外,用於流1216之總可用功 率1238可党限於一用於流1216之峰值分配i238c。可為每 一流1216維持諸如圖u所示之獨立桶機制(其利用下文所 描述之參數BucketLevel及T2PInfl〇w 1235),以判定用於每 机1216之總可用功率丨238。可藉由採用用於Ατ 1上 之不同流1216之總可用功率1238的總和來判定用於Ατ 1206之總可用功率1234。 • 以下k供可用於AT 12 0 6上之流1216之總可用功率12 3 8 之判定中的各種公式及演算法之數學描述。在下文所描述 之等式中,在每一子訊框將用於Ατ 12〇6上之每一流z.的總 可用功率1238判定一次。(在某些實施例中,一子訊框等 於四個時間槽,且一時間槽等於5/3 ms。)用於流之總可用 功率I238在等式中稱作的㈣。 用於以尚容量封包524a來傳輸之流ζ·的總可用功率1238 可表達為: 115031 .doc (i)1336195Figure 12 illustrates an embodiment in which at least some of the ATs 1206 within the sector 1232 include a plurality of streams 1216. The resources between the multiple streams associated with the AT 1206 are allocated in a manner that maintains quality assurance (q0s). In this embodiment, an independent amount of available power can be determined for each stream 1216 on the AT 1206. The available power for the stream 1216 on the AT 12〇6 can be determined according to the method previously described in connection with Figures 10-11. 1238 » Each stream will be used to store unused T2P 115031.doc < S :, 1336195 buckets up to a certain maximum level. When the stream data arrives, the bucket-resource is used to allocate the packet with a maximum bucket decimation rate based on the peak-to-average access control. In this way, the average resource usage is limited to T2PInfl〇w 1G35, but the local burst allocation can be used to benefit from the data source. The peak-to-average control (called BucketFactor) limits the power received by AN 1004. How do you like each other? For example, the total available power 1238 for stream 1216 can include a current power allocation 1238a for stream 1216 plus at least some portion of the accumulated power # allocation 12 times for stream 1216. In addition, the total available power 1238 for stream 1216 can be limited to a peak allocation i238c for stream 1216. A separate bucket mechanism, such as the one shown in Figure u (which utilizes the parameters BucketLevel and T2PInfl〇w 1235 described below), can be maintained for each class 1216 to determine the total available power 丨 238 for each of the machines 1216. The total available power 1234 for Ατ 1206 can be determined by employing the sum of the total available power 1238 for the different streams 1216 on Ατ 1 . • The following k provides a mathematical description of the various equations and algorithms that can be used in the determination of the total available power 12 3 8 of stream 1216 on AT 12 0 6 . In the equations described below, the total available power 1238 for each stream z Α on Ατ 12〇6 is determined once in each subframe. (In some embodiments, a sub-frame is equal to four time slots, and a time slot is equal to 5/3 ms.) The total available power I238 for the stream is referred to in the equation as (4). The total available power 1238 for the flow transmitted by the still capacity packet 524a can be expressed as: 115031 .doc (i) 1336195

PotentialT2POutflowi HC = ( ( / (l + AllocationStagger x )x \ r BucketLeveli n ^ + T2PInflowin \Λ 0,min 1 4 J 5 .J V ^BucketFactor{r2PInflowin 5 FRABin )x T2PInflowin J) 用於以低等待時間封包524b來傳輸之流ζ·的總可用功率 1238可表達為: P otentialTIP Outflow t iPotentialT2POutflowi HC = ( ( / (l + AllocationStagger x )x \ r BucketLeveli n ^ + T2PInflowin \Λ 0,min 1 4 J 5 .JV ^BucketFactor{r2PInflowin 5 FRABin )x T2PInflowin J) Used to wrap 524b with low latency The total available power 1238 of the flow to be transmitted can be expressed as: Potential TIP Outflow ti

max 0,min (l + AllocationStagger xrn)>Max 0,min (l + AllocationStagger xrn)>

BucketLeveL + T2PInflowiBucketLeveL + T2PInflowi

BucketFactor{r2PInflowin, FRABin )x T2Plnflowt (2). 為在子訊框《用於流(之積聚功率分酉己 1238b。Γ2Ρ/«/7ο>ν,,„為在子訊框η用於流之當前功率分配 .1238a。表達式 尸尸在子訊 框 π用於流ζ·之峰值功率分配 1238c 。 „,F兄4晃„)為用於判定用於總可用功率1 2 3 8 之限制因子(亦即,藉以允許在子訊框《用於流之總可用功 率1238超過在子訊框π用於流ζ·之當前功率分配1238a的因 子)的函數。在子訊框《之滤波反向活動位元流 為扇區1232之負載位準的估計,且將於下文更詳細地論 述。JZ/ocai/cmAagger為使分配位準抖動以避免同步問題 之隨機項的振幅,且〜為在範圍[-1,1]内之實值均勻分佈隨 機數。 在子訊框《 + i用於流ί之積聚功率分配1238b可表達為: II503 l.doc •20- ⑶BucketFactor{r2PInflowin, FRABin )x T2Plnflowt (2). For the flow in the sub-frame "for the flow (the accumulation of power is divided into 1238b. Γ2Ρ/«/7ο> ν,, „ is used in the sub-frame η for streaming Current power allocation. 1238a. The expression corpse is used in the sub-frame π for the peak power distribution of the flow · 1238 c. „, F brother 4 „ „) is used to determine the limiting factor for the total available power 1 2 3 8 (i.e., by means of a function that allows the total available power 1238 for the stream to exceed the current power allocation 1238a for the rogue in the sub-frame π) in the sub-frame. The active bit stream is an estimate of the load level of sector 1232 and will be discussed in more detail below. JZ/ocai/cmAagger is the amplitude of the random term that causes the allocation level to be dithered to avoid synchronization problems, and ~ is in range The real value in [-1,1] evenly distributes the random number. In the sub-frame "+ i for the accumulation of power, the power distribution 1238b can be expressed as: II503 l.doc •20- (3)

BucketLeveli n+l = vaxailBucketLeveli n + T2PInflowi n - T2POutflowijn), BucketLevdSatt „+1) MPowi//⑽425為在子訊框n分攤至流z·的傳輸功率422 之部分。下文提供一用於例示性等式。 + /為在子訊框《 + /用於流ί之積聚功率分配 1238b的飽和位準1135 。 下文提供一用於 + Y之例示性等式。 Γ·2Ρ0Μί//ονμ,·,„ 425可表達為: (din \ TIP Outflowin = -^- χΤχΤ2Ρη (4) J ,>n {SumPayloadn) " 在上述等式(4)中,為來自包括於在子訊框《期間所傳 輸之子封包中的流之資料量。(子封包為在子訊框期間所 傳輸之封包的部分。)心》2户吵/〇<3£/„為之總和。TxT2P表 示傳輸訊務對導引通道功率之比率,且為在子訊框 «期間所傳輸之子封包的功率位準422。 可表達為:BucketLeveli n+l = vaxailBucketLeveli n + T2PInflowi n - T2POutflowijn), BucketLevdSatt „+1) MPowi//(10) 425 is the portion of the transmission power 422 that is allocated to the stream z· in the subframe n. An example is provided below for the exemplary equation. + / is the saturation level 1135b assigned to the accumulation power of the sub-frame "+ / for the stream ί 1135. An exemplary equation for + Y is provided below. Γ·2Ρ0Μί//ονμ,·, „ 425 It can be expressed as: (din \ TIP Outflowin = -^- χΤχΤ2Ρη (4) J ,>n {SumPayloadn) " In the above equation (4), the sub-packets transmitted from the period included in the sub-frame The amount of information in the stream. (The sub-packet is the part of the packet transmitted during the sub-frame.) The heart "2 households noisy / 〇 < 3 £ / „ for the sum. TxT2P represents the ratio of the transmission traffic to the pilot channel power, and The power level of the sub-packet transmitted during the subframe « can be expressed as:

BucketLevelSat^ =BucketLevelSat^ =

BurstDurationFactort x BucketFactor^TlPInflowtFRABT2PInflowin ijDwrai/owFaciori為對允許流ί·以峰值功率分配1238c 來傳輸之時間長度的限制。 自用於給定反向鏈路載波之AN 1304獲取用於AT 1306上之 115031.doc •21 · 1336195 流1316的當前功率分配1338aBurstDurationFactort x BucketFactor^TlPInflowtFRABT2PInflowin ijDwrai/owFaciori is a limit on the length of time allowed for the stream to be transmitted with the peak power allocation 1238c. The AN 1304 for a given reverse link carrier acquires the current power allocation 1338a for the 13031.doc •21 · 1336195 stream 1316 on the AT 1306.

、在某些實施財,獲取當前功率分配1338a可為兩步驟 過程。流資源可以分散方式藉由每—AT 13〇6來分配(自主 模式)或使用授權1374自位於AN 1304中之中心控制器或排 程器1340來分配。圖13說明Ατ 13〇6可藉以使用藉由 Π04所進行之網路資源分配的集中式控制的形式來獲取用 於流13 16之當前功率分配1338&的一方式。如圖所示, 1306可自執行於AN 1304上之排程器134〇接收一授權訊息 1342。授權訊息1342可包括一用於Ατ 13〇6上之某些或所 有"il 1316的當刖功率分配授權1374 »授權1374可為一資源 分配(而非每封包分配),其允許AN 13〇4提供資源分配更 新及改變。其亦可允許詳細Q0S資訊之頻帶内信號傳輸。 對於所接收之每一當前功率分配授權1374而言,AT 13〇6 將用於相應流13 16之當前功率分配n38a設定為等於當前 功率分配授權1374。授權1374分配及凍結功率分配歷時一In some implementations, obtaining the current power allocation 1338a can be a two-step process. Stream resources may be allocated in a decentralized manner by each AT 13〇6 (autonomous mode) or using an authorization 1374 from a central controller or scheduler 1340 located in the AN 1304. Figure 13 illustrates a manner in which Ατ 13〇6 can be used to obtain the current power allocation 1338& for stream 13 16 in the form of centralized control of network resource allocation by Π04. As shown, 1306 can receive an authorization message 1342 from scheduler 134 executing on AN 1304. The authorization message 1342 may include a power allocation grant 1374 for some or all of the "il 1316 on Ατ 13〇6. The authorization 1374 may be a resource allocation (rather than every packet allocation), which allows AN 13〇 4 Provide resource allocation updates and changes. It also allows for detailed signal transmission within the band of QOS information. For each current power allocation grant 1374 received, AT 13〇6 sets the current power allocation n38a for the corresponding stream 13 16 to be equal to the current power allocation grant 1374. Authorize 1374 to allocate and freeze power allocation for a duration of one

時間間隔。因此’ AN 1304在此時間間隔期間控制流資源 分配。 如上文所描述,流資源可以分散方式藉由每一 AT丨3〇6 來分配(自主模式)或使用授權1374自位於AN 13 04中之中 心控制器或排程器1340來分配。因此,第一步驟涉及判定 是否自AN 1304接收到用於流1316之當前功率分配授權 1374。若否’則AT 1306自主地判定用於流12 16之當前功 率分配1338a。換言之,AT 1306判定用於流1216之當前功 率分配1338a而未受到來自排程器1340之干預。此可稱作 -22- 115031.doc 1336195 自主模式。以下論述係關於使AT 1306自主地判定用於at 1306上之一或多個流13 16之當前功率分配1338&的例示性 方法。 自主地判定用於每一反向鍵路載波之一或多個流1ί16的當 前功率分配1238a 圖14說明在扇區1432内自AN 1404傳輸至AT 1406的反向 活動位元(RAB)1444。存取節點14〇4使用rab經由反向鏈 路而向其覆蓋區域内之AT 1406通知關於當前訊務活動 量。因此,RAB 1444為一過載指示。AT在決定是否因為 經由反向鏈路之高訊務負載而減小其訊務速率或因為經由 反向鏈路之低訊務負載而增加其訊務速率時併入此資訊。 RAB 1444可為兩個值中的一個:指示扇區1432當前繁忙之 第一值(例如,+1 ),或指示扇區1432當前閒置之第二值(例 如,-1)。如下文所解釋’ RAB 1444可用於判定用於AT 1206上之流1216的當前功率分配1238a。應注意,無論是 共用AT 1406還是跨越AT 1406,流1216皆觀察每一扇區中 之相同RAB 1444 »此可為在多流情況下定標良好之設計簡 化。 使用用於每一反向鏈路載波之短及長RAB估計來自主地判 定當前功率分配1238a 圖15說明可維持於AT 1506處以判定用於AT 1506上之一 或多個流1516之當前功率分配1238a的資訊。在所說明之 實施例中,每一流1516與RAB 1444之一,,快速"或"短期"估 計相關聯。此快速估計將在本文中稱作qrAB 1 546。下文 -23- H5031.doc 1336195 將描述一用於判定QRAB 1546之例示性方法β 每一流1516亦與扇區1232之較長期負載位準之估計相關 聯’該估計在本文中稱作FRAB 1548(其代表,,據波"rab 1444)。FRAB為與QRAB 1546類似之扇區負載的量測但 其具有更長之時間常數^因此,qRAB為相對瞬時的,而 FRAB 1548給出較長期之扇區負載資訊。FRAB i 為一 位於RAB 1444之兩個可能值之間的某處之實數,例如, + 1及-1。然而,其他數可用於RAB 1444之值。frab 1548 愈接近於指示扇區1432繁忙之RAB 1444的值,則扇區1432 被負载得愈沉重。相反地,FRAB 1548愈接近於指示扇區 1432閒置之RAB 1444的值,則扇區1432被負載得愈不沉 重。以下描述判定FRAB 1548之一實例。 每一流1516亦與一向上斜坡函數(upward以叫㈣ funCtlon)1550及一向下斜坡函數(d〇wnward funct10n)1552相關聯。與一特定流1516相關聯之向上斜坡 函數1550及向下斜坡函數1552為用於流1516之當前功率分 配1238a的函數。與流1516相關聯之向上斜坡函數1550係 用於判定用於流1516之當前功率分配1238&的增加。相反 地,與流1 51 6相關聯之向下斜坡函數丨552係用於判定用於 流1516之當前功率分配1238&的減小。在某些實施例中, 向上斜坡函數15 50及向下斜坡函數1552皆取決於FRAB 1548之值及用於流1516之當前功率分配i238a。因為向上 斜坡函數1550及向下斜坡函數1552取決於FRAB之值所 以其為負载依賴性斜坡函數。因此,frab允許將未負載 II503I.doc -24-time interval. Thus 'AN 1304 controls flow resource allocation during this time interval. As described above, the streaming resources may be allocated in a decentralized manner by each AT丨3〇6 (autonomous mode) or using an authorization 1374 from a central controller or scheduler 1340 located in AN 13 04. Therefore, the first step involves determining whether a current power allocation grant 1374 for stream 1316 has been received from AN 1304. If not, then AT 1306 autonomously determines the current power allocation 1338a for stream 12 16 . In other words, AT 1306 determines the current power allocation 1338a for stream 1216 without being interfered with by scheduler 1340. This can be called -22- 115031.doc 1336195 autonomous mode. The following discussion is directed to an exemplary method of having AT 1306 autonomously determine a current power allocation 1338 & for one or more streams 13 16 at at 1306. Autonomously determining the current power allocation 1238a for one or more of the reverse link carriers 1 Figure 16 illustrates the reverse activity bit (RAB) 1444 transmitted from the AN 1404 to the AT 1406 within the sector 1432. The access node 14〇4 uses rab to notify the AT 1406 in its coverage area of the current traffic activity via the reverse link. Therefore, RAB 1444 is an overload indication. The AT incorporates this information when deciding whether to reduce its traffic rate due to the high traffic load on the reverse link or to increase its traffic rate due to the low traffic load on the reverse link. The RAB 1444 can be one of two values: a first value (e.g., +1) indicating that the sector 1432 is currently busy, or a second value (e.g., -1) indicating that the sector 1432 is currently idle. The RAB 1444 can be used to determine the current power allocation 1238a for the stream 1216 on the AT 1206, as explained below. It should be noted that whether it is a shared AT 1406 or an AT 1406, stream 1216 observes the same RAB 1444 in each sector » This can be a simplified design for scaling in multiple streams. Using the short and long RAB estimates for each reverse link carrier to determine the current power allocation from the primary location 1238a. Figure 15 illustrates that it can be maintained at AT 1506 to determine the current power allocation for one or more of the flows 1516 on the AT 1506. 1238a information. In the illustrated embodiment, each stream 1516 is associated with one of the RABs 1444, a fast " or "short" estimate. This quick estimate will be referred to herein as qrAB 1 546. An exemplary method for determining QRAB 1546, β per first 1516, is also associated with an estimate of the longer term load level of sector 1232, which is referred to herein as FRAB 1548 (hereinafter) -23-H5031.doc 1336195 (hereinafter) Its representative, according to the wave "rab 1444). FRAB is a measure of sector load similar to QRAB 1546 but has a longer time constant ^ Therefore, qRAB is relatively instantaneous, while FRAB 1548 gives longer-term sector load information. FRAB i is a real number somewhere between two possible values of RAB 1444, for example, + 1 and -1. However, other numbers can be used for the value of RAB 1444. The closer frab 1548 is to the value indicating the busy RAB 1444 of sector 1432, the more heavily sector 1432 is loaded. Conversely, the closer FRAB 1548 is to the value of RAB 1444 indicating that sector 1432 is idle, the less heavily sector 1432 is loaded. The following description determines one example of FRAB 1548. Each first-class 1516 is also associated with an upward ramp function (upward called (four) funCtlon) 1550 and a downward ramp function (d〇wnward funct10n) 1552. The up ramp function 1550 and down ramp function 1552 associated with a particular stream 1516 is a function of the current power allocation 1238a for stream 1516. The up ramp function 1550 associated with stream 1516 is used to determine the increase in current power allocation 1238& for stream 1516. Conversely, the downward ramp function 丨 552 associated with stream 1 51 6 is used to determine the reduction in current power allocation 1238 & for stream 1516. In some embodiments, both the up ramp function 15 50 and the down ramp function 1552 are dependent on the value of FRAB 1548 and the current power allocation i238a for stream 1516. Because the up ramp function 1550 and the down ramp function 1552 depend on the value of FRAB as a load dependent ramp function. Therefore, the frab allows unloaded II503I.doc -24-

< S 1336195 之T2P斜坡動力學自負載之穩態T2p動力學退耦。當扇區 . 未負載時,需要較快之斜坡來快速且平滑地填充扇區容 - 量。當扇區負載時,需要較慢之斜坡來減小熱升(Rise_ 〇ver-Thermal,RoT)變化。在一扇區處之R〇T被定總 收功率對熱雜訊功率之比例。此數量為可量測的並自校 正,且提供由每一 AT 1506所觀察之干擾的估計。在其他 方法中,使用一固定斜坡,從而在此等衝突需求之間導致 權衡。 ® 在網路中為每一流15 16界定向上斜坡函數1550及向下斜 坡函數1552,且其可自控制該流之AT 15〇6的AN 14〇4下 載。向上斜坡函數及向下斜坡函數具有流之當前功率分配 1238a作為其自變數(augument)。向上斜坡函數155〇在本文 中有時將稱作gu,且向下斜坡函數1552在本文中有時將稱 作gd吾人將gu/gd之比率(亦為當前功率分配1238a之函 數)稱作需求或優先權函數。可證實,以資料及存取終端 魯 機功率可用性為條件,反向鏈路MAC(RLMac)方法收斂為 用於每一流1516之當前功率分配1238&,使得所有流需求 函數值在其流之分配處被採用時相等。藉由使用此事實並 明智地設計流需求函數,有可能與可由集中式排程器所達 成之机布局及需求對資源分配之一般映射相同的一般映 射。但需求函數方法以最小控制信號傳輸並以分散方式來 達成此一般排程能力。向上及向下斜坡函數允許輕微負載 之扇區中之快速的訊務對導引通道功率(T2p)增加、扇區 令$之平滑編入(filin& in)、隨著扇區負載增加時之較低斜 ^ 15031 .doc -25· 1336195 坡及T2P動力學在負載與未負載扇區之間的退耦。此處, T2P係用作扇區資源。對於一固定終止目標,T2P以流傳 輸速率而約略線性地增加。 AT 1506中用於判定用於每一反向鏈路載波之QRAB 1646 及FRAB 1648的組件 圖16為說明AT 1606中可用於判定QRAB 1646及FRAB 1648之例示性功能組件的方塊圖。如圖所示,AT 1606可 包括一 RAB解調變組件1654、一映射器1656、第一及第二 單極IIR濾波器1658、1660及一限制器件1662。 RAB 1644跨越通信通道1664而自AN 1604傳輸至AT 1606。RAB解調變組件1654使用熟習此項技術者已知之標 準技術來解調變所接收之信號。RAB解調變組件1654輸出 一日誌似然比(LLR) 1666。映射器1656將LLR 1666作為輸 入並將LLR 1666映射至一介於RAB 1644之可能值之間的 值(例如,+1及-1),其為用於彼槽之所傳輸的RAB之估 計。 將映射器1656之輸出提供至第一單極HR濾波器1658。 第一 IIR濾波器1658具有一時間常數^。將第一 HR濾波器 1658之輸出提供至一限制器件1662。限制器件1662將第一 IIR濾波器1658之輸出轉換為對應mrab 1644之兩個可能 值的兩個可能值中之一個。舉例而言,若RAB 1644為-1或 + 1 ’則限制器件1662將第一 IIR濾波器1658之輸出轉換為 -1或+ 1。限制器件1662之輸出為QRAB 1646。選擇時間常 數% ’使得QRAB 1646表示自AN 1604所傳輸之RAB 1644< S 1336195 T2P slope dynamics decoupling from steady-state T2p dynamics of the load. When the sector is unloaded, a faster ramp is needed to quickly and smoothly fill the sector capacity. When the sector is loaded, a slower slope is needed to reduce the Rise_ 〇ver-Thermal (RoT) change. R 〇 T at a sector is determined as the ratio of the total received power to the thermal noise power. This number is measurable and self-correcting and provides an estimate of the interference observed by each AT 1506. In other methods, a fixed slope is used, resulting in a trade-off between these conflicting needs. ® defines an up ramp function 1550 and a down ramp function 1552 for each stream 15 16 in the network, and it can be downloaded from the AN 14〇4 of the AT 15〇6 that controls the stream. The up ramp function and the down ramp function have the current power allocation 1238a of the stream as its augument. The upward ramp function 155 有时 will sometimes be referred to herein as gu, and the downward ramp function 1552 will sometimes be referred to herein as gd. The ratio of gu/gd (also a function of current power allocation 1238a) is called demand. Or priority function. It can be confirmed that the reverse link MAC (RLMac) method converges to the current power allocation 1238& for each stream 1516, so that all flow demand function values are allocated in its flow, subject to the data and access terminal power availability. When the place is adopted, it is equal. By using this fact and judiciously designing the flow demand function, it is possible to have the same general mapping as the general mapping of resource allocations that can be achieved by a centralized scheduler. However, the demand function method transmits with minimal control signals and achieves this general scheduling capability in a decentralized manner. The up and down ramp functions allow fast traffic in the sector with a slight load to increase the pilot channel power (T2p), the sector to smooth the fit (filin& in), as the sector load increases Low skew ^ 15031 .doc -25· 1336195 Slope and T2P dynamics decoupling between load and unloaded sectors. Here, T2P is used as a sector resource. For a fixed termination target, T2P increases approximately linearly at the rate of streaming. Components for Determining QRAB 1646 and FRAB 1648 for Each Reverse Link Carrier in AT 1506 FIG. 16 is a block diagram illustrating exemplary functional components of AT 1606 that may be used to determine QRAB 1646 and FRAB 1648. As shown, the AT 1606 can include an RAB demodulation component 1654, a mapper 1656, first and second monopole IIR filters 1658, 1660, and a limiting device 1662. RAB 1644 is transmitted from AN 1604 to AT 1606 across communication channel 1664. The RAB demodulation component 1654 uses a standard technique known to those skilled in the art to demodulate the received signal. The RAB Demodulation Component 1654 outputs a Log Likelihood Ratio (LLR) 1666. Mapper 1656 takes LLR 1666 as an input and maps LLR 1666 to a value (e.g., +1 and -1) between the possible values of RAB 1644, which is an estimate of the transmitted RAB for the slot. The output of mapper 1656 is provided to a first monopolar HR filter 1658. The first IIR filter 1658 has a time constant ^. The output of the first HR filter 1658 is provided to a limiting device 1662. Restriction device 1662 converts the output of first IIR filter 1658 to one of two possible values corresponding to two possible values of mrab 1644. For example, if RAB 1644 is -1 or + 1 ', then limiting device 1662 converts the output of first IIR filter 1658 to -1 or +1. The output of the limiting device 1662 is QRAB 1646. Select time constant % ' such that QRAB 1646 represents RAB 1644 transmitted from AN 1604

* S 115031.doc -26- 1336195 之當前值為何值的估計。用於時間常數、之值可(例如)為 四個時間槽。(^講可靠性係藉由IIR濾波器1658之渡波來 改良。在一實例中,可在每一槽將qRab更新一次。 亦將映射器1656之輸出提供至一具有時間常數〜之第二 單極11幻慮;皮器_。第二IIR遽波器166〇之輸出為frab 1648。時間常數1更長於時間常數%。一用於時間常數^之 例示性值為384個時間槽。 不將第二IIR濾波器1660之輸出提供至限制器件。因 此,如上文所描述,FRAB 1648為一位mRAB 1644之指示 扇區1432繁忙之第一值與RAB 1644之指示扇區1432閒置之 第二值之間的某處之實數。 圖17說明一用於判定用於AT 12〇6上之流1216之當前功 率分配1238a的例示性方法17〇〇。方法17〇〇之步驟17〇2涉 及判定與流1216相關聯之qRAB 1546的值。在步驟口⑸ 中,判定QRAB 1546是否等於一繁忙值(亦即,指示扇區 M32當前繁忙之值)e gQRAB 1546等於—繁忙值,則在 步驟1706中減小當前功率分配1238a,亦即,在時間”用於 流1216之當前功率分配1238a小於在時間用於流1216之 當前功率分配1238a。可使用為流1216所界定之向下斜坡 函數1 5 5 2來計算減小之量值。 若QRAB 1546等於一閒置值,則在步驟17〇8中增加當前 功率分配1238a,亦即,在當前時間間隔期間用於流丨216 之當前功率分配丨238&大於在大多數最近時間間隔期間用 於流12丨6之當前功率分配1238a。可使用為流i2i6所界定 •27· 115031.doc 1336195 一優先權或需求函數(T2PInflow之函數),其為T2Pup與 T2Pdn函數之比率〇 為月良矛务扇區導弓|功率對 比其他扇區之導引功率的量測。在某些實施例中,其為服 務扇區FL導引功率對其他扇區之導引功率的比率。 為一將導引強度映射至斜坡函數之T2P自變 數中之偏移的函數且可自AN下載。Τ2Ρ表示訊務對導引功 率之比率。該偏移係指訊務通道相對於導引之增益。以此 方式,可基於如由尸«忌變數所量測之AT在網路 中之位置來調整AT處之流的優先權。 當前功率分配123 8a可表達為: ' T2PFilterTCt \xT2POuiflowiη_λ - ⑻* S 115031.doc -26- 1336195 An estimate of the current value of the value. For the time constant, the value can be, for example, four time slots. (^ Reliability is improved by the IIR filter 1658. In one example, qRab can be updated once per slot. The output of mapper 1656 is also provided to a second with time constant ~ The output of the second IIR chopper 166 is frab 1648. The time constant 1 is longer than the time constant %. An exemplary value for the time constant ^ is 384 time slots. The output of the second IIR filter 1660 is provided to the limiting device. Thus, as described above, FRAB 1648 is the second value of one of the mRAB 1644 indicating that the sector 1432 is busy and the indicating sector 1432 of the RAB 1644 is idle. A real number somewhere in between. Figure 17 illustrates an exemplary method 17 for determining the current power allocation 1238a for stream 1216 on AT 12〇6. Step 17 of method 17 involves decision and The value of qRAB 1546 associated with stream 1216. In step (5), it is determined whether QRAB 1546 is equal to a busy value (ie, indicating that the sector M32 is currently busy) e gQRAB 1546 is equal to the busy value, then in step 1706 Decrease the current power allocation 1238a, ie, at the time The current power allocation 1238a for stream 1216 is less than the current power allocation 1238a for stream 1216 at time. The reduced magnitude value can be calculated using the downward ramp function 1 5 5 2 defined by stream 1216. If QRAB 1546 Equal to an idle value, the current power allocation 1238a is added in step 17〇8, that is, the current power allocation 丨 238 & for the rogue 216 during the current time interval is greater than the stream 12 during most recent time intervals.当前6 current power allocation 1238a. Can be used as defined by stream i2i6 • 27· 115031.doc 1336195 A priority or demand function (a function of T2PInflow), which is the ratio of T2Pup to T2Pdn function 〇 is a good target sector The pilot power is measured against the pilot power of other sectors. In some embodiments, it is the ratio of the pilot sector FL pilot power to the pilot power of other sectors. The function of the offset to the T2P argument of the ramp function and can be downloaded from AN. Τ2Ρ represents the ratio of the traffic to the pilot power. The offset is the gain of the traffic channel relative to the pilot. based on A dead «avoid the measured variables of the network AT in the position adjusted at the current priority ilk AT 123 8a power allocation may be expressed as: 'T2PFilterTCt \ xT2POuiflowiη_λ - ⑻.

T2PInflowin = ί—1—. \T2PFilterTC x TlPInflow^ J AT2PInflowi n 如前述等式所說明,當達到飽和位準1135且將斜坡設定 為零時,當前功率分配1238a按指數規律地衰變。此允許 用於叢發訊務源之當前功率分配1238a之值的持續性,對 於該等叢發訊務源而言,持續時間應長於典型封包間達時 間(interarrival time) 〇 在某些實施例中,為AT 1206之有效集合中之每一扇區 估計一 QRAB值1546。若QRAB對於AT之有效集合中的任 何扇區皆為繁忙,則減小當前功率分配1238a。若QRAB對 於AT之有效集合中的所有扇區皆為閒置,則增加當前功率 分配1238a。在替代實施例中,可界定另一參數QRABps。 II503 丨.doc -29- 1336195 對於QRABps,考慮所量測之導引強度。(導引強度為服務 扇區導引功率對比其他扇區之導引功率的量測。在某些實 施例中,其為服務扇區FL導引功率對其他扇區之導引功率 的比率。)視AT 1206對AT 1206有效集合中之扇區中之反 向鏈路干擾的貢獻而定,QRABps可用於解釋短期扇區負 載。若QRAB對於一滿足一或多個以下條件之扇區s為繁 忙,則將QRABps設定為繁忙值:(1)扇區s為用於存取終端 機之前向鏈路服務扇區;(2)來自扇區s之DRCLock位元失 鎖且扇區s之卩丨1(^81^1^11111,5大於一臨限值;(3)來自扇區s 之DRCLock位元鎖定且扇區s之PilotStrengthn,s大於一臨限 值。否則,將QRABps設定為一間置值。(AN 1204可使用 DRCLock通道而向AT 1206通知AN 1204是否成功地接收到 由AT 1206所發送之DRC資訊。舉例而言,經由DRCLock 通道而發送DRCLock位元(例如,指示"是"或"否"。))在判 定QRABps之實施例中,當前功率分配1238a可在QRABps 閒置時增加,且可在QRABPS繁忙時減小。 用於每一反向鏈路載波之集中式控制 圖18說明一涉及集中式控制之實施例,其中AT 1806將 一請求訊息1866發送至AN 1804上之排程器1840。圖18亦 說明將一授權訊息1842發送至AT 1806之排程器1840。在 某些實施例中,排程器1840可主動地將授權訊息1842發送 至AT 1806。或者,排程器1840可回應於一由AT 1806所發 送之請求訊息1866而將授權訊息1842發送至AT 1806。請 求訊息1 866含有AT功率頂部空間資訊以及每流佇列長度資 115031.doc • 30· 1336195 訊。 圖19說明可維持AT 1906處以使AT 1906判定何時將請求 訊息1866發送至AN 1 804的資訊。如圖所示’ AT 1906可與 一請求比率1968相關聯。請求比率1968指示在反向訊務通 道2〇8上所發送之請求訊息大小1866對在反向訊務通道208 上所發送之資料的比率。在某些實施例中,當請求比率 1968減小至低於某一臨限值時,則AT 19〇6將請求訊息 1866發送至排程器1840。 AT 1906亦可與一請求間隔1970相關聯。請求間隔1970 指示自將最終請求訊息1866發送至排程器1840以來的時 段。在某些實施例中,當請求間隔增加至高於某一臨 限值時,則AT 1906將請求訊息1866發送至排程器1840。 用以觸發請求訊息1 866之兩種方法亦可被共同使用(亦 即,可在任一方法引起請求訊息1866時將其發送)。 圖20說明在扇區2032内執行於AN 2004上之排程器2040 與AT 2006之間的例示性相互作用。如圖20所示,排程器 2040可判定用於扇區2032内之AT 2006之子集2072的當前 功率分配授權1374。可為每一 AT 2006判定一獨立當前功 率分配授權1374。在子集2072中之AT 2006包括一個以上 之流1216之處,排程器2040可判定用於每一 AT 2006上之 某些或所有流12 16的獨立當前功率分配授權1374。排程器 2040將授權訊息2042週期性地發送至子集2072中之AT 2006 »在一實施例中,排程器2040可能不判定用於扇區 2032内之不為子集2072之一部分的AT 2006之當前功率分 31 115031.doc 1336195 配授權1374。實情為,扇區2032中之剩餘AT 2006自主地 判定其自身之當前功率分配1〇38a。授權訊息2〇42可包括 -用於某些或全部當前功率分配授權1374之保持週期。用 於當前功率分配授權1374之保持週期指示Ατ 2〇〇6將用於 相應流12 16之當前功率分配1238&保持於由當前功率分配 授權1374所指定之位準處多久。 根據圖20所說明之方法,可能不將排程器2〇4〇設計為填 充扇區2032中之所有容量。實情為,排程器2〇4〇判定用於 子集2072内之AT 2006的當前功率分配1038&,且接著藉由 剩餘AT 2006來有效地使用剩餘扇區2〇32而無來自排程器 2040之干預。子集2072可隨時間而改變,且甚至可隨每一 授權訊息2042而改變。又’將授權訊息2〇42發送至Ατ 2006之某子集2072的決策亦可藉由任何數目之外部事件來 觸發’該等外部事件包括偵測到某些流1216未滿足某些 QoS需求。 圖21說明執行於AN 2104上之排程器2140與AT 2106之間 的另一例示性相互作用。在某些實施例中,若允許Ατ 2106判定用於AT 2106上之流2116的當前功率分配2138a, 則每一當前功率分配2138a將隨時間而收斂至一穩態值。 舉例而言’若一 AT 2106進入一具有一具有待傳輸之資料 之流2116的未負載扇區2132,則用於彼流2116之當前功率 分配213 8a將向上斜變(ramp up),直至彼流2116吸收整個 扇區2132之輸送量為止。然而,可能花費一段時間來發生 此情況。 115031.doc -32- 【:S ) 1336195 一替代方法係使排程器2140判定每一 AT 2106中之流將 最終達到之穩態值之估計。排程器2140可接著將一授權訊 息2142發送至所有AT 2106 »在授權訊息2142中,如由排 程器2140所判定,將用於流2116之當前功率分配授權2174 設定為等於用於彼流2116之穩態值之估計。一旦接收到授 權訊息2M2,AT 21 06就將用於AT 2 106上之流2116的當前 功率分配213 8a設定為等於授權訊息2142中之穩態估計 2174。一旦將此完成’就可隨後允許Ατ 21〇6追蹤系統條 件之任何改變且自主地判定用於流2116之當前功率分配 2138a,而無來自排程器2140之進一步干預。 圖22說明自AN 2204上之排程器2240傳輸至AT 2206之授 權訊息2242的另一實施例。如前所述’授權訊息2242包括 一用於AT 22 06上之一或多個流2216的當前功率分配授權 2274 ^此外,授權訊息包括一用於某些或所有當前功率分 配授權2274之保持週期2276。 授權訊息2242亦包括一用於AT 2206上之某些或所有流 2216的積聚功率分配授權2278。一旦接收到授權訊息 2242,AT 2206就將用於AT 2206上之流2216的積聚功率分 配2238b設定為等於用於授權訊息2242中之相應流2216的 積聚功率分配授權2278 » 圖23說明某些實施例中可儲存於AT 23〇6處之功率分佈 2380。功率分佈2380可用於判定由Ατ 23〇6傳輸至an 之封包的有效負載大小420及功率位準422。 功率分佈2380包括複數個有效負載大小232〇。包括於功 U5031.doc •33- 1336195 率分佈2380中之有效負載大小2320為用於由AT 2306所傳 輸之封包524的可能有效負載大小2320。 功率分佈23 80中之每一有效負載大小2320與一用於每一 可能傳輸模式之功率位準2322相關聯。在所說明之實施例 中,每一有效負載大小2320與一高容量功率位準2322a及 一低等待時間功率位準2322b相關聯。高容量功率位準 2322a為用於具有相應有效負載大小2320之高容量封包 524a的功率位準。低等待時間功率位準2322b為用於具有 相應有效負載大小2320之低等待時間封包524b的功率位 準。 圖24說明可儲存於AT 2406處之複數個傳輸條件2482。 在某些實施例中,傳輸條件2482影響用於封包524之有效 負載大小420及功率位準422之選擇。 傳輸條件2482包括一分配功率條件2484。分配功率條件 24 84大體上係關於確保AT 2406不使用多於向其所分配之 功率的功率。更具體言之,分配功率條件2484為封包524 之功率位準422不超過用於AT 2406之總可用功率1034。上 文論述了用於判定AT 2406之總可用功率1034之各種例示 性方法。 傳輸條件2482亦包括一最大功率條件2486。最大功率條 件2486為封包524之功率位準422不超過已為AT 2406所指 定之最大功率位準。 傳輸條件2482亦包括一資料條件2488。資料條件2488大 體上係關於確保封包524之有效負載大小420鑒於AT 2406 115031.doc • 34·T2PInflowin = ί—1—. \T2PFilterTC x TlPInflow^ J AT2PInflowi n As indicated by the foregoing equation, when the saturation level 1135 is reached and the ramp is set to zero, the current power distribution 1238a decays exponentially. This allows for the persistence of the value of the current power allocation 1238a for the burst source, for which the duration should be longer than the typical interarrival time. In some embodiments A QRAB value of 1546 is estimated for each of the effective sets of ATs 1206. If the QRAB is busy for any sector in the active set of ATs, then the current power allocation 1238a is reduced. If the QRAB is idle for all sectors in the active set of ATs, then the current power allocation 1238a is incremented. In an alternate embodiment, another parameter QRABps may be defined. II503 丨.doc -29- 1336195 For QRABps, consider the measured pilot strength. (The pilot strength is a measure of the pilot power of the serving sector versus other sectors. In some embodiments, it is the ratio of the pilot sector FL pilot power to the pilot power of other sectors. Depending on the contribution of AT 1206 to reverse link interference in sectors in the active set of AT 1206, QRABps can be used to account for short-term sector loading. If the QRAB is busy for a sector s that satisfies one or more of the following conditions, then QRABps is set to a busy value: (1) the sector s is the serving sector before accessing the terminal; (2) The DRCLock bit from sector s is out of lock and sector s is 卩丨1 (^81^1^11111, 5 is greater than a threshold; (3) DRCLock bit from sector s is locked and sector s PilotStrengthn, s is greater than a threshold. Otherwise, QRABps is set to a value. (AN 1204 can use the DRCLock channel to inform AT 1206 whether AN 1204 successfully received the DRC information sent by AT 1206. For example That is, the DRCLock bit is sent via the DRCLock channel (eg, indicating "Yes" or "No"))) In the embodiment of determining QRABps, the current power allocation 1238a may be increased when QRABps is idle, and may be The QRABPS is reduced at busy time. Centralized Control for Each Reverse Link Carrier Figure 18 illustrates an embodiment involving centralized control in which the AT 1806 sends a request message 1866 to the scheduler 1840 on the AN 1804. Figure 18 also illustrates the dispatch of an authorization message 1842 to the scheduler 1840 of the AT 1806. In some embodiments, scheduler 1840 can actively send authorization message 1842 to AT 1806. Alternatively, scheduler 1840 can send authorization message 1842 to a request message 1866 sent by AT 1806 to AT 1806. Request message 1 866 contains AT power headspace information and a per-stream queue length of 115031.doc • 30· 1336195. Figure 19 illustrates that AT 1906 can be maintained to cause AT 1906 to determine when to send request message 1866 to AN 1 Information of 804. As shown, 'AT 1906 can be associated with a request ratio 1968. The request ratio 1968 indicates that the request message size 1866 sent on the reverse traffic channel 2〇8 is on the reverse traffic channel 208. The ratio of the transmitted data. In some embodiments, when the request ratio 1968 is reduced below a certain threshold, the AT 19〇6 sends the request message 1866 to the scheduler 1840. The AT 1906 can also Associated with a request interval 1970. The request interval 1970 indicates a time period since the final request message 1866 was sent to the scheduler 1840. In some embodiments, when the request interval increases above a certain threshold, the AT 1906 will Request message 1866 is sent to scheduler 1840. The two methods used to trigger request message 1 866 can also be used in common (i.e., can be sent when either method causes request message 1866). FIG. 20 illustrates an exemplary interaction between scheduler 2040 and AT 2006 executing on AN 2004 within sector 2032. As shown in FIG. 20, scheduler 2040 can determine a current power allocation grant 1374 for a subset 2072 of ATs 2006 within sector 2032. An independent current power distribution grant 1374 can be determined for each AT 2006. Where AT 2006 in subset 2072 includes more than one stream 1216, scheduler 2040 can determine an independent current power allocation grant 1374 for some or all of the streams 12 16 on each AT 2006. The scheduler 2040 periodically transmits the grant message 2042 to the AT 2006 in the subset 2072. In an embodiment, the scheduler 2040 may not determine an AT for the portion of the sector 2032 that is not part of the subset 2072. The current power of 2006 is 31 115031.doc 1336195 with an authorization of 1374. The fact is that the remaining AT 2006 in sector 2032 autonomously determines its own current power allocation 1〇38a. The authorization message 2 〇 42 may include - a hold period for some or all of the current power allocation grants 1374. The hold period indication Ατ 2〇〇6 for the current power allocation grant 1374 will be used to maintain the current power allocation 1238& of the corresponding stream 12 16 at the level specified by the current power allocation grant 1374. According to the method illustrated in Figure 20, the scheduler 2〇4〇 may not be designed to fill all of the capacity in the sector 2032. The fact is that the scheduler 2〇4〇 determines the current power allocation 1038& for the AT 2006 in the subset 2072, and then effectively uses the remaining sectors 2〇32 by the remaining AT 2006 without the slave scheduler. 2040 intervention. Subset 2072 can change over time and can even change with each authorization message 2042. Again, the decision to send the authorization message 2〇42 to a subset 2072 of Ατ 2006 can also be triggered by any number of external events. The external events include detecting that certain flows 1216 do not satisfy certain QoS requirements. Figure 21 illustrates another exemplary interaction between scheduler 2140 and AT 2106 performed on AN 2104. In some embodiments, if Ατ 2106 is allowed to determine the current power allocation 2138a for stream 2116 on AT 2106, then each current power allocation 2138a will converge to a steady state value over time. For example, if an AT 2106 enters an unloaded sector 2132 having a stream 2116 with data to be transmitted, the current power allocation 213 8a for the stream 2116 will ramp up until the other Stream 2116 absorbs the throughput of the entire sector 2132. However, it may take a while for this to happen. 115031.doc -32- [:S ) 1336195 An alternative method is to cause scheduler 2140 to determine an estimate of the steady state value that each stream in AT 2106 will eventually reach. The scheduler 2140 can then send an authorization message 2142 to all ATs 2106 » in the grant message 2142, as determined by the scheduler 2140, setting the current power allocation grant 2174 for the stream 2116 equal to for the stream. Estimation of the steady state value of 2116. Upon receipt of the grant message 2M2, the AT 21 06 sets the current power allocation 213 8a for the stream 2116 on the AT 2 106 to be equal to the steady state estimate 2174 in the grant message 2142. Once this is done, then Ατ 21〇6 can be allowed to track any changes in system conditions and autonomously determine the current power allocation 2138a for stream 2116 without further intervention from scheduler 2140. Figure 22 illustrates another embodiment of an authorization message 2242 transmitted from the scheduler 2240 on the AN 2204 to the AT 2206. As previously described, the 'authorization message 2242 includes a current power allocation grant 2274 for one or more streams 2216 on the AT 22 06. Further, the grant message includes a hold period for some or all of the current power allocation grants 2274. 2276. The grant message 2242 also includes an accumulated power allocation grant 2278 for some or all of the flows 2216 on the AT 2206. Upon receiving the grant message 2242, the AT 2206 sets the accumulated power allocation 2238b for the stream 2216 on the AT 2206 to be equal to the accumulated power allocation grant 2278 for the corresponding stream 2216 in the grant message 2242 » Figure 23 illustrates some implementations In the example, the power distribution 2380 can be stored at AT 23〇6. The power distribution 2380 can be used to determine the payload size 420 and power level 422 of the packet transmitted by Ατ 23〇6 to an. Power distribution 2380 includes a plurality of payload sizes 232 〇. The payload size 2320 included in the capability U5031.doc • 33 - 1336195 rate distribution 2380 is the possible payload size 2320 for the packet 524 transmitted by the AT 2306. Each of the power distributions 2380 is associated with a power level 2322 for each possible transmission mode. In the illustrated embodiment, each payload size 2320 is associated with a high capacity power level 2322a and a low latency power level 2322b. The high capacity power level 2322a is the power level for the high capacity packet 524a having the corresponding payload size 2320. The low latency power level 2322b is the power level for the low latency packet 524b having a corresponding payload size 2320. FIG. 24 illustrates a plurality of transmission conditions 2482 that may be stored at AT 2406. In some embodiments, transmission condition 2482 affects the selection of payload size 420 and power level 422 for packet 524. Transmission condition 2482 includes a distributed power condition 2484. The power allocation condition 24 84 is generally related to ensuring that the AT 2406 does not use more power than the power allocated to it. More specifically, the allocated power condition 2484 is that the power level 422 of the packet 524 does not exceed the total available power 1034 for the AT 2406. Various illustrative methods for determining the total available power 1034 of the AT 2406 are discussed above. Transmission condition 2482 also includes a maximum power condition 2486. The maximum power condition 2486 is that the power level 422 of the packet 524 does not exceed the maximum power level already specified for the AT 2406. Transmission condition 2482 also includes a data condition 2488. The data condition 2488 is generally related to ensuring the payload size of the packet 524. 420 in view of AT 2406 115031.doc • 34·

S 1336195 之總可用功率1034以及AT 2406當前可用於傳輸之資料量 而不太大。更具體言之,資料條件2488為在功率分佈2380 中不存在對應於用於封包524之傳輸模式之較低功率位準 2322並能夠載運以下兩者之較小者的有效負載大小2320 : (1)當前可用於傳輸之資料量;及(2)用於AT 2406之總可用 功率1034所對應之資料量。 以下提供傳輸條件2482之數學描述。分配功率條件2484 可表達為:The total available power of S 1336195 is 1034 and the amount of data that AT 2406 is currently available for transmission is not too large. More specifically, the data condition 2488 is that there is no lower power level 2322 in the power distribution 2380 corresponding to the lower power level 2322 for the transmission mode of the packet 524 and can carry the smaller of the two of the following: 2 The amount of data currently available for transmission; and (2) the amount of data for the total available power 1034 of the AT 2406. A mathematical description of the transmission condition 2482 is provided below. The assigned power condition 2484 can be expressed as:

TxT2PNominalPS m < ^ieF {PotentialTIPOutflowi TM ) ⑼ 為用於有效負載大小尸5及傳輸模式 ΓΜ之功率位準2322。F為流集合418。 最大功率條件2486可表達為: max{TxT2PPreTransitionPS m,TxT2PPostTransitionPsni)< TxT2Pmax (l〇) 在某些實施例中,在封包524之傳輸期間的某點處允許 封包524之功率位準422自第一值轉變為第二值。在該等實 施例中,在功率分佈2380中所指定之功率位準2322包括一 轉變前值(pre-transition value)及一轉變後值(posttransition value) 。 rjcriPPreTVcmsz'iz’owp&Tw為 用於有 效負載 大小 及傳輸模式 ΓΜ之轉變前值。 户尸為用於有效負載大小尸S及傳輸模 式:ΓΜ之轉變後值。為對於AT 206所界定之最大 功率位準,且可為由AT 206所量測之PilotStrength的函 115031.doc -35- 1336195 ' 數。PilotStrength為服務扇區導引功率對比其他扇區之導 引功率的量測。在某些實施例中,其為服務扇區FL導引功 率對其他扇區之導引功率的比率。其亦可用於控制AT 206 自主地執行之向上及向下斜坡。其亦可用於控制 ' TxT2Pmax,使得在不良幾何形狀中(例如,在扇區之邊緣 處)之AT 206可限制其最大傳輸功率,以避免在其他扇區 中產生非吾人所樂見之干擾。在一實施例中,此可藉由基 於前向鏈路導引強度來調整gu/gd斜坡而得以達成。 φ 在某些實施例中,資料條件2488為在功率分佈2380中不 存在對應於用於封包524之傳輸模式之較低功率位準2322 並能夠載運由下式所給出之大小的有效負載之有效負載大 小 2320 : /e/r min^ n, T2PConversionFactorm x PotentialT2POutflowi m ) (11) 在等式(11)中,4,„為來自包括於在子訊框《期間所傳輸 之子封包中之流/(2616)的資料量。表達式 T2PConversionFactormxPotentialT2POutflowi:m 為用於氣 i 之可傳輪負 料,亦即,用於AT 2406之總可用功率1034所對應之資料 量。:TZPConvem'onFaciorT'M為一用於將用於流 ^(2616)之總 可用功率1238轉換為一資料位準之轉換因子。 圖25說明可由AT 206執行以判定用於封包524之有效負 載大小420及功率位準422的例示性方法2500。步驟2502涉 及自功率分佈2380選擇一有效負載大小2320。步驟2504涉 及識別與用於封包524之傳輸模式之所選有效負載大小 11503I.doc -36- <:S ) 1336195 2320相關聯的功率位準2322。舉例而言,若封包524待以 高容量模式來傳輸,則步驟25〇4涉及識別與所選有效負載 大小2320相關聯之高容量功率位準2322a。相反地,若封 包待以低等待時間模式來傳輸,則步驟25()4涉及識別與所 選有效負載大小2320相關聯之低等待時間功率位準 2322b 〇 步驟2506涉及:若封包524係以所選有效負載大小232〇 及相應功率位準2322來傳輸,則判定是否滿足傳輸條件 2482。若在步驟2506處判定滿足傳輸條件2482,則在步驟 2508處將所選有效負載大小232〇及相應功率位準^。傳達 至實體層312。 ♦在步驟2506處判定未滿足傳輸條件2482,則在步驟 2510處自功率分佈2380選擇一不同有效負載大小232〇。方 法2500接著返回至步驟2504且如上文所描述而繼續進行。 與多流分配相關聯之基礎設計機制為總可用功率等於用 於存取終端機2606中之每一流之可用功率的總和。此可作 用良好,直至存取終端機2606自身由於硬體限制(pA頂部 空間受限)或由於TxT2Pmax限制而用盡傳輸功率。當傳輸 功率受限時’存取終端機2606中流功率分配之進一步仲裁 係必要的。如上文所論述,當不存在功率限制時,gu/gd 需求函數經由RAB及流斜坡之正規函數而判定每一流之當 前功率分配。 在AT 2606功率受限之情況下,一用以設定流2616分配 之方法係將AT 2606功率限制考慮為嚴格類似於扇區功率 115031.doc •37· 1336195TxT2PNominalPS m < ^ieF {PotentialTIPOutflowi TM ) (9) is the power level 2322 for payload size 5 and transmission mode. F is a stream set 418. The maximum power condition 2486 can be expressed as: max {TxT2PPreTransitionPS m, TxT2PPostTransitionPsni) < TxT2Pmax (l〇) In some embodiments, the power level 422 of the packet 524 is allowed to pass from the first point at some point during the transmission of the packet 524. The value is converted to a second value. In these embodiments, the power level 2322 specified in the power distribution 2380 includes a pre-transition value and a post transition value. rjcriPPreTVcmsz'iz’owp&Tw is the pre-transition value for the effective load size and transmission mode. The corpse is used for the payload size S and the transmission mode: the post-transition value. It is the maximum power level defined for AT 206 and may be the number of the PilotStrength letter 115031.doc -35 - 1336195 ' measured by AT 206. PilotStrength measures the pilot power of the serving sector versus the pilot power of other sectors. In some embodiments, it is the ratio of the serving sector FL steering power to the pilot power of the other sectors. It can also be used to control the up and down ramps that the AT 206 performs autonomously. It can also be used to control 'TxT2Pmax, such that AT 206 in poor geometry (e.g., at the edge of a sector) can limit its maximum transmit power to avoid interference in other sectors that are not desirable. In one embodiment, this can be achieved by adjusting the gu/gd ramp based on the forward link steering strength. φ In some embodiments, data condition 2488 is that there is no lower power level 2322 corresponding to the transmission mode for packet 524 in power distribution 2380 and is capable of carrying a payload of the size given by Payload size 2320: /e/r min^ n, T2PConversionFactorm x PotentialT2POutflowi m ) (11) In Equation (11), 4, „ is the stream from the sub-packets included in the sub-frame (2616) The amount of data. The expression T2PConversionFactormxPotentialT2POutflowi:m is the transferable material for the gas i, that is, the amount of data corresponding to the total available power 1034 of the AT 2406.: TZPConvem'onFaciorT'M is a A conversion factor for converting the total available power 1238 for stream (2616) to a data level. Figure 25 illustrates an illustration that may be performed by AT 206 to determine payload size 420 and power level 422 for packet 524. Method 2500. Step 2502 involves selecting a payload size 2320 from power distribution 2380. Step 2504 involves identifying the selected payload size 11503I.doc-36- <:S with the transmission mode for packet 524. 1336195 2320 associated power level 2322. For example, if packet 524 is to be transmitted in a high capacity mode, step 25A involves identifying a high capacity power level 2322a associated with the selected payload size 2320. If the packet is to be transmitted in a low latency mode, then step 25() 4 involves identifying a low latency power level 2322b associated with the selected payload size 2320. Step 2506 involves: if the packet 524 is selected If the payload size 232 〇 and the corresponding power level 2322 are transmitted, it is determined whether the transmission condition 2482 is satisfied. If it is determined at step 2506 that the transmission condition 2482 is satisfied, then at step 2508 the selected payload size 232 and the corresponding power level are selected. Passed to the physical layer 312. ♦ At step 2506, it is determined that the transmission condition 2482 is not met, then a different payload size 232 is selected from the power distribution 2380 at step 2510. The method 2500 then returns to step 2504 and as above The description continues with the basic design mechanism associated with the multi-stream allocation being equal to the total available power for each of the access terminals 2606. The sum of the powers. This works well until the access terminal 2606 itself runs out of transmission power due to hardware limitations (pA headspace limited) or due to TxT2Pmax limits. 'Access terminal 2606 stream when the transmission power is limited Further arbitration of power distribution is necessary. As discussed above, when there is no power limit, the gu/gd demand function determines the current power allocation for each stream via the normal function of the RAB and the flow ramp. In the case where AT 2606 power is limited, a method for setting the allocation of stream 2616 considers the AT 2606 power limit to be strictly similar to sector power 115031.doc • 37· 1336195

限制。通常’扇區具有一用於設定RAB之最大接收功率準 則’其接著引起每一流之功率分配。該思想為:當Ατ 2606功率受限時,若AT 26〇6之功率限制實際上為扇區之 接收功率之相應限制,則將彼AT 2606中之每—流設定為 其將接收之功率分配《此流功率分配可自gu/gd需求函數 藉由執行AT 2606内部之虛擬rab或藉由其他等效演算法 來直接判定。以此方式,維持了 Ατ 26〇6内之流優先權並 使其與AT 2606間之流優先權一致。另外,超出現有胖及 gd函數之資訊為不必要的。 現將提供本文所描述之某些或所有實施例之各種特徵的 概述。系統允許平均資源分配(T2pinfl〇w 2635)與此資源 如何用於封包分配(包括峰值速率及峰值叢發持續時間之 控制)之退耦。 封包524分配可在所有情況下保持自主❶對於平均資源 分配’排程分配或自纟分配係可能的。此允許排程分配與limit. Typically the 'sector has a maximum received power criterion for setting the RAB' which in turn causes a power allocation for each stream. The idea is: when the power of Ατ 2606 is limited, if the power limit of AT 26〇6 is actually the corresponding limit of the received power of the sector, then each stream in AT 2606 is set to the power allocation to be received. "This flow power allocation can be directly determined from the gu/gd demand function by executing a virtual rab inside the AT 2606 or by other equivalent algorithms. In this way, the flow priority within Ατ 26〇6 is maintained and aligned with the flow priority between AT 2606. In addition, information beyond the existing fat and gd functions is unnecessary. An overview of the various features of some or all of the embodiments described herein will now be provided. The system allows the average resource allocation (T2pinfl〇w 2635) and how this resource is used for decoupling of packet allocation (including peak rate and peak burst duration control). The allocation of packets 524 can be maintained in all cases, and it is possible for the average resource allocation 'schedule allocation or automatic allocation. This allows scheduling assignments and

自主分配之無縫整合,因為封包524分配在兩情況下皆行 為相同纟平均資源可按需要經常地或不經常地更新。 授權U保持時間之控制允許資源分配定時以最小信 號傳輸耗用之精確控制。 叉權訊心申之BucketLevel控制允許資源至流之快速注入 而不會影響其隨時間之平均分配 源注入。 此為一種"一次使用"資 排程器2640可進杆ιΙπε1α 订固疋點"之估計或用於每一流2616之 適當資源分配,且接签 钱者將此專值下載至每一流2616。此減 11503 丨.doc •38- 1336195 ^使網路接近於其適當分配("粗糙"分配)之時間,且接 著,自主模式快速地達成最終分配精細"分配)。 排程器2640可將授權發送至流2616之子集,並允許其他 執行自主分配。以此方式’可向某些關鍵流進行資源保 證,且接著,若適當之,則剩餘流自主地"填充"剩餘 量。 、 排程器2640可實施-"看管”(shepherding)功能其中授 權訊息之傳輸僅在流未滿足Q〇S需求時發生。否則,允許 流自主地設定其自身之功率分配。以此方式,可以最小信 號傳輸及耗用來進行QoS保證。應注意,為達成用於流之 Q〇s目標,看管排程器2640可授權一不同於自主分配之固 定點解決方案的功率分配。 AN 2604可指定向上及向下斜坡函數之每一流設計。此 專斜坡函數之適當選擇允許任何每一流2616之平均資源分 配使用每一扇區中之丨位元控制資訊之僅以純自主操作的 精破指定。 隱含於QRAB設計中之非常快速的定時(在每槽被更新且 在每一 AT 2606處以短時間常數來濾波)允許每一流之功率 分配之非常緊密的控制,並將總扇區容量最大化,同時維 持穩定性及覆蓋範圍。 允許峰值功率之每一流2616的控制作為平均功率分配及 扇區負載(FRAB)之函數。此允許權衡叢發性訊務之時間性 與對總扇區1432之負載及穩定性的效應。 經由使用BurstDurationFactor而允許以峰值功率率 115031.doc •39· 1336195 (P〇Wer rate)之傳輸之最大持續時間之每一流2616的控制。 結合峰值速率控制,此允許扇區1432之穩定性及峰值負載 之控制而無需自主流分配之中心協調,並允許調節對特定 源類型之需求。 對叢發源之分配係藉由桶機制及T2pinfl〇w 2635之持續 性來處理’其允許平均功率分配至叢發源到達之映射,同 時維持平均功率之控制。T2pinfl〇w 2635之濾波器時間常 數控制以下持續時間:在該持續時間内,允許零星封包 5 24到達,且超出該持續時間時,T2pinfi〇w 2635衰變至最 小分配。 T2PInflow 2635斜坡對frab 1548之依賴性允許較少負 載之扇區1432中的較高斜坡動力學,而未影響最終平均功 率分配。以此方式’可在扇區被較少負載時實施積極的斜 坡,而藉由減小斜坡積極性將良好穩定性維持於高負載位 準。 基於流優先權、資料需求及可用功率經由自主操作而將 丁2?11^1(^ 2635自調節為用於給定流2616之適當分配。當 流2616被過分配時,81^1^1^61達到61^1(^1^618&1值或 位準2635 ’向上斜坡停止,且T2PInflow 2635值將向下衰 變至BucketLevel小於BucketLevelSat 2635處之位準。此則 為用於丁2?11^1(^ 2635之適當分配。 除了基於向上/向下斜坡函數設計之可用於自主分配之 每流QoS分化以外,亦有可能基於通道條件、經由qrab 或(^11人:6?8及斜坡對?丨1(^81代叩仆之依賴性來控制流2216之 115031.doc -40- 1336195 功率分配。以此方式,在不良通道條件中之流2616可獲得 較低分配,從而減小干擾並改良系統之總容量,或可獲得 獨立於通道條件之全部分配,其以系統容量為代價來維持 均勻行為。此允許公平性/一般福祉權衡之控制。 盡可能地,用於每一流2216之AT 2606間及AT 2606内的 功率分配盡可能為位置獨立的。此意味著其他流26丨6在相 同AT 2606或其他AT 2606處為何物並不重要,流2216之分 配僅取決於總扇區負載。某些實體事實限制可如何良好地 達成此目標,尤其係最大AT 26〇6傳輸功率及關於合併高 容量(HiCap)與低等待時間(L〇Lat)流2616之問題。 與此方法一致,以AT 2606之傳輸功率限制為條件,可 用於AT 2606封包分配之總功率為可用於AT 26〇6中之每一 流之功率的總和。 無論何種規則用於判定自包括於封包分配中之每一流 22 16的資料分配,仍依據桶抽取來維持流22丨6之資源使用 的精確核算。以此方式,對於任何資料分配規則保證流 22 16間的公平性。 當AT 2606功率受限且不能容納可用於其所有流2616的 總功率時,使用來自適於可用於AT 26〇6内之較少功率之 母流的功率。亦即,儘管AT 2606内之流僅僅與彼等AT 2606共用一扇區及彼最大功率位準(AT 26〇6功率限制整體 上類似於該扇區之功率限制),但AT 26〇6内之流相對於彼 此而維持適當優先權。扇區中未由功率受限之AT 2606用 盡的剩餘功率接著照常可用於扇區中之其他流2616。The seamless integration of autonomous allocations, because the packets 524 are allocated in the same way in both cases, the average resources can be updated frequently or infrequently as needed. The control of the grant U hold time allows the resource allocation timing to be precisely controlled with minimal signal transmission consumption. The BucketLevel control of the forks allows for rapid injection of resources into the stream without affecting its average distribution of source injection over time. This is a kind of "one-time use" resource scheduler 2640 can enter the ιΙπε1α fixed point" estimate or for the appropriate resource allocation for each stream 2616, and the signer downloads this value to each stream 2616. This minus 11503 丨.doc •38- 1336195 ^ brings the network close to its proper allocation ("rough" allocation) time, and then, the autonomous mode quickly reaches the final allocation fine "allocation. Scheduler 2640 can send authorizations to a subset of streams 2616 and allow other executions to perform autonomous allocations. In this way, resource guarantees can be made to certain critical flows, and then, if appropriate, the remaining flows autonomously "fill" the remaining amount. The scheduler 2640 can implement a -"shepherding" function in which the transmission of the authorization message occurs only when the flow does not satisfy the Q〇S requirement. Otherwise, the flow is allowed to autonomously set its own power allocation. QoS guarantees can be minimized for signal transmission and consumption. It should be noted that to achieve the Q〇s target for the flow, the watch scheduler 2640 can authorize a power allocation that is different from the autonomously assigned fixed point solution. Each stream design of the up and down ramp functions is specified. The appropriate selection of this ramp function allows the average resource allocation for any of the streams 2616 to use only the purely autonomously manipulated designation of the bit control information in each sector. Very fast timing implicit in the QRAB design (updated every slot and filtered with a short time constant at each AT 2606) allows very tight control of the power distribution of each stream and maximizes total sector capacity While maintaining stability and coverage, control of each stream 2616 of peak power is allowed as a function of average power allocation and sector load (FRAB). Allows to weigh the timeliness of bursty traffic and the effect on the load and stability of the total sector 1432. Allows the maximum transmission rate of the peak power rate of 115031.doc • 39· 1336195 (P〇Wer rate) by using BurstDurationFactor The control of each stream 2616 of duration. Combined with peak rate control, this allows control of the stability and peak load of sector 1432 without central coordination of autonomous stream allocation and allows for adjustment of the need for a particular source type. The allocation is handled by the bucket mechanism and the persistence of T2pinfl〇w 2635, which allows the mapping of the average power distribution to the arrival of the burst source while maintaining the control of the average power. The filter time constant of T2pinfl〇w 2635 controls the following durations: During this duration, sporadic packets 5 24 are allowed to arrive, and beyond this duration, T2pinfi〇w 2635 decays to a minimum allocation. The dependence of the T2PInflow 2635 ramp on frab 1548 allows for a higher of the less loaded sectors 1432. Slope dynamics without affecting the final average power distribution. In this way 'can be implemented positively when the sector is less loaded Slopes, while maintaining good stability at high load levels by reducing slope enthusiasm. Based on flow priority, data requirements and available power, D2?11^1 (^ 2635 is self-tuned for Given a proper allocation of stream 2616. When stream 2616 is over-allocated, 81^1^1^61 reaches 61^1 (^1^618&1 value or level 2635' up ramp stops, and T2PInflow 2635 value will The lower decay to the level at which BucketLevel is less than BucketLevelSat 2635. This is the appropriate allocation for D2?11^1 (^ 2635. In addition to the per-flow QoS differentiation that can be used for autonomous allocation based on the up/down ramp function, it is also possible to base the channel condition via qrab or ( ^11 people: 6?8 and the slope pair? 丨1 (^81 generation servant dependence to control the flow of 2216 115031.doc -40- 1336195 power distribution. In this way, the flow 2616 in the bad channel conditions can be A lower allocation is achieved, thereby reducing interference and improving the overall capacity of the system, or obtaining a full allocation independent of channel conditions, which maintains uniform behavior at the expense of system capacity. This allows for fairness/general well-being control. Possibly, the power allocation between AT 2606 and AT 2606 for each stream 2216 is as position-independent as possible. This means that the other streams 26丨6 are not important at the same AT 2606 or other AT 2606, stream The allocation of 2216 depends only on the total sector load. Some entity fact limits can achieve this goal well, especially for maximum AT 26〇6 transmission power and for combined high capacity (HiCap) and low latency (L〇Lat) Flow 2616 Consistent with this method, the total power available for AT 2606 packet allocation is the sum of the power available for each of AT 26〇6, subject to the transmission power limitation of AT 2606. The data distribution of each stream 22 16 included in the packet allocation is still based on the bucket extraction to maintain accurate accounting of the resource usage of the stream 22 。 6. In this way, the fairness of the stream is guaranteed for any data distribution rule. When the AT 2606 is power limited and cannot accommodate the total power available for all of its streams 2616, the power from the parent stream suitable for less power available in the AT 26〇6 is used. That is, although the flow within the AT 2606 is only Sharing one sector and its maximum power level with their AT 2606 (AT 26〇6 power limit is similar to the power limit of the sector as a whole), but the flows within AT 26〇6 maintain appropriate priority with respect to each other. The remaining power in the sector that is not used up by the power limited AT 2606 is then available to other streams 2616 in the sector as usual.

115031.doc S 1336195 當一 AT 2606中之高容量潛在資料使用的總和足夠高以 致於無合併將導致跨越封包524之大的功率差異時,可將 高容量流2216合併於低等待時間傳輸中。此維持了適於自 干擾系統之傳輸功率的平滑性。當特定高容量流2216&具 有延遲需求以使得其不能等待相同Ατ 26〇6中之所有低等 待時間流2216b傳輸時,可將高容量流2216a合併於低等待 時間傳輸巾’接著-旦達到潛在資料使用之臨限值,流就115031.doc S 1336195 The high-capacity stream 2216 can be merged into a low latency transmission when the sum of the high-capacity potential data usage in an AT 2606 is sufficiently high that no consolidation would result in a large power difference across the packet 524. This maintains the smoothness of the transmission power suitable for the self-interference system. When a particular high-capacity stream 2216& has a delay requirement such that it cannot wait for all of the low latency streams 2216b in the same 〇τ 26〇6 to be transmitted, the high-capacity stream 2216a can be merged into the low-latency transmission towel. Threshold of data use, flow

可將其資料合併於低等待時間傳輸中。因A,當與持續低 等待時間流2216b共用_AT纖時,可滿足對於高容量流 2216&之延遲需求°當扇區被輕微地負載時,可將高容量 流合併於低等待時間傳輸中,在發送高容量流22^作為 低等待時間中之效率損失係不重要的,且因此可始終允許 合併。 田用於间谷篁模式之封包大小在大小上將至少為 y Thresh時’即使不存在有效低等待時間流m6b,Their data can be combined in a low latency transmission. Because A, when _AT fiber is shared with the continuous low latency stream 2216b, the delay requirement for the high-capacity stream 2216& can be satisfied. When the sector is slightly loaded, the high-capacity stream can be merged into the low latency transmission. The efficiency loss in transmitting the high-capacity stream 22^ as a low latency is not important, and thus the merge can always be allowed. The size of the packet used by the field for the valley model will be at least y Thresh when it is ’ even if there is no effective low latency stream m6b.

仍:以低等待時間模式來傳輸—組高容量㈣心。此允 :门令里模式流以在其功率分配足夠高時達成最高輸送 量’因為用於AT 2606之最高輸送量發生於最大封包524大 2低等待時間傳輸模式。換言之,詩高容量傳輸之♦ 〇率非常低於低等待相傳輸之峰值速率,因此允許高 ::二:机221“在其達成最高輸送量為適當時使用低等 侍Bf間傳輸。 1 . 16八有限制其最大功率分配2T2Pmax參數。 可月b視Μ 在網路中之位置而定(例如,當在兩扇區之 U5031.docStill: Transfer in low latency mode—group high capacity (four) heart. This allows the mode stream in the gate to achieve the highest throughput when its power allocation is high enough because the highest throughput for the AT 2606 occurs in the maximum packet 524 large 2 low latency transmission mode. In other words, the high-capacity transmission of the poem is very much lower than the peak rate of the low-waiting phase transmission, thus allowing high::2: The machine 221 "uses the transmission between the lower waiters Bf when it achieves the highest throughput." 16 8 has a limit on its maximum power allocation 2T2Pmax parameter. It can be determined by the location in the network (for example, when in two sectors U5031.doc

-42· S 邊界處AT 2606產生附加干擾並影響穩定性時),亦可能需 要限制AT 2606之總傳輸功率。可將參數TxT2Pmax設計為 ?11〇18打6叩111之函數,並限制八丁 2606之最大傳輸功率。 圖26為說明AT 2606之一實施例的功能方塊圖。AT 2606 包括一控制AT 2606之操作的處理器2602。處理器2602亦 可稱作CPU。可包括唯讀記憶體(ROM)及隨機存取記憶體 (RAM)之記憶體2605向處理器2602提供指令及資料。記憶 體2605之一部分亦可包括非揮發性隨機存取記憶體 (NVRAM)。 可體現於一諸如蜂巢式電話之無線通信器件中的AT 2606亦可包括一外殼2607,該外殼2607含有一傳輸器2608 及一接收器26 10以允許資料在AT 2606與諸如AN 2604之遠 端位置之間的傳輸及接收’諸如音訊通信。傳輸器2608與 接收器2610可組合為一收發器2612。天線26 14附著至外殼 2607且電耦接至收發器2612。亦可使用額外天線(未圖 示)。傳輸器2608、接收器2610及天線2614之操作在此項 技術中已熟知且本文將無需進行描述。 AT 2606亦包括一用於偵測並量化由收發器2612所接收 之信號之位準的信號偵測器2616。此項技術中已知’信號 偵測器2616偵測諸如總能量、每偽雜訊(PN)晶片之導引能 量、功率譜密度及其他信號的信號。 AT 2606之狀態改變器2626基於當前狀態及由收發器 26 12所接收且由信號偵測器2616所偵測之額外信號來控制 無線通信器件之狀態。無線通信器件能夠以許多狀態中之 115031.doc -43· 1336195 任一個來操作。 AT 2606亦包括一系統判定器2628,該系統判定器2628 係用於控制無線通信器件並在其判定當前服務提供者系統 不足時判定無線通信器件應傳送至哪一服務提供者系統。 AT 2606之各種組件係藉由匯流排系統2630而耦接在一 起,除了資料匯流排以外’該匯流排系統還可包括功率匯 流排、控制信號匯流排及狀態信號匯流排。然而,為清晰 起見’在圖26中將各種匯流排說明為匯流排系統2630 » AT 2606亦可包括一用於處理信號之數位信號處理器 (DSP)2609。熟習此項技術者應瞭解,圖26所說明之AT 2606為一功能方塊圖而非一特定組件清單。 多載波多流之反向鏈路媒體存取控制 上文所描述之實施例可能係關於單載波系統,其中 RLMAC桶可用於每一流2216以整理並控制T2P域中之存 取。本文所描述之各種器件及方法亦可實施於多載波多流 之系統.中,其中每一存取終端機可在多個載波(例如,頻 帶)上獨立或共同地傳輸導引、耗用及訊務信號。舉例而 言,若載波具有1.25 MHz(百萬赫茲)之頻帶,則5 mHz之 頻帶可包括3或4個載波。 在一多載波實施例中,AT 2606可具有並行地執行之多 個應用程式流2216。此等應用程式流可映射至AT 2606中 之MAC層流,其中該映射可藉由AN 2604來控制(例如,在 集中式控制下)》AT 2606可具有可用於跨越所有指派載波 之傳輸的最大總功率量。AT 2606處之MAC判定待分配用 115031 .doc -44 - 1336195 於傳輸至每一指派載波上之每一流26i6的功率量以便滿 足各種約束,諸如流2216之Q0S約束(例如,延遲、抖動、 錯誤率,料)、網路之負載約束(例如,RgT、每一扇區 中之負載,等等),等等。 可設計MAC以使得AN 2604判定一集中式參數組,其中 某些參數依流而定,而其他參數依載波而定,同時at 2606判定用於每一載波中之每一流2216的每實體層封包功 率分配。視各種設計目標而定,ΑΝ 26〇4可藉由判定適當 的集中式參數組來選擇控制用於駐留於相同ΑΤ 26〇6中之 流以及跨越網路中之不同載波而駐留於不同Ατ 26〇6中之 流22 16的流22 16分配。 整理多載波系統中之資料流 諸如圖27所說明,當向Ατ 26〇6指派多個RL載波時,被 指派至AT 2606之每一 RL載波中之資料流2216存取控制係 藉由使用用於每一 MAC層流2216之兩獨立符記桶組而自 AT 2606處之流2216資料整理退耦。(此可不同於流2216存 取控制與流2216資料整理係藉由單—桶機制來耦接之單載 波實施例)。由應用程式流2216所產生之資料首先係藉由 資料域中所界定之整理符記桶2636a來調節(用於資料流 2216之整理)。在一實施例中,存在每流2216之單一整理 功能。該整理功能確保由流22 16所利用之平均及峰值資源 小於或等於一限制。在一實施例中,流2216(或Ατ 26〇6)可 能不濫用多載波系統中之額外分配,且在資料域中執行整 理。 I15031.doc ,45· 當在RTC MAC層中整理流2216資料時,執行圖28所示之 以下步驟。首先,AN 2604組態以下資料符記桶屬性(步驟 3010): 用於 MAC 流 i(22l6)之資料符記桶 2 6 3 6 a最大大小(以八位元組)。 進入用於MAC流i(2216)之每子訊框 (以八位元組)之整理桶2636a的資料符記入流。 離開用於MAC流i(22l6)之每子訊框 (以八位元組)之整理桶2636a的資料符記出流。 緊接著,藉由將資料符記桶(或整理桶2636a)位準 DataTokenBucketlevel i 設定 為最大 桶位準 DataBucketLevelMaXi^. H^· ^ MAC ^ i(2216) ffij 始化(步驟3020),其可表達為:-42. When the AT 2606 at the S boundary produces additional interference and affects stability), it may also be necessary to limit the total transmission power of the AT 2606. The parameter TxT2Pmax can be designed as a function of ?11〇18, 6叩111, and limits the maximum transmission power of the eight-but 2606. Figure 26 is a functional block diagram illustrating one embodiment of AT 2606. The AT 2606 includes a processor 2602 that controls the operation of the AT 2606. Processor 2602 can also be referred to as a CPU. Memory 2605, which may include read only memory (ROM) and random access memory (RAM), provides instructions and data to processor 2602. Portions of memory 2605 may also include non-volatile random access memory (NVRAM). The AT 2606, which may be embodied in a wireless communication device such as a cellular telephone, may also include a housing 2607 that includes a transmitter 2608 and a receiver 26 10 to allow data to be remotely located at the AT 2606 and such as the AN 2604. Transmission and reception between locations 'such as audio communication. Transmitter 2608 and receiver 2610 can be combined into a transceiver 2612. Antenna 26 14 is attached to housing 2607 and is electrically coupled to transceiver 2612. Additional antennas (not shown) can also be used. The operation of transmitter 2608, receiver 2610, and antenna 2614 is well known in the art and will not be described herein. The AT 2606 also includes a signal detector 2616 for detecting and quantizing the level of the signal received by the transceiver 2612. Signal detector 2616 is known in the art to detect signals such as total energy, pilot energy per pseudo noise (PN) wafer, power spectral density, and other signals. The state changer 2626 of the AT 2606 controls the state of the wireless communication device based on the current state and the additional signals received by the transceiver 26 12 and detected by the signal detector 2616. The wireless communication device can operate in any of a number of states 115031.doc - 43 · 1336195. The AT 2606 also includes a system determinator 2628 for controlling the wireless communication device and determining to which service provider system the wireless communication device should be transmitted when it determines that the current service provider system is insufficient. The various components of the AT 2606 are coupled together by a busbar system 2630, in addition to the data busbars. The busbar system can also include a power bus, a control signal bus, and a status signal bus. However, for clarity, the various busbars are illustrated in Figure 26 as busbar system 2630. The AT 2606 can also include a digital signal processor (DSP) 2609 for processing signals. Those skilled in the art will appreciate that the AT 2606 illustrated in Figure 26 is a functional block diagram rather than a list of specific components. Multi-Carrier Multi-Stream Reverse Link Media Access Control The embodiments described above may be directed to a single carrier system where RLMAC buckets may be used for each stream 2216 to organize and control access in the T2P domain. The various devices and methods described herein can also be implemented in a multi-carrier, multi-stream system in which each access terminal can transmit, consume, and consume independently or collectively over multiple carriers (eg, frequency bands). Signal signal. For example, if the carrier has a frequency band of 1.25 MHz (million Hz), the 5 mHz band may include 3 or 4 carriers. In a multi-carrier embodiment, AT 2606 can have multiple application flows 2216 executing in parallel. Such application streams may be mapped to a MAC layer stream in AT 2606, where the mapping may be controlled by AN 2604 (eg, under centralized control). AT 2606 may have a maximum of transmissions available for all assigned carriers. Total amount of power. The MAC at AT 2606 determines the amount of power to be allocated to each stream 26i6 on each assigned carrier to satisfy various constraints, such as the QOS constraints of stream 2216 (e.g., delay, jitter, error), 115031.doc -44 - 1336195 Rate, material), network load constraints (for example, RgT, load in each sector, etc.), and so on. The MAC may be designed such that the AN 2604 determines a centralized set of parameters, some of which are stream dependent, while other parameters are carrier dependent, while at 2606 determines each physical layer packet for each of the streams 2216 in each carrier. Power allocation. Depending on various design goals, 选择 26〇4 can be selected to control the streams that reside in the same 以及 26〇6 and reside on different Ατ across different carriers in the network by determining the appropriate set of centralized parameters. The stream 22 16 of the stream 22 16 is allocated. Organizing the data stream in the multi-carrier system, such as illustrated in FIG. 27, when assigning a plurality of RL carriers to Ατ 26〇6, the data stream 2216 access control system assigned to each of the RB carriers of the AT 2606 is used by The two independent token bucket groups of each MAC layer stream 2216 are decoupling from the stream 2216 at AT 2606. (This may be different from the stream 2216 access control and stream 2216 data collation is a single carrier embodiment coupled by a single-bucket mechanism). The data generated by application stream 2216 is first adjusted by the collation bucket 2636a defined in the data field (for collation of data stream 2216). In one embodiment, there is a single collating function per stream 2216. This collating function ensures that the average and peak resources utilized by stream 22 16 are less than or equal to a limit. In an embodiment, stream 2216 (or Ατ 26〇6) may not abuse additional allocations in the multi-carrier system and perform grooming in the data domain. I15031.doc, 45. When the stream 2216 data is organized in the RTC MAC layer, the following steps shown in Fig. 28 are performed. First, the AN 2604 configures the following data token bucket attributes (step 3010): The data token bucket for the MAC stream i (22l6) 2 6 3 6 a maximum size (in octets). The data entry into the bucket 2636a for each sub-frame (in octets) for MAC stream i (2216) is entered into the stream. The stream of the sorting bucket 2636a for each sub-frame (in octets) for the MAC stream i (22l6) is recorded. Then, by setting the data token bucket (or the bucket 2636a) level DataTokenBucketlevel i to the maximum bucket level DataBucketLevelMaXi^. H^· ^ MAC ^ i(2216) ffij initialization (step 3020), which can be expressed for:

DataTokenBucketleveli = DataBucketLevelMaXi (12) 隨後,在每一子訊框η之開始處,計算來自用於每一有 效MAC流i(2216)之資料符記桶(或整理桶)2636a的最大允 許出流並將用於整理桶2636a之總可用功率設定為等於此 最大值,或若此最大值為負,則將其設定為零(步驟 3030)。用於整理桶2636a之資料出流的總可用功率可表達 為:DataTokenBucketleveli = DataBucketLevelMaXi (12) Subsequently, at the beginning of each subframe n, the maximum allowed outflow from the data token bucket (or bucket) 2636a for each valid MAC stream i (2216) is calculated and will The total available power for the bin 2636a is set equal to this maximum, or if the maximum is negative, it is set to zero (step 3030). The total available power for the data outflow of the bin 2636a can be expressed as:

PotentialDataTokenBucketOutfloWin = max {DataTokenlnfloWi + DataTokenBucketLeveliw 0) (13) 其中1表示^1八0流2216,11表示子訊框,1)如<37'〇^:6«_/>2//〇\^表 示用於流i(2216)之當前資料分配2639a , 丘 115031.doc -46- 1336195 • DataTokenBucketLevelin ^^^>;1ΐΐ(2216)^, 積聚資料分配2639b。 緊接著,判定此是否為新封包分配(步驟3040)。若對步 驟3040之答覆為否,則轉向步驟3060。若步驟3040之結果 ' 為是,則在訊框η於每一指派載波j中之新封包分配期間執 行以下步驟3050。若在子訊框η用於流i(2216)之整理桶 2639a之總可用資料等 於零(步驟3050),則其可表達為: • PotentialDataTokenBucketOutflow in — 0 (14) 隨後,將用於高容量封包524a之第j載波上之第i流的總 可用功率1238尸〇以^^<3/77/>0«(/7〇14^,7.,//(:設定為等於零,且 將用於低等待時間封包524a之第j載波上之第i流(2216)的 總可用功率1238 尸設定為等於零(步 驟3055)。此等等式可表達為:PotentialDataTokenBucketOutfloWin = max {DataTokenlnfloWi + DataTokenBucketLeveliw 0) (13) where 1 indicates ^1 八0 stream 2216, 11 indicates the sub-frame, 1) as <37'〇^:6«_/>2//〇\^ Indicates the current data allocation 2639a for stream i (2216), YU 115031.doc -46- 1336195 • DataTokenBucketLevelin ^^^>;1ΐΐ(2216)^, Accumulated data allocation 2639b. Next, it is determined whether this is a new packet allocation (step 3040). If the answer to step 3040 is no, then go to step 3060. If the result of step 3040 is 'Yes, then the following step 3050 is performed during the new packet allocation in frame n of each assigned carrier j. If the total available data for the bin 2639a for the stream i (2216) is equal to zero (step 3050), then it can be expressed as: • PotentialDataTokenBucketOutflow in — 0 (14) Subsequently, it will be used for the high capacity packet 524a The total available power of the ith stream on the jth carrier is 1238 corpse to ^^<3/77/>0«(/7〇14^,7.,//(: is set equal to zero, and will be used The total available power of the ith stream (2216) on the jth carrier of the low latency packet 524a is set to equal zero (step 3055). This equation can be expressed as:

PotentialTIP Outflow ijuc = 〇 (15) PotentialT2POutfloWijii = 0 (16) 其中i表示MAC流2216,j表示第j載波,η表示子訊框,HC 表示高容量,且LL表示低等待時間。 若步驟3050之結果為否,則轉向步驟3060。此確保將分 配至AT處之每一指派RL載波中之流的功率在該流超過資 料桶分配時設定為零。 緊接著,判定此是否為子訊框η之結束(步驟3060)。若對 步驟3060之答覆為否,則返回至步驟3030。若對步驟3060 115031.doc -47- 1336195 之答覆為是,則在每一子訊框η之結束處藉由以下步驟來 更新用於每一有效MAC流i(2216)之資料符記桶位準:將用 於訊框n+1之資料符記桶位準設定為等於用於流i(2216)之 當前資料分配2639a DataTokenlnflowi加上在子訊框 n(2216)用於資料流i(2216)之積聚資料分配2639b ,減去來自包含於在子訊框η於所 有載波j中之有效負載中之MAC流i(2216)之八位元組的數 目2^(:(^,11或用於流i(2216)之資料符記桶2636a最大大小 DataBucketLevelMaXi的最小值(步驟3070)。此可表達為:PotentialTIP Outflow ijuc = 〇 (15) PotentialT2POutfloWijii = 0 (16) where i denotes the MAC stream 2216, j denotes the jth carrier, η denotes a subframe, HC denotes a high capacity, and LL denotes a low latency. If the result of step 3050 is no, then go to step 3060. This ensures that the power of the stream to be allocated to each of the assigned RL carriers at the AT is set to zero when the stream exceeds the allocation of the bucket. Next, it is determined whether this is the end of the subframe η (step 3060). If the answer to step 3060 is no, then return to step 3030. If the answer to step 3060 115031.doc -47 - 1336195 is YES, the data token bucket for each valid MAC stream i (2216) is updated at the end of each subframe n by the following steps. Standard: Set the data bucket level for frame n+1 to be equal to the current data allocation for stream i (2216) 2639a DataTokenlnflowi plus for sub-frame n (2216) for data stream i (2216) The accumulated data allocation 2639b, minus the number of octets from the MAC stream i (2216) contained in the payload of the sub-frame n in all carriers j 2^(:(^,11 or The data in stream i (2216) is the minimum value of the maximum size DataBucketLevelMaXi of the bucket 2636a (step 3070). This can be expressed as:

DataTokenBucketLevelin+i = mm(DataTokenInfioWi + DataTokenBucketLevelin -DataTokenBucketLevelin+i = mm(DataTokenInfioWi + DataTokenBucketLevelin -

DataBucketLevelMaxi) (17) 其中du,n =來自包含於在子訊框η於載波j中之有效負載中 之MAC流i(22 16)之八位元組的數目,C =指派至AT 2606之 所有載波的集合,[』以山丄11為來自包含於在子訊框η於所有 載波j中之有效負載中之MAC流i(22 16)之八位元組的數 目,DataTokenlnflowi為用於流i(2216)之當前資料分配 2639a,DataTokenBucketLeveli,n為用於在子訊框η之資料 流 i(2216)的積聚資料分配 2639b,且 DataBucketLevelMaxi 為用於流i(2216)之資料符記桶2636a最大大小。返回至步 驟3030 。 接著藉由在T2P或功率域中所界定之第二組符記桶2636b 來調節此資料域符記桶2636a之輸出。此等第二桶或流存 取桶263 6b判定用於每一指派載波中之每一 MAC流2216之DataBucketLevelMaxi) (17) where du,n = the number of octets from the MAC stream i (22 16) contained in the payload of the subframe n in the carrier j, C = assigned to all of the AT 2606 The set of carriers, [" is the number of octets from the MAC stream i (22 16) contained in the payload of the sub-frame n in all carriers j, and the DataTokenlnflowi is used for the stream i (2216) The current data allocation 2639a, DataTokenBucketLeveli, n is the accumulated data allocation 2639b for the data stream i (2216) in the subframe η, and the DataBucketLevelMaxi is the data token bucket 2636a for the stream i (2216). size. Return to step 3030. The output of the data field token bucket 2636a is then adjusted by a second set of token buckets 2636b defined in the T2P or power domain. These second buckets or stream access buckets 263 6b are determined for each of the MAC flows 2216 in each of the assigned carriers.

' S 115031.doc -48 - 1336195 潛在允許傳輸功率。因此,每一第二桶2636b表示一指派 載波及位於該載波上之流2216。因此,在多載波下,基於 每載波來控制流2216存取,其中可將指派rLmaC桶之數 目6又之為荨於指派至每一流2216之載波的數目-。 圖2 7說明將流整理自存取控制退輕之一實例,其中首先 將資料置放於一用於彼流2616之流整理(或源控制)桶2636a 中’且接著以一峰值出流約束為條件,使用一組載波選擇 規則2639c而將資料分配至不同載波,在一實施例中,該 等載波選擇規則可儲存於記憶體中作為可藉由處理器或處 理器構件來執行之指令。N個載波中之每一者具有標記為 對應於1至N個載波之1至n之其自身的存取控制桶2636b。 因此’可將桶26;36b之數目設定為等於用於每一流2216之 指派載波之數目。 接著藉由使用基於第二T2P域之符記桶263 6b的輸出及下 文所界定之一組規則來判定用於每一載波中之每一流2216 之最終功率分配。 AT 26〇6處之載波選擇策略 AT 2606基於一度量而將所有指派載波分等級。在一實 施例中’ AT 2606之導引信號的平均傳輸功率 (TxPil〇tP〇wer)可用作載波等級度量。若在給定子訊框具 有最低平均TxPilotPower之載波不可用於新封包分配,則 使用其他較低等級之載波。用於平均化TxPil〇tp〇wer之濾 波器時間常數具有以下效應“AT 26〇6可藉由使用較小之濾 波器時間常數而自利用短期衰落變化中獲益。另一方面, 115031.doc -49-' S 115031.doc -48 - 1336195 Potentially allowed transmission power. Thus, each second bucket 2636b represents an assigned carrier and a stream 2216 located on the carrier. Thus, under multi-carrier, flow 2216 access is controlled on a per-carrier basis, where the number of assigned rLmaC buckets can be equal to the number of carriers assigned to each stream 2216. Figure 2 illustrates an example of streamlining self-access control, where data is first placed in a stream collation (or source control) bucket 2636a for the stream 2616 and then constrained by a peak outflow Conditionally, the data is assigned to different carriers using a set of carrier selection rules 2639c, which in one embodiment can be stored in memory as instructions executable by the processor or processor component. Each of the N carriers has its own access control bucket 2636b labeled 1 to n corresponding to 1 to N carriers. Thus, the number of buckets 26; 36b can be set equal to the number of assigned carriers for each stream 2216. The final power allocation for each of the streams 2216 in each carrier is then determined by using the output of the token bucket 263 6b based on the second T2P domain and a set of rules defined below. Carrier Selection Strategy at AT 26〇6 The AT 2606 ranks all assigned carriers based on a metric. The average transmit power (TxPil〇tP〇wer) of the pilot signal of AT 2606 in one embodiment can be used as a carrier level metric. If the carrier with the lowest average TxPilotPower in the given sub-frame is not available for new packet allocation, then other lower-level carriers are used. The filter time constant used to average TxPil〇tp〇wer has the following effect "AT 26〇6 can benefit from the use of short-term fading variations by using smaller filter time constants. On the other hand, 115031.doc -49-

S 1336195 較長之時間常數反映每一指派RL載波中之AT 2606所觀察 之總干擾的長時間變化。應注意,平均FRAB 1548或平均 TxPilotPower及平均FRAB 1548之函數亦為可能之度量。 AT 2606基於封包之等級而將封包分配於每一載波上,直 至AT 2606用盡資料、PA頂部空間或載波為止。本方法及 裝置之多載波RTC MAC可基於指派載波之等級經由指派載 波而迭代(添加或撤消),直至AT 26〇6無資料或無pA頂部 空間為止。The longer time constant of S 1336195 reflects the long-term variation of the total interference observed by AT 2606 in each assigned RL carrier. It should be noted that the average FRAB 1548 or average TxPilotPower and average FRAB 1548 functions are also a possible measure. The AT 2606 distributes the packets on each carrier based on the level of the packet until the AT 2606 runs out of data, the PA headspace, or the carrier. The multi-carrier RTC MAC of the method and apparatus may iterate (add or revoke) via assignment of carriers based on the assigned carrier level until AT 26〇6 has no data or no pA headspace.

信雜比(SNR)亦可用作度量^ AT 26〇6藉由支持具有較低 干擾之載波而達成負載平衡。AT 2 6 0 6經由指派載波之子 集而傳輸,以便以更多Eb/N()有效模式來操作以最小化對 於相同之所達成的資料速率經由所有指派載波而求和之每 傳輸位元所需的能量。The signal-to-noise ratio (SNR) can also be used as a metric. AT 26〇6 achieves load balancing by supporting carriers with lower interference. AT 2 6 6 6 is transmitted via a subset of assigned carriers to operate in more Eb/N() active modes to minimize each transmitted bit summed over all assigned carriers for the same achieved data rate. The energy needed.

可被使用之另一度量為干擾。AT 26〇6利用跨越指派載 波之頻率選擇性衰落而在可能時藉由支持對具有在較小時 間標度内所㈣之較低干擾之载波的功率分配來獲得多頻 分集增益。AT 2606試圖藉由支持對具有在較纟時間標度 内所置測之較低干擾之載波的功率分配(或第一分配功率) 來最大化每單位功率上所傳輸之位元的數目。或者,入τ 2606藉由最小化用於給定封包524大小之傳輸功率來達成 =擾^效之傳輸且在可能時藉由適#地選擇栽波來達成终 在每一該指派載波上由AT 測傳輸導引功率或反向有效位 2606所觀察之干擾可藉由量 兀來間接量測。此等兩個度 H5031.doc f可在時間標度内加以平均化。時間標度判定對由於較少 平均化之雜訊度里之反應與對由於過分滤波之過分平滑的 - 度量之反應之間的權衡。 ' 在另貫施例中,AT 2606可使用包括(但不限於)上文所 淪述之度量之度量的組合而將所有指派載波分等級。 “ 2606可基於pa頂部空間及(可能為)資料考慮而決定 撤肩載波。在一實施例中,AT 26〇6選擇撤消具有最高 ^ TxPU〇tP0wer(在某時段内加以平均化)之載波。 以Eb/N〇有效模式跨越許多指派載波之傳輸包含:對於 存取、、、端機之相同總資料速率,使用支持線性區域中之每 位元所需之能量所針對的封包大小跨越更大數目之載波的 傳輸,其與使用每位元所需之能量在非線性(凸)區域中所 針對之封包大小以較少數目之載波的傳輸相反。 ,mac層以AN 2604-AT 2606協作來達成跨越載波之負載 平衡。可將負載平衡時間標度分為兩部分”短期負載平衡 • 及,期平均負載平衡β AT 26〇6以分散方式藉由在用於基 ;母封包之傳輸之指派載波之間進行適當地選擇來達成短 期負载平衡。短期負載平衡之實例包括:i)AT 26G6在RAB 1444或封包524在每一指派載波中受到大小顯示時對跨越 所有指派載波之功率進行水填充;及η)ατ 26〇6在功率(亦 即,PA頂部空間)受限時經由指派载波之子集而傳輸。 、AN 2604藉由適當地判定用於跨越載波之流的參數 $藉由在有效集合管理及新流到達之時間標度中將載波適 田地刀配至AT 26〇6來達成長期負载平衡。ΑΝ “ο*藉由適 I I503I.doc 51 1336195 當地判定上文所論述之MAC流2216參數來控制對於網路中 跨越每一指派載波之每一流2216的公平性及長期功率分 配。 使用授權訊息2642之載波分配 圖29說明一涉及集中式控制之實施例,其中AT 2606將 一載波請求訊息2666發送至AN 2604上之排程器2640。圖 30亦說明將載波授權訊息2642發送至AT 2606之排程器 2640。AN 2604與AT 2606可使用一訊息驅動機制而協作以 找到用於網路之最佳載波分配。與用於先前所論述之單載 波實施例中的現有T2PInflow請求授權機制類似,AT 2606 及AN 2604分別使用載波請求訊息2666及載波授權訊息 2642。在AT 2606驅動模式中,AN 2604依賴於在資料及 PA頂部空間證實是正確時請求額外載波之AT 2606。在AN 2604驅動模式中,AN 2604可使所有AT 2606週期性地傳遞 資料、TxPilotPower、FL導引強度及PA頂部空間資訊, AN 2604可使用其來判定何時將載波分配至AT 2606。載波 請求訊息2666與載波授權訊息2642可非同步。AT 2606可 將一載波請求訊息2666發送至AN 2604以用於載波之數目 的增加/減少。又,AT 2606可在AT 2606受到鏈路預算限制 時自主地減少指派載波之數目,但在撤消載波之後通知 AN 2604。AT 2606發送一載波請求訊息2666以在資料及 PA頂部空間證實是正確時增加指派載波之數目,並在PA 頂部空間或資料使當前數目之載波效率低時減少指派載波 之數目^ AT 2606載波請求訊息2666可含有流QoS需求、平Another metric that can be used is interference. The AT 26〇6 utilizes frequency selective fading across the assigned carrier and, where possible, obtains multi-frequency diversity gain by supporting power allocation to carriers having lower interference (4) within a smaller time scale. The AT 2606 attempts to maximize the number of bits transmitted per unit of power by supporting power allocation (or first allocated power) for carriers having lower interference placed within a longer time scale. Alternatively, the incoming τ 2606 is achieved by minimizing the transmission power for a given packet 524 size and, if possible, by selecting the carrier to achieve the final assignment on each of the assigned carriers. The interference observed by the AT measurement transmission pilot power or the inverse significant bit 2606 can be indirectly measured by the measurement 。. These two degrees H5031.doc f can be averaged over the time scale. The time scale determines the trade-off between the response in the noise due to less averaging and the response to the over-smoothed metric due to excessive filtering. In a further embodiment, AT 2606 may classify all assigned carriers using a combination of metrics including, but not limited to, the metrics recited above. " 2606 may determine the shoulder carrier based on the pa headspace and (possibly) data considerations. In one embodiment, AT 26〇6 chooses to cancel the carrier with the highest ^ TxPU 〇 tP0wer (averaged over a period of time). The transmission of Eb/N〇 active mode across many assigned carriers includes: for the same total data rate of access, and end machines, the bandwidth required to support each bit in the linear region is larger for the packet size The transmission of the number of carriers, as opposed to the transmission of the energy required per bit in the non-linear (convex) region, is the opposite of the transmission of a smaller number of carriers. The mac layer cooperates with AN 2604-AT 2606 Achieving load balancing across carriers. The load balancing time scale can be divided into two parts: “Short-term load balancing” and “Average load balancing β AT 26〇6 are distributed in a decentralized manner by the assignment for the base; Appropriate selection between carriers is used to achieve short-term load balancing. Examples of short-term load balancing include: i) AT 26G6 water-fills power across all assigned carriers when RAB 1444 or packet 524 is size-sized in each assigned carrier; and η) ατ 26〇6 at power (ie, , PA headspace) is transmitted via a subset of assigned carriers when restricted. The AN 2604 achieves long-term load balancing by appropriately determining the parameter for the flow across the carrier by arranging the carrier to the AT 26〇6 in the time scale of effective set management and arrival of the new flow. ο “ο* The locality determines the fairness and long-term power allocation for each of the flows 2216 across each assigned carrier in the network by determining the MAC flow 2216 parameters discussed above by I I503I.doc 51 1336195. Carrier Allocation of 2642 FIG. 29 illustrates an embodiment involving centralized control in which AT 2606 sends a carrier request message 2666 to scheduler 2640 on AN 2604. Figure 30 also illustrates the transmission of carrier grant message 2642 to AT 2606. Scheduler 2640. AN 2604 and AT 2606 can cooperate using a message driven mechanism to find the best carrier allocation for the network. Similar to the existing T2P Inflow request authorization mechanism used in the single carrier embodiment discussed previously, The AT 2606 and AN 2604 respectively use the carrier request message 2666 and the carrier grant message 2642. In the AT 2606 drive mode, the AN 2604 relies on the AT 2606 requesting additional carriers when the data and PA headspace are verified to be correct. In the AN 2604 drive mode The AN 2604 allows all AT 2606 to periodically transmit data, TxPilotPower, FL pilot strength, and PA headspace information, which AN 2604 can use to determine When to assign a carrier to AT 2606. Carrier request message 2666 may be asynchronous with carrier grant message 2642. AT 2606 may send a carrier request message 2666 to AN 2604 for increase/decrease in the number of carriers. Again, AT 2606 may The number of assigned carriers is autonomously reduced when the AT 2606 is limited by the link budget, but the AN 2604 is notified after the carrier is revoked. The AT 2606 sends a carrier request message 2666 to increase the number of assigned carriers when the data and PA headspace are verified to be correct. And reduce the number of assigned carriers when the PA headspace or data makes the current number of carriers inefficient. AT 2606 carrier request message 2666 may contain flow QoS requirements, flat

:S 115031.doc -52- 1336195 均仔列長度、每一載波中之平均Txpil〇tP〇wer、每一載波 中之FL導引強度及PA頂部空間有關資訊。 AN 2604可使用載波授權訊息2642基於AT 2606請求訊息 資訊及負載平衡FL耗用等準則來授權載波。AN 2604可回 應於一載波請求訊息2666而選擇不發送載波授權訊息 2642。AN 2604可使用載波授權訊息2642而在任何時間增 加/減少/重新指派用於每一 AT 2606之指派載波。又,AN 2604亦可在任何時間重新指派用於每一 AT 2606之載波以 確保負載平衡及效率或基於FL需求而在任何時間重新指派 用於每一 AT 2606之載波以確保負載平衡及效率。AN 2604 可在任何時間減少用於每一 AT 2606之載波的數目。AN 2604可撤消一載波並在任何時間向給定AT 2606指派另一 載波--AT 2606服務在其他載波於切換過程期間在AT 2606 處被啟用時未中斷。AT 2606遵循AN 2604載波授權2642。 在一實施例中,可使用優先權函數來執行每載波之流存 取控制。每載波分配與用於單載波系統之分配類似且可跨 越所有載波而相同。隨著指派至終端機之載波的數目改 變,無需改變RTC MAC桶參數。 如同單載波實施例,每一載波上之斜坡率受限於最大可 允許干.擾。 載波分配及管理 在多載波系統中,在前向鏈路(FL)上指派至AT之載波的 數目可(例如)基於與FL上之AT相關聯之資料及QoS需求的 AN資訊而藉由AN來判定。在反向鏈路(RL)上指派至AT之:S 115031.doc -52- 1336195 The length of the column, the average Txpil〇tP〇wer in each carrier, the FL pilot strength in each carrier, and the PA headspace related information. The AN 2604 can use carrier grant message 2642 to authorize the carrier based on criteria such as AT 2606 request message information and load balancing FL consumption. The AN 2604 may choose not to transmit the carrier grant message 2642 in response to a carrier request message 2666. The AN 2604 can use the carrier grant message 2642 to add/reduce/reassign the assigned carrier for each AT 2606 at any time. In turn, AN 2604 can also reassign the carrier for each AT 2606 at any time to ensure load balancing and efficiency or reassign the carrier for each AT 2606 at any time based on FL demand to ensure load balancing and efficiency. The AN 2604 can reduce the number of carriers for each AT 2606 at any time. The AN 2604 may revoke one carrier and assign another carrier to the given AT 2606 at any time - the AT 2606 service is uninterrupted when other carriers are enabled at the AT 2606 during the handover procedure. The AT 2606 follows the AN 2604 carrier grant 2642. In an embodiment, a priority function can be used to perform flow access control per carrier. The per-carrier allocation is similar to the allocation for a single carrier system and can be the same across all carriers. As the number of carriers assigned to the terminal changes, there is no need to change the RTC MAC bucket parameters. As with the single carrier embodiment, the ramp rate on each carrier is limited by the maximum allowable interference. Carrier Allocation and Management In a multi-carrier system, the number of carriers assigned to the AT on the forward link (FL) can be, for example, based on AN information based on the data and QoS requirements associated with the AT on the FL. To judge. Assigned to the AT on the reverse link (RL)

:S 115031.doc •53· 1336195 載波的數目可基於AT與AN之間的協作過程’例如,基於 每一載波上之RL負載的AN資訊、其傳輸功率之八丁資訊(或 功率頂部空間)、其緩衝器狀態、RL上之資料及Q〇s需 求,等等。如下文進一步所描述,指派至八丁之尺^載波的 數目亦可(例如)關於自Ατ所接收之排程資訊而藉由an來 判定。 舉例而言,亦可存在與Ατ相關聯之多個FL載波及多個 RL載波。FL載波之數目可與壯載波之數目相同(例如,以 對稱操作模式)或不同於RL載波之數目(例如,以非對稱操 作模式)。亦可存在與AT相關聯之單一RL載波及多個1?1載 波(例如,非對稱操作模式之特定情況)或單一RL.波及單 一 FL載波(例如,對稱操作模式之特定情況)。如下文所描 述之實例進一步說明,可動態地執行几及尺匕載波之分配 及管理。 在一實施财,AN可判定待指滚至八丁之FL載波的數目 作為一或多個載波分配參數之函數,並基於該判定而將一 指派訊息(例如,IS.856型系統中之訊務通道指派(tca)訊 息或W-CDMA型系統中之無線電承載重組態訊息)發送至 AT 〇 本文所揭不之載波分配參數可包括以下參數中之一個: 與FL上之AT相關聯的資料需求(例如,基於an處之資料佇 J長度)關於與凡上之AT相關聯之至少一流的q〇s需求 (例如’基於與—或多個流相關聯之QoS類型或應用程式類 )待於FL上傳輸2FL有關耗用資訊之量(例如,基於指 】1503 丨.doc:S 115031.doc •53· 1336195 The number of carriers may be based on a cooperative process between the AT and the AN 'eg, based on the AN information of the RL load on each carrier, the eight bits of information (or power head space) of its transmission power, Its buffer status, data on the RL, and Q〇s requirements, and so on. As further described below, the number of carriers assigned to the octet can also be determined, for example, by an with respect to the schedule information received from Ατ. For example, there may be multiple FL carriers and multiple RL carriers associated with Ατ. The number of FL carriers may be the same as the number of strong carriers (e.g., in a symmetric mode of operation) or different than the number of RL carriers (e.g., in an asymmetric mode of operation). There may also be a single RL carrier associated with the AT and a plurality of 1:1 carriers (e.g., a particular case of asymmetric mode of operation) or a single RL. A single FL carrier (e.g., a particular case of symmetric mode of operation). As further illustrated by the examples described below, the allocation and management of several and a few carrier carriers can be performed dynamically. In an implementation, the AN may determine the number of FL carriers to be indexed to eight, as a function of one or more carrier allocation parameters, and assign an assignment message based on the determination (eg, a message in an IS.856 type system) A channel assignment (tca) message or a radio bearer reconfiguration message in a W-CDMA type system) is sent to the AT. The carrier assignment parameters disclosed herein may include one of the following parameters: Data associated with the AT on the FL Requirements (eg, based on data at an 伫J length) with respect to at least first-class q〇s requirements associated with the AT (eg, 'based on QoS types or application classes associated with multiple streams—) The amount of 2FL related information transmitted on the FL (for example, based on the reference) 1503 丨.doc

•54- S 1336195 , 派至AT之RL載波的數目)、FL上之AT的位置及扇區内干擾 (其可(例如)基於平均資料速率控制(DRC)值或由Ατ所報告 • 之導引強度而藉由AN來推斷)、FL上之扇區負载(或每載波 . 之平均扇區負載)(其可(例如)藉由監視基於每載波之在扇 區中之FL使用來估計)、與八^^相關聯之硬體約束(例如,關 於AN傳輸、追蹤及管理多個FL載波之能力),等等。 如下文進一步所描述,AN亦可(例如)基於自AT所接收 之排程資訊以及AN處可用之RL有關資訊(例如,扇區負載 或RgT)來判定待指派至AT之RL載波的數目。 在一實施例中,AT可將排程資訊傳輸至an,且接收一 指示被指派至AT之載波的數目之關於排程資訊之指派訊 息。 本文所揭示之排程資訊可(例如)包括以下資訊中之至少 一個:與RL上之AT相關聯的資料需求、關於與尺]^上之AT 相關聯之一或多個流的Qos需求(例如,基於與一或多個流 φ 相關聯之Q〇S類型或應用程式類型)、AT處可用sRL傳輸 之傳輸功率(或功率頂部空間)(其可(例如)基於與指派至AT 之每一 RL載波相關聯的平均傳輸導引功率來判定)、與Ατ 相關聯之緩衝器狀態(例如,在w_cdma型系統中)、待於 RL上傳輸之FL有關耗用資訊之量(例如,基於指派至at之 FL載波的數目)、RL上之AT之位置及可由Ατ所觀察之總 (包括扇區内及扇區間)干擾、RL上之扇區負載(或每載波 之平均扇區負載)(AT可藉由監視基於每載波之在扇區中的 RL使用而對其進行判定)、與AT相關聯之硬體約束(例如, 115031.doc •55- S ) 1336195 AT傳輸、追蹤及管理多個载波之能力),等等。 排程資訊亦可包括AT需要具有之額外RL載波的數目或 AT意欲撤消(或已撤消)之先前指派之RL載波之子集。舉例 而言,如下文進一步所描述,AT可判定所需之RL載波的 數目作為一或多個載波判定參數之函數。 本文所揭示之載波判定參數可包括以下參數中之一個: 與RL上之AT相關聯的資料需求、關於與RL上之AT相關聯 之一或多個流的QoS需求(例如,基於與一或多個流相關聯 之QoS類型或應用程式類型)、AT處可用sRL傳輸之傳輸 功率(或功率頂部空間)(其可(例如)基於與指派至Ατ之每一 RL載波相關聯的平均傳輸導引功率來判定)、與Ατ相關聯 之緩衝器狀態(例如,在W-CDMA型系統中)、待於rl上傳 輸之FL有關耗用資訊之量(例如,基於指派至Ατ之fl載波 的數目)、RL上之AT之位置及由AT所觀察之總(包括扇區 内及扇區間)干擾、RL上之扇區負載(或每載波之平均扇區 負載)(AT可藉由監視基於每載波之在扇區中的RL使用而對 其進行判定)、與AT相關聯之硬體約束(例如,關於八丁傳 輸、追蹤及管理多個載波之能力),等等。 關於本文所揭示之載波的術語"撤消”可指停止(或終止) 載波上之所有傳輸(例如,與導引、訊務/資料及耗用通道 相關聯)。 以下進一步描述載波分配及管理之實例。 在一實例中,AT最初可將複數個存取探針發送於隨機雜 湊之RL載波上(例如’試圖均勻地分佈由來自跨越所有可• 54-S 1336195, the number of RL carriers assigned to the AT), the location of the AT on the FL, and intra-sector interference (which may be, for example, based on average data rate control (DRC) values or reported by Ατ The strength of the sector is estimated by the AN, the sector load on the FL (or the average sector load per carrier.) (which can be estimated, for example, by monitoring the FL usage in the sector based on each carrier) Hardware constraints associated with 八 (eg, regarding the ability of AN to transmit, track, and manage multiple FL carriers), and so on. As further described below, the AN may also determine the number of RL carriers to assign to the AT based, for example, on scheduling information received from the AT and RL related information (e.g., sector load or RgT) available at the AN. In an embodiment, the AT may transmit the schedule information to an and receive an assignment message indicating the schedule information indicating the number of carriers assigned to the AT. The scheduling information disclosed herein may, for example, include at least one of the following information: a data requirement associated with an AT on the RL, and a Qos requirement for one or more streams associated with the AT on the ruler ( For example, based on the Q〇S type or application type associated with one or more streams φ, the transmission power (or power headspace) of the available sRL transmissions at the AT (which may be based, for example, on each assignment to the AT) The average transmission pilot power associated with an RL carrier is determined), the buffer status associated with Ατ (eg, in a w_cdma type system), and the amount of FL related consumption information to be transmitted over the RL (eg, based on The number of FL carriers assigned to at), the location of the AT on the RL, and the total (including intra-sector and inter-sector interference) observed by Ατ, the sector load on the RL (or the average sector load per carrier) (AT can be determined by monitoring the RL usage in the sector based on each carrier), hardware constraints associated with the AT (eg, 115031.doc • 55-S) 1336195 AT transmission, tracking and management The ability of multiple carriers), and so on. The scheduling information may also include a subset of the number of additional RL carriers that the AT needs to have or a subset of previously assigned RL carriers that the AT intends to revoke (or have revoked). For example, as further described below, the AT can determine the number of RL carriers required as a function of one or more carrier decision parameters. The carrier decision parameters disclosed herein may include one of the following parameters: a data requirement associated with an AT on the RL, a QoS requirement for one or more flows associated with the AT on the RL (eg, based on one or Transmission power (or power headspace) of available sRL transmissions at the AT (which may be based, for example, on an average transmission guide associated with each RL carrier assigned to Ατ) The power is used to determine the buffer state associated with Ατ (eg, in a W-CDMA type system), and the amount of FL related information to be transmitted on rl (eg, based on the fl carrier assigned to Ατ) Number), the location of the AT on the RL, and the total (including intra-sector and inter-sector interference) observed by the AT, the sector load on the RL (or the average sector load per carrier) (AT can be monitored based on Each carrier's RL in the sector is used to determine it, hardware constraints associated with the AT (eg, the ability to transmit, track, and manage multiple carriers), and so on. The term "undo" with respect to the carrier disclosed herein may refer to stopping (or terminating) all transmissions on the carrier (e.g., associated with steering, traffic/data, and consumption channels). Further description of carrier allocation and management is provided below. An example. In an example, an AT may initially send a plurality of access probes on a random hashed RL carrier (eg, 'trying to distribute evenly from across all available

115031.doc •56- 、S 1336195 用RL載波之不同AT的存取探針所產生之RL負載)。如下文 進一步所說明,在回應中,AN可決定將一或多個載波指 派至AT,其可不同於AT先前將存取探針所發送至之載 波。 圖3 0展示一呼叫流程圖3000,其說明多載波通信系統中 之載波分配及管理之一實例。在步驟3010處,AT 3001將 初始或預定RL載波上之存取探針(例如,藉由雜湊函數)發 送至AN 3002。在步驟3020處,一旦將存取探針解碼,AN 3002就將一存取通道確認(本文為縮寫及簡潔起見而展示 為"AC-ACK”)發送至AT 3001。在步驟3030處,AN 3002判 定(例如,藉由執行載波管理演算法)待指派至AT 3001之 FL及RL載波的數目。AN 3002亦可識別待指派至AT之不同 於AT 3001最初探測之載波的FL及RL載波。在步驟3040 處,AN 3002將一指派訊息(本文為縮寫及簡潔起見而展示 為"TCA")發送至AT 3 001,其指示被指派至AT 3 001之FL及 RL載波及AT 3001可用來判定每一新近指派之RL載波上之 初始傳輸導引功率的參考值(本文稱為"TxInitAjust”)。在 步驟3050處,AT 3001將一 ACK至TCA(本文為縮寫及簡潔 起見而展示為"TCC”)發送至AN 3002。在步驟3060處,AT 3 00 1基於TxInitAjust來判定每一新近指派之RL載波上的初 始傳輸導引功率。115031.doc • 56-, S 1336195 RL load generated by access probes of different ATs of the RL carrier). As explained further below, in response, the AN may decide to assign one or more carriers to the AT, which may be different than the carrier to which the AT previously sent the access probe. Figure 30 illustrates a call flow diagram 3000 illustrating one example of carrier allocation and management in a multi-carrier communication system. At step 3010, the AT 3001 transmits an access probe on the initial or predetermined RL carrier (e.g., by a hash function) to the AN 3002. At step 3020, upon decoding the access probe, the AN 3002 sends an access channel acknowledgment (shown herein as "AC-ACK" for abbreviations and conciseness) to the AT 3001. At step 3030, AN 3002 determines (e.g., by performing a carrier management algorithm) the number of FL and RL carriers to be assigned to AT 3001. AN 3002 may also identify FL and RL carriers to be assigned to the AT that are different from the carrier originally detected by AT 3001. At step 3040, the AN 3002 sends an assignment message (shown herein as "TCA" for abbreviations and conciseness) to AT 3 001 indicating the FL and RL carriers assigned to AT 3 001 and the AT 3001 A reference value (herein referred to as "TxInitAjust") that can be used to determine the initial transmission pilot power on each newly assigned RL carrier. At step 3050, AT 3001 sends an ACK to TCA (shown herein as "TCC" for abbreviations and conciseness) to AN 3002. At step 3060, AT 3 00 1 determines each recent assignment based on TxInitAjust. The initial transmission pilot power on the RL carrier.

在圖30中,舉例而言,AT 3001可最初將存取探針發送 於第一RL載波上。除了第一RL載波以外,AN 3002可隨後 將第二RL載波(不同於第一 RL載波)指派至AT 3001。AN 5 ) 115031.doc •57- 1336195 3002亦可將第二RL載波分配至AT 3001以代替第一 RL載 波。在該等情況下,AN 3002可發送用於Ατ 3〇〇1之In Figure 30, for example, the AT 3001 may initially transmit an access probe on a first RL carrier. In addition to the first RL carrier, the AN 3002 can then assign a second RL carrier (different from the first RL carrier) to the AT 3001. AN 5 ) 115031.doc • 57- 1336195 3002 may also assign a second RL carrier to AT 3001 in place of the first RL carrier. In such cases, AN 3002 can be sent for Ατ 3〇〇1

TxInitAjust(例如,包括於TCA中)以判定第二尺1載波上之 初始傳輸功率。 在一實例中,最初可向AT指派FL及RL中之每一者上的 單載波。心後’需要在FL及/或RL上添加更多載波。用 於添加更多載波之觸發可藉由AT來起始,例如,關於一具 有更多資料之新的有效MAC流及/或改良型可用傳輸功 率專卓。用於添加更多載波之觸發亦可藉由an來起 始,例如,關於RL上之負載條件改變及/或用於Ατ之几上 之新的有效MAC流,等等。 圖31展示一呼叫流程圖31〇〇,其說明向AT添加更多載波 之實例。在步驟3 110處’ AT 3〇〇1判定所需之fl及rl载 波的數目(例如,藉由執行一載波管理演算法)。若結果指 示需要更多載波,則在步驟3120處AT將一請求訊息發送至 AN 3002。在步驟313〇處,AN 3002判定是否將額外載波 分配至AT 3001。在步驟3140處,AN 3〇〇2將指示待指派至 AT 3001之額外載波及與每一新近指派之rl載波(若有)相 關聯之TxInitAjust的TCA發送至AT 3001。在步驟3150處, AT 3001 將 TCC 發送至 AN 3002。在步驟 3160 處,AT 3001 基於TxImtAjust來判定每一新近指派iRL載波上的初始傳 輸功率。 在AN 3002可起始更多載波之添加的情況下,an 3002 可自一自AT 3001所接收之訊息(例如,IS 856型系統中之 115031.doc •58· (S :, 路由更新訊息)獲取FL及RL有關資訊e AN 3〇〇2隨後可判 疋(例如,藉由執行一載波管理演算法)待分配至AT 3工之 L及RL載波的新集合。諸如上文所描述,AN 3〇〇2可將指 丁新載波札派(以及用於每一新近指派之rl載波的 TxInitAjust)之 TCA進—步發送至 AT 3〇〇 丄。 在實例中,最初(或先前)可向AT指派FL及RL兩者上 之多個載波。該AT可隨後決定撤消先前指派之RL載波的 子集。用於撤消AT處之載波的觸發可歸因於各種因素,包 括(但不限於): AT又到鏈路預算限制且可能無法在所有指派載波上 成功地封閉RL(換言之,成功地維持RL上之預定封包錯誤 率)。舉例而言,由於傳輸功率限制,AT可能無法在所有 才曰派RL載波上與AN成功地通信。此可促使Ατ撤消先前指 派之RL載波之子集並使用可用傳輸功率而在剩餘rl載波 上與AN成功地通信。 在RL上存在傳輸功率低效率。舉例而言,Ατ可具有足 夠功率來封閉鏈路並與八\通信;然而,依據八1之功率使 用,支援多個RL載波可能效率低。在該等情況下,八1可 藉由未支付在多個RL載波上所傳輸之RLs用通道之成本 而疋使用可用功率在指派RL通道之子集上傳輸而狀況更 好。 AT受到資料限制且可能不意欲支付傳輸與未使用之rl 載波相關聯之額外耗用通道的成本。 圖32展示一呼叫流程圖32〇〇,其說明受限鏈路預算可起 115031.doc -59· 1336195 始用於撤消某些RL載波之觸發的實例。在步驟3210處, AT 3001撤消先前指派之RL載波的子集,使得可用傳輸功 率足以在一或多個剩餘RL載波上成功地封閉鏈路。在步驟 3220處,AT 3001將一指示被撤消之先前指派2RL載波的 子集及基礎原因之請求訊息發送至AN 3002。在回應中, 在步驟3230處,AN 3 002將TC A發送至AT 3001,該TCA指 示被指派至AT之FL載波的數目及FL有關耗用通道對與at 3001相關聯之剩餘RL載波的映射。 圖33展示一呼叫流程圖3300’其說明傳輸功率低效率可 起始用於撤消某些RL載波之觸發的實例。在步驟33 1〇處, AT 3001判定其需要撤消之先前指派之rl載波的數目。在 步驟3320處,AT 3001將一指示其意欲撤消之先前指派之 RL載波的數目及基礎原因之請求訊息發送至an 3 0 0 2。AT 3001可在實際上撤消任何RL載波之前等待來自aN 3〇〇2之 確認(或驗證)。在步驟3330處,AN 3002將TCA發送至AT 3001 ’該TCA指示被指派至AT 3001之FL及RL載波的數目 及FL有關耗用通道對與AT 3〇〇1相關聯之剩餘以載波之映 射。—旦接收到TCA,在步驟3340處,AT 3001就執行FL 有關耗用通道之映射。為提供平滑傳輸,在步驟335〇處, AT 3001在所有指派RL載波上將FL有關耗用通道同時傳輸 某(例如,短)持續時間。此後,如步驟3360中所說明,AT 3001撤消先前指派之尺[載波的所有子集。 在資料限制可起始用於撤消某些RL載波之觸發的情況 下’ AT 3001可決定僅撤消未載運fl有關耗用通道之rl載 115031.doc •60- 1336195 ' 波。舉例而言,AT 3001可首先在對AN 3002之請求訊息中 '對其進行指示,並制止撤消任何RL載波,直至諸如上文所 描述自AN 3 002獲取確認(例如,TCA)。 在一實例中,最初可向AT指派FL及RL中之每一者上的 單一載波。AN可隨後決定將先前指派之RL載波改變為新 (或不同)載波。舉例而言,用於改變藉由AN之RL載波指 派之觸發可歸因於AT位置之改變,同時AN使用基於位置 之載波分配演算法。 ♦ 圖34展示一呼叫流程圖3400,其說明AN可起始新RL載 波指派之實例。在步驟34 10處,最初(或先前)向AT 3001指 派FL及RL中之每一者上的單一載波。在步驟3420處,AN 3002獲取FL及RL有關資訊(例如,AT 3001處之傳輸功率可 用性、基於AT之平均FL信號干擾雜訊比(SINR)之AT位 置,等等),例如,獲取自一自AT 300 1所接收之訊息(例 如,路由更新訊息)。基於該資訊,AN 3002決定改變AT之 RL載波(例如,藉由執行一載波管理演算法)。為確保平滑 ® 轉變,在步驟3430處,AN將TCA發送至AT 3001(例如)歷 時一短持續時間,該TCA指示被指派至AT 3001之兩個(新 的加上先前的)RL載波及FL有關耗用通道對新近指派之RL 載波的映射。在確保AN 3 002能夠將新近指派之RL載波上 的所有FL有關耗用通道有效地解碼(如步驟3450所說明)之 後,如步驟3460所說明,AN 3 002發送請求AT 3 001撤消先 前指派之RL載波之TCA。在步驟3470處,AT 3001撤消先 前指派之RL載波。 115031.doc •61 - 1336195 上文所描述之實例提供多載波通信系統中之載波分配及 管理之某些實施例。存在其他實例及實施例。舉例而言, 在某些實施例中,FL及RL載波指派(以及添加或撤消某些 載波)可藉由AN來單方面地判定,例如,關於由at所提供 之排程訊息(諸如上文所描述)。 圖35說明可用於實施本文所揭示之某些實施例之裝置 3500的方塊圖。以實例說明之,裝置35〇〇可包括:一載波 分配單元3510,其經組態以判定待指派至八7之載波的數目 (例如,諸如上文所描述,作為一或多個載波分配參數之 函數);及一傳輸單元3520,其經組態以基於載波分配單 元3 5 10之判定而將一指派訊息發送至at。 裝置3500可進一步包括一接收單元353〇,其經組態以自 AT接收排程資訊、存取探針及其他資訊(諸如上文所描 述)。載波分配單元35 1 0可經進一步組態以(例如)關於自 AT所接收之排程資訊、存取探針及/或其他資訊而判定被 指派至AT之FL及/或RL載波的數目。 在裝置3500中,載波分配單元3510、傳輸單元352〇及接 收早元3530可搞接至一通彳§匯流排3540 ^ —處理單元3550 及一記憶體單元3560亦可耦接至通信匯流排354〇。處理單 元3550可經組態以控制及/或協調各種單元之操作。記憶 體單元3560可體現待由處理單元3550所執行之指令。 圖36說明可用於實施本文所揭示之某些實施例之裝置 3600的方塊圖。以實例說明之,裝置36〇〇可包括:一載波 判疋單元3 610,其經組態以判定由at所需之rl載波的數TxInitAjust (e.g., included in the TCA) to determine the initial transmission power on the second 1:1 carrier. In an example, the AT can be initially assigned a single carrier on each of the FL and RL. Behind the heart, you need to add more carriers on the FL and / or RL. The trigger for adding more carriers can be initiated by the AT, for example, with respect to a new valid MAC stream with more information and/or improved available transmission power. The triggering for adding more carriers can also be initiated by an, for example, with respect to load condition changes on the RL and/or new valid MAC flows for a few Ατ, and so on. Figure 31 shows a call flow diagram 31, which illustrates an example of adding more carriers to an AT. At step 3 110, AT 3〇〇1 determines the number of fl and rl carriers required (e.g., by performing a carrier management algorithm). If the result indicates that more carriers are needed, then at step 3120 the AT sends a request message to AN 3002. At step 313, the AN 3002 determines whether an additional carrier is allocated to the AT 3001. At step 3140, AN 3〇〇2 sends a TCA indicating the additional carrier to be assigned to AT 3001 and TxInitAjust associated with each newly assigned rl carrier (if any) to AT 3001. At step 3150, the AT 3001 sends the TCC to the AN 3002. At step 3160, AT 3001 determines the initial transmission power on each newly assigned iRL carrier based on TxImtAjust. In the case where the AN 3002 can start adding more carriers, the an 3002 can receive messages from the AT 3001 (for example, 115031.doc • 58 in the IS 856 system (S:, routing update message) Acquiring the FL and RL related information e AN 3〇〇2 may then determine (eg, by performing a carrier management algorithm) a new set of L and RL carriers to be assigned to the AT 3 operator. Such as described above, AN 3〇〇2 can send the TCA of the new carrier (and TxInitAjust for each newly assigned rl carrier) to AT 3〇〇丄. In the example, the initial (or previous) can be The AT assigns multiple carriers on both the FL and the RL. The AT may then decide to revoke a subset of the previously assigned RL carriers. The trigger for revoking the carrier at the AT may be attributable to various factors including, but not limited to, : The AT again has a link budget constraint and may not be able to successfully enclose the RL on all assigned carriers (in other words, successfully maintaining the predetermined packet error rate on the RL). For example, due to transmission power limitations, the AT may not be able to do it at all. The RL carrier successfully communicates with the AN. The τ can be caused to revoke a subset of the previously assigned RL carriers and successfully communicate with the AN on the remaining rl carriers using the available transmit power. There is transmission power inefficiency on the RL. For example, Ατ can have sufficient power to close the link And communicate with the eight\; however, according to the power usage of VIII, it may be inefficient to support multiple RL carriers. In these cases, 八1 can be used by the RLs channel that is not transmitted on multiple RL carriers. The cost is better to use the available power to transmit on a subset of the assigned RL channels. The AT is limited by data and may not be interested in paying for the cost of the additional overhead channel associated with the unused rl carrier. Figure 32 shows a call Flowchart 32A illustrates an example in which the restricted link budget can be used to trigger the revocation of certain RL carriers starting at 115031.doc - 59. 1336195. At step 3210, the AT 3001 revokes the child of the previously assigned RL carrier. The set such that the available transmit power is sufficient to successfully close the link on one or more of the remaining RL carriers. At step 3220, the AT 3001 will indicate a subset of the previously assigned 2RL carriers that were revoked and The base cause request message is sent to AN 3002. In response, at step 3230, AN 3 002 sends TC A to AT 3001, which indicates the number of FL carriers assigned to the AT and the FL related consumption channel pair and Mapping of the remaining RL carriers associated with at 300 1. Figure 33 shows a call flow diagram 3300' illustrating an example of a transmission power inefficiency that may initiate a trigger for revoking certain RL carriers. At step 33 1 , AT 3001 Determine the number of previously assigned rl carriers that it needs to revoke. At step 3320, the AT 3001 sends a request message indicating the number of previously assigned RL carriers and the underlying cause to which it intends to revoke to an 301. The AT 3001 can wait for a confirmation (or verification) from aN 3〇〇2 before actually canceling any RL carriers. At step 3330, the AN 3002 sends the TCA to the AT 3001 'The TCA indicates the number of FL and RL carriers assigned to the AT 3001 and the remaining carrier-associated mapping of the FL-related drain channel pair associated with AT 3〇〇1. . Once the TCA is received, at step 3340, the AT 3001 performs a FL mapping of the consumed lanes. To provide smooth transmission, at step 335, the AT 3001 simultaneously transmits the FL related consumption channel for a certain (e.g., short) duration on all assigned RL carriers. Thereafter, as illustrated in step 3360, the AT 3001 revokes the previously assigned ruler [all subsets of carriers. In the case where the data limit can be initiated to revoke the triggering of certain RL carriers, the AT 3001 may decide to revoke only the unloaded fl-related rl load 115031.doc • 60- 1336195 'wave. For example, AT 3001 may first 'instruct it in the request message to AN 3002 and suppress undoing any RL carrier until an acknowledgment (e.g., TCA) is obtained from AN 3 002, such as described above. In an example, the AT can be initially assigned a single carrier on each of the FL and RL. The AN may then decide to change the previously assigned RL carrier to a new (or different) carrier. For example, the trigger used to change the RL carrier assignment by the AN can be attributed to a change in the AT location while the AN uses a location based carrier allocation algorithm. ♦ Figure 34 shows a call flow diagram 3400 illustrating an example in which an AN can initiate a new RL carrier assignment. At step 3410, a single carrier on each of the FL and RL is initially (or previously) assigned to the AT 3001. At step 3420, AN 3002 obtains FL and RL related information (eg, transmission power availability at AT 3001, AT-based average FL signal interference noise ratio (SINR) AT position, etc.), for example, obtained from one Messages received from AT 300 1 (eg, routing update messages). Based on this information, AN 3002 decides to change the RL carrier of the AT (e.g., by performing a carrier management algorithm). To ensure a smoothed® transition, at step 3430, the AN sends the TCA to the AT 3001 (for example) for a short duration, the TCA indication being assigned to the two (new plus previous) RL carriers and FL of the AT 3001 A mapping of the consumed channel to the newly assigned RL carrier. After ensuring that AN 3 002 is capable of efficiently decoding all FL-related drain channels on the newly assigned RL carrier (as illustrated by step 3450), as illustrated by step 3460, AN 3 002 sends a request to AT 3 001 to revoke the previously assigned TCA of the RL carrier. At step 3470, the AT 3001 revokes the previously assigned RL carrier. 115031.doc • 61 - 1336195 The examples described above provide certain embodiments of carrier allocation and management in a multi-carrier communication system. There are other examples and embodiments. For example, in some embodiments, FL and RL carrier assignments (and adding or revoking certain carriers) may be unilaterally determined by the AN, for example, with respect to scheduling messages provided by at (such as above Described). Figure 35 illustrates a block diagram of an apparatus 3500 that can be used to implement certain embodiments disclosed herein. By way of example, device 35A may include a carrier allocation unit 3510 configured to determine the number of carriers to be assigned to VIII 7 (eg, as described above, as one or more carrier allocation parameters) And a transmission unit 3520 configured to send an assignment message to at based on the determination of the carrier allocation unit 305. Apparatus 3500 can further include a receiving unit 353〇 configured to receive scheduling information, access probes, and other information (such as described above) from the AT. The carrier allocation unit 35 10 may be further configured to determine the number of FL and/or RL carriers assigned to the AT, for example, with respect to schedule information received from the AT, access probes, and/or other information. In the device 3500, the carrier allocation unit 3510, the transmission unit 352, and the receiving unit 3530 can be connected to a communication bus 3540. The processing unit 3550 and a memory unit 3560 can also be coupled to the communication bus 354. . Processing unit 3550 can be configured to control and/or coordinate the operation of various units. Memory unit 3560 can embody instructions to be executed by processing unit 3550. Figure 36 illustrates a block diagram of an apparatus 3600 that can be used to implement certain embodiments disclosed herein. By way of example, device 36A may include a carrier arbitration unit 3 610 configured to determine the number of rl carriers required by at

115031.doc •62· S 1336195 目(例如,諸如上文所描述,作為一或多個載波判定參數 之函數);及一傳輸單元3620,其經組態以基於載波判定 單元3 61 0之判定而將一請求訊息發送至an。 裝置3600可進一步包括一接收單元363〇,其經組態以自 AN接收一(例如)指示被指派至at之載波的數目以及用於 任何新近私派之RL載波的TxInitAdjust之指派訊息(諸如上 文所描述)。裝置3600亦可包括一功率調整單元364〇,其 、、呈組態以基於TxlnitAdjust(及其他傳輸功率調整)而判定用 於每一新近指派之尺^載波的初始傳輸功率。傳輸單元362〇 可經進一步組態以將來自AT之排程資訊、存取探針及其他 資訊傳輸至AN。 在裝置3600中’載波判定單元3610、傳輸單元3620、接 收單元3630及功率調整單元3640可耦接至一通信匯流排 3650。處理單元3 660及一記憶體單元3 670亦可耦接至通 信匯流排3650。處理單元3660可經組態以控制及/或協調 各種單元之操作。記憶體單元3670可體現待由處理單元 3660所執行之指令。 各種所揭示之實施例可實施於多載波通信系統中之 AN、AT及其他元件中。 圖35-36中之各種單元/模組及本文所揭示之其他實施例 叮實施於硬體、軟體、勤體或其組合中。在硬體實施例 中各種單元可實施於一或多個特殊應用積體電路 (ASIC)、數位信號處理器(DSp)、數位信號處理器件 (DSPD)、場可程式化閘陣列(FpGA)、處理器、微處理 115031.doc -63· 态控制恣、微控制器、可程式化邏輯器件(PLD)、其他 電子早το或其任何組合内。在軟體實施例中,各種單元可 以執行本文所描述之功能的模組(例如,程序、函數,等 等)來實施。軟體程式碼可儲存於記憶體單元中並藉由處 (或處理單元)來執行。記憶體單元可實施於處理器内 〆處理器外。p ,在該情況下’其可經由此項技術中已知之 各種構件而以通信方式耦接至處理器。 各種所揭示之實施例可實施於控制器、Ατ及用於提供廣 播/多點播送服務之其他構件中。本文所揭示之實施例可 應用於資料處理系,统、無線通信系統、單向廣播系統及需 要資訊有效傳輸之任何其他系統。 熟習此項技術者應瞭解,可使用任何各種不同技術來表 不貝訊及信號。舉例而言,可藉由電壓、電流、電磁波、 磁場或粒子、光場或粒子或其任何組合來表示在整個上述 描述中所提及之資料、指令、命令、資訊、信號、位元、 符號及晶片。 熟習此項技術者應進一步瞭解,結合本文所揭示之實施 例而描述的各種說明性邏輯區塊、模组、電路及演算法步 驟可實施為電子硬體、電腦軟體或兩者之組合。為清晰地 說明硬體與軟體之此互換性,各種說明性組件、區塊、模 組、電路及步驟在上文通常依據其功能性而加以描述。將 該功能性實施為硬體還是軟體取決於強加於整個系統上之 特定應用及設計約束。熟習此項技術者對於每一特定應用 可以變化之方式來實施所描述之功能性,但該等實施決策 U 503 l.doc •64· < S > 不應被解釋為導致偏離本發明之範疇。 、’·〇 σ本文所揭不之實施例而描述的各種說明性邏輯區 塊、模組及電路可以通用處理器、數位信號處理器 (DSP)、特殊應用積體電路(Asic)、場可程式化間陣列 (^PGA)或其他可程式化邏輯器#、離散閘極或電晶體邏 輯離散硬體組件或其經設計以執行本文所描述之功能的 任何組合來實施或執行。通用處理器可為微處理器,但在 替代實施例t,處理器可為任何f知處理器、控制器、微 控制器或狀態機。處理器亦可實施為計算器件之組合,例 如’ DSP與微處理器之組合、複數個微處理器、一或多個 微處理|§結合一 DSP核心或任何其他該組態。 結合本文所揭示之實施例而描述之方法或演算法的步驟 可直接體現於硬體中、由處理器所執行之軟體模組中或兩 者之組合中。軟體模組可駐留於隨機存取記憶體(ram)、 快閃記憶體、唯讀記憶體(R〇M)、電可程式化 ROM(EPROM)、電可擦可程式化R〇M(EEpR〇M)、暫存 器、硬碟、抽取式磁碟、CD-ROM或此項技術中已知之任 何形式的儲存媒體中。一例示性儲存媒體耦接至處理器, 使得處理器可自儲存媒體讀取資訊及將資訊寫入至儲存媒 體。在替代實施例中’儲存媒體可與處理器為一體式。處 理器及儲存媒體可駐留於ASIC中。ASIC可駐留於AT中。 在替代實施例中’處理器及儲存媒體可作為離散組件而駐 留於AT中》 k供所揭示之實施例的先前描述以使熟習此項技術者能 115031.doc -65 · s ) 夠製作或使用本發明。對此等實施例之各種修改對於熟習 此項技術者而言將係顯而易見的,且本文所界定之一般原 理可應用於其他實施例而不脫離本發明之精神或範疇。因 此’本發明並非意欲限於本文所示之實施例,而應符合與 本文所揭示之原理及新穎特徵一致的最寬範疇。 【圖式簡單說明】 圖1說明一支援許多使用者且能夠實施本文所論述之實 施例之至少一些態樣之通信系統的實例; 圖2為說明尚資料速率通信系統中之存取網路及存取終 端機的方塊圖; 圖3為說明存取終端機上之層堆疊的方塊圖; 圖4為說明存取終端機上之較高層、媒體存取控制層與 實體層之間的例示性相互作用之方塊圖; 圖5A為說明一傳輸至存取網路之高容量封包的方塊圖; 圖5B為說明一傳輸至存取網路之低等待時間封包的方塊 圖; 圖6為說明可存在於在抱纟面 你瓦存取網路上之不同類型之流的方塊 圆, 圖7為說明一用於高容量封包 之例示性流集合的方塊 圖; 圖8為說明一用於低等待時間封包之例示性流集合的方 塊圖; 圖9為說明可維持於存取終端機處關定高容量流是否 包括於低等待時間封包之流集合中之資訊的方塊圖; 115031.doc * 66 - 1336195 圖ίο為說明_扁@ / 内之一存取網路及複數個存取終端機 的方塊圖; 圖11說明T用於射帛於存取終端機U用功率的 例示性機制; :12為說明一扇區内之至少一些存取終端機包括多個流 之實施例的方塊圖; 圖為說月存取終端機可藉以獲取用於存取終端機上之 流之當前功率分配之一方式的方塊圖;115031.doc • 62· S 1336195 (eg, as described above, as a function of one or more carrier decision parameters); and a transmission unit 3620 configured to determine based on the carrier determination unit 3 61 0 A request message is sent to an. Apparatus 3600 can further include a receiving unit 363 configured to receive, from the AN, an assignment message indicating, for example, the number of carriers assigned to at and TxInitAdjust for any newly private RL carrier (such as The text describes). Apparatus 3600 can also include a power adjustment unit 364, configured to determine an initial transmission power for each newly assigned squad carrier based on TxlnitAdjust (and other transmission power adjustments). The transmission unit 362 can be further configured to transmit scheduling information, access probes, and other information from the AT to the AN. In the device 3600, the carrier determining unit 3610, the transmitting unit 3620, the receiving unit 3630, and the power adjusting unit 3640 can be coupled to a communication bus 3650. The processing unit 3 660 and a memory unit 3 670 can also be coupled to the communication bus 3650. Processing unit 3660 can be configured to control and/or coordinate the operation of various units. Memory unit 3670 can embody instructions to be executed by processing unit 3660. The various disclosed embodiments can be implemented in AN, AT, and other components in a multi-carrier communication system. The various units/modules of Figures 35-36 and other embodiments disclosed herein are implemented in hardware, software, hard work, or a combination thereof. In a hardware embodiment, various units may be implemented in one or more special application integrated circuits (ASICs), digital signal processors (DSp), digital signal processing devices (DSPDs), field programmable gate arrays (FpGA), Processor, microprocessor 115031.doc -63 · state control, microcontroller, programmable logic device (PLD), other electronic early το or any combination thereof. In a software embodiment, various elements may be implemented by modules (e.g., programs, functions, etc.) that perform the functions described herein. The software code can be stored in the memory unit and executed by the (or processing unit). The memory unit can be implemented outside the processor and outside the processor. In this case, it can be communicatively coupled to the processor via various components known in the art. The various disclosed embodiments can be implemented in controllers, Ατ, and other components for providing broadcast/multicast services. Embodiments disclosed herein may be applied to data processing systems, wireless communication systems, one-way broadcast systems, and any other system that requires efficient transmission of information. Those skilled in the art should be aware that any of a variety of different technologies can be used to express the signals and signals. For example, the data, instructions, commands, information, signals, bits, symbols referred to throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, light fields or particles, or any combination thereof. And wafers. It will be further appreciated by those skilled in the art that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein can be implemented as an electronic hardware, a computer software, or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps are generally described above in terms of their functionality. Whether the functionality is implemented as hardware or software depends on the specific application and design constraints imposed on the overall system. Those skilled in the art will be able to implement the described functionality in a manner that can vary for each particular application, but such implementation decisions U 503 l.doc • 64· < S > should not be construed as causing a departure from the present invention. category. The various illustrative logic blocks, modules, and circuits described in the embodiments disclosed herein may be general purpose processors, digital signal processors (DSPs), special application integrated circuits (Asic), field-receivable A stylized array (^PGA) or other programmable logic #, discrete gate or transistor logic discrete hardware component or any combination thereof designed to perform the functions described herein is implemented or executed. A general purpose processor may be a microprocessor, but in the alternative embodiment t, the processor may be any processor, controller, microcontroller or state machine. The processor can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors, and a DSP core or any other such configuration. The steps of the method or algorithm described in connection with the embodiments disclosed herein may be embodied in a hardware, in a software module executed by a processor, or in a combination of both. The software module can reside in random access memory (ram), flash memory, read only memory (R〇M), electrically programmable ROM (EPROM), electrically erasable and programmable R〇M (EEpR) 〇M), scratchpad, hard drive, removable disk, CD-ROM or any form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from the storage medium and write the information to the storage medium. In an alternate embodiment, the storage medium may be integral to the processor. The processor and storage medium can reside in the ASIC. The ASIC can reside in the AT. In an alternate embodiment, the 'processor and storage medium may reside in the AT as discrete components' k for the prior description of the disclosed embodiments to enable the skilled artisan to produce 115031.doc -65 · s ) or The invention is used. Various modifications to the embodiments are obvious to those skilled in the art, and the general principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Therefore, the present invention is not intended to be limited to the embodiments shown herein, but in the broadest scope of the principles and novel features disclosed herein. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 illustrates an example of a communication system that supports many users and that is capable of implementing at least some aspects of the embodiments discussed herein; FIG. 2 illustrates an access network in a data rate communication system and Figure 4 is a block diagram showing the layer stack on the access terminal; Figure 4 is an illustration showing the higher layer, media access control layer and physical layer on the access terminal. Figure 5A is a block diagram illustrating a high-capacity packet transmitted to the access network; Figure 5B is a block diagram illustrating a low latency packet transmitted to the access network; Figure 6 is a block diagram illustrating A block circle of different types of streams present on the tile access network, Figure 7 is a block diagram illustrating an exemplary flow set for high volume packets; Figure 8 is a diagram illustrating a low latency A block diagram of an exemplary set of flow packets of the packet; FIG. 9 is a block diagram illustrating information that can be maintained at the access terminal to determine whether the high-capacity stream is included in the stream set of the low latency packet; 115031.doc * 66 - 1336195 ί 为 为 _ 扁 扁 扁 / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / A block diagram of an embodiment in which at least some of the access terminals in a sector comprise a plurality of streams; the figure is a way in which the monthly access terminal can obtain one of the current power allocations for accessing the stream on the terminal Block diagram

圖為說月在扇區内自存取網路傳輸至存取終端機之反 向活動位元的方塊圖; 圖15為說明可料於存取終端機處㈣定詩存取終端 機上之—或多個流之當前功率分配之資訊的方塊圖; 圖16為說明存取終端機中可用於判定反向活動位元之估 計及扇區之當前負載位準之估計的例示性功能組件之功能 方塊圖; 圖17為說明一用於判定用於存取終端機上之流之當前功 率分配之例示性方法的流程圖; 圖18為說明將請求訊息發送至存取網路上之排程器之存 取終端機的方塊圖; 圖19為說明可維持於存取終端機處以使存取終端機判定 何時將凊求訊息發送至存取網路之資訊的方塊圖; 圖20為說明執行於扇區内之存取網路上之排程器與存取 終端機之間的例不性相互作用之方塊圖; 圖21為說明執行於存取網路上之排程器與存取終端機之 115031.doc •67- 1336195 間的另一例示性相互作用之方塊圖; 圖22為說明自存取網路上之排程器傳輸至存取終端機之 授權訊息之另一實施例的方塊圖; 圖23為說明可儲存於存取終端機處之功率分佈的方塊 El ·園,The figure is a block diagram of the reverse activity bit transmitted from the access network to the access terminal in the sector; FIG. 15 is a diagram showing that the terminal can be accessed at the terminal (4) - or a block diagram of information on the current power allocation of multiple streams; Figure 16 is an illustration of an illustrative functional component in an access terminal that can be used to determine an estimate of a reverse activity bit and an estimate of the current load level of the sector. Figure 17 is a flow chart illustrating an exemplary method for determining the current power allocation for accessing a stream on a terminal; Figure 18 is a diagram illustrating the dispatch of a request message to a scheduler on an access network FIG. 19 is a block diagram showing information that can be maintained at the access terminal to cause the access terminal to determine when to send a request message to the access network; FIG. Block diagram of an exemplary interaction between a scheduler and an access terminal on an access network within a sector; Figure 21 illustrates a scheduler and access terminal implemented on the access network 115031 .doc • Another illustrative phase between 67- 1336195 FIG. 22 is a block diagram showing another embodiment of an authorization message transmitted from a scheduler on a self-access network to an access terminal; FIG. 23 is a diagram illustrating power stored at an access terminal; Distributed square El · Garden,

圖24為說明可儲存於存取終端機處之複數個傳輸條件的 方塊圖; 圖25為說明可由存取終端機執行以判定詩封包之有效 負載大小及功率位準之例示性方法的流程圖; 圖26為說明存取終端機之—實施例的功能方塊圖; 、&圖27說明藉由使用兩個獨立符記桶集合用於每-MAC層 爪而將机存取控制自存取終端機處之流資料整理退箱的實 圖28為說明當整理rtg 驟的流程圖; mac層中之流資料時所執行之步Figure 24 is a block diagram illustrating a plurality of transmission conditions storable at an access terminal; Figure 25 is a flow diagram illustrating an exemplary method executable by an access terminal to determine the payload size and power level of a poem packet Figure 26 is a functional block diagram illustrating an embodiment of an access terminal; & Figure 27 illustrates machine access control self-access by using two separate token bucket sets for each-MAC layer claw The real picture 28 of the flow data collection and unloading at the terminal machine is a flow chart for explaining the rtg process; the steps performed when the flow data in the mac layer is executed

圖29為說明將載波譆龙 α上 求訊息發送至存取網路上之排程器 並接收载波授權訊息之在 存取終端機的方塊圖; 圖30展示一呼叫流程圖 配及管理的實例; 其說明多載波通信中之載波分 圖31展示一呼叫流程圖 配及管理的實例; 圖32展示一呼叫流程圖 配及管理的實例; 圖33展示一呼叫流程圖 其說明多載波通信中之載波分 其說明多載波通信中之載波分 其說明多載波通信中之載波分 115031.doc •68· 1336195 配及管理的實例; 圖34展示一呼叫流程圖,其說明多載波通信中之載波分 配及管理的實例; 圖35說明一方塊圖,其可用於實施某些所揭示之實施 例;及 圖36說明一方塊圖,其可用於實施某些所揭示之實施 例0 【主要元件符號說明】29 is a block diagram showing an access terminal device for transmitting a message on a carrier αα to a scheduler on an access network and receiving a carrier grant message; FIG. 30 shows an example of a call flow diagram configuration and management; FIG. 33 shows an example of a call flow diagram configuration and management; FIG. 33 shows a call flow diagram illustrating a carrier in multi-carrier communication; FIG. The carrier in the multi-carrier communication is described in the description of the carrier in the multi-carrier communication 115031.doc • 68· 1336195. Example of allocation and management; FIG. 34 shows a call flow diagram illustrating carrier allocation in multi-carrier communication and Figure 35 illustrates a block diagram that can be used to implement certain disclosed embodiments; and Figure 36 illustrates a block diagram that can be used to implement certain disclosed embodiments.

100 無線通信系統 102A-102G /J、區 104A-104G 存取點(AP) 106A-106K 存取終端機 204 存取網路(AN) 206 存取終端機(AT) 208 反向訊務通道 306 AT 308 媒體存取控制(MAC)層 310 較高層 312 實體層 314 反向訊務通道(RTC)MAC協定 406 AT 408 MAC層 410 較高層 412 實體層 115031.doc -69- 1336195100 Wireless Communication System 102A-102G/J, Zone 104A-104G Access Point (AP) 106A-106K Access Terminal 204 Access Network (AN) 206 Access Terminal (AT) 208 Reverse Traffic Channel 306 AT 308 Medium Access Control (MAC) Layer 310 Higher Layer 312 Physical Layer 314 Reverse Traffic Channel (RTC) MAC Protocol 406 AT 408 MAC Layer 410 Higher Layer 412 Physical Layer 115031.doc -69- 1336195

' 414 416 418 420 422 504 506 524a • 524b 606 616a 616b 716a 718 724a 816a 816b 818 824b 906 916a 926 928 930 RTC MAC協定 流 流集合' 414 416 418 420 422 504 506 524a • 524b 606 616a 616b 716a 718 724a 816a 816b 818 824b 906 916a 926 928 930 RTC MAC Protocol Flow Set

有效負載大小 功率位準 AN ATPayload size Power level AN AT

高容量封包 低等待時間封包 AT 高容量封包 低等待時間封包 高容量流 流集合 高容量封包 高容量流 低等待時間流 流集合High-capacity packet Low-latency packet AT high-capacity packet Low-latency packet High-capacity stream Stream set High-capacity packet High-capacity stream Low-waiting stream Stream set

低等待時間封包 AT ifj容直流 可傳輸資料 合併臨限值 合併臨限值 115031.doc -70- 1336195 1004 AN 1006 AT 1032 扇區 1034 可用功率 1034a 當前功率分配 1034b 積聚功率分配 1034c 峰值分配 1135 飽和位準 1136 虛擬”桶" 1204 AN 1206 AT 1216 流 1232 扇區 1234 可用功率 1238 可用功率 1238a 當前功率分配 1238b 積聚功率分配 1238c 峰值分配 1304 AN 1306 AT 1316 流 1338 可用功率 1338a 當前功率分配 1340 排程器 115031.doc 1336195 1342 授權訊息 1374 當前功率分配授權 1404 AN 1406 AT 1432 扇區 1506 AT 1516 流 1546 QRAB 1548 FRAB 1550 向上斜坡函數 1552 向下斜坡函數 1604 AN 1606 AT 1644 RAB 1646 QRAB 1648 FRAB 1654 解調變組件 1656 映射器 1658 第一單極IIR濾波器 1660 第二單極IIR濾波器 1662 限制器件 1664 通信通道 1666 曰誌似然比(LLR) 1804 AN 115031.doc -72- 1336195Low latency packet AT ifj capacitive DC transmit data merge threshold merge threshold 115031.doc -70- 1336195 1004 AN 1006 AT 1032 sector 1034 available power 1034a current power allocation 1034b accumulation power distribution 1034c peak distribution 1135 saturation bit Quasi 1136 Virtual "Bucket" 1204 AN 1206 AT 1216 Stream 1232 Sector 1234 Available Power 1238 Available Power 1238a Current Power Distribution 1238b Accumulated Power Distribution 1238c Peak Distribution 1304 AN 1306 AT 1316 Stream 1338 Available Power 1338a Current Power Distribution 1340 Scheduler 115031.doc 1336195 1342 Authorization message 1374 Current power allocation authorization 1404 AN 1406 AT 1432 Sector 1506 AT 1516 Stream 1546 QRAB 1548 FRAB 1550 Up ramp function 1552 Down ramp function 1604 AN 1606 AT 1644 RAB 1646 QRAB 1648 FRAB 1654 Demodulation Component 1656 Mapper 1658 First Unipolar IIR Filter 1660 Second Unipolar IIR Filter 1662 Limiting Device 1664 Communication Channel 1666 似 似 Like Ratio (LLR) 1804 AN 115031.doc -72- 1336195

1806 AT 1840 排程器 1842 授權訊息 1866 請求訊息 1906 AT 1968 請求比率 1970 請求間隔 2004 AN 2006 AT 2032 扇區 2040 排程器 2042 授權訊息 2072 子集 2104 AN 2106 AT 2116 流 2138 可用功率 2138a 當前功率分配 2140 排程器 2142 授權訊息 2174 當前功率分配授權/穩態估計 2206 AT 2216 流 2238b 積聚功率分配 -73- 115031.doc 13361951806 AT 1840 Scheduler 1842 Authorization Message 1866 Request Message 1906 AT 1968 Request Ratio 1970 Request Interval 2004 AN 2006 AT 2032 Sector 2040 Scheduler 2042 Authorization Message 2072 Subset 2104 AN 2106 AT 2116 Stream 2138 Available Power 2138a Current Power Distribution 2140 Scheduler 2142 Authorization Message 2174 Current Power Distribution Authorization/Steady State Estimate 2206 AT 2216 Flow 2238b Accumulated Power Allocation -73- 115031.doc 1336195

2240 排程器 2242 授權訊息 2274 當前功率分配授權 2276 保持週期 2278 積聚功率分配授權 2306 AT 2320 有效負載大小 2322a 高容量功率位準 2322b 低等待時間功率位準 2380 功率分佈 2406 AT 2482 傳輸條件 2484 分配功率條件 2486 最大功率條件 2488 資料條件 2602 處理器 2604 AN 2605 記憶體 2606 AT 2607 外殼 2608 傳輸器 2609 數位信號處理器(DSP) 2610 接收器 2612 收發器 115031.doc -74- 13361952240 Scheduler 2242 Authorization Message 2274 Current Power Allocation Authorization 2276 Retention Period 2278 Accumulated Power Allocation Authorization 2306 AT 2320 Payload Size 2322a High Capacity Power Level 2322b Low Latency Power Level 2380 Power Distribution 2406 AT 2482 Transmission Condition 2484 Distribution Power Condition 2486 Maximum Power Condition 2488 Data Condition 2602 Processor 2604 AN 2605 Memory 2606 AT 2607 Case 2608 Transmitter 2609 Digital Signal Processor (DSP) 2610 Receiver 2612 Transceiver 115031.doc -74- 1336195

2614 天線 2616 流/信號偵測器 2626 狀態改變器 2628 系統判定器 2635 T2PInflow 2636a 整理符記桶/資料符記桶 2636b 符記桶 2639a .當前資料分配 2639b 積聚資料分配 2639c 載波選擇規則 2640 排程器 2642 載波授權訊息 2666 載波請求訊息 3001 AT 3002 AN 3500 裝置 3510 載波分配單元 3520 傳輸單元 3530 接收單元 3540 通信匯流排 3550 處理單元 3560 記憶體單元 3600 裝置 3610 載波判定單元 (S ) 115031.doc ·75· 1336195 3620 傳輸單元 3630 接收單元 3640 功率調整單元 3650 通信匯流排 3660 處理單元 3670 記憶體單元 115031.doc -76-2614 Antenna 2616 Stream/Signal Detector 2626 State Changer 2628 System Determinator 2635 T2PInflow 2636a Organizer Bucket/Data Marker Bucket 2636b Character Bucket 2639a. Current Data Allocation 2639b Accumulated Data Allocation 2639c Carrier Selection Rule 2640 Scheduler 2642 Carrier Authorization Message 2666 Carrier Request Message 3001 AT 3002 AN 3500 Device 3510 Carrier Allocation Unit 3520 Transmission Unit 3530 Receiving Unit 3540 Communication Bus 3550 Processing Unit 3560 Memory Unit 3600 Device 3610 Carrier Determination Unit (S) 115031.doc · 75· 1336195 3620 Transmission unit 3630 Receiving unit 3640 Power adjustment unit 3650 Communication bus 3660 Processing unit 3670 Memory unit 115031.doc -76-

Claims (1)

1336195 年月 曰修5-替換買 第095135848號專利申請案 中文申請專利範圍替換本(99年5月) 十、申請專利範圍: 1· 一種用於多載波通信之方法,包含 將排程資訊傳輸至一存取網路 資訊中之至少一個: 該排程資訊 包括以下 求 一關於與該反向鏈路上之該存 4仔取,,冬鸲機相關聯之至1336195 月曰修5-Replacement Buying No. 095135848 Patent Application Replacement of Chinese Patent Application (May 99) X. Application Patent Range: 1. A method for multi-carrier communication, including scheduling information transmission At least one of accessing the network information: the scheduling information includes the following as follows: relating to the storage on the reverse link, 少一流的服務品質(QoS)需求, 一可用於該反向鏈路上之傳輸功率,—與該存取終 端機相關聯之缓衝器狀態, 待於該反向鏈路上傳輸之前向鏈路有關耗用資訊之 量, 该反向鏈路上之干擾的量,該存取終端機之一位 置, 該反向鏈路上之一扇區負載,或 • 一與該存取終端機相關聯之硬體約束;及 關於β亥排程資訊而接收一指示被指派至—存取終端機 之載波之數目的指派訊息。 2. 如請求項1之方法,其中該排程資訊包括由該存取終端 機所請求之反向鏈路載波的數目。 3. 如請求項2之方法,進一步包含判定由該存取終端機所 需之反向鏈路載波的數目作為至少一載波判定參數之一 函數。 4·如請求項3之方法,其中該載波判定參數包括以下參數 09. 5. 〇γ 年月日修i替換f $m' — 個:一與i反向鏈路上·^該存取終端機相關 聯的資料需求'一關於與該反向鏈路上之該存取終端機 相關聯之至少一流的服務品質(Qos)需求、一可用於該 反向鏈路上之傳輸功率、待於該反向鏈路上傳輸之前向 鏈路有關耗用資訊之量、該反向鏈路上之干擾的量、該 存取終端機之一位置、該反向鏈路上之一扇區負載及一 與該存取終端機相關聯之硬體約束。 5·如睛求項2之方法,其中該排程資訊進一步包括由該存 取終端機所需之額外反向鏈路載波的數目。 月求項5之方法,其中該指派訊息進一步包括分配至 °亥存取終端機之新近指派之反向鏈路載波的數目及一與 每新近指派之反向鏈路載波上之一初始傳輪功率相關 聯的參考值。 如β求項6之方法,進一步包含基於該參考值來判定該 初始傳輸功率。 月求項1之方法,其中該排程資訊指示由該存取終端 機所撤/肖之先前指派之反向鏈路載波之一子集。 9·如5月求項8之方法,其巾該指派訊息進一步包括指派至 、、、立而機之如向鍵路載波的數目及前向鍵路有關耗 用通道對與該存取終端機相關聯之一或多個剩餘反向鏈 路載波的一映射。 月求項1之方法,其中該排程資訊指示該存取終端機 意欲撤消之先前指派之反向鏈路載波之一子集。 11.如咕求項10之方法其中該指派訊息進一步包括指派至 115031-990507.doc 1336195 99r~~&amp;r— a ^ ,J. ^月日修換買 該存取終端機之前向 义 降戰波及反向鏈路載波的數目及 别向鏈路有關耗用通道對 I對與该存取終端機相關聯之一或 夕個剩餘反向鏈路載波的—映射。 12. 如請求項11之方法,·進一 + v L 3在扣派至該存取終端機 之該等反向鏈路載波中的每一 石上时°哀等刖向鏈路有關 耗用通道傳輸一持續時間。 13. —種用於多載波通信之方法,包含: 判定待指派至-存取終端機之前向鏈路载波的數目作 為至少-載波分配參數之—函數,該至少_载波 數包括以下資訊中之至少一個: -與-反向鏈路上之該存取終端機相關聯的資料需 求, -關於與該反向鏈路上之該存取終端機相關聯之至 少一流的服務品質(QoS)需求, 一可用於該反向鏈路上之傳輸功率,—與該存取终 端機相關聯之緩衝器狀態, 子終 量 待於該反向鏈路上傳輸之前向鏈路有關耗用資訊之 置 该反向鏈路上之干擾的量,該存取終端機之 位 該反向鏈路上之一扇區負載,或 一與該存取終端機相關聯之硬體約束;及 基於該判定而將一指派訊息發送至該存取终端機 14.如請求項13之方法,進一步包含: 115031-990507.doc 1336195 ~ί§9ΐ Π. 〇 7-- 年月曰修正替換頁 自該存取終端機接&amp;排程資 關於該排程資訊而判定與該存取終端機相關聯之反向 鏈路載波的數目。 15.如請求項丨4之方法,其中該排程資訊包括以下資訊中之 至少-m向鏈m存取終端機相關聯的 ^料需求、-關於與該反向鏈路上之該存取終端機相關 %之至少一流的服務品質(Q〇S)需求、一可用於該反向 鏈路上之傳輸功率、一與該存取終端機相關聯之緩衝器 狀態、待於該反向鏈路上傳輸之前向鏈路有關耗用資訊 之量、該反向鏈路上之干擾的量、該存取终端機之一位 置、該反向鏈路上之-扇區負似—與該存取終端機相 關聯之硬體約束。 A如請求項14之方法’其中該排程資訊包括由該存取終端 機所請求之反向鏈路載波的數目。 17·如請求項16之方法,其中該排程資訊進一步包括由該存 取終端機所需之額外反向鏈路載波的數目。 18·如請求項17之方法 具中該指派訊息進一步包括分配j 該存取终端機之新近指派之反向鏈路載波的數目及一 每新近指派之反向鏈路載波上之一初始傳輪功率相 聯的參考值。 19·如請求項14之方法,其中該排程資訊指示由該存取終端 機所撤消之先前指派之反向鏈路載波的一子集。 20·如請求項19之方法,其中該指派訊息進—步包括指派至 該存取终端機之前向鏈路载波的數目纟前向冑路有關耗 115031-990507.doc -4 - 1336195 a . 年月曰修正替換頁 用通道對與該存取終端機相關聯之一或多個剩餘反向鏈 路載波的一映射。 .21.^請求項Η之方法,其中該排程資訊指示該存取終端機 意欲撤消之先前指派之反向鏈路載波之一子集。 22·如請求項21之方法,其中該指派訊息進—步1括指派至 該存取終端機之前向鏈路載波及反向鏈路載波的數目及 前向鏈路有關耗用通道對與該存取終端機相關聯之一或 • 多個剩餘反向鏈路載波的一映射。 23.如請求項13之方法,進一步包含部分地基於自該存取終 Τ機所獲取之前向鏈路有關及反向鏈路有關資訊而判定 是否將一新反向鏈路載波指派至該存取 认如請求項23之方法,其中該前向鍵路有關I:反向鍵路 有關貧訊係後取自一由該存取終端機所傳輸之路由更新 訊息。 25.如請求項23之方法,其中該指派訊息進—步包括分配至 # 該存取終端機之一新近指派之反向鏈路載波及-先前指 派之反向鏈路載波及前向鏈路有關耗料道對該新近指 派之反向鏈路載波的一映射。 26·如請求項25之方法,進—步包含將在該新近指派之反向 鏈路載波上所傳輸之該等前向鏈路有祕料道解碼。 27.如凊求項13之方法,進—步包含自該存取終端機接收一 反向鏈路載波上之複數個存取探針。 28.如請求項27之方法,谁—半 ν έ回應於該等存取探針而 判定待指派至該存取政硅秘&gt; e , 仔取,冬端機之反向鏈路載波的數目。 I15031-990507.doc -5- 1336195 J S日修正替換頁 29.如請求項28之方法中該進一步包括指派至 该存取終端機之前向鏈路載波及反㈣路載波的數目。 30·如請求項29之方法,其中該指派訊息進-步包括一與一 派之反向鏈路载波上之—初始傳輸功率相闕聯的 參考值。 31· —種用於多載波通信之方法,包含: 自一存取終端機接收在—第— 乐夂向鏈路載波上所傳輸 之複數個存取探針; :第—反向鏈路载波指派至該存取终端機;及 將一與該第二反向鏈路載波上 戰反上之初始傳輸功率相關 聯的 &gt; 考值發送至該存取終端機。 32·2^31之方法’進—步包含判定待指派至該存取終 ^械之則向鏈路載波的數目。 33 種用於多載波通信之方法,包含·· 將-第—反向鏈路载波上之複數個存取探針傳輸至一 存取網路;及 自該存取網路接收-訊息,該訊息指示—指派至—存 取終端機之第二反向鏈路载波及一與該第二反向鏈路載 波上之一初始傳輸功率相關聯的參考值。 4·如明求項33之方法,進一步包含美i ,匕3基於5玄參考值而判定該 一反向鏈路載波上之該初始傳輸功率。 35· 一種適於多載波通信之裝置,包含: 用於將排程資訊傳輸至—存取網路之構件,該排程資 訊包括以下資訊中之至少一個: 、 H5031-990507.doc • 6 - 1336195 〇7· 年月曰修正替换頁 一與一反向鏈路上之一 求 存取、、、' 鸲機相關聯的資料需 端機相關聯之至 一關於與該反向鏈路上之該存取终 少一流的服務品質(Q〇S)需求, 與該存取終 一可用於該反向鏈路上之傳輸功率, 端機相關聯之緩衝器狀態,Less first-class quality of service (QoS) requirements, one for the transmission power on the reverse link, the buffer status associated with the access terminal, to be related to the link before transmission on the reverse link The amount of information consumed, the amount of interference on the reverse link, the location of one of the access terminals, the sector load on the reverse link, or • a hardware associated with the access terminal Constraint; and receiving an assignment message indicating the number of carriers assigned to the access terminal with respect to the beta schedule information. 2. The method of claim 1, wherein the schedule information comprises the number of reverse link carriers requested by the access terminal. 3. The method of claim 2, further comprising determining a number of reverse link carriers required by the access terminal as a function of at least one carrier decision parameter. 4. The method of claim 3, wherein the carrier determination parameter comprises the following parameter 09. 5. 〇 γ 年 修 i i replace f $ m ' — one: i and i reverse link on the ^ ^ access terminal Associated data requirements 'one with respect to at least first-class quality of service (Qos) requirements associated with the access terminal on the reverse link, one available for transmission power on the reverse link, to be reversed The amount of information on the link prior to transmission of the link, the amount of interference on the reverse link, the location of one of the access terminals, the sector load on the reverse link, and an access terminal The hardware constraints associated with the machine. 5. The method of claim 2, wherein the schedule information further comprises the number of additional reverse link carriers required by the access terminal. The method of claim 5, wherein the assignment message further comprises a number of newly assigned reverse link carriers assigned to the HF access terminal and an initial transmission on each of the newly assigned reverse link carriers Power associated reference value. The method of β, wherein the method further comprises determining the initial transmission power based on the reference value. The method of claim 1, wherein the schedule information indicates a subset of previously assigned reverse link carriers that are revoked by the access terminal. 9. The method of claim 8, wherein the assignment message further comprises assigning to, , and the number of the lane-to-key carrier and the forward-key-related consumption channel pair and the access terminal A mapping of associated one or more remaining reverse link carriers. The method of claim 1, wherein the schedule information indicates a subset of previously assigned reverse link carriers that the access terminal intends to revoke. 11. The method of claim 10, wherein the assignment message further comprises assigning to 115031-990507.doc 1336195 99r~~&amp;r- a ^ , J. ^ month change to buy the access terminal The number of warfare and reverse link carriers and the mapping of the associated link-related consumption channel pair I to one of the access terminal stations or the remaining remaining reverse link carriers. 12. According to the method of claim 11, the +V L 3 is transmitted to each of the reverse link carriers of the access terminal, and the downlink link is used for the associated channel transmission. A duration. 13. A method for multi-carrier communication, comprising: determining a number of forward link carriers to be assigned to an access terminal as a function of at least a carrier allocation parameter, the at least _carrier number comprising the following information At least one: - a data requirement associated with the access terminal on the reverse link, - at least a first-class quality of service (QoS) requirement associated with the access terminal on the reverse link, The transmit power available on the reverse link, the buffer status associated with the access terminal, and the sub-final amount to be transmitted on the reverse link prior to the link-related consumption information. The amount of interference on the road, the location of the access terminal on the reverse link, a sector load, or a hardware constraint associated with the access terminal; and sending an assignment message based on the determination The access terminal 14. The method of claim 13, further comprising: 115031-990507.doc 1336195 ~ ί§9ΐ Π. 〇7-- 年月曰曰Replacement page from the access terminal machine &amp; scheduling About the row Information and determines the number of reverse link carrier associated with the access of the terminal. 15. The method of claim 4, wherein the schedule information comprises at least -m to the chain m access terminal associated with the information in the following information, - regarding the access terminal on the reverse link At least a first-class quality of service (Q〇S) requirement for the machine-related %, a transmit power available for the reverse link, a buffer status associated with the access terminal, and a transmission on the reverse link The amount of information about the previous link-related information, the amount of interference on the reverse link, the location of one of the access terminals, the negative of the sector on the reverse link - associated with the access terminal Hardware constraints. A. The method of claim 14 wherein the schedule information comprises the number of reverse link carriers requested by the access terminal. 17. The method of claim 16, wherein the schedule information further comprises the number of additional reverse link carriers required by the access terminal. 18. The method of claim 17 wherein the assignment message further comprises assigning j the number of newly assigned reverse link carriers of the access terminal and an initial pass on each newly assigned reverse link carrier. Power-associated reference value. The method of claim 14, wherein the schedule information indicates a subset of previously assigned reverse link carriers that are revoked by the access terminal. 20. The method of claim 19, wherein the assigning the message further comprises assigning to the access terminal a number of forward link carriers, forward traffic related consumption 115031-990507.doc -4 - 1336195 a. The Month Correction Replacement page uses a mapping of a channel pair to one or more remaining reverse link carriers associated with the access terminal. 21.21. The method of claim </ RTI> wherein the schedule information indicates a subset of previously assigned reverse link carriers that the access terminal intends to revoke. The method of claim 21, wherein the assignment message further includes the number of forward link carriers and reverse link carriers and the forward link related consumption channel pair assigned to the access terminal One of the access terminal associated or one mapping of a plurality of remaining reverse link carriers. 23. The method of claim 13, further comprising determining whether to assign a new reverse link carrier to the deposit based in part on prior link related and reverse link related information obtained from the access terminal. The method of claim 23, wherein the forward link related to the I: reverse link is related to a routing update message transmitted by the access terminal. 25. The method of claim 23, wherein the assigning the message further comprises assigning to one of the access terminal a newly assigned reverse link carrier and - a previously assigned reverse link carrier and a forward link A mapping of the consumer lane to the newly assigned reverse link carrier. 26. The method of claim 25, the step comprising decoding the forward link transmitted on the newly assigned reverse link carrier. 27. The method of claim 13, wherein the step of receiving comprises receiving, from the access terminal, a plurality of access probes on a reverse link carrier. 28. The method of claim 27, wherein, in response to the access probes, determining to be assigned to the access silicon secret &gt; e, taking the reverse link carrier of the winter end machine number. I15031-990507.doc -5 - 1336195 JS Day Correction Replacement Page 29. The method of claim 28, further comprising the number of forward link carriers and inverse (four) way carriers assigned to the access terminal. 30. The method of claim 29, wherein the assigning the message further comprises a reference value associated with the initial transmission power on the reverse link carrier of the one. 31. A method for multi-carrier communication, comprising: receiving, from an access terminal, a plurality of access probes transmitted on a -to-to-link carrier; : a first-reverse link carrier Assigned to the access terminal; and send a &gt; test value associated with the initial transmission power of the second reverse link carrier to the access terminal. The method of 32·2^31 includes the determination of the number of link carriers to be assigned to the access terminal. 33 methods for multi-carrier communication, comprising: transmitting a plurality of access probes on a -first reverse link carrier to an access network; and receiving - a message from the access network, The message indicates a second reverse link carrier assigned to the access terminal and a reference value associated with an initial transmission power on the second reverse link carrier. 4. The method of claim 33, further comprising merging i, 匕3 determining the initial transmission power on the reverse link carrier based on the 5 sine reference value. 35. A device suitable for multi-carrier communication, comprising: means for transmitting scheduling information to an access network, the scheduling information comprising at least one of the following information: , H5031-990507.doc • 6 - 1336195 〇7· 曰 曰 替换 替换 替换 替换 替换 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 曰 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换 替换Taking the first-class quality of service (Q〇S) demand, and the access speed that can be used for the transmission power on the reverse link, the buffer status associated with the terminal, 量 待於該反向鏈路上傳輸之前一路㈣耗用資訊之 置 該反向鏈路上之干擾的量,該存取終端機 之一位 成久冋域塔上 一與該存取終端機相關聯之硬體約束,·及 ^關於該排程資訊而接收一指示被指派至—存取終 端機之載波之數目的指派訊息之構件。 、 36.如請求項35之裝置,其中該排程資訊包括由該存取終端 機所請求之反向鏈路載波的數目。 A如請求項36之裝置’進—步包含用於判^由該存取終端 機所需之反向鏈路載波的數目作為至少—載波判定參數 之一函數之構件。 38·如凊求項37之裝置,其中該載波判定參數包括以下參數 中之至少-個一與-反向鏈路上之該存取終端機相關 聯的貪料需求、-關於與該反向鏈路上之該存取終端機 相關知之至少-流的服務品質(Q〇s)需4、-可用於該 反向鏈路上之傳輸功率、待於該反向鏈路上傳輸之前向 H503I-990507.doc 1336195 39. 40. 41. 42. 43. 44. 45. 46. ©ft Sr~j} y 年月曰修正替換頁 鏈路有關耗用資訊之量、該反向鏈路上之干優的量、該 存取终端機之一位置、該反向鏈路上之一扇區負載及一 與該存取終端機相關聯之硬體約束。 如請求項36之裝置,其中該排程資訊進一步包括由該存 取終端機所需之額外反向鏈路載波的數目。 如請求、項39之裝置,其中該指派訊息進一步包括分配至 該存取終端機之新近指派之反向鏈路載波的數目及一與 每新近指派之反向鏈路載波上之一初始傳輸功率相關 聯的參考值。 如請求項40之裝置,進一步包含用於基於該參考值來判 定該初始傳輸功率之構件。 如請求項35之裝置,其中該排程資訊指示由該存取終端 機所撤消之先前指派之反向鏈路載波之一子集。 如請求項42之裝置,其中該指派訊息進一步包括指派至 該存取終端機之前向鏈路載波的數目及前向鏈路有關耗 用通道對與該存取終端機相關聯之一或多個剩餘反向鏈 路載波的~映射。 如請求項35之裝置,其中該排程資訊指示該存取終端機 意欲撤消之先前指派之反向鏈路載波的一子集。 如請求項44之裝置,其中該指派訊息進一步包括指派至 該存取終端機之前向鏈路載波及反向鏈路載波的數目及 前向鏈路有關耗用通道對與該存取終端機相關聯之一或 多個剩餘反向鏈路載波的一映射。 如请求項45之裝置,進一步包含用於在指派至該存取終 115031-990507.doc -8 - 1336195 立而機之該等反向鏈路載波中的每— 有關耗用通道傳輸一持續時間之構件。’ 則向鏈路 47. —種適於多載波通信之裝置,包含: 用於判定待指派至一存取終端機之前向鏈路载波的數 目作為至少-載波分配參數之-函數之構件,該至! 載波分配參數包括以下資訊中之至少—個.X ^ — 求Τ與一反向鏈路上之該存取:端機:目關聯的資料需 一關於與該反向鏈路上之兮为$ ^ 之°亥存#終端機相關聯之至 少一流的服務品質(QoS)需求, 取终 一可用於該反向鏈路上之傳輸功率,一與該存 端機相關聯之緩衝器狀態, 之 量 待於該反向鏈路上傳輸之前向鏈路有關耗用資訊 該反向鏈路上之干擾的詈, 傻幻里,遠存取終端機之—位 • 置, 該反向鏈路上之一扇區負載,或 一與該存取終端機相關聯之硬體約束;及 用於基於該判定而將一指淚邙自麻a E ?日很sfl息發送至該存取終端機 之構件。 48.如請求項47之裝置,進一步包含: 用於自該存取終端機接收排程資訊之構件;及 用於關於違排权資訊而判定與該存取终端機相關聯之 反向鏈路載波的數目之構件。 115031-990507.doc -9· 49. 如請求項48之裝置,其中該排程資訊包括以下資訊中之 至少一個:一與一反向鏈路上之該存取終端機相關聯的 寊料需求、一關於與該反向鏈路上之該存取終端機相關 聯之至少一流的服務品質(Q0S)需求、一可用於該反向 鏈路上之傳輸功率、一與該存取終端機相關聯之緩衝器 狀態、待於該反向鏈路上傳輸之前向鏈路有關耗用資訊 之量、該反向鏈路上之干擾的量、該存取終端機之一位 置、該反向鏈路上之一扇區負載及一與該存取终端機相 關聯之硬體約束。 50. 如請求項48之裝置,其中該排程資訊包括由該存取終端 機所請求之反向鏈路載波的數目。 5 1 ·如請求項50之裝置,其中該排程資訊進一步包括由該存 取終端機所需之額外反向鏈路載波的數目。 52. 如請求項51之裝置,其中該指派訊息進一步包括分配至 該存取終端機之新近指派之反向鏈路載波的數目及一與 每一新近指派之反向鏈路載波上之一初始傳輸功率相關 聯的參考值。 53. 如請求項48之裝置,其中該排程資訊包括由該存取終端 機所撤消之先前指派之反向鏈路載波的一子集。 54·如請求項53之裝置,其中該指派訊息進一步包括指派至 °亥存取终端機之前向鍵路載波的數目及前向鏈路有關耗 用通道對與該存取終端機相關聯之一或多個剩餘反向鍵 路載波的一映射。 55·如請求項48之裝置,其中該排程資訊指示該存取終端機 115031-990507.doc 1336195 L9k ^ 0 ^ :;r &gt;1日您正替換頁 思欲撤消之先前指派之反向鏈路載波之一子集。 56·如請求項55之裝置,其中該指派訊息進一步包括指派至 °亥存取終端機之前向鏈路載波及反向鍵路載波的數目及 刖向鏈路有關耗用通道對與該存取終端機相關聯之—或 多個剩餘反向鏈路載波的一映射。 57.如凊求項47之裝置,進一步包含用於部分地基於自該存 取終端機所獲取之前向鏈路有關及反向鏈路有關資訊而 • 判定是否將一新反向鏈路載波指派至該存取終端機之構 件。 5 8.如巧求項57之裝置,其中該指派訊息進一步包括分配至 亥存取終端機之一新近指派之反向鏈路載波及一先前指 ’之反向鏈路載波及刖向鏈路有關耗用通道對該新近指 派之反向鏈路載波的一映射。 5 9·如。月求項47之裝置,進一步包含用於自該存取終端機接 收一反向鏈路載波上之複數個存取探針之構件。 籲60. 士吻求項59之裝置,其中該指派訊息進一步包括回應於 該等存取探針之被指派至該存取終端機之前向鏈路载波 及反向鏈路載波的數目。 61·如請求項60之裝置,其中該指派訊息進一步包括一與一 新近指派之反向鏈路載波上之—初始傳輸功率相關聯的 參考值。 62. —種適於多載波通信之裝置,包含: 用於自-存取終端機接收在_第_反向鍵路載波上所 傳輸之複數個存取探針之構件; 115031-990507.doc -11 . 1336195 用於將一第 件;及 5253 反向鏈路載波指派至該存取終端 機之構 用於將一與該第二反向鏈路載波上、 相關聯之參考值發送至該存取終端機之構輸功率 63. —種適於多載波通信之裝置,包含: 用於將一第一反向鏈路載波上 至一存取網路之構件;及 複數個存取探針傳輸 用於自該存取網路接收一訊息之構件,該訊阜指干一 指派至一存取終端機之第二反向鏈路載波二:二: 反向鏈路載波上之-初始傳輸功率相關聯的參考值。一 64. ^請求項63之裝置,進一步包含用於基於該參考值而判 定該第二反向鏈路載波上之該初始傳輸功率之構件。 65. —包含符碼之電腦可讀儲存媒體,當其被—處理号執行 時會造成該處理器執行用於多載波通信之操作,該電$ 可讀儲存媒體包括: 用於將排程資訊傳輸至一存取網路之符碼,該排程資 訊包括以下資訊中之至少一個: 一與一反向鏈路上之一存取終端機相關聯的資料需 求, 一關於與該反向鏈路上之該存取終端機相關聯之至 少一流的服務品質(QoS)需求, 一可用於該反向鏈路上之傳輸功率,—與該存取終 端機相關聯之緩衝器狀態, 待於該反向鏈路上傳輸之前向鏈路有關耗用資訊之 115031-990507.doc 12 1336195 量 置 于— 年月曰饺正替換頁 該反向鏈路上之干擾的量,該存取終端機之一 位 該反向鏈路上之一扇區負载,或 一與該存取終端機相關聯之硬體約束;及 用於關於該排程資訊而接收一指示被指派至— 端機之載波之數目的指派訊息之符碼。Quantising the amount of interference on the reverse link before the transmission on the reverse link (4) consumes information, and one of the access terminals is associated with the access terminal on a long-term tower The hardware constraints, and the means for receiving the assignment message indicating the number of carriers assigned to the access terminal are received with respect to the schedule information. 36. The apparatus of claim 35, wherein the schedule information comprises a number of reverse link carriers requested by the access terminal. A device, as in claim 36, includes means for determining the number of reverse link carriers required by the access terminal as a function of at least one of the carrier decision parameters. 38. The apparatus of claim 37, wherein the carrier determination parameter comprises at least one of: the greedy requirement associated with the access terminal on the reverse link, and the reverse chain The access terminal on the road knows that at least the quality of service (Q〇s) of the stream needs to be 4, which can be used for the transmission power on the reverse link, before being transmitted on the reverse link to H503I-990507.doc 1336195 39. 40. 41. 42. 43. 44. 45. 46. ©ft Sr~j} y Year Month 曰 Correct the amount of information on the replacement page link, the amount of dryness on the reverse link, A location of the access terminal, a sector load on the reverse link, and a hardware constraint associated with the access terminal. The apparatus of claim 36, wherein the schedule information further includes the number of additional reverse link carriers required by the access terminal. The apparatus of claim 39, wherein the assignment message further comprises a number of newly assigned reverse link carriers assigned to the access terminal and an initial transmission power of one of each newly assigned reverse link carrier Associated reference value. The apparatus of claim 40, further comprising means for determining the initial transmission power based on the reference value. The apparatus of claim 35, wherein the schedule information indicates a subset of previously assigned reverse link carriers that are revoked by the access terminal. The apparatus of claim 42, wherein the assignment message further comprises assigning to the access terminal a number of forward link carriers and a forward link related consumption channel pair associated with the access terminal one or more The ~ mapping of the remaining reverse link carriers. The apparatus of claim 35, wherein the schedule information indicates a subset of previously assigned reverse link carriers that the access terminal desires to revoke. The apparatus of claim 44, wherein the assignment message further comprises assigning to the access terminal a number of forward link carriers and reverse link carriers and a forward link related consumption channel pair associated with the access terminal A mapping of one or more remaining reverse link carriers. The apparatus of claim 45, further comprising: each of said reverse link carriers assigned to the access terminal 115031-990507.doc -8 - 1336195 for a duration of associated consumption channel transmission The components. 'Sequential link 47. A device suitable for multi-carrier communication, comprising: means for determining a number of forward link carriers to be assigned to an access terminal as a function of at least a carrier allocation parameter, to! The carrier allocation parameter includes at least one of the following information: .X ^ - the access and the access on a reverse link: the data associated with the destination: the information about the reverse link is $^ °Hai Cun# The at least first-class quality of service (QoS) requirements associated with the terminal, the last available transmission power for the reverse link, and the buffer status associated with the storage device. The transmission of the forward link on the reverse link is related to the interference of the interference on the reverse link, in the sneaky, the far access terminal, the sector load on the reverse link, Or a hardware constraint associated with the access terminal; and means for transmitting a finger teardrop to the access terminal based on the determination. 48. The apparatus of claim 47, further comprising: means for receiving schedule information from the access terminal; and for determining a reverse link associated with the access terminal with respect to the violation rights information The component of the number of carriers. The apparatus of claim 48, wherein the schedule information comprises at least one of: a demand associated with the access terminal on a reverse link, a minimum quality of service (QOS) requirement associated with the access terminal on the reverse link, a transmit power available for the reverse link, and a buffer associated with the access terminal State, the amount of information about the link to be consumed before the transmission on the reverse link, the amount of interference on the reverse link, the location of one of the access terminals, one of the sectors on the reverse link The load and a hardware constraint associated with the access terminal. 50. The device of claim 48, wherein the schedule information comprises a number of reverse link carriers requested by the access terminal. The device of claim 50, wherein the schedule information further includes the number of additional reverse link carriers required by the access terminal. 52. The apparatus of claim 51, wherein the assignment message further comprises a number of newly assigned reverse link carriers assigned to the access terminal and an initial on one of each newly assigned reverse link carrier The reference value associated with the transmission power. 53. The device of claim 48, wherein the schedule information comprises a subset of previously assigned reverse link carriers that are revoked by the access terminal. 54. The apparatus of claim 53, wherein the assignment message further comprises assigning to the Haihai access terminal a number of forward-key carriers and a forward link-related drain channel pair associated with the access terminal Or a mapping of a plurality of remaining reverse link carriers. 55. The apparatus of claim 48, wherein the schedule information indicates that the access terminal 115031-990507.doc 1336195 L9k ^ 0 ^ :;r &gt; 1 day is replacing the reverse of the previous assignment that the page is intended to revoke A subset of the link carriers. 56. The apparatus of claim 55, wherein the assignment message further comprises a number of forward link carriers and reverse link carriers assigned to the Haihai access terminal and a link-related associated channel pair and the access A mapping of the terminal associated with one or more of the remaining reverse link carriers. 57. The apparatus of claim 47, further comprising: determining whether to assign a new reverse link carrier based in part on prior link related and reverse link related information obtained from the access terminal; To the components of the access terminal. 5. The apparatus of claim 57, wherein the assignment message further comprises a newly assigned reverse link carrier assigned to one of the Hai access terminals and a reverse link carrier and a forward link of a previous indication A mapping of the consumed channel to the newly assigned reverse link carrier. 5 9·如如. The apparatus of claim 47 further comprising means for receiving a plurality of access probes on a reverse link carrier from the access terminal. The device of claim 59, wherein the assignment message further comprises a number of forward link carriers and reverse link carriers that are assigned to the access terminal in response to the access probes. 61. The apparatus of claim 60, wherein the assignment message further comprises a reference value associated with an initial transmission power on a newly assigned reverse link carrier. 62. A device suitable for multi-carrier communication, comprising: means for receiving, by a self-access terminal, a plurality of access probes transmitted on a _th reverse-keyway carrier; 115031-990507.doc -11. 1336195 for assigning a first piece; and 5253 reverse link carrier to the access terminal for transmitting a reference value associated with the second reverse link carrier to the Accessing the power of the terminal 63. A device suitable for multi-carrier communication, comprising: means for uplinking a first reverse link carrier to an access network; and a plurality of access probes Transmitting a means for receiving a message from the access network, the message being a second reverse link carrier assigned to an access terminal: 2: on the reverse link carrier - initial transmission Power associated reference value. A device of claim 63, further comprising means for determining the initial transmission power on the second reverse link carrier based on the reference value. 65. A computer readable storage medium containing a code that, when executed by a processing number, causes the processor to perform operations for multi-carrier communication, the readable storage medium comprising: for scheduling information Transmitting to a code of an access network, the schedule information including at least one of the following information: a data request associated with one of the access terminals on the reverse link, and an on the reverse link At least a first-class quality of service (QoS) requirement associated with the access terminal, one available for transmission power on the reverse link, a buffer status associated with the access terminal, to be reversed 115031-990507.doc 12 1336195 quantity of the link-related consumption information on the link is placed - the amount of interference on the reverse link is replaced by one of the access terminals Loaded to a sector on the link, or a hardware constraint associated with the access terminal; and for receiving an assignment message indicating the number of carriers assigned to the end station with respect to the schedule information Code 66. 一包含符碼之電腦可讀儲存媒體,當其被—處理器執行 時會造成該處理||執行用於多載波㈣之操作,該: 可讀儲存媒體包括: /电細 用於將—第-反向鏈路载波上之複數個存取探針傳幹 至一存取網路之符碼;及 J66. A computer readable storage medium containing a code that, when executed by a processor, causes the processing|| to perform operations for multiple carriers (4), the: readable storage medium comprising: - a plurality of access probes on the first-reverse link carrier are transmitted to an access network; and J 用於自該存取網路接收一訊息之符碼,該訊息指示 指派至一存取終端機之第二反向鏈路載波及—與該: 反向鏈路载波上之一初始傳輸功率相關聯的參考值。 115031-990507.doc 13-a code for receiving a message from the access network, the message indicating a second reverse link carrier assigned to an access terminal and - relating to: an initial transmission power on the reverse link carrier The reference value of the union. 115031-990507.doc 13-
TW095135848A 2005-03-08 2006-09-27 Method and apparatus for carrier allocation and management in multi-carrier communication systems TWI336195B (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US65998905P 2005-03-08 2005-03-08
US72134305P 2005-09-27 2005-09-27
US11/371,274 US20060203724A1 (en) 2005-03-08 2006-03-07 Multi-carrier, multi-flow, reverse link medium access control for a communication system

Publications (2)

Publication Number Publication Date
TW200723807A TW200723807A (en) 2007-06-16
TWI336195B true TWI336195B (en) 2011-01-11

Family

ID=45075060

Family Applications (1)

Application Number Title Priority Date Filing Date
TW095135848A TWI336195B (en) 2005-03-08 2006-09-27 Method and apparatus for carrier allocation and management in multi-carrier communication systems

Country Status (1)

Country Link
TW (1) TWI336195B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI469671B (en) * 2008-12-30 2015-01-11 Interdigital Patent Holdings Method and apparatus for multiple carrier utilization in wireless communications
US8565170B2 (en) 2009-01-14 2013-10-22 Qualcomm Incorporated Method and apparatus for scheduling data transmission on multiple carriers

Also Published As

Publication number Publication date
TW200723807A (en) 2007-06-16

Similar Documents

Publication Publication Date Title
JP5475023B2 (en) Method and apparatus for carrier allocation and management in a multi-carrier communication system
KR100944131B1 (en) Multi-carrier, multi-flow, reverse link medium access control for a communication system
Pedersen et al. An overview of downlink radio resource management for UTRAN long-term evolution
JP5575845B2 (en) Cooperative autonomous scheduled resource allocation for distributed communication systems
JP4699421B2 (en) Method for transmit power control based on reverse activity bit evaluation and data flow specific upper / lower ramping function and corresponding radio access terminal
TW200926845A (en) Resource scaling in wireless communication systems
US20110158194A1 (en) Scheduling of Data Transmissions in Multi-Carrier Data Transmission Networks
BRPI0910273B1 (en) WIRELESS COMMUNICATION METHOD, MULTIPLE CARRIER MANAGEMENT EQUIPMENT FOR WIRELESS COMMUNICATION, USER EQUIPMENT TO PARTICIPATE IN COMMUNICATIONS
WO2017148213A1 (en) Resource allocation control method, device, and system
CN101273601A (en) Method and apparatus for carrier allocation and management in a multi-carrier communication system
TWI336195B (en) Method and apparatus for carrier allocation and management in multi-carrier communication systems
TWI358218B (en) Cooperative autonomous and scheduled resource allo
CN1864372B (en) Cooperative autonomous and scheduled resource allocation for distributed communication systems
Huang et al. A novel resource allocation scheme based on resource efficiency for LTE-A system
HK1125237A (en) Method and apparatus for carrier allocation and management in multi-carrier communication systems
McVeigh et al. Normalised-power based reservation in connection admission control for mixed services in 3rd generation radio access networks
HK1120176A (en) Multi-carrier, multi-flow, reverse link medium access control for a communication system

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees