EP1755249B1 - Méthode et appareil pour planifier le traitement des données dans un modem - Google Patents

Méthode et appareil pour planifier le traitement des données dans un modem Download PDF

Info

Publication number
EP1755249B1
EP1755249B1 EP06013874.0A EP06013874A EP1755249B1 EP 1755249 B1 EP1755249 B1 EP 1755249B1 EP 06013874 A EP06013874 A EP 06013874A EP 1755249 B1 EP1755249 B1 EP 1755249B1
Authority
EP
European Patent Office
Prior art keywords
information
burst
decoding
map
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
EP06013874.0A
Other languages
German (de)
English (en)
Other versions
EP1755249A2 (fr
EP1755249A3 (fr
Inventor
Hyung-Sang Cho
Byung-Tae Kang
Yun-Sang Park
Bong-Gee Song
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics Co Ltd
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
Application filed by Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Publication of EP1755249A2 publication Critical patent/EP1755249A2/fr
Publication of EP1755249A3 publication Critical patent/EP1755249A3/fr
Application granted granted Critical
Publication of EP1755249B1 publication Critical patent/EP1755249B1/fr
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0075—Transmission of coding parameters to receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0055—MAP-decoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes

Definitions

  • the present invention relates generally to a communication system, and in particular, to an apparatus and method for processing data in a modem for a mobile station used in a communication system.
  • the technology generally used for providing data service to users in the current wireless communication environment is classified into 2.5 th generation or 3 rd generation cellular mobile communication technology, such as Code Division Multiple Access 2000 1x Evolution Data Optimized (CDMA2000 1xEVDO), General Packet Radio Services (GPRS) together with Universal Mobile Telecommunication Service (UMTS), as well as Wireless Local Area Network (LAN) technology, such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 Wireless LAN and HyperLAN/2.
  • CDMA2000 1xEVDO Code Division Multiple Access 2000 1x Evolution Data Optimized
  • GPRS General Packet Radio Services
  • UMTS Universal Mobile Telecommunication Service
  • LAN Wireless Local Area Network
  • IEEE Institute of Electrical and Electronics Engineers 802.11 Wireless LAN and HyperLAN/2.
  • the 3 rd generation mobile communication technology for mainly providing voice service via a circuit-switched network is primarily characterized by providing packet data services in which subscribers can access the Internet in various wireless communication environments.
  • the cellular mobile communication network has a limitation in supporting high-speed packet data service.
  • the CDMA2000 1xEVDO system which is a synchronous mobile communication system, supports a data rate of at most 2.4 Mbps.
  • wireless LAN technologies such as IEEE 802.16-based wireless LAN (see e.g. " Part 16: Air Interface for Fixed Broadband Wireless Access Systems; P80216-REVd_D5pre-approval", IEEE DRAFT; P80216-REVD_D5PRE-APPROVAL, IEEE-SA, PISCATAWAY, NJ USA, vol. 802.16, no. D5pre-approval, 13 May 2004 (2004-05-13), pages 1-915 , XP017647006), HyperLAN/2 and Bluetooth.
  • Such technologies cannot guarantee mobility on the level of the cellular mobile communication system.
  • wireless LAN technologies have replaced the wire communication networks, such as a cable modem and Digital Subscriber Line (xDSL), in hot spot areas such as public place and school, or in the home network environment, making an alternative proposal for providing high-speed data service in the wireless environment.
  • wire communication networks such as a cable modem and Digital Subscriber Line (xDSL)
  • xDSL Digital Subscriber Line
  • the use of the wireless LAN in providing high-speed data service causes a limitation in providing public network service to users.
  • the broadband communication system can provide high-speed data service in the indoor/outdoor still/mobile environments using various types of mobile stations. Below is a detailed description of the communication system.
  • MS mobile station
  • FIG. 1 is a diagram schematically illustrating a data frame format used in a general communication system.
  • FIG. 1 there is shown an IEEE 802.16-based data frame format in a general communication system for providing communication service.
  • the data frame used in the communication system distinguishes a downlink (DL) field and an uplink (UL) field in units of time.
  • a Transmit/receive Transition Gap (TTG) forms a guard time in a transition interval from the downlink to the uplink
  • a Receive/transmit Transition Gap (RTG) forms a guard time in a transition interval from the uplink to the downlink.
  • the horizontal axis represents Orthogonal Frequency Division Multiple Access (OFDMA) symbol numbers
  • the vertical axis represents subchannel logical numbers.
  • OFDMA Orthogonal Frequency Division Multiple Access
  • a preamble for synchronization acquisition is located in a K th OFDMA symbol, and broadcast data information commonly received at MSs, such as Frame Control Header (FCH) and DL-MAP, is located in a (K+1) th OFDMA symbol.
  • the FCH composed of two subchannels, transmits basic information on the subchannel concerning ranging and modulation.
  • Downlink Bursts (DL bursts) of DL burst#1 to DL burst#6 are located in a (K+3) th OFDMA symbol to a (K+15) th OFDMA symbol.
  • Uplink Bursts are locatable in a (K+17) th OFDMA symbol to a (K+26) th OFDMA symbol.
  • Ranging subchannels for ranging are located in the (K+17) th OFDMA symbol to the (K+26) th OFDMA symbol.
  • a downlink frame includes a preamble field, an FCH field, a DL-MAP field, a UL-MAP field, as well as a plurality of DL burst fields.
  • the preamble field is used for transmitting a synchronization signal, for example, a preamble sequence, for synchronization acquisition between a transmitter and a receiver, for example, between a base station (BS) and an mobile station (MS). That is, the preamble field is a necessary part for synchronization with the data transmitted from the BS, and a modem of the MS extracts synchronization information from the preamble using various methods.
  • a synchronization signal for example, a preamble sequence
  • MS mobile station
  • the FCH field composed of two subchannels, transmits basic information on the subchannel, ranging and modulation.
  • the MS is able to determine a size of a DL-MAP and is also able to determine the frequency reuse factor ("reuse") used in the BS, for example, determine one of reuse 1 to reuse3.
  • the DL-MAP field a field for transmitting a DL-MAP message, has a variety of information for extracting data position and size in the downlink frame and for providing service to an MS. Therefore, it is possible to extract data in the frame by analyzing the DL-MAP information.
  • the DL burst field is used for extracting data based on the information acquired by analyzing the normal data information, for example, the DL-MAP.
  • subchannel refers to a channel composed of a plurality of subcarriers, and a predetermined number of subcarriers constitute one subchannel according to system conditions.
  • One frame is composed of a plurality of, for example, 42 symbols, and one symbol can be divided into several subchannels.
  • the symbol can be regarded as a unit time used for dividing the frame in the time domain, and a data size in one symbol differs according to format of the frame.
  • the uplink frame in the data frame format used in the broadband communication system is composed of a plurality of UL burst fields and a ranging subchannel field.
  • the ranging subchannel field a field for transmitting ranging subchannels for ranging, is used for extracting normal data information using the UL burst fields, for example, extracting data based on the information acquired by analyzing the UL-MAP.
  • the following data processing order is required in order to extract data from the foregoing downlink fields of the data frame according to the IEEE 802.16 standard.
  • the data processing is performed in an ascending order of 1), 2) and 3), completing data reception for one frame.
  • a modem for the broadband communication system needs a high data rate (i.e, 10 Mbps for the downlink) and has a complex data format such as Partial Usage of the SubChannel (PUSC) and Full Usage of the SubChannel (FUSC), thus taking a very important role in data processing.
  • PUSC Partial Usage of the SubChannel
  • FUSC Full Usage of the SubChannel
  • FIG. 2 is a diagram schematically illustrating a structure of an apparatus for processing data in a general broadband communication system.
  • An 802.16-based modem is roughly divided into a received (Rx) data processor including a synchronization part, a Convolutional Turbo Code (CTC) decoder and a Convolutional Code (CC) decoder, and a transmission (Tx) data processor including Medium Access Control (MAC), a CTC encoder and a CC encoder.
  • Rx received
  • CTC Convolutional Turbo Code
  • CC Convolutional Code
  • Tx Transmission
  • FIG. 2 it shows a structure of a symbol part block of the received data processor in the modem.
  • the partial block structure includes a channel estimator 210, a decoder 230 and a MAP decoder 250.
  • the channel estimator 210 estimates a channel based on a pilot in the data that underwent Fast Fourier Transform (FFT). Data compensation is achieved according to the estimated channel.
  • FFT Fast Fourier Transform
  • the decoder 230 operates according to the type of a CTC/CC decoder. With the use of the decoder 230, the modem corrects a data error generated during data transmission.
  • the MAP decoder 250 processes the FCH and DL-MAP in the frame format defined in IEEE 802.16, shown in FIG. 1 .
  • the modem processes the FCH and DL-MAP, and thereby extracting normal data.
  • the structure shown in FIG. 2 a simple structure implemented based on IEEE 802.16, has the following problems.
  • Data can be transmitted over one frame.
  • a data rate may considerably decrease.
  • channel estimation performance may suffer degradation.
  • Complex data processing is needed when various formats such as PUSC and FUSC are mixed in a frame.
  • the modem can have a unique data processing structure.
  • the data throughput and efficiency are taken into consideration, there is a need for an effective block design.
  • a scheduling method for processing data in a communication system comprising the steps of performing downlink MAP, DL-MAP, decoding; generating a burst table and a bitmap table through the DL-MAP decoding; and processing data in a symbol unit using the burst table and the bitmap table, wherein the burst table includes burst information acquired by using the DL-MAP, and the bitmap table includes location information of at least one burst, and wherein the bitmap table further includes information indicating whether the at least one burst is a burst of a corresponding mobile station, information about an unique number assigned to the at least one burst, and information about a decoding location of a Convolutional Code, CC, or a Convolutional Turbo Code, CTC.
  • a scheduling method for processing data of a scheduler in a communication system comprising the steps of:
  • a scheduling apparatus for processing data in a communication system, the apparatus comprising a decoder for decoding an input signal; a memory for storing data output from the decoder in each data field in units of bursts; a MAP decoder for decoding a downlink MAP, DL-MAP, and generating a burst table and a bitmap table; and a symbol scheduler for managing control for the scheduling apparatus and full information associated with the scheduling apparatus, and performing scheduling for data processing in a symbol unit using information included in the burst table and the bitmap table, wherein the burst table includes burst information acquired by using the DL-MAP, and the bitmap table includes location information of at least one burst, and wherein the bitmap table further includes information indicating whether the at least one burst is a burst of a corresponding mobile station, information about an unique number assigned to the at least one burst and information about a decoding location of a Convolutional Code,
  • the present invention relates to an apparatus and method for scheduling symbol data of a modem in a communication system, for solving the problems of the conventional art and for enabling fast data processing. That is, simplifying the complex data processing structure caused by combination of several in-frame configurations such as Partial Usage of the SubChannel (PUSC), Full Usage of the SubChannel (FUSC) and frequency reuse factor (hereinafter referred to as "reuse"), and by optimizing the number of decoders can reduce the complexity of data processing.
  • PUSC Partial Usage of the SubChannel
  • FUSC Full Usage of the SubChannel
  • reuse frequency reuse factor
  • the present invention provides a method for maintaining a data rate even though data is transmitted long along the time axis in this frame format, and processing data in units of symbols, thereby improving channel estimation performance.
  • the present invention provides an apparatus for implementing memory optimization by configuring a memory structure with a single-port memory, and implementing data flow optimization through appropriate time adjustment for data read/write.
  • a modem is roughly divided into a received (Rx) data processor including a synchronization part, a Convolutional Turbo Code (CTC) decoder and a Convolutional Code (CC) decoder, and a transmission (Tx) data processor including Medium Access Control (MAC), a CTC encoder and a CC encoder.
  • Rx received
  • CTC Convolutional Turbo Code
  • CC Convolutional Code
  • Tx transmission
  • MAC Medium Access Control
  • the present invention provides an operation of a scheduler for controlling the overall operation of the received data processor, which is a symbol level block, and a structure thereof.
  • the communication system can use several data processing/scheduling schemes.
  • the present invention provides an apparatus and method for obtaining the highest possible data rate, and maximizing performance of decoders including a CC decoder and a CTC decoder.
  • the present invention can reduce the number of decoders required for obtaining the full data rate of, for example, 10 Mbps, and can obtain stable performance even for high-capacity data processing by minimizing delay between blocks.
  • a symbol scheduler for a modem according to the present invention is constructed appropriately for data reception based on the IEEE 802.16 communication system, and can obtain a high data rate by processing data in units of symbols. By processing data in units of symbols in this way, it is possible to solve the problem occurring in processing the data arranged long in the time domain, thereby optimizing the number of CTC and CC decoders needed for obtaining a required data rate.
  • the present invention provides efficient data processing by simplifying the complex frame configuration such as PUSC, FUSC and reuse.
  • FIG. 3 is a block diagram schematically illustrating a structure of a symbol apparatus for a modem according to the present invention. It should be noted that FIG. 3 illustrates a structure of a symbol block according to the present invention.
  • a definition will be given of the overall block structure according to the present invention, i.e. structures of a symbol scheduler, a Log Likelihood Ratio (LLR) demapper, a memory, a slot combiner, a decoder, and a Hybrid Automatic Repeat Request (HARQ) controller, and the overall data flow thereof.
  • LLR Log Likelihood Ratio
  • HARQ Hybrid Automatic Repeat Request
  • the symbol apparatus includes a symbol scheduler 301, a channel estimator 303, an LLR demapper 307, a decoder 309, a memory 313, a MAP decoder 315, and an HARQ controller 317.
  • the symbol scheduler 301 controls each of the blocks shown in FIG. 3 , and manages the overall information. An internal structure and operation of the symbol scheduler 301 will be described in detail later with reference to FIG. 4 .
  • the channel estimator 303 estimates a channel of the input data that underwent Fast Fourier Transform (FFT), and compensates the estimated channel.
  • FFT Fast Fourier Transform
  • the LLR demapper 307 performs LLR calculation for CC decoding and CTC decoding.
  • the CC/CTC decoding scheme is based on the soft decision scheme. Therefore, the LLR demapper 307 performs a soft-decision operation according to the decoding scheme.
  • the decoder 309 includes a CC decoder and a CTC decoder, and decodes the data CC/CTC-decoded by the CC decoder and the CTC decoder.
  • the decoder 309 acquires the original data by calculating a trellis diagram based on the soft decision results calculated by the CC decoder and the CTC decoder.
  • the memory 313 stores the data output from the decoder 309 in each data field, i.e. stores the decoded data output from the decoder 309 in units of bursts.
  • the memory 313 includes a burst memory, as well as a memory controller for controlling a memory operation.
  • the MAP decoder 315 extracts frame-related information from a Frame Control Header (FCH) and DL-MAP data, and provides the extracted information to the symbol scheduler 301 and each block that requires the extracted information.
  • FCH Frame Control Header
  • the HARQ controller 317 determines ACK/NACK for the HARQ data information, and controls corresponding blocks depending on the ACK/NACK.
  • FIG. 4 is a diagram schematically illustrating an internal structure of a symbol scheduler according to the present invention.
  • the symbol scheduler according to the present invention is roughly divided into four parts. That is, the symbol scheduler 301 for managing an input/output operation, i.e.
  • managing status for the overall symbol block, includes an FCH scheduler (FCH_scheduler) 410 for managing a related status for performing FCH decoding, a DL-MAP scheduler (DL-MAP_scheduler) 420 for managing a related status for performing DL-MAP decoding, an initialization scheduler (Init_scheduler) 430 for initializing/setting a memory, and a normal scheduler (Norm_scheduler) 440 for managing a related status for performing normal-burst decoding.
  • FCH_scheduler FCH scheduler
  • DL-MAP_scheduler DL-MAP scheduler
  • Initialization scheduler Init_scheduler
  • Normal_scheduler normal scheduler
  • the symbol scheduler 301 manages a status for the overall symbol block.
  • the symbol scheduler 301 performs the following processes in order to process data in one frame.
  • each step in the processes is defined as a 'state', and the state is managed in the scheduler. In the following description, it will be referred to as a 'scheduler state'. More specifically, the step of determining whether data synchronization is acquired is defined as an 'initial state', the step of extracting an FCT in the frame is defined as an 'FCH mode', the step of extracting a DL-MAP in the frame is defined as a 'DL-MAP mode', and the step of determining whether there is an HARQ MAP in the frame is defined as an 'HARQ mode'. The HARQ MAP does not necessarily exist in the frame. Finally, the step of extracting data after extracting the full MAP information is defined as a 'data mode'.
  • lower schedulers i.e. the FCH scheduler 410, the DL-MAP scheduler 420, the initialization scheduler 430 and the normal scheduler 440 operate as follows.
  • the FCH scheduler 410 performs state management when the state of the symbol scheduler 301 is the 'FCH mode'.
  • the DL-MAP scheduler 420 performs state management when the state of the symbol scheduler 301 is the 'DL-MAP mode'.
  • the initialization scheduler 430 performs state management when the state of the symbol scheduler 3 01 is 'set FCH info', 'set DL-MAP info' and 'init info'.
  • the initialization scheduler 430 sets the information necessary for FCH extraction in each block.
  • the information necessary for FCH extraction includes FCH size, iteration, and data type.
  • the initialization scheduler 430 sets information necessary for DL-MAP extraction in each block.
  • the information necessary for DL-MAP extraction includes DL-MAP size, iteration, data type, and decoding type.
  • the initialization scheduler 430 sets information for extracting normal data in each block.
  • the information extracted through the DL-MAP is converted into a table through a MAP decoder, and the table values are set for decoding in each block.
  • the normal scheduler 440 performs state management when the state of the symbol scheduler 301 is the 'normal mode'. Herein below the operation processes of the lower schedulers will be described in more detail.
  • the symbol scheduler 301 Upon reception of a frame start signal, the symbol scheduler 301 starts symbol decoding. Thereafter, the symbol scheduler 301 enables the initialization scheduler 430 to set FCH decoding-related information. After setting the FCH decoding-related information, the symbol scheduler 301 enables the FCH scheduler 410 to perform FCH decoding based on the information.
  • the initialization scheduler 430 sets DL-MAP information acquired as the FCH decoding result in its associated block. Then the DL-MAP scheduler 420 is enabled to perform DL-MAP decoding. Next, based on the burst table and bitmap table obtained as the DL-MAP decoding result, the initialization scheduler 430 sets information for normal burst decoding in its associated block. Finally, the normal scheduler 440 is enabled to decode the normal bursts.
  • the foregoing embodiment of the present invention processes data in units of symbols. That is, after completion of channel estimation for every symbol, the present invention reads data of the symbol and immediately performs decoding thereon.
  • the present invention provides two configuration tables: a burst table and a bitmap table. Both tables are generated in the MAP decoder 315, and preferred burst table and bitmap tables are shown in FIGs. 5 and 6 , respectively.
  • FIG. 5 is a diagram schematically illustrating a preferred burst table configured according to the present invention.
  • the burst table assigns a unique number to each burst for the burst information obtained a DL-MAP through a burst information element (IE) from, and stores it in a buffer.
  • IE burst information element
  • the contents of each part of the burst table are as follows. That is, the burst table includes an End Of Contents (EOC) indicating whether it is an end of the burst table, an ID used for determining whether a corresponding burst in the table belongs to the current MS or another MS, a Burst_indx indicating a unique number assigned to each burst, an FEC code type indicating a Frame Error Correction (FEC) code type and including CTC information, CC information and encoding information, a repetition indicating the number of iterations, a boosting indicating a data boosting level, a Burst_sz indicating a data slot size, and a CTC iteration designating the number of iterations in CTC decoding.
  • EOC End Of Contents
  • ID used for determining whether a corresponding burst in the table belongs to the current MS or another MS
  • a Burst_indx indicating a unique number assigned to each burst
  • FIG. 6 is a diagram schematically illustrating a preferred bitmap table configured according to the present invention.
  • bitmap table indicates data positions and burst numbers in one frame, thereby enabling symbol-based data processing.
  • the contents of each part of the bitmap table are as follows.
  • the bitmap table includes a My_brst indicating whether a corresponding burst belongs to the current MS, a Burst_indx indicating a unique number assigned to each burst, and a Fec_end indicating arrival of a CC/CTC decoding size. That is, communication system, one data unit is divided into several parts before being transmitted, and CC/CTC encoding is performed on each of the divided parts. In order to decode the received data, it is necessary to determine how finely the received data is divided, and determine whether the received data is processed so that it can now undergo CC/CTC decoding. In this manner, it is possible to indicate CC/CTC decoding positions of the divided data using the 'Fec_end' signal.
  • the symbol scheduler 301 operates based on the table information shown in FIGs. 5 and 6 .
  • the table information is set at the time when the DL-MAP decoding ends. Subsequently, if the DL-MAP decoding ends, a configuration done signal is transmitted by the MAP decoder 315. Then, the symbol scheduler 301 reads the configured burst table, and previously sets corresponding information depending on the read burst table. Next, the symbol scheduler 301 reads the bitmap table and processes data in units of symbols depending on the read bitmap table.
  • the operation of the symbol scheduler 301 is divided into a processing operation in the case where there is an HARQ MAP, and a process operation in the case where there is no HARQ MAP.
  • the operations will be described with reference to FIGs. 7 and 8 , respectively.
  • FIG. 7 is a flow-chart diagram illustrating a preferred operation of a symbol scheduler according to the present invention.
  • step 701 the symbol scheduler waits for start of a new frame in an 'IDLE' state. That is, the symbol scheduler waits in an 'IDLE' mode, if a reset occurs as processing on a particular frame is done. The symbol scheduler waits in the IDLE mode until a Frame Start signal is generated in step 703.
  • step 705 the symbol scheduler sets FCH information if the Frame Start signal is generated in step 703 . That is, the symbol scheduler sets information for FCH decoding.
  • the FCH is input to a PUSC field within 4 slots with 4 iterations. In this way, the FCH size and iteration information are set in each block in the symbol.
  • step 707 the symbol scheduler performs FCH decoding in an FCH decoding mode.
  • the symbol scheduler waits in this state until it receives an FCH Done signal indicating completion of the FCH decoding in step 709.
  • the symbol scheduler Upon reception of the FCH Done signal in step 709, the symbol scheduler sets DL-MAP information in step 711. That is, the symbol scheduler sets information for DL-MAP decoding. In other words, if the FCH decoding is done in step 709, the symbol scheduler can acquire such information as DL-MAP size, iteration and code. In this case, the symbol scheduler sets this information in each block in the symbol.
  • step 713 the symbol scheduler performs DL-MAP decoding in a DL-MAP decoding mode.
  • a table is generated in a MAP decoder as a result of the DL-MAP decoding.
  • the symbol scheduler waits in this state until it receives a TABLE Done signal indicating completion of generating the table in step 715.
  • step 717 the symbol scheduler sets HARQ MAP information upon reception of the TABLE Done signal in step 715. That is, the symbol scheduler sets information for decoding an HARQ MAP.
  • step 719 the symbol scheduler performs HARQ MAP decoding in an HARQ MAP decoding mode.
  • the symbol scheduler waits in this state until it receives an HARQ TABLE Done signal indicating completion of the HARQ MAP decoding in step 721.
  • the symbol scheduler sets Burst information to an initial value upon reception of the HARQ TABLE Done signal in step 721 . That is, the symbol scheduler sets information for normal burst decoding.
  • the symbol scheduler can read such information from the burst table. In this case, the symbol scheduler reads the information from the burst table, and sets such information as code rate, FEC code type, CTC iteration and burst size in each corresponding block.
  • step 725 the symbol scheduler decodes normal bursts in a Normal burst decoding mode.
  • the symbol scheduler waits in this state until it receives a Burst decoding Done signal indicating completion of the burst decoding in step 727.
  • the symbol scheduler Upon receipt of the Burst decoding Done signal in step 727, the symbol scheduler ends the processing on the frame, and returns to step 701 through reset and waits for start of a new frame.
  • FIG. 8 is a flow chart diagram illustrating another preferred operation of a symbol scheduler according to the present invention.
  • the symbol scheduler waits for start of a new frame in an 'IDLE' state. That is, the symbol scheduler waits in an 'IDLE' mode, if a reset occurs as processing on a particular frame is done. The symbol scheduler waits in the IDLE mode until a Frame Start signal is generated in step 803.
  • step 805 the symbol scheduler sets FCH information if the Frame Start signal is generated in step 803 . That is, the symbol scheduler sets information for FCH decoding. For example, the FCH is input to a PUSC field within 4 slots with 4 iterations. In this way, the FCH size and iteration information are set in each block in the symbol.
  • step 807 the symbol scheduler performs FCH decoding in an FCH decoding mode.
  • the symbol scheduler waits in this state until receipt of an FCH Done signal indicating completion of the FCH decoding in step 809.
  • step 811 the symbol scheduler sets DL-MAP information upon receipt of the FCH Done signal in step 809. That is, the symbol scheduler sets information for DL-MAP decoding. In other words, if the FCH decoding is done in step 809, the symbol scheduler can acquire such information as DL-MAP size, iteration and code. In this case, the symbol scheduler sets this information in each block in the symbol.
  • step 813 the symbol scheduler performs DL-MAP decoding in a DL-MAP decoding mode.
  • a table is generated in a MAP decoder as a result of the DL-MAP decoding.
  • the symbol scheduler waits in this state until it receives a TABLE Done signal indicating completion of generating the table in step 815.
  • the symbol scheduler sets Burst information to an initial value upon reception of the TABLE Done signal in step 815. That is, the symbol scheduler sets information for normal burst decoding.
  • the symbol scheduler can read such information from the burst table. In this case, the symbol scheduler reads the information from the burst table, and sets such information as code rate, FEC code type, CTC iteration and burst size in each corresponding block.
  • step 819 the symbol scheduler decodes normal bursts in a Normal burst decoding mode.
  • the symbol scheduler waits in this state until it receipt of a Burst decoding Done signal indicating completion of the burst decoding in step 821.
  • the symbol scheduler Upon reception of the Burst decoding Done signal in step 821, the symbol scheduler ends the processing on the frame, and returns to step 801 through reset and waits for start of a new frame.
  • the processing operation of the symbol scheduler 301 according to the present invention has been described so far. Next, a detailed description will be made of processing operations of lower schedulers constituting the symbol scheduler 301, i.e. the FCH scheduler 410, the DL-MAP scheduler 420, the initialization scheduler 430 and the normal scheduler 440.
  • lower schedulers constituting the symbol scheduler 301 i.e. the FCH scheduler 410, the DL-MAP scheduler 420, the initialization scheduler 430 and the normal scheduler 440.
  • the FCH scheduler 410 manages an associated state for FCH decoding. That is, the FCH scheduler 410 is enabled when a scheduler state is 'FCH mode'. More specifically, the FCH scheduler 410 first checks a particular buffer, for example, a channel estimation buffer, to determine whether the data is sufficiently channel-estimated such that it can undergo FCH decoding. Because the FCH is in a first PUSC symbol interval, the FCH scheduler 410 can determine whether channel estimation on first two symbols is done. If it is determined that the channel estimation is done, the FCH scheduler 410 sets information necessary for FCH decoding. That is, the FCH scheduler 410 sets iteration, burst ID, data size and FEC code type. After completion of the information setting, the FCH scheduler 410 generates an address used for reading data from the channel estimation buffer, and waits until an FCH Done is generated.
  • a particular buffer for example, a channel estimation buffer
  • the DL-MAP scheduler 420 manages a state for DL-MAP decoding.
  • the DL-MAP unlike the FCH, is not fixed in its length, and is subject to change in code rate according to circumstances. Therefore, the DL-MAP scheduler 420 should receive the FCH decoding result from the MAP decoder, and set the related information in each block.
  • the DL-MAP scheduler 420 initializes the state every frame and manages the state. More specifically, the DL-MAP scheduler 420 starts its operation if the symbol scheduler 301 enters the DL-MAP mode.
  • the DL-MAP scheduler 420 Upon entry into the DL-MAP mode, the DL-MAP scheduler 420 sets the information for performing decoding in each of necessary blocks.
  • the set information includes DL-MAP iteration and code rate.
  • the DL-MAP scheduler 420 reads a channel estimated value and data from the channel estimation buffer. Thereafter, the DL-MAP scheduler 420 waits for completion of the DL-MAP decoding.
  • the initialization scheduler 430 sets necessary information in each symbol block, every time the state changes in the symbol scheduler 301. By previously setting the repeatedly used data before data transmission in this way, it is possible to increase the overall data processing capability.
  • the initialization scheduler 430 operates in the following three regions, and sets the information necessary in each of the regions.
  • the normal scheduler 440 takes charge of a scheduler function for normal burst decoding. That is, because the normal data can exist in the PUSC field and/or the FUSC field, the normal scheduler 440 should take only the related details into consideration. Therefore, the normal scheduler 440 sets information for each individual burst based on the configuration table. Thereafter, the set informant is set over the overall symbol block.
  • the present invention provides a symbol scheduler for a modem that is constructed based on IEEE 802.16 appropriately for data reception, and process data in units of symbols using the symbol scheduler, thereby obtaining a high data rate.
  • a symbol scheduler for a modem that is constructed based on IEEE 802.16 appropriately for data reception, and process data in units of symbols using the symbol scheduler, thereby obtaining a high data rate.
  • the present invention can enable efficient data processing by simplifying the complex frame configuration such as PUSC, FUSC and reuse.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)
  • Communication Control (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Claims (22)

  1. Procédé d'ordonnancement pour le traitement de données dans un système de communication, le procédé comprenant les étapes suivantes :
    effectuer un décodage de sous-système d'application mobile à liaison descendante DL-MAP, soit DownLink-Mobile Application Part ;
    le procédé étant caractérisé par
    générer un tableau de rafales et d'un tableau de bitmaps via le décodage DL-MAP ; et
    traiter des données dans une unité de symboles en utilisant le tableau de rafales et le tableau de bitmaps,
    dans lequel le tableau de rafales comprend de l'information de rafale acquise en utilisant le DL-MAP, et le tableau de bitmaps comprend de l'information de localisation d'au moins une rafale, et
    dans lequel le tableau de bitmaps comprend de l'information indiquant si ladite au moins une rafale est ou non une rafale d'une station mobile correspondante, de l'information concernant un numéro unique attribué à ladite au moins une rafale, et de l'information concernant une localisation de décodage d'un code convolutionnel, CC, ou d'un turbo-code convolutionnel, CTC.
  2. Procédé d'ordonnancement selon la revendication 1, dans lequel l'étape de effectuer un décodage DL-MAP comprend :
    déterminer du fait qu'une synchronisation de données est acquise ou non ;
    si la synchronisation de données est acquise, acquérir un en-tête de contrôle de trame FCH, soit Frame Control Header, en mettant en oeuvre un décodage FCH ; et
    décoder du DL-MAP en utilisant l'information DL-MAP extraite du FCH.
  3. Procédé d'ordonnancement selon la revendication 1, comprenant en outre :
    après achèvement de la génération du tableau de rafales et du tableau de bitmaps, déterminer du fait qu'il y a ou non un sous-système d'application mobile de demande de répétition automatique hybride HARQ MAP, soit Hybrid Automatic Repeat Request Mobile Application Part, dans une trame d'un champ de vérification HARQ MAP ;
    s'il y a un HARQ MAP, établir d'information HARQ MAP et décoder du HARQ MAP en fonction de l'information HARQ MAP établie ; et
    s'il n'y a pas de HARQ MAP, la transition à un mode de données pour générer des données.
  4. Procédé d'ordonnancement selon la revendication 1, dans lequel le tableau de rafales comprend au moins une information parmi de l'information (EOC) indiquant si chaque rafale incluse dans le tableau de rafales est ou non une dernière rafale incluse dans le tableau de rafales, de l'information d'identifiant (ID) pour indiquer une station mobile correspondant à chaque rafale, de l'information de numéro (Burst_indx) indiquant un numéro unique attribué à chaque rafale, de l'information CTC, de l'information CC, de l'information de codage, de l'information d'itération, de l'information d'augmentation de données, de l'information de taille de créneau de données, et de l'information pour indiquer un nombre d'itérations de décodage CTC.
  5. Procédé d'ordonnancement pour le traitement de données d'un ordonnanceur dans un système de communication, le procédé comprenant les étapes suivantes :
    lors de la réception d'un signal de début de trame, effectuer un décodage de symbole ;
    activer d'un ordonnanceur d'initialisation (430) pour établir de l'information en rapport avec le FCH, et activer d'un ordonnanceur FCH (410) pour mettre en oeuvre un décodage FCH conformément à l'information en rapport avec le FCH ;
    établir, par l'ordonnanceur d'initialisation (430), d'information en rapport avec le DL-MAP acquise via le décodage FCH, et la mise en oeuvre, par un ordonnanceur DL-MAP (420), d'un décodage DL-MAP conformément à l'information en rapport avec le DL-MAP ; et
    établir, par l'ordonnanceur d'initialisation (430), d'information en rapport avec le décodage de rafale normale en utilisant un tableau de rafales et un tableau de bitmaps acquis via le décodage DL-MAP, et le décodage, par un ordonnanceur normal (440), de rafales normales dans une unité de symboles conformément à l'information en rapport avec le décodage de rafale normale,
    dans lequel le tableau de rafales comprend de l'information de rafale acquise en utilisant le DL-MAP, et le tableau de bitmaps comprend de l'information de localisation d'au moins une rafale, et
    dans lequel le tableau de bitmaps comprend de l'information indiquant si ladite au moins une rafale est ou non une rafale d'une station mobile correspondante, de l'information concernant un numéro unique attribué à ladite au moins une rafale, et de l'information concernant une localisation de décodage d'un code convolutionnel, CC, ou d'un turbo-code convolutionnel, CTC.
  6. Procédé d'ordonnancement selon la revendication 5, dans lequel le tableau de rafales et le tableau de bitmaps sont générés par un décodeur MAP (315) pour mettre en oeuvre le décodage DL-MAP, et le tableau de rafales comprend des rafales conformes à de l'information de rafale acquise en utilisant des éléments d'information de rafale d'un DL-MAP, et chacune des rafales est incluse dans le tableau de rafales en lui attribuant un numéro.
  7. Procédé d'ordonnancement selon la revendication 6, dans lequel le tableau de rafales comprend au moins une information parmi de l'information (EOC) indiquant si chacune des rafales est ou non une dernière rafale incluse dans le tableau de rafales, de l'information d'identifiant (ID) pour indiquer une station mobile correspondant à chacune des rafales, de l'information de numéro (Burst_indx) pour indiquer un numéro unique attribué à chacune des rafales, de l'information CTC, de l'information CC, de l'information de codage, de l'information d'itération, de l'information d'augmentation de données, de l'information de taille de créneau de données et de l'information pour indiquer un nombre d'itérations de décodage CTC.
  8. Procédé d'ordonnancement selon la revendication 5, dans lequel l'information incluse dans le tableau de bitmaps est établie à un moment où le décodage DL-MAP est terminé.
  9. Procédé d'ordonnancement selon la revendication 6, comprenant en outre :
    lors de la réception d'un signal de configuration terminée indiquant l'achèvement du décodage DL-MAP provenant du décodeur MAP (315), l'établissement, par l'ordonnanceur d'initialisation (430), de l'information en rapport avec le décodage de rafale normale en utilisant de l'information incluse dans le tableau de rafales ; et
    après l'établissement de l'information en rapport avec le décodage de rafale normale, le décodage, par l'ordonnanceur normal (440), des rafales normales dans l'unité de symboles en utilisant de l'information incluse dans le tableau de bitmaps et traiter des données pour chaque symbole.
  10. Appareil d'ordonnancement pour le traitement de données dans un système de communication, l'appareil comprenant :
    un décodeur (230 ; 309) pour décoder un signal d'entrée ;
    une mémoire (313) pour stocker des données sorties par le décodeur dans chaque champ de données en unités de rafales ;
    caractérisé par :
    un décodeur MAP (315) pour décoder un DL-MAP et pour générer un tableau de rafales et un tableau de bitmaps ; et
    un ordonnanceur de symboles (301) pour gérer la commande de l'appareil d'ordonnancement et toute l'information associée à l'appareil d'ordonnancement, et pour mettre en oeuvre un ordonnancement de traitement de données dans une unité de symboles en utilisant de l'information incluse dans le tableau de rafales et le tableau de bitmaps,
    dans lequel le tableau de rafales comprend de l'information de rafale acquise en utilisant le DL-MAP, et le tableau de bitmaps comprend de l'information de localisation d'au moins une rafale, et
    dans lequel le tableau de bitmaps comprend de l'information indiquant si ladite au moins une rafale est ou non une rafale d'une station mobile correspondante, de l'information concernant un numéro unique attribué à ladite au moins une rafale, et de l'information concernant une localisation de décodage d'un code convolutionnel, CC, ou d'un turbo-code convolutionnel, CTC.
  11. Appareil d'ordonnancement selon la revendication 10, comprenant en outre :
    un estimateur de canal (303) pour évaluer un canal de données d'entrée qui a subi une transformée de Fourier rapide FFT, soit Fast Fourier Transform, et pour compenser les données estimées de canal ; et
    un combinateur de symboles pour générer des données originelles en combinant des données qui sont transmises par itération en des unités de symboles via l'estimateur de canal.
  12. Appareil d'ordonnancement selon la revendication 10, comprenant en outre un démappeur (307) de rapport de vraisemblance logarithmique LLR, soit Log Likelihood Ratio, pour fournir une valeur de sortie de décodage au décodeur via un calcul LLR.
  13. Appareil d'ordonnancement selon la revendication 10, dans lequel le décodeur (309) comprend au moins un décodeur parmi un décodeur CC pour mettre en oeuvre un décodage CC et un décodeur CTC pour mettre en oeuvre un décodage CTC.
  14. Appareil d'ordonnancement selon la revendication 10, comprenant en outre un contrôleur (317) de demande de répétition automatique hybride, HARQ, pour déterminer un acquittement/non-acquittement ACK/NACK, soit ACKnowledgement/Negative ACKnowledgement, pour de l'information de données HARQ, et pour contrôler la transmission et la réception d'un message ACK et d'un message NACK.
  15. Appareil d'ordonnancement selon la revendication 10, dans lequel l'ordonnanceur de symboles comprend :
    un ordonnanceur (410) d'en-tête de contrôle de trame FCH pour gérer un état de mise en oeuvre du décodage FCH ;
    un ordonnanceur DL-MAP (420) pour gérer un état de décodage DL-MAP si le décodage FCH est achevé ;
    un ordonnanceur d'initialisation (430) pour établir de l'information nécessaire dans chaque bloc de symboles chaque fois que change un état, et pour mettre en oeuvre l'initialisation et l'établissement sur la mémoire ; et
    un ordonnanceur normal (440) pour gérer un état pour la mise en oeuvre d'un décodage de rafale normale.
  16. Appareil d'ordonnancement selon la revendication 15, dans lequel l'ordonnanceur FCH (410) est activé dans un mode FHC pour acquérir un FCH dans une trame, où, lors de la détection de l'achèvement d'une estimation de canal via un tampon d'estimation de canal, l'ordonnanceur FCH (410) établit de l'information nécessaire pour le décodage FCH, génère une adresse utilisée pour acquérir des données du tampon d'estimation de canal, et effectue la transition à un mode suivant lors de la réception d'un signal de FCH terminé.
  17. Appareil d'ordonnancement selon la revendication 15, dans lequel l'ordonnanceur DL-MAP (420) reçoit le résultat de décodage FCH du décodeur MAP (315), établit de l'information associée au résultat de décodage FCH, initialise un état à chaque trame, et gère l'état initialisé.
  18. Appareil d'ordonnancement selon la revendication 15, dans lequel l'ordonnanceur d'initialisation (430) établit préalablement des données utilisées de manière répétée avant la transmission de données, établit de l'information en rapport avec le FCH avant de mettre en oeuvre un décodage FCH lors de la réception d'une nouvelle trame, établit de l'information DL-MAP acquise d'un FCH pour mettre en oeuvre un décodage DL-MAP après achèvement du décodage FCH, et établit de l'information pour décoder des données normales en utilisant le tableau de rafales et un tableau de bitmaps acquis suite au décodage DL-MAP.
  19. Appareil d'ordonnancement selon la revendication 15, dans lequel l'ordonnanceur d'initialisation (430) établit l'information en rapport avec le décodage de rafale normale lorsque le décodage DL-MAP est achevé dans le décodeur MAP, après achèvement de l'établissement de l'information en rapport avec le décodage de rafale normale, et l'ordonnanceur normal (440) décode les rafales normales dans l'unité de symboles en utilisant de l'information incluse dans le tableau de bitmaps.
  20. Appareil d'ordonnancement selon la revendication 10, dans lequel le tableau de rafales comprend des rafales conformes à de l'information de rafale acquise en utilisant un élément d'information de rafale du DL-MAP.
  21. Appareil d'ordonnancement selon la revendication 20, dans lequel le tableau de rafales comprend au moins une information parmi de l'information (EOC) indiquant si chacune des rafales est ou non une dernière rafale incluse dans le tableau de rafales, de l'information d'identifiant (ID) pour indiquer une station mobile correspondant à chacune des rafales, de l'information de numéro (Burst_indx) indiquant un numéro unique attribué à chacune des rafales, de l'information CTC, de l'information CC, de l'information de codage, de l'information d'itération, de l'information d'augmentation de données, de l'information de taille de créneau de données, et de l'information pour indiquer un nombre d'itérations de décodage CTC.
  22. Appareil d'ordonnancement selon la revendication 10, dans lequel l'information incluse dans le tableau de bitmaps est établie à un moment où le décodage DL-MAP est terminé.
EP06013874.0A 2005-07-04 2006-07-04 Méthode et appareil pour planifier le traitement des données dans un modem Expired - Fee Related EP1755249B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020050059932A KR100754584B1 (ko) 2005-07-04 2005-07-04 모뎀에서 데이터 스케쥴링 장치 및 방법

Publications (3)

Publication Number Publication Date
EP1755249A2 EP1755249A2 (fr) 2007-02-21
EP1755249A3 EP1755249A3 (fr) 2012-10-17
EP1755249B1 true EP1755249B1 (fr) 2013-12-04

Family

ID=37589505

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06013874.0A Expired - Fee Related EP1755249B1 (fr) 2005-07-04 2006-07-04 Méthode et appareil pour planifier le traitement des données dans un modem

Country Status (5)

Country Link
US (1) US7873026B2 (fr)
EP (1) EP1755249B1 (fr)
JP (1) JP4624966B2 (fr)
KR (1) KR100754584B1 (fr)
CN (1) CN1968274B (fr)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100656827B1 (ko) 2006-01-02 2006-12-13 주식회사 이노와이어리스 계측기의 휴대인터넷 신호 분석 방법
JP4355330B2 (ja) * 2006-07-28 2009-10-28 京セラ株式会社 移動体通信システム、基地局装置、移動局装置、及び移動体通信方法
EP1903710A3 (fr) * 2006-09-20 2014-05-21 Samsung Electronics Co., Ltd. Appareil et procédé de traitement des données reçues dans un système de communication large bande sans fil
KR100799922B1 (ko) * 2006-09-22 2008-01-31 포스데이타 주식회사 직교 주파수 분할 접속방식을 지원하는 시스템을 위한디코딩 장치 및 방법
KR100930047B1 (ko) * 2007-01-12 2009-12-08 삼성전자주식회사 다중 채널 무선통신 시스템에서 동적 채널 할당 장치 및방법
CN101378286B (zh) * 2007-08-30 2013-06-26 华为技术有限公司 调度信息的指示方法和装置
US20090122744A1 (en) * 2007-11-09 2009-05-14 Alexander Maltsev Selective relaying for wireless networks
KR100928471B1 (ko) * 2007-12-28 2009-11-25 포스데이타 주식회사 무선통신 시스템에서의 프레임 구성 장치 및 방법
US8576955B2 (en) * 2008-03-28 2013-11-05 Qualcomm Incorporated Architecture to handle concurrent multiple channels
US20090245402A1 (en) * 2008-03-31 2009-10-01 Qualcomm Incorporated Apparatus and method for tile processing in wireless communications
US9184874B2 (en) * 2008-03-31 2015-11-10 Qualcomm Incorporated Storing log likelihood ratios in interleaved form to reduce hardware memory
US8498607B2 (en) 2008-06-12 2013-07-30 Qualcomm Incorporated Methods and systems for power savings using a message indication header
US7924703B2 (en) * 2008-10-08 2011-04-12 Samsung Electronics Co., Ltd. System and method for an EMBS design to optimize spectrum efficiency, link adaptation and EMBS traffic security
CN101414848B (zh) * 2008-11-18 2012-12-12 华为技术有限公司 一种解析帧控制头的方法、装置及系统
KR100980275B1 (ko) * 2009-02-05 2010-09-06 (주)카이로넷 프레임 제어 헤더 디코딩 장치
US8897219B2 (en) * 2010-08-13 2014-11-25 Lg Electronics Inc. Method and user equipment for transmitting ranging signal, and method and base station for receiving ranging signal
KR101233184B1 (ko) * 2010-08-13 2013-02-15 엘지전자 주식회사 레인징 신호 전송방법 및 사용자기기와, 레인징 신호 수신방법 및 기지국
KR102416491B1 (ko) 2017-06-19 2022-07-05 삼성전자 주식회사 무선 통신 시스템에서 데이터 디코딩 방법 및 장치

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7197022B2 (en) * 2000-11-15 2007-03-27 Wi-Lan, Inc. Framing for an adaptive modulation communication system
CN1146192C (zh) * 2002-04-17 2004-04-14 华为技术有限公司 以太网交换芯片输出队列管理调度方法和装置
AU2003903826A0 (en) * 2003-07-24 2003-08-07 University Of South Australia An ofdm receiver structure
KR100703307B1 (ko) * 2002-08-06 2007-04-03 삼성전자주식회사 터보 복호화 장치 및 방법
KR100689566B1 (ko) * 2003-03-08 2007-03-02 삼성전자주식회사 광대역 무선 접속 통신 시스템에서 초기 레인징을 이용한핸드오프 시스템 및 방법
KR100557150B1 (ko) * 2003-10-31 2006-03-03 삼성전자주식회사 광 대역 무선 접속 통신 시스템의 제어 메시지 전송프레임 및 그 방법
KR100667178B1 (ko) * 2003-12-02 2007-01-12 한국전자통신연구원 직교 주파수 분할 다중 접속 방식 시스템에서의 자원 할당및 억세스 방법
KR20050088817A (ko) * 2004-03-03 2005-09-07 삼성전자주식회사 광대역 무선 접속 통신 시스템에서 이동 가입자 단말기의핸드오버에 따른 네트워크 재진입 시스템 및 방법
KR100594111B1 (ko) 2004-03-12 2006-06-30 삼성전자주식회사 주파수 밴드별 다중 코딩을 사용하는 광대역 무선 접속시스템에서 데이터 전송 방법 및 시스템
KR100754658B1 (ko) 2004-03-12 2007-09-03 삼성전자주식회사 통신 시스템에서 복합 재전송 운용 방법
JP4477059B2 (ja) * 2004-05-07 2010-06-09 サムスン エレクトロニクス カンパニー リミテッド 広帯域無線接続通信システムのスリープモードにおける周期的レンジングのためのシステム及び方法
JP2006014321A (ja) * 2004-06-21 2006-01-12 Samsung Electronics Co Ltd 広帯域無線接続通信システムにおける動作モード情報を送受信する方法
US7796547B2 (en) * 2004-08-06 2010-09-14 Nextel Communications Inc. Method and apparatus for providing information to mobile stations in inactive states
US7792205B2 (en) * 2004-10-12 2010-09-07 Zte (Usa) Inc. Encoding and decoding of frame control header in downlink subframes in wireless communication systems
CN101808290B (zh) * 2004-10-15 2016-03-16 苹果公司 通信资源分配系统和方法
US7096401B2 (en) * 2004-11-15 2006-08-22 Motorola, Inc. Multi-mode hybrid ARQ scheme
US7580386B2 (en) * 2005-04-19 2009-08-25 Intel Corporation Cooperative scheduling of master and slave base station transmissions to provide coexistence between networks
KR100896203B1 (ko) * 2006-02-24 2009-05-12 삼성전자주식회사 광대역무선접속시스템에서 데이터 복조를 위한 채널추정장치 및 방법
EP1903710A3 (fr) * 2006-09-20 2014-05-21 Samsung Electronics Co., Ltd. Appareil et procédé de traitement des données reçues dans un système de communication large bande sans fil

Also Published As

Publication number Publication date
JP2007020173A (ja) 2007-01-25
JP4624966B2 (ja) 2011-02-02
US20070002977A1 (en) 2007-01-04
KR100754584B1 (ko) 2007-09-05
CN1968274A (zh) 2007-05-23
EP1755249A2 (fr) 2007-02-21
CN1968274B (zh) 2011-06-01
KR20070004389A (ko) 2007-01-09
US7873026B2 (en) 2011-01-18
EP1755249A3 (fr) 2012-10-17

Similar Documents

Publication Publication Date Title
EP1755249B1 (fr) Méthode et appareil pour planifier le traitement des données dans un modem
US10959227B2 (en) Communication resource allocation systems and methods
US8176379B2 (en) Apparatus and method for processing received data in a broadband wireless communication system
EP2232752B1 (fr) Procédé et appareil destinés à un décodage en aveugle
CN102204362B (zh) 用于使用消息指示头部进行功率节省的方法和系统
US8509133B2 (en) Wireless scheduling systems and methods
US8619917B2 (en) Decoding apparatus and method of terminal in wireless communication system
EP2787703B1 (fr) Procédé et système d'estimation de voie sur la liaison descendante, et terminal mobile
KR20080051973A (ko) 무선 통신 시스템에서 하이브리드 자동 재전송 요구 기법을 적용하여 방송 채널의 커버리지를 확대하기 위한 장치 및 방법
US8737291B2 (en) Methods and systems for DL-MAP processing
EP2988563A1 (fr) Systèmes d'attribution de ressources de communication et procédés
EP2452527B1 (fr) Attribution de ressources fondée sur la priorité et la puissance de signalisation
US20110130165A1 (en) Methods of power sharing for dl control transmission

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20060704

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SAMSUNG ELECTRONICS CO., LTD.

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 1/00 20060101AFI20120910BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

AKX Designation fees paid

Designated state(s): DE FR GB IT SE

INTG Intention to grant announced

Effective date: 20130621

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT SE

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602006039469

Country of ref document: DE

Effective date: 20140130

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131204

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006039469

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20140718

Year of fee payment: 9

26N No opposition filed

Effective date: 20140905

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20140717

Year of fee payment: 9

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006039469

Country of ref document: DE

Effective date: 20140905

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20150331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131204

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140731

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602006039469

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20150704

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160202

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150704