WO2006105018A1 - Method and apparatus for bit mapping enhanced-dedicated physical control channel (e-dpcch) information in umts wireless communication system - Google Patents

Method and apparatus for bit mapping enhanced-dedicated physical control channel (e-dpcch) information in umts wireless communication system Download PDF

Info

Publication number
WO2006105018A1
WO2006105018A1 PCT/US2006/011106 US2006011106W WO2006105018A1 WO 2006105018 A1 WO2006105018 A1 WO 2006105018A1 US 2006011106 W US2006011106 W US 2006011106W WO 2006105018 A1 WO2006105018 A1 WO 2006105018A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
rsn
tfi
bits
fixed
Prior art date
Application number
PCT/US2006/011106
Other languages
French (fr)
Inventor
Rainer Walter Bachl
Florian Derriennic
Francis Dominique
Hongwei Kong
Said Tatesh
Original Assignee
Lucent Technologies 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
Application filed by Lucent Technologies Inc. filed Critical Lucent Technologies Inc.
Priority to JP2008504224A priority Critical patent/JP4808245B2/en
Priority to KR1020077022124A priority patent/KR101170866B1/en
Priority to DE602006009236T priority patent/DE602006009236D1/en
Priority to EP06748738A priority patent/EP1864419B1/en
Priority to AT06748738T priority patent/ATE443382T1/en
Publication of WO2006105018A1 publication Critical patent/WO2006105018A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072Error control for data other than payload data, e.g. control data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0078Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1896ARQ related signaling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/04Error control

Definitions

  • E-DPCCH ENHANCED-DEDICATED PHYSICAL CONTROL CHANNEL
  • This invention relates to wireless communications.
  • a wireless communications network typically includes a variety of communication nodes coupled by wireless or wired connections and accessed through different types of communications channels.
  • Each of the communication nodes includes a protocol stack that processes the data transmitted and received over the communications channels.
  • the operation and configuration of the various communication nodes can differ and are often referred to by different names.
  • Such communications systems include, for example, a Code Division Multiple Access 2000 (CDMA2000) system and a Universal Mobile Telecommunications System (UMTS).
  • CDMA2000 Code Division Multiple Access 2000
  • UMTS Universal Mobile Telecommunications System
  • Third generation wireless communication protocol standards may employ a dedicated traffic channel in the uplink (e.g., a communication flow between a mobile station (MS) or User Equipment (UE), and a base station (BS) or NodeB.
  • the dedicated physical channel may include a data part (e.g., a dedicated physical data channel (DPDCH) in accordance with UMTS Release 4/5 protocols, a fundamental channel or supplemental channel in accordance with CDMA2000 protocols, etc.) and a control part (e.g., a dedicated physical control channel (DPCCH) in accordance with UMTS Release 4/5 protocols, a pilot/power control sub-channel in accordance with CDMA2000 protocols, etc.).
  • DPDCH dedicated physical data channel
  • DPCCH dedicated physical control channel
  • the DPDCH carries the data to be transmitted.
  • Incoming data is in the format of transport channels and multiple transport channels are time- multiplexed into the DPDCH.
  • Transport channels are received every Transmission Time Interval (TTI), which is 1 , 2, 4 or 8 times the radio frame duration of 10ms.
  • TTI Transmission Time Interval
  • Different transport channels to be multiplexed into the same DPDCH can have different TTIs, but the boundaries of the larger TTIs are always aligned with the boundaries of some smaller TTIs.
  • Each DPDCH frame has an associated DPCCH frame of 10 ms duration consisting of 15 slots of 10 bits each.
  • Each slot's 10 bits consist of pilot bits and control bits.
  • the control bits include Transport Format Combination Indicator (TFCI) bits, which provide an indicator of the data rate for each transport channel on the associated DPDCH and are used for processing the received DPDCH frame, Feed Back Information (FBI) bits, and Transmit Power Control (TPC) bits.
  • TFCI Transport Format Combination Indicator
  • FBI Feed Back Information
  • TPC Transmit Power Control
  • Two bits per slot are allocated for TFCI.
  • the actual combination of numbers of the remaining 8 bits can changed and is controlled by the Radio Network Controller (RNC).
  • RNC Radio Network Controller
  • An exemplary configuration is 5 pilot bits, 2 TFCI bits, 1 FBI bit and 2 TPC bits for one slot.
  • TFCI is transmitted every frame by the UE. It is a 10-bit word that is coded into a 32-bit TFCI codeword. In a normal mode, two coded bits are punctured and the remaining 30 TFCI coded bits are transmitted in a radio frame, 2 bits per slot, 15 slots per radio frame. Since TFCI is a 10-bit word, there are 1024 possible TFCI index values. Depending, however, on the Transport Format Combination Set (TFCS) size, only the indices from 0 to TFCS_size-1 are used out of those 1024 possible TFCI index values, where the number TFCS_size is much smaller than 1024.
  • TFCS Transport Format Combination Set
  • the index is mapped to its 10-bit binary representation, which is (x10, x9, ..., x1), where bit x10 is the MSB and bit x1 is the LSB, and where this binary representation of TFCI runs from 0 to TFCS_size-1.
  • This 10-bit word is then encoded by a (32,10) subcode of a 2 nd order Reed-Muller code to produce the 32-bit TFCI codeword (z ⁇ , z1 , ..., z31 ), which is punctured by not transmitting the last two bits, z30 and z31.
  • these remaining 30 bits, z ⁇ z29 are transmitted 2-bit per slot in the 15-sIot DPCCH frame.
  • soft symbols, s ⁇ , s1 , ..., s31 corresponding to the coded TFCI bits z ⁇ , z1 , ..., z31 at the UE are derived. These soft symbols are decoded by correlating them with each of the 1024 possible TFCI code words to obtain 1024 metrics for TFCS indexes ⁇ 0, 1 , ...,1023 ⁇ . A search for the maximum of these metrics is performed and the index that corresponds to the maximum metric is the decoded TFCI.
  • FHT Fast Hadamard Transform
  • enhanced dedicated physical channels may include an enhanced data part (e.g., an enhanced dedicated physical data channel [E-DPDCH] in accordance with UMTS protocols) and an enhanced control part (e.g., an enhanced dedicated physical control channel [E-DPCCH] in accordance with UMTS protocols).
  • E-DPDCH enhanced dedicated physical data channel
  • E-DPCCH enhanced dedicated physical control channel
  • E-DPDCH simultaneously with a frame of control information in the E-DPCCH channel.
  • This control information that is communicated from UE to NodeB includes parameters that are in general needed by the NodeB to decode the E-DPDCH frame.
  • An E-DPCCH word includes seven E-TFI (E-DCH [enhanced-uplink dedicated channel] Transport Format Indicator) bits that provide the NodeB with information from which the NodeB can determine the actual packet size within the E-DPDCH data frame. This is needed because the transport channels can have a variable packet data size based on the type of the applications and the dynamic nature of packet data communication.
  • E-TFI E-DCH [enhanced-uplink dedicated channel] Transport Format Indicator
  • an E-DPCCH word includes RSN (retransmission sequence number) bits that indicate the redundancy version of the data frame on the E-DPDCH, up to a maximum of 3, which can be represented by two bits.
  • RSN transmission sequence number
  • the redundancy version is needed because the NodeB needs to know whether a frame is transmitted for the first time, or is a HARQ (Hybrid Automatic Repeat Request) first, second or third retransmission of the data frame.
  • the UE will retransmit the same frame unless an acknowledgement (ACK) is received from at least one NodeB, or the maximum allowable number of retransmissions of the same frame has been reached. Therefore, even if a NodeB was not previously able to decode a frame transmission, it cannot predict whether the UE will send a new transmission of another frame or the retransmission of the previous frame since another NodeB with which the UE was communicating might have acknowledged the previous frame.
  • ACK acknowledgement
  • the E-DPCCH word also includes a single happy bit (H-bit), which the UE uses to inform the NodeB whether or not it is happy with current setup of E-DCH channels (e.g., the UE can use this indictor to tell the NodeB that it needs more data capacity and can handle it, but NodeB currently is not allowing it to have the data rate so it is not happy).
  • An E-DPCCH word thus contains 10-bits that are the seven TFI bits, the two RSN bits and the single happy bit (H-bit) within one frame of transmission.
  • FIG. 1 shows the mapping of the RSN, TFI and H-bit bit mapping by bit mapper 101 at the UE 102 of the two RSN bits into bits (x1 , x2), TFI into bits (x3, ... ,x9) and the H-bit into bit x10.
  • Coder 103 then encodes the 10-bit DPCCH words using a (32,10) subcode of a 2 nd order Reed-Muller code to form a 32-bit E-DPCCH codeword (z ⁇ , z1 , ..., z31), which is the same as the encoding of the TFCI for DPCCH described above.
  • TFCI for DPCCH only the first 30 bits, z ⁇ , ... , z29, are transmitted.
  • the soft symbols (sO, s1 , ..., s31) corresponding to the coded E-DPCCH bits, (zO, z1 , ..., z31 ) at the UE 102, are derived (not shown).
  • Correlator 105 correlates these soft symbols with each possible E-DPCCH code words (1024 in total), to produce the 1024 metrics of E-DPCCH indices ⁇ 0, 1 , ..., 1023 ⁇ .
  • DPCCH DPCCH
  • FHT can be employed as a computationally efficient method to perform the correlation. Since NodeB can exploit prior knowledge about the maximum RSN and the Transport Format Set (TFS) size in use, searcher 106 only needs to perform the search on those metrics that correspond to valid E-DPCCH words. However, the valid E-DPCCH words do not correspond to a single range of indices but rather correspond to either discrete indices or to a few disjoint index regions.
  • the maximum search by searcher 106 over metrics with valid E-DPCCH indices is more involved than the corresponding search over TFCIs over ⁇ 0, 1 , TFCS-size-1 ⁇ for DPCCH described above.
  • the maximum RSN is 1
  • TFI has values from 0 - 3
  • the three different sources of information are mapped so that the decimal equivalents of the possible E-DPCCH indices lie within a continuous range of values.
  • the legacy TFCI decoder at the NodeB that is used for DPCCH can be reused for E- DPCCH.
  • FIG. 1 is high-level block diagram showing the prior art E-DPCCH processing at the UE and at the NodeB
  • FIG. 2 is a high-level block diagram showing the E-DPCCH processing at the UE and at the NodeB in accordance with an embodiment of the present invention
  • FIG. 3 shows the mapping of the H-bit, the RSN and TFI bits for a particular exemplary embodiment.
  • mapping the three sources of information (RSN, TFI and H-bit) separately into the E-DPCCH 10-bit field as per the prior art as described above and illustrated in FIG. 1
  • these three information sources are instead bit-mapped so that the decimal equivalents all possible RSN, TFI and H-bit combinations lie within a continuous range of values.
  • the search for a maximum metric amongst the correlated received soft symbol word and possible code words can be efficiently searched only a continuous range of possible indices and the legacy TFCI coder that is used at NodeB for DPCCH can be re-used for this purpose.
  • the following mapping of the H-bit, RSN and TFI achieves the desired functionality:
  • Equation (1) the "# (number) of possible values of the H-bit" is 2 since the H-bit can be 0 or 1 , and the "# of possible values of RSN" is equal to MAX_RSN+1 since RSN can take any value from the following sets: ⁇ 0 ⁇ , ⁇ 0,1 ⁇ , ⁇ 0,1 ,2 ⁇ , and ⁇ 0,1 ,2,3 ⁇ .
  • MAX_RSN+1 is thus the size of the set of possible values of RSN and can be 1 , 2, 3 or 4.
  • TFI is the transport format index in decimal, and being 7 bits, can range in decimal value between 0 and 127. Equation (1 ) can be written as:
  • MAX_E-DPCCH_index 1 +2*MAX_RSN+2*(MAX_RSN+1 )*MAX_TFI (3)
  • MAX_TFI is the maximum TFI (in decimal) currently in use.
  • FIG. 2 shows the processing of E-DPCCH at the UE 201 transmitter and the NodeB 202 receiver.
  • bit mapper 203 maps the input RSN, TFI and H-bit according to equation (2) above to produce a 10-bit E-DPCCH word (x10, x9, ... ,x1 ), where bit x10 is the MSB and bit x1 is the LSB.
  • Coder 204 then encodes the 10-bit E-DPCCH word using a (32,10) subcode of a 2 nd order Reed-Muller code to form a 32-bit E-DPCCH codeword (z ⁇ , z1, ..., z31), in the same manner as coder 103 did in FIG. 1.
  • the soft symbols (s ⁇ , s1 s31 ) corresponding to the coded E-DPCCH bits, (z ⁇ , z1 , ..., z31) at the UE 102 are derived (not shown).
  • Correlator 205 correlates these soft symbols with each possible E-DPCCH code word (1024 in total), to produce the 1024 metrics of E-DPCCH indices ⁇ 0, 1 , ..., 1023 ⁇ .
  • FHT can be employed as a computationally efficient method to perform the correlation.
  • searcher 206 needs only conduct a maximum search over the indices ⁇ 0, 1 MAX_E-DPCCH_index ⁇ to determine the index having the largest metric and thus the decoded E-DPCCH word.
  • a complete reuse of the legacy TFCI decoder at NodeB is achieved.
  • equation (2) becomes:
  • (x10, x9, ... ,x1) is the 10-bit E-DPCCH codeword from MSB (x10) to LSB (x1), where X h ,i is the H-bit, x rsni1 and x rsn , 2 represent the RSN, with x rsn ,i the MSB and x rS n, 2 the LSB.
  • TFI is represented by a 7-bit integer, with Xt fC ⁇ ,i the MSB and xt fd , 7 the LSB.
  • the present invention can be employed in any other wireless embodiment to bit map a plurality of fixed-bit-length information components that each have individual maximum possible decimal-equivalent values into a single control word that, depending on the values of the information components, has possible decimal equivalent values that continuously range from a minimum to maximum.

Landscapes

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

Abstract

In a 3GPP standards Release 6 UMTS system, in order to avoid searching at NodeB for a maximum E-DPCCH-associated metric at discrete possible valid index values, or over disjoint possible valid index regions, at the UE the three different sources of information, the fixed number bits that comprise the RSN, TFI and the H-bit components of the E-DPCCH bit field, are mapped so that the decimal equivalents of the possible E-DPCCH indices lie within a continuous range of values.

Description

METHOD AND APPARATUS FOR BIT MAPPING
ENHANCED-DEDICATED PHYSICAL CONTROL CHANNEL (E-DPCCH) INFORMATION IN UMTS WIRELESS COMMUNICATION SYSTEM
Cross-Reference
This application claims the benefit of U.S. Provisional Application No. 60/666052, filed March 29, 2005.
Technical Field This invention relates to wireless communications.
Background of the Invention
A wireless communications network typically includes a variety of communication nodes coupled by wireless or wired connections and accessed through different types of communications channels. Each of the communication nodes includes a protocol stack that processes the data transmitted and received over the communications channels. Depending on the type of communications system, the operation and configuration of the various communication nodes can differ and are often referred to by different names. Such communications systems include, for example, a Code Division Multiple Access 2000 (CDMA2000) system and a Universal Mobile Telecommunications System (UMTS).
Third generation wireless communication protocol standards (e.g., 3GPP-UMTS, 3GPP2-CDMA2000, etc.) may employ a dedicated traffic channel in the uplink (e.g., a communication flow between a mobile station (MS) or User Equipment (UE), and a base station (BS) or NodeB. The dedicated physical channel may include a data part (e.g., a dedicated physical data channel (DPDCH) in accordance with UMTS Release 4/5 protocols, a fundamental channel or supplemental channel in accordance with CDMA2000 protocols, etc.) and a control part (e.g., a dedicated physical control channel (DPCCH) in accordance with UMTS Release 4/5 protocols, a pilot/power control sub-channel in accordance with CDMA2000 protocols, etc.). For UMTS, the DPDCH carries the data to be transmitted. Incoming data is in the format of transport channels and multiple transport channels are time- multiplexed into the DPDCH. Transport channels are received every Transmission Time Interval (TTI), which is 1 , 2, 4 or 8 times the radio frame duration of 10ms. Different transport channels to be multiplexed into the same DPDCH can have different TTIs, but the boundaries of the larger TTIs are always aligned with the boundaries of some smaller TTIs.
Each DPDCH frame has an associated DPCCH frame of 10 ms duration consisting of 15 slots of 10 bits each. Each slot's 10 bits consist of pilot bits and control bits. The control bits include Transport Format Combination Indicator (TFCI) bits, which provide an indicator of the data rate for each transport channel on the associated DPDCH and are used for processing the received DPDCH frame, Feed Back Information (FBI) bits, and Transmit Power Control (TPC) bits. Two bits per slot are allocated for TFCI. The actual combination of numbers of the remaining 8 bits can changed and is controlled by the Radio Network Controller (RNC). An exemplary configuration is 5 pilot bits, 2 TFCI bits, 1 FBI bit and 2 TPC bits for one slot. Both the NodeB and the UE know the pilot bits, but the rest of the bits are unknown to the NodeB. TFCI is transmitted every frame by the UE. It is a 10-bit word that is coded into a 32-bit TFCI codeword. In a normal mode, two coded bits are punctured and the remaining 30 TFCI coded bits are transmitted in a radio frame, 2 bits per slot, 15 slots per radio frame. Since TFCI is a 10-bit word, there are 1024 possible TFCI index values. Depending, however, on the Transport Format Combination Set (TFCS) size, only the indices from 0 to TFCS_size-1 are used out of those 1024 possible TFCI index values, where the number TFCS_size is much smaller than 1024. For each transmission, the index is mapped to its 10-bit binary representation, which is (x10, x9, ..., x1), where bit x10 is the MSB and bit x1 is the LSB, and where this binary representation of TFCI runs from 0 to TFCS_size-1. This 10-bit word is then encoded by a (32,10) subcode of a 2nd order Reed-Muller code to produce the 32-bit TFCI codeword (zθ, z1 , ..., z31 ), which is punctured by not transmitting the last two bits, z30 and z31. As noted, these remaining 30 bits, zθ z29, are transmitted 2-bit per slot in the 15-sIot DPCCH frame.
At the NodeB receiver, soft symbols, sθ, s1 , ..., s31 corresponding to the coded TFCI bits zθ, z1 , ..., z31 at the UE are derived. These soft symbols are decoded by correlating them with each of the 1024 possible TFCI code words to obtain 1024 metrics for TFCS indexes {0, 1 , ...,1023}. A search for the maximum of these metrics is performed and the index that corresponds to the maximum metric is the decoded TFCI. Fast Hadamard Transform (FHT) can be employed as a computationally efficient method to perform the correlation. Since the NodeB knows the TFCS look-up table size in use, it only needs to search on the metrics corresponding to the indices from 0 to TFCS- size-1 , with no gaps in between these indices. This gives significant performance advantage over the case when no information about the actual size of TFCS is assumed (i.e., TFCS-size = 1024), especially when the actual TFCS size is much smaller than 1024. The maximum search is thus able to operate only on the metrics for the first TFCS_size indices out of the possible 1024 indices.
Newer versions of these standards, for example, Release 6 of UMTS provide for high data rate uplink channels referred to as enhanced dedicated physical channels. These enhanced dedicated physical channels may include an enhanced data part (e.g., an enhanced dedicated physical data channel [E-DPDCH] in accordance with UMTS protocols) and an enhanced control part (e.g., an enhanced dedicated physical control channel [E-DPCCH] in accordance with UMTS protocols). As defined in the specification of the enhanced uplink data channel, the UE transmits a frame of data in the
E-DPDCH simultaneously with a frame of control information in the E-DPCCH channel. This control information that is communicated from UE to NodeB includes parameters that are in general needed by the NodeB to decode the E-DPDCH frame. An E-DPCCH word includes seven E-TFI (E-DCH [enhanced-uplink dedicated channel] Transport Format Indicator) bits that provide the NodeB with information from which the NodeB can determine the actual packet size within the E-DPDCH data frame. This is needed because the transport channels can have a variable packet data size based on the type of the applications and the dynamic nature of packet data communication. Generally, two frame sizes (TTI lengths), i.e., 10 ms and 2 ms, are available for use in the E-DPDCH. In addition, an E-DPCCH word includes RSN (retransmission sequence number) bits that indicate the redundancy version of the data frame on the E-DPDCH, up to a maximum of 3, which can be represented by two bits. The redundancy version is needed because the NodeB needs to know whether a frame is transmitted for the first time, or is a HARQ (Hybrid Automatic Repeat Request) first, second or third retransmission of the data frame. If a previous transmission has not been acknowledged by any of the NodeBs that might be communicating with a UE, the UE will retransmit the same frame unless an acknowledgement (ACK) is received from at least one NodeB, or the maximum allowable number of retransmissions of the same frame has been reached. Therefore, even if a NodeB was not previously able to decode a frame transmission, it cannot predict whether the UE will send a new transmission of another frame or the retransmission of the previous frame since another NodeB with which the UE was communicating might have acknowledged the previous frame. The E-DPCCH word also includes a single happy bit (H-bit), which the UE uses to inform the NodeB whether or not it is happy with current setup of E-DCH channels (e.g., the UE can use this indictor to tell the NodeB that it needs more data capacity and can handle it, but NodeB currently is not allowing it to have the data rate so it is not happy). An E-DPCCH word thus contains 10-bits that are the seven TFI bits, the two RSN bits and the single happy bit (H-bit) within one frame of transmission.
In accordance with 3GPP standards Release 6 (TS25.212, version 6.4.0, 30 March 2005), these three sources of information (RSN, TFI and H- bit) are used to form a 10-bit E-DPCCH word (x10, x9, ... , x1). FIG. 1 shows the mapping of the RSN, TFI and H-bit bit mapping by bit mapper 101 at the UE 102 of the two RSN bits into bits (x1 , x2), TFI into bits (x3, ... ,x9) and the H-bit into bit x10. Coder 103 then encodes the 10-bit DPCCH words using a (32,10) subcode of a 2nd order Reed-Muller code to form a 32-bit E-DPCCH codeword (zθ, z1 , ..., z31), which is the same as the encoding of the TFCI for DPCCH described above. As for TFCI for DPCCH, only the first 30 bits, zθ, ... , z29, are transmitted. At the NodeB receiver 104, the soft symbols (sO, s1 , ..., s31) corresponding to the coded E-DPCCH bits, (zO, z1 , ..., z31 ) at the UE 102, are derived (not shown). Correlator 105 correlates these soft symbols with each possible E-DPCCH code words (1024 in total), to produce the 1024 metrics of E-DPCCH indices {0, 1 , ..., 1023}. As for DPCCH, FHT can be employed as a computationally efficient method to perform the correlation. Since NodeB can exploit prior knowledge about the maximum RSN and the Transport Format Set (TFS) size in use, searcher 106 only needs to perform the search on those metrics that correspond to valid E-DPCCH words. However, the valid E-DPCCH words do not correspond to a single range of indices but rather correspond to either discrete indices or to a few disjoint index regions. Hence, the maximum search by searcher 106 over metrics with valid E-DPCCH indices is more involved than the corresponding search over TFCIs over {0, 1 , TFCS-size-1} for DPCCH described above. As a first example, if the maximum RSN is 1 , and TFI has values from 0 - 3, there are 16 valid indices having discrete values of 0, 2, 128, 130, 256, 258, 384, 386, 512, 514, 640, 642, 768, 770, 896, and 898. As a second example, if the maximum RSN is 3 and TFI has values from 0 - 3, there are a total of 32 valid indices having values in the individual ranges of 0 - 3, 128 - 131 , 256 - 259, 384 - 387, 512 - 515, 640 - 643, 768 - 771 , and 896 - 899, thus requiring a search for the maximum metric over eight disjoint index regions.
Summary of the Invention
In order to avoid searching for a maximum metric at discrete possible valid index values, or over disjoint possible valid index regions, the three different sources of information, the fixed number bits that comprise the RSN, TFI and the H-bit components of the E-DPCCH bit field, are mapped so that the decimal equivalents of the possible E-DPCCH indices lie within a continuous range of values. Advantageously, with such mapping, the legacy TFCI decoder at the NodeB that is used for DPCCH can be reused for E- DPCCH.
Brief Description of the Drawing
FIG. 1 is high-level block diagram showing the prior art E-DPCCH processing at the UE and at the NodeB; FIG. 2 is a high-level block diagram showing the E-DPCCH processing at the UE and at the NodeB in accordance with an embodiment of the present invention; and
FIG. 3 shows the mapping of the H-bit, the RSN and TFI bits for a particular exemplary embodiment.
Detailed Description
In accordance with the described embodiment of the present invention, rather than mapping the three sources of information (RSN, TFI and H-bit) separately into the E-DPCCH 10-bit field as per the prior art as described above and illustrated in FIG. 1 , these three information sources are instead bit-mapped so that the decimal equivalents all possible RSN, TFI and H-bit combinations lie within a continuous range of values. Thus, the search for a maximum metric amongst the correlated received soft symbol word and possible code words can be efficiently searched only a continuous range of possible indices and the legacy TFCI coder that is used at NodeB for DPCCH can be re-used for this purpose. Specifically, the following mapping of the H-bit, RSN and TFI achieves the desired functionality:
10-bit E-DPCCH in decimal = (H-bit) + (# of possible values of H-bit) * RSN + (# of possible values of H-bit) * (# of possible values of RSN) * TFI (1 )
In equation (1), the "# (number) of possible values of the H-bit" is 2 since the H-bit can be 0 or 1 , and the "# of possible values of RSN" is equal to MAX_RSN+1 since RSN can take any value from the following sets: {0}, {0,1}, {0,1 ,2}, and {0,1 ,2,3}. MAX_RSN+1 is thus the size of the set of possible values of RSN and can be 1 , 2, 3 or 4. TFI is the transport format index in decimal, and being 7 bits, can range in decimal value between 0 and 127. Equation (1 ) can be written as:
10-bit E-DPCCH in decimal = (H-bit) + 2 * RSN + 2 * (MAX_RSN+1 ) * TFl (2)
The maximum value of the E-DPCCCH word is therefore:
MAX_E-DPCCH_index=1 +2*MAX_RSN+2*(MAX_RSN+1 )*MAX_TFI (3)
where MAX_TFI is the maximum TFI (in decimal) currently in use.
FIG. 2 shows the processing of E-DPCCH at the UE 201 transmitter and the NodeB 202 receiver. At UE 201 , bit mapper 203 maps the input RSN, TFI and H-bit according to equation (2) above to produce a 10-bit E-DPCCH word (x10, x9, ... ,x1 ), where bit x10 is the MSB and bit x1 is the LSB. Coder 204 then encodes the 10-bit E-DPCCH word using a (32,10) subcode of a 2nd order Reed-Muller code to form a 32-bit E-DPCCH codeword (zθ, z1, ..., z31), in the same manner as coder 103 did in FIG. 1. As described above, only the first 30 bits, zθ, ... , z29, are transmitted. At the NodeB receiver 202, the soft symbols (sθ, s1 s31 ) corresponding to the coded E-DPCCH bits, (zθ, z1 , ..., z31) at the UE 102, are derived (not shown). Correlator 205 correlates these soft symbols with each possible E-DPCCH code word (1024 in total), to produce the 1024 metrics of E-DPCCH indices {0, 1 , ..., 1023}. As previously discussed, FHT can be employed as a computationally efficient method to perform the correlation. Since the valid indices now only range between 0 and MAXJE-DPCCHJndex, searcher 206 needs only conduct a maximum search over the indices {0, 1 MAX_E-DPCCH_index} to determine the index having the largest metric and thus the decoded E-DPCCH word. Advantageously, a complete reuse of the legacy TFCI decoder at NodeB is achieved. As an example, if MAX_RSN=3 (i.e., RSN is from the set {0, 1 , 2, 3}, equation (2) becomes:
10-bit E-DPCCH in decimal = (H-bit) + 2 * RSN + 8 * TFI (4)
The multiplication by 2 of the 2 RSN bits is equivalent to bit-shifting
RSN to the left by one bit and the multiplication by 8 of the 7 TFI bits is equivalent to bit-shifting TFI to the left by 3 bits. This results in the following simple mapping of the RSN, TFI and H bit by bit mapper 203 as follows:
X10 = Xtfl.1 (5)
Xg = Xtfi.2 (6)
Xe = Xtfi,3 (7) X7 = Xtn.4 (8)
Xe = Xtfi,5 (9)
X5 = Xtfi,6 (10)
X4 = Xtfi,7 (1 1 )
X3 = Xrsn,1 (12)
X2 = Xrsn,2 (13)
Xi = Xh1I (14)
where (x10, x9, ... ,x1) is the 10-bit E-DPCCH codeword from MSB (x10) to LSB (x1), where Xh,i is the H-bit, xrsni1 and xrsn,2 represent the RSN, with xrsn,i the MSB and xrSn,2the LSB. TFI is represented by a 7-bit integer, with XtfCι,i the MSB and xtfd,7the LSB. FIG. 3 shows the bit mapping of the H-bit, the RSN bits and the TFI bits into a 10-bit E-DPCCH word, which can vary in decimal value, using equation (3), from 0 (H-bit = 0, RSN = 0, TFI = 0) to a maximum value of (7 + 8 * MAXJFI).
As compared with the prior art example described above that resulted in 32 valid indices in 8 disjoint index ranges when the maximum RSN is 3 and TFI has values from 0 - 3, using the mapping of equation (4) results in 32 possible E-DPCCH words that continuously range from a minimum OOOOOOOOOO', or decimal "0" when H, TFI and RSN are all zeroes, to a maximum '0000011111 ', or decimal "31 " when H = '1 ' (decimal 1 ), TFI = O0000111 (decimal "3"), and RSN = '11" (decimal "3"). For the other prior art example described above, where if the maximum
RSN is 1 and TFI has values from 0 - 3, equation (2) becomes: 10-bit E-DPCCH in decimal = (H-bit) + 2 * RSN + 4 * TFI (15)
In this case, rather than 16 discrete and disjoint valid indices that the prior art methodology yields, using the mapping of equation (15) yields 16 possible valid E-DPCCH words than continuously range from a minimum of OOOOOOOOOO", or decimal "0", when H, RSN and TFI all are zeroes, to a maximum of '0000001111 ', or decimal "15", when H = 1 , RSN = 1 , and TFI = 3.
Although described in the connection with a UMT embodiment, the present invention can be employed in any other wireless embodiment to bit map a plurality of fixed-bit-length information components that each have individual maximum possible decimal-equivalent values into a single control word that, depending on the values of the information components, has possible decimal equivalent values that continuously range from a minimum to maximum.
The above-described embodiments are illustrative of the principles of the present invention. Those skilled in the art could devise other embodiments without departing from the spirit and scope of the present invention.

Claims

The invention claimed is:
1. A method of combining a plurality of fixed-bit-length input words into a single multi-bit codeword, the method comprising: mapping the bits of the input words into the single multi-bit codeword in a manner such that the decimal equivalents of the combined single multi-bit codewords formed from all allowed combinations of different input words lie within a continuous range of values, the number of allowed combinations of different input words being less than the maximum number of different values in decimal that the multi-bit codeword could possibly have.
2. A method at a transmitter in a wireless communications system of combining a fixed-length Happy (H) indicator, a fixed-length Retransmission Sequence Number (RSN), and a fixed-length Transport Format Indicator (TFI) into a combined fixed-length multi-bit codeword for transmission in a frame on a control channel, the method comprising: mapping the fixed number of bits of the Happy indicator, the fixed number of bits of the RSN, and the fixed number of bits of the TFI into a combined fixed-length multi-bit codeword such that the decimal equivalents of the combined codewords formed from all allowed combinations of the Happy indicator, the RSN and TFI lie within a continuous range of values, the number of allowed combinations of the Happy indicator, the RSN, and TFI being less than the maximum number of different values in decimal that the combined fixed-length multi-bit codeword could possibly have.
3. The method of claim 2 wherein the control channel is an Enhanced Dedicated Physical Control Channel (E-DPCCH) transmitted by user equipment, the Happy indicator is a single Happy (H) bit, the RSN has a fixed- length of two bits, the TFI has a fixed-length of seven bits, and the combined fixed-length multi-bit codeword has ten bits.
4. The method of claim 3 wherein the H-bit, the two RSN bits and the TFI bits are mapped to the combined 10-bit codeword that in decimal is equal to:
(H-bit) + (# [number] of possible values of H-bit) * RSN +
(# of possible values of H-bit) * (# of possible values of RSN) * TFI.
5. The method of claim 4 where "# of possible values of the H-bit" is two, and the "# of possible values of RSN" is equal to MAX_RNS+1 ,and the combined 10-bit codeword in decimal is equal to
(H-bit) + 2 * RSN + 2 * (MAX_RSN+1 ) * TFI, and the maximum value in decimal of the combined 10-bit codeword is equal to:
1 +2*MAX_RSN+2*(MAX_RSN+1 )*MAX_TFI where MAX_TFI is the maximum TFI, in decimal, being used.
6. The method of claim 5 where if MAX-RSN is equal to three, then the mapping of the H-bit, the two RSN bits and the seven TFI bits is:
X-IO = xtfi,1 X9 = Xtfi,2 x8 = Xtfi,3
X7 = Xtfi,4 X6 = Xtfi,5 X5 = Xtfi.6 X4 = Xtfi.7 X3 = Xrsn,1
X2 = Xrsn,2 Xi = Xh,i where (x10, x9, ... ,x1) is the combined 10-bit codeword from most significant bit (MSB) (x10) to least significant bit (LSB) (x1 ), where Xh,i is the H-bit, xrSn,i and xrsn,2 are the two RSN bits, with xrSn,i the MSB and xrsn,2the LSB, and with xtfci.1 - xtfci,7 being the seven TFI bits from MSB to LSB.
7. Apparatus for combining a plurality of fixed-bit-length input words into a single multi-bit codeword, the method comprising: means for receiving the plurality of fixed-bit-length input words; and means for mapping the bits of the input words into the single multi-bit codeword in a manner such that the decimal equivalents of the combined single multi-bit codewords formed from all allowed combinations of different input words lie within a continuous range of values, the number of allowed combinations of different input words being less than the maximum number of different values in decimal that the multi-bit codeword could possibly have.
8. Apparatus at a transmitter in a wireless communications system for combining a fixed-length Happy indicator, a fixed-length Retransmission Sequence Number (RSN), and a fixed-length Transport Format Indicator (TFI) into a combined fixed-length multi-bit codeword for transmission in a frame on a control channel, the apparatus comprising: means for receiving the Happy indicator, the RSN and the TFI; and means for mapping the fixed number of bits of the Happy indicator, the fixed number of bits of the RSN, and the fixed number of bits of the TFI into a combined fixed-length multi-bit codeword such that the decimal equivalents of the combined codewords formed from all allowed combinations of the Happy indicator, the RSN and TFI lie within a continuous range of values, the number of allowed combinations of the Happy indicator, the RSN, and TFI being less than the maximum number of different values in decimal that the combined fixed-length multi-bit codeword could possibly have.
9. The apparatus of claim 8 wherein the transmitter is in user equipment, the control channel is an Enhanced Dedicated Physical Control Channel (E-DPCCH) transmitted by the user equipment, the Happy indicator is a single Happy (H) bit, the RSN has a fixed-length of two bits, the TFI has a fixed-length of seven bits, and the combined fixed-length multi-bit codeword has ten bits.
10. The apparatus of claim 9 wherein the means for mapping maps the H-bit, the two RSN bits and the TFI bits to the combined 10-bit codeword that in decimal is equal to:
(H-bit) + (# [number] of possible values of H-bit) * RSN +
(# of possible values of H-bit) * (# of possible values of RSN) * TFI.
11. The apparatus of claim 10 where "# of possible values of the H-bit" is two, and the "# of possible values of RSN" is equal to MAX_RNS+1 ,and the combined 10-bit codeword in decimal is equal to
(H-bit) + 2 * RSN + 2 * (MAX_RSN+1 ) * TFI, and the maximum value in decimal of the combined 10-bit codeword is equal to: 1 +2*MAX_RSN+2*(MAX_RSN+1 )*MAX_TFI where MAX_TFI is the maximum TFI, in decimal, being used.
12. The apparatus of claim 11 where if MAX_RSN is equal to three, then the mapping of the H-bit, the two RSN bits and the seven TFI bits is:
X1O = xtfi,1 X9 = Xtfj,2 x8 = Xtfi,3 X7 = Xffi.4 X6 = Xtfi,5 X5 = Xtfi,6 X4 = Xffl.7 X3 = Xrsn,1
X2 = Xrsn,2 X1 = Xh,1 where (x10, x9 x1 ) is the combined 10-bit codeword from most significant bit (MSB) (x10) to least significant bit (LSB) (x1), where Xh,i is the H-bit, xrSn,i and xrSn,2 are the two RSN bits, with xrsn,i the MSB and xrsn,2 the LSB, and with Xtfci.1 - Xtfci.7 being the seven TFI bits from MSB to LSB.
PCT/US2006/011106 2005-03-29 2006-03-27 Method and apparatus for bit mapping enhanced-dedicated physical control channel (e-dpcch) information in umts wireless communication system WO2006105018A1 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP2008504224A JP4808245B2 (en) 2005-03-29 2006-03-27 Method and apparatus for bit mapping enhanced dedicated physical control channel (E-DPCCH) information in a UMTS wireless communication system
KR1020077022124A KR101170866B1 (en) 2005-03-29 2006-03-27 Method and apparatus for bit mapping enhanced-dedicated physical control channel e-dpcch information in umts wireless communication system
DE602006009236T DE602006009236D1 (en) 2005-03-29 2006-03-27 METHOD AND DEVICE FOR BIT MAPPING INFORMATION OF AN ADVANCED, ASSORTED PHYSICAL CONTROL CHANNEL (E-DPCCH) IN A WIRELESS UMTS COMMUNICATION SYSTEM
EP06748738A EP1864419B1 (en) 2005-03-29 2006-03-27 Method and apparatus for bit mapping enhanced-dedicated physical control channel (e-dpcch) information in umts wireless communication system
AT06748738T ATE443382T1 (en) 2005-03-29 2006-03-27 METHOD AND APPARATUS FOR BIT-MAPPING EXTENDED ASSIGNED PHYSICAL CONTROL CHANNEL (E-DPCCH) INFORMATION IN A WIRELESS UMTS COMMUNICATIONS SYSTEM

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US66605205P 2005-03-29 2005-03-29
US60/666,052 2005-03-29
US11/388,295 2006-03-24
US11/388,295 US7715349B2 (en) 2005-03-29 2006-03-24 Method and apparatus for bit mapping enhanced-dedicated physical control channel (E-DPCCH) information in UMTS wireless communication system

Publications (1)

Publication Number Publication Date
WO2006105018A1 true WO2006105018A1 (en) 2006-10-05

Family

ID=36636231

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2006/011106 WO2006105018A1 (en) 2005-03-29 2006-03-27 Method and apparatus for bit mapping enhanced-dedicated physical control channel (e-dpcch) information in umts wireless communication system

Country Status (8)

Country Link
US (1) US7715349B2 (en)
EP (2) EP1864419B1 (en)
JP (1) JP4808245B2 (en)
KR (1) KR101170866B1 (en)
AT (1) ATE443382T1 (en)
DE (1) DE602006009236D1 (en)
ES (1) ES2333611T3 (en)
WO (1) WO2006105018A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008114222A2 (en) * 2007-03-19 2008-09-25 Nokia Corporation Apparatus, method and computer program product providing indication of persistent allocation on l1/l2 control channel
WO2008135820A2 (en) * 2007-03-19 2008-11-13 Nokia Corporation Method and apparatus for allocating resources using nested bit mapping
EP2034619A1 (en) 2007-09-05 2009-03-11 NTT DoCoMo, Inc. Radio base station and method of receiving physical control channel

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8204007B2 (en) 2005-08-01 2012-06-19 Interdigital Technology Corporation Method and apparatus for control of enhanced dedicated channel transmissions
CN101606343A (en) * 2007-02-09 2009-12-16 株式会社Ntt都科摩 Retransmission control method and receiver side device
US8442140B2 (en) * 2008-09-25 2013-05-14 Samsung Electronics Co., Ltd. Method of designing codebook for network multiple input multiple output communication system and method of using the codebook
EP2900019B1 (en) * 2014-01-28 2017-03-15 MediaTek Inc. Handheld device, base station and transmission control method thereof

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040047321A1 (en) * 2002-04-09 2004-03-11 Nec Corporation Signalling scheme for high speed downlink packet access
DE10344765A1 (en) * 2003-09-26 2005-04-14 Siemens Ag Method for transmitting control data

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4047321A (en) 1975-03-13 1977-09-13 Lloyd Carl Thorning Animal trap
US7463689B2 (en) * 2003-10-09 2008-12-09 Industrial Technology Research Institute Error correction and decoding method and system for wideband code division multiple access
US8221343B2 (en) 2005-01-20 2012-07-17 Flowcardia, Inc. Vibrational catheter devices and methods for making same

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040047321A1 (en) * 2002-04-09 2004-03-11 Nec Corporation Signalling scheme for high speed downlink packet access
DE10344765A1 (en) * 2003-09-26 2005-04-14 Siemens Ag Method for transmitting control data

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
3GPP: "3GPP TS 25.212 V6.4.0 (2005-03)", 3GPP TS 25.212, March 2005 (2005-03-01), XP002389636, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg_ran/tsg_ran/TSGR_28/Docs/PDF/RP-050252.pdf> *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008114222A2 (en) * 2007-03-19 2008-09-25 Nokia Corporation Apparatus, method and computer program product providing indication of persistent allocation on l1/l2 control channel
WO2008135820A2 (en) * 2007-03-19 2008-11-13 Nokia Corporation Method and apparatus for allocating resources using nested bit mapping
WO2008114222A3 (en) * 2007-03-19 2008-12-04 Nokia Corp Apparatus, method and computer program product providing indication of persistent allocation on l1/l2 control channel
WO2008135820A3 (en) * 2007-03-19 2009-02-19 Nokia Corp Method and apparatus for allocating resources using nested bit mapping
US9338771B2 (en) 2007-03-19 2016-05-10 Nokia Technologies Oy Method and apparatus for allocating resources using nested bit mapping
EP2034619A1 (en) 2007-09-05 2009-03-11 NTT DoCoMo, Inc. Radio base station and method of receiving physical control channel
JP2009065384A (en) * 2007-09-05 2009-03-26 Ntt Docomo Inc Wireless base station, and receiving method of physical control channel
KR101008300B1 (en) 2007-09-05 2011-01-13 가부시키가이샤 엔.티.티.도코모 Radio base station and physical control channel receiving method

Also Published As

Publication number Publication date
EP2117150A1 (en) 2009-11-11
DE602006009236D1 (en) 2009-10-29
EP1864419B1 (en) 2009-09-16
US7715349B2 (en) 2010-05-11
KR20080002781A (en) 2008-01-04
US20060221907A1 (en) 2006-10-05
JP4808245B2 (en) 2011-11-02
ES2333611T3 (en) 2010-02-24
JP2008535393A (en) 2008-08-28
EP1864419A1 (en) 2007-12-12
KR101170866B1 (en) 2012-08-02
ATE443382T1 (en) 2009-10-15
EP2117150B1 (en) 2012-10-24

Similar Documents

Publication Publication Date Title
KR100925444B1 (en) A method for transmitting uplink siganl including data and control inforamtion via uplink channel
US7721179B2 (en) Method and apparatus for encoding/decoding transmission information in mobile telecommunication system
US7403513B2 (en) Apparatus and method for coding and decoding CQI information in communication system using high speed downlink packet access
US7995552B2 (en) Apparatus and method for transmitting TFCI bits for a hard split mode in a CDMA mobile communication system
US7929510B2 (en) Method of scaling soft symbols of an uplink enhanced dedicated transport channel (E-DCH) and method for enabling use of a log-map turbo decoding algorithm for processing the E-DCH
US7715349B2 (en) Method and apparatus for bit mapping enhanced-dedicated physical control channel (E-DPCCH) information in UMTS wireless communication system
JP2006166438A (en) Method and apparatus for transmitting and receiving data with high reliability in mobile communication system supporting packet data transmission
JP2003051760A (en) Apparatus and method for mapping transport format combination indicator bit symbol for hard split mode in code division mobile communication system
JP2003209891A (en) Method for processing control information in wireless communication system
JP4199195B2 (en) Speed matching method to support increased redundancy with flexible layer 1
EP2408134A1 (en) Feedback signal coding method and apparatus
US20080205328A1 (en) Method of scaling soft symbols of an uplink enhanced dedicated transport channel (E-DCH) and method for enabling use of a log-map turbo decoding algorithm for processing the E-DCH
KR100640923B1 (en) method for encoding TFCI
KR20030046539A (en) Apparatus for transferring channelization code allocation information in communication system using high speed downlink packet access scheme and method thereof

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2006748738

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020077022124

Country of ref document: KR

ENP Entry into the national phase

Ref document number: 2008504224

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU