This invention relates to electronic digital communication systems and more particularly to cellular radio telephone systems.
Digital communication systems include time-division multiple access (TDMA) systems, such as cellular radio telephone systems that comply with the GSM telecommunication standard and its enhancements like GSM/EDGE, and code-division multiple access (CDMA) systems, such as cellular radio telephone systems that comply with the IS-95, cdma2000, and wideband CDMA (WCDMA) telecommunication standards. Long Term Evolution (LTE) can be seen as an evolution of the current WCDMA standard. Digital communication systems also include “blended” TDMA and CDMA systems, such as cellular radio telephone systems that comply with the universal mobile telecommunications system (UMTS) standard, which specifies a third generation (3G) mobile system being developed by the European Telecommunications Standards Institute (ETSI) within the International Telecommunication Union's (ITU's) IMT-2000 framework. The Third Generation Partnership Project (3GPP) promulgates the UMTS, LTE, WCDMA, and GSM standards, and specifications that standardize other kinds of cellular radio communication systems. This application focusses on WCDMA systems for simplicity, but it will be understood that the principles described in this application can be implemented in other digital communication systems.
Efficiency of uplink (i.e., the mobile-station-to-base-station, or reverse, direction) transmission and maximization of the available network capacity are achieved by carefully scheduling the uplink (UL) transmissions of the usually many mobile stations (MSs) in a base station's cell. The base station (BS) mainly providing service to a MS is usually called the MS's “serving” BS or cell. The serving BS informs its individual MSs of when they are allowed to transmit, and at which power level, so that the total power in the cell and the noise remain within the acceptable limits.
An MS's permission to transmit in the UL is transported from the serving BS to the MS by an absolute grant message sent by the BS in the downlink (i.e., the base-station-to-mobile-station, or forward, direction). Due to its importance, the absolute grant message is encoded and includes cyclic redundancy check (CRC) bits for error detection and correction. The CRC bits help ensure that an MS decodes the grant message correctly when a message is actually sent by a BS, but that may not be enough to stop an MS from falsely detecting a grant message when no message was sent. Through random chance, bits decoded by an MS can sometimes match valid CRC bits, with the result that the MS “detects” a false grant message. Such false grant messages are sometimes called “ghost grants”.
Because absolute grant messages indirectly control the UL power level, false detections detrimentally affect network capacity and MS throughputs. A false grant message sets a MS's transmit power to a level different from the level intended by a serving BS and can cause interference with other MSs. Therefore, there is a need for improved methods and apparatus of signal detection that reduce the number or probability of false detections.
In accordance with aspects of this invention, there is provided a method of decoding a received signal in a communication system. The method includes partially decoding the received signal, including generating a decoding-reliability metric value and cyclic redundancy check (CRC) information; checking the generated CRC information; comparing the decoding-reliability metric value with a threshold; if the generated CRC information checks and the decoding-reliability metric value passes the threshold, completing decoding the received signal; and otherwise, discarding the received signal.
Also in accordance with aspects of this invention, there is provided an apparatus in a receiver in a communication system. The apparatus includes a decoder configured to partially decode a signal received by the receiver and to generate a respective decoding-reliability metric value and CRC information; and an electronic processor configured to check the generated CRC information and to compare the decoding-reliability metric value with a threshold. If the generated CRC information checks and the decoding-reliability metric value passes the threshold, the received signal is completely decoded; otherwise, the received signal is discarded.
Also in accordance with aspects of this invention, there is provided a computer-readable medium having stored instructions that, when executed by a computer, cause the computer to perform a method of decoding a received signal in a communication system. The method includes partially decoding the received signal, including generating a decoding-reliability metric value and CRC information; checking the generated CRC information; comparing the decoding-reliability metric value with a threshold; if the generated CRC information checks and the decoding-reliability metric value passes the threshold, completing decoding the received signal; and otherwise, discarding the received signal.
The several features, objects, and advantages of this invention will be understood by reading this description in conjunction with the drawings, in which:
This description focusses on a WCDMA communication system for efficient explanation, but the artisan will understand that the invention in general can be implemented in other communication systems.
This invention compares a metric from a received-signal decoder with a threshold to decrease significantly the probability of false detection in a receiver and thus increase UL reliability and performance. In a WCDMA system, for example, this invention enables significant decrease of the probability of false grant-message detection and significant increases of Enhanced Uplink performance and reliability.
It should be understood that the arrangement of functionalities depicted in
WCDMA is based on direct-sequence spread-spectrum techniques, with pseudo-noise scrambling codes and orthogonal channelization codes separating BSs and physical channels (MSs), respectively, in the DL. Orthogonal variable spreading factor (OVSF) channelization codes are used in order to maintain link orthogonality while accommodating different user data rates.
Characteristics of physical and transport channels (Layer 1) in the frequency-division-duplex (FDD) mode of a WCDMA cellular radio communication system are defined in 3GPP TS 25.211 V8.4.0, Physical Channels and Mapping of Transport Channels onto Physical Channels (FDD) (Release 8) (March 2009), among other specifications. In general, transport channels are services offered by Layer 1 to higher layers and are defined by how data is transferred over the air interface between a BS and a MS. Dedicated channels use inherent addressing of MSs, and each of successive radio frames consists of fifteen time slots, with the length of a slot corresponding to 2560 chips, or 2/3 millisecond (ms). Each frame is also organized into successive subframes, each consisting of three slots, with the length of a subframe corresponding to 7680 chips, or 2 ms. A WCDMA communication system is described here, but it will be appreciated that other systems have equivalent features.
Another evolution of WCDMA is Enhanced Uplink (EUL), or High-Speed Uplink Packet Access (HSUPA), that enables high-rate packet data to be sent in the reverse direction. According to Section 5.3.3.14 of 3GPP TS 25.211, the enhanced dedicated channel (E-DCH) is a downlink physical channel that includes an E-DCH absolute grant channel (E-AGCH), which is a transport channel having a rate of 30 kilobits per second (kbps) and a spreading factor of 256 that carries uplink E-DCH absolute grant messages. These messages and channels are also described, for example, in Section 11.8 of 3GPP TS 25.321 V8.5.0, Medium Access Control (MAC) Protocol Specification (Release 8) (March 2009).
As described above, grant messages, as well as other information, are encoded or decoded for transport services over the air interface between a BS and an MS. In general, the channel coding scheme combines error detection and correction, rate matching, interleaving, and transport-channel mapping onto or from physical channels.
As depicted in
As WCDMA and other communication systems are currently specified, it is required that the E-AGCH be decoded for every TTI when the EUL functionality is turned on, even though the E-AGCH message is transmitted only when there is a change in the absolute grant. As noted above, the 16-bit CRC information is not enough to stop false AGCH message detection when no message is transmitted, and so sometimes the decoded bits match a valid CRC and a ghost grant is “detected”. It is currently believed that other error-detecting code information, such as a checksum that includes RNTI information, is equivalent to, although possibly less efficient and less widely used than the CRC information described above. The artisan should understand that CRC information as used in this application also refers to such equivalent information.
The probability of a false detection can be calculated as follows. The total number of valid AGCH messages NValid is 26, for a 6-bit message, and the total number of combinations NTotal of 6-bit AGCH messages and 16-bit CRCs is 222. The probability of false detection Pfd is given by:
which is to say that on average an MS will falsely detect an AGCH message once in every 65536 TTIs. That corresponds to a false detection about once every 131 seconds (on average) for a 2-ms TTI and about once every 655 seconds (on average) for a 10-ms TTI. This problem has been observed both in actual communication systems and in a computer simulation, which is described in more detail below.
The inventors have recognized that a decision-reliability metric generated by a decoder can be used with a suitable threshold to distinguish between false and correct decoding decisions and thereby decrease the probability of false detection. As a particular example, the so-called “s metric” that is generated by and output from a convolutional decoder represents the reliability of the decoding decision. Although it is not strictly necessary, it is common for a convolutional decoder to generate the s metric, which is discussed in Appendix 1.2 of 3GPP TS 25.212, among other places. The artisan will understand that any decoder, convolutional or otherwise, that generates a decision-reliability metric that is equivalent to the s metric can be used. For example, decoders for Turbo codes and low-density parity-check (LDPC) codes can generate suitable decision-reliability metrics. LDPC decoders are described in, for example, L. Yanping et al., “New Implementation for the Scalable LDPC-Decoders”, Proc. 59th Vehicular Technology Conference, vol. 1, pp. 343-346 (May 17-19, 2004).
The decoder's decision-reliability metric is used in combination with a tunable decision threshold to distinguish between false and correct decoding decisions. Let MS represent a decoder's decision-reliability metric and let
The received sequence is at least partially decoded by a suitable decoder 524, such as a convolutional decoder, that produces a local version of the 60-bit absolute grant sequence for each TTI, a local version of the transmitted CRC or equivalent information, and a decoding-reliability metric, such as the s metric. As depicted in
It will be appreciated that the order of the CRC processor 326 and the gate 515 shown in
The threshold
Computer simulations of the methods and apparatus described above were run for the 2-ms TTI case, which is currently believed to be the case that is most susceptible to false detections. In the simulations, the energy level of the received E-AGCH signal was chosen at Ec/Ior=−11 dB, with Ior/Ioc=0 dB, where Ec is the energy per chip and Ior and Ioc are respectively the interference power spectral density per channel bandwidth (e.g., 3.84 MHz) and the interference power spectral density per chip. Three simulations were carried out, each comprising 100 000 frames to determine the false-detection rate and 10 000 frames to determine the missed-detection rate. Since the probability of a false detection is low and would require a very large number of frames to estimate accurately, it was decided to record the s metric each time a false detection was observed.
It can be observed that an s metric threshold value of
The artisan will understand that this description is given for a context of E-AGCH decoding, but it will be understood that the signal detection process described above can also be used in other situations where the relevant message set consists of a limited number of valid messages. For example, the process described above can be used for transport format combination indicator (TFCI) decoding in WCDMA communication systems, and other situations will be apparent to the artisan. It is particularly applicable to reception scenarios where the decoding performance (missed-detection and false-alarm probabilities) is constrained and messages contain a CRC or other validation mechanism, such as a checksum. Of course, the artisan will understand that a suitable decoding reliability metric similar to an s metric would be generated in the process of decoding such other messages and channels. As discussed above, Turbo decoders and LDPC decoders, among others, can generate suitable reliability metrics.
Those of ordinary skill in this art will understand that the above-described threshold values are examples and that other values could be used. It will also be appreciated that procedures described above are carried out repetitively as necessary, for example, to respond to the time-varying nature of communication signals exchanged by transmitters and receivers. To facilitate understanding, many aspects of this invention are described in terms of sequences of actions that can be performed by, for example, elements of a programmable computer system. It will be recognized that various actions could be performed by specialized circuits (e.g., discrete logic gates interconnected to perform a specialized function or application-specific integrated circuits), by program instructions executed by one or more processors, or by a combination of both. Wireless transceivers implementing embodiments of this invention can be included in, for example, mobile telephones, pagers, headsets, laptop computers and other mobile terminals, base stations, and the like.
Moreover, this invention can additionally be considered to be embodied entirely within any form of computer-readable storage medium having stored therein an appropriate set of instructions for use by or in connection with an instruction-execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch instructions from a medium and execute the instructions. As used here, a “computer-readable medium” can be any means that can contain, store, or transport the program for use by or in connection with the instruction-execution system, apparatus, or device. The computer-readable medium can be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium include an electrical connection having one or more wires, a portable computer diskette, a random-access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), and an optical fiber.
Thus, the invention may be embodied in many different forms, not all of which are described above, and all such forms are contemplated to be within the scope of the invention. For each of the various aspects of the invention, any such form may be referred to as “logic configured to” perform a described action, or alternatively as “logic that” performs a described action.
It is emphasized that the terms “comprises” and “comprising”, when used in this application, specify the presence of stated features, integers, steps, or components and do not preclude the presence or addition of one or more other features, integers, steps, components, or groups thereof.
The particular embodiments described above are merely illustrative and should not be considered restrictive in any way. The scope of the invention is determined by the following claims, and all variations and equivalents that fall within the range of the claims are intended to be embraced therein.
This application claims the benefit of the filing date of U.S. Provisional Patent Application No. 61/247,599 filed on Oct. 1, 2009, which is incorporated here by reference.
Number | Date | Country | |
---|---|---|---|
61247599 | Oct 2009 | US |