The present application claims priority to Great Britain Priority Application GB 0613686.5, filed Jul. 10 2006 and incorporated herein by reference in its entirety.
The present invention relates to a communication system and more particularly, but not exclusively, to an Orthogonal Frequency Division Multiplexing (OFDM) system that uses low density parity check codes.
This section is intended to provide a background or context to the invention that is recited in the claims. The description herein may include concepts that could be pursued, but are not necessarily ones that have been previously conceived or pursued. Therefore, unless otherwise indicated herein, what is described in this section is not prior art to the description and claims in this application and is not admitted to be prior art by inclusion in this section.
Wireless communications systems of a cellular nature are well known, where a network entity in the form of a base station is responsible for communication with user equipment in one or more cells or sectors. When an user equipment moves from one cell or sector to another cell or sector, handover techniques ensure that the communication is not lost as responsibility is passed to a different base station. There are many different techniques for processing signals for transmission between the base station and the user equipment, and the precise handover techniques which are used depend on these systems.
One technique for handling multi-carrier transmissions is orthogonal frequency division multiplexing (OFDM). Orthogonal frequency-division multiplexing (OFDM) offers the advantages of improved downlink system capacity, coverage and data rates for packet data services with high spectral efficiency due to a nearly rectangular spectrum occupancy and low-cost implementation using the Fast Fourier Transform (FFT). It has been exploited for wideband data communications over mobile radio channels, high bit rate digital subscriber lines (HDSLs), asymmetric digital subscriber lines (ADSLs), digital broadcasting, and wireless local area network (WLAN) in IEEE 802.11n and worldwide interoperability for microwave access (WIMAX) in IEEE 802.16e. OFDM partitions the entire bandwidth into parallel independent sub-carriers to transmit parallel data streams. The relatively long symbol duration and guard interval provide greater immunity to intersymbol interference (ISI). Recently it received considerable attention as an air interface for evolution of UMTS mobile radio systems in the 3GPP (Third Generation Partnership Protocol) standardization forum.
Communication systems such as OFDM employ coding to enhance the reliability of communication over noisy channels. One such error correction code system uses low density parity check (LDPC) codes.
Low-Density parity check (LDPC) codes are a class of linear block codes, which provide near-capacity performance on a large set of data transmission and storage channels. These codes have proven to be serious competitors to turbo codes in terms of their error correcting performance. Also, LDPC codes exhibit an asymptotically better performance than turbo codes and also admit a better trade-off between performance and decoding complexity.
An LDPC code can be represented by a bipartite graph. For an (N, K) LDPC codes, the bipartite graph consists of N variable nodes (represent the bits of the codeword), N-K check bits (corresponding to parity check equations), and a certain number of edges between these two types of nodes. The term “degree” of a node is the number of edges connected to this node. If all the variable nodes have a same degree j, and all the check nodes have a same degree k, this code is referred to as a “regular” LDPC code. Otherwise, if the variable or check nodes have different degrees, the code is called an “irregular” LDPC code.
Irregular LDPC codes are typically described as ensembles with variable and check edge polynomials
respectively, where λi and ρj are the fraction of total edges connected to variable and check nodes of degree i=2, 3, . . . , dl and j=2, 3, . . . , dr respectively. Thus, some random irregular LDPC constructions based upon edge ensemble designs have error correcting capabilities measured in Bit Error Rate (BER) that are within 0.05 dB of the rate-distorted Shannon limit.
Further advantages of LDPC codes include low complexity, full parallelizable decoders and detectable decoding errors.
V. Mannoni et al describe in Proc. IEEE PIMRC 2002 a method of optimizing the structure of LDPC codes for transmission over a frequency selective fading channel. According to this method a differential evolution optimization algorithm is used. Although this method improves the system performance it is impractical in dynamic environments. Furthermore the transmitter has to re-optimize the algorithm to find the optimal degree profile by exhaustive operations.
It is therefore an aim of embodiments of the present invention to optimize the advantages of LDPC codes in an OFDM system.
According to a first aspect of the present invention there is provided a method of transmitting data in a communications system comprising a first station and a second station, the method comprising the steps of encoding data; allocating the encoded data to different quality channels based on how data is encoded; transmitting the encoded data on the allocated channels from the first station to the second station.
According to a second aspect of the invention there is provided a method of transmitting data in a communication system comprising the step of transmitting data on different quality channels in dependence on how the data is encoded.
According to a third aspect of the invention there is provided a transmitter comprising an encoder for encoding data, receiving means for receiving channel information, channel allocation means for allocating data to different quality channels in dependence on the channel information, and transmitting means for transmitting data on the allocated channels.
According to a fourth aspect of the present invention there is provided a receiver comprising receiving means for receiving data, transmitting means for transmitting channel information for the received data, ordering means for reordering data to the order in which the data was encoded based on the channel information, and decoding means for decoding the data.
According to a fifth aspect of the invention there is provided a communications system comprising a first station and a second station, wherein the first station is arranged to encode data and transmit the encoded data to the second station on different quality channels in dependence on how the data is encoded, and wherein the second station is arranged to determine channel information, order the encoded data to an order in which it was encoded based on the channel information, and to decode the data.
According to a sixth aspect of the present invention there is provided a communications system comprising a first station and a second station, the first station arranged to order encoded data from a first order to a second order in dependence on channel information received from the second station and to transmit the data to the second station; and the second station is arranged to order the data from the second order to the first order in dependence on order information derived from the channel information.
These and other advantages and features of the invention, together with the organization and manner of operation thereof, will become apparent from the following detailed description when taken in conjunction with the accompanying drawings, wherein like elements have like numerals throughout the several drawings described below.
For a better understanding of various embodiments of the present invention and to show how the same may be carried into effect, reference will now be made by way of example to the accompanying drawings in which:
FIGS. 5(a) and 5(b) are graphs showing an instance of degree distribution in subcarriers after ordering;
Reference will now be made to
where E(s) is the energy per symbol. N is the number of subcarriers, j is the square root of −1 and k is the subcarrier index.
The discrete-time received signal can be written as
yn=sn{circle around (×)}hn+nnn=0,1, . . . ,N−1
where sn is the transmitted signal, hn is the channel impulse response and nn, is the additive white Gaussian noise (AWGN).
In the above conventional OFDM transceiver it is assumed that the channel impulse response is unchangeable during an OFDM symbol period. The CP is removed and the signal is converted from serial to parallel at block 36. After the signal is processed by an N-points FFT (Fast Fourier Transform) operation at block 38, the frequency domain signal can be written as
Yk=Sk.Hk+Nk,k=0,1, . . . ,N−1
where Hk is the channel frequency domain response and Nk is the AWGN at the k-th subcarrier.
Frequency-domain received signals Yk, can be equalized by one-tap equalizer 44 based on the channel state information (CSI) estimation. The signal is then demapped from symbol level to bit level by MQMA De-map block 46 and eventually decoded by LDPC decoder 48 using the BP algorithm.
Reference will now be made to
As shown in
At the transmitter Kc information bits are encoded by the LDPC encoder into Nc coded bits Xkc, kc=1, 2, . . . , Nc with the code rate of: R=Kc/Nc
The encoded bits are output from the encoder as codewords. Usually the output LDPC codeword is too long to be transmitted in a single OFDM symbol. In this case it is necessary to segment the LDPC codeword into sub-blocks in order to map the coded bits onto an OFDM symbol. According to one embodiment of the invention the sub-block contains 1024 coded bits.
Each bit encoded by the encoded by the encoder has a particular degree. According to an embodiment of the invention a LDPC encoded bit may have a degree of 2, 3 or 9. The proportion of each type degree in a codeword is referred to as the degree distribution of the codeword.
In one embodiment of the invention, if a sequence of bits in a codeword is to be transmitted in more than one OFDM symbol, the segmentation block 50 performs an inner interleave function to insure the degree distribution of bits in each sub block is the same as the degree distribution of the bits in the whole codeword. Interleave operations are known in the art and will not be described further herein.
At segmentation block 50 the codewords are segmented into sub-blocks of size: N·log2M, where N is the subcarrier number and M is the modulation constellation size. According to an embodiment of the invention, any type of modulation may be used. Typically in a 3GPP LTE (3rd Generation Partnership Project for the Long Term Evolution) system N is valid from 128 to 1024 based on the bandwidth, while M may range from 2 for BPSK to 6 for 64 QAM. Thus Nc=a·N·log2M, where a is the number of sub-blocks.
The a blocks are then input into order block 52, before being mapped into N symbols Sk, k=0, 1, . . . , N−1 at MQAM mapper block 24.
It should be noted that although the number of symbols has been set as equal to the number of subcarriers in this embodiment, in other embodiments of the invention the number of symbols may not be equal to the number of subcarriers. For example, in another embodiment of the invention, some of subcarriers may be utilized as virtual carriers or by other users.
As shown in
In an alternative embodiment of the invention the channel information may be determined at the transmitter. In this embodiment another channel estimation method may be used, for example in Time Division Duplexing (TDD) systems, CSI information may be provided in the reciprocal uplink and downlink communications. The CSI may include full channel information, time delay and power spectrum of each path, or the frequency response of the channel as well as channel attenuation information.
According to an embodiment of the invention, when the sub-blocks are input into the order block 52, the coded bits in each sub-block are ordered according to their degrees and to the channel attenuation of each subcarrier contained in channel state information (CSI).
The order block 52 uses the CSI to determine the channel attenuation of each subcarrier and order the encoded bits according to its degree such that when the bits are eventually modulated onto subcarriers the bits with higher variable degrees are allocated to subcarriers with less attenuation.
The ordered bits are then input into the MQAM mapper 24 where they are mapped into symbols Sk.
As known in the art, an OFDM symbol is transmitted on a plurality of subcarriers. According to an embodiment of the invention, the symbols are modulated onto the subcarriers by an IFFT operation at block 28. As a result of ordering the bits in each sub-block at order block 52, the higher and lower modulated bits are segmented in the frequency domain such that the modulated symbols containing bits with higher variable degrees, are allocated to subcarriers with less attenuation. Conversely, the modulated symbols containing bits with lower variable degrees, hereinafter referred to as symbols with lower variable degrees, are allocated to subcarriers with greater attenuation.
After the symbols have been modulated onto subcarriers the cyclic prefix (CP) is added, before being up-converted and transmitted.
It should be noted that embodiments of the present invention are particularly suited to, although not limited to, a quasi static fading environment since it is not necessary to transmit the CSI information as often when the channel does not vary very fast.
When the signal is received at the receiver of the user equipment UE, the signal is converted from an analogue signal to a digital signal at block 34. The CP is removed at block 36. After, the signal is processed by an FFT operation at block 38 into a frequency domain signal.
The frequency-domain received signal, is equalized at equalizer 44 based on the channel state information (CSI) estimation provided to the equalizer by the channel estimation block 42. The CSI is also provided to the transmitter via a feedback signal for the purpose of ordering. In an embodiment of the present invention quantization of the feedback signal is applied to reduce the signaling overhead. The inventors have that shown using simulations that quantization induced performance loss is negligible.
The signal is then input into MQAM de-map block 46 where it is de-mapped from symbol level to bit level. The coded blocks are then input into De-order block 56 where they are reordered into their original order using CSI provided by the channel estimation block 42.
The combiner 58 performs the opposite operation to the segmentation block 50 in the transmitter. Accordingly, when a whole codeword is transmitted in more then one OFDM block, the reordered coded bits are combined into a whole codeword at Combiner 58 before being decoded at LDPC Decoder 48.
At S1 the data is encoded at the first station. The encoding may encode different bits of the data differently, for example the encoded bits may have variable degrees as previously discussed.
At S2 the encoded data is allocated to different quality channels based on how the data is encoded.
At S3 the encoded data is transmitted on the allocated channels from the first station to the second station.
Table 1 below summarizes the performances of an ordered LDPC coded OFDM system according to an embodiment of the invention. The system was simulated and evaluated in quasi-static frequency-selective fading channel with perfect channel estimation. The parity check matrices of LDPC code are generated according to the Progressive Edge Growth (PEG) method, (as described in X. Y. HU, E. Eleftheriou, and D. M. Arnold, “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Trans. Inform. Theory, vol. 51 no. 1, pp. 376-398, January 2005), and the codes are decoded by BP decoding algorithm with 100 iterations.
Reference is now made to
From the above results it can be seen that embodiments of the present invention significantly improve the bit error rate (BER) performance of OFDM systems.
It should be appreciated that embodiments of the invention may also be used in relation to other types of encoding such as Zigzag encoding. In the case of zigzag encoding parity zigzag encoded bits may be modulated onto a highly attenuated subcarrier, whereas systematic zigzag encoded bits may be modulated onto a less attenuated subcarrier.
It should also be appreciated that embodiments of the present invention may be used in other types of communication systems, such as a Bell Labs Layered Space-Time (BLAST) antenna system. According to this embodiment encoded bits with higher degrees can be placed on the less attenuated antennas.
Embodiments of the invention may be applied to any encoding scheme whereby one encoded bit contributes differently than another encoded bit to the decoding process.
Embodiments of the invention may also be applied to any encoding scheme whereby one encoded bit is more robust to error when being decoded than another encoded bit.
The required data processing functions in the above described embodiments of the present invention may be implemented by either hardware or software. All required processing may be provided in a controller provided in the transmitter and in the receiver, or control functions may be separated. Appropriately adapted computer program code product may be used for implementing the embodiments, when loaded to a computer. The program code product for providing the operation may be stored on and provided by a carrier medium such as a carrier disc, card or tape. Implementation may be provided with appropriate software in a control node. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.
Software and web implementations of the present invention could be accomplished with standard programming techniques with rule based logic and other logic to accomplish the various database searching steps, correlation steps, comparison steps and decision steps. It should also be noted that the words “component” and “module,” as used herein and in the claims, is intended to encompass implementations using one or more lines of software code, and/or hardware implementations, and/or equipment for receiving manual inputs.
The applicant draws attention to the fact that the present invention may include any feature or combination of features disclosed herein either implicitly or explicitly or any generalization thereof, without limitation to the scope of any of the present claims. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention.
Number | Date | Country | Kind |
---|---|---|---|
GB 0613686.5 | Jul 2006 | GB | national |