337 research outputs found
Wyner-Ziv coding based on TCQ and LDPC codes and extensions to multiterminal source coding
Driven by a host of emerging applications (e.g., sensor networks and wireless
video), distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and
various other forms of multiterminal source coding), has recently become a very active
research area.
In this thesis, we first design a practical coding scheme for the quadratic Gaussian
Wyner-Ziv problem, because in this special case, no rate loss is suffered due to
the unavailability of the side information at the encoder. In order to approach the
Wyner-Ziv distortion limit D??W Z(R), the trellis coded quantization (TCQ) technique
is employed to quantize the source X, and irregular LDPC code is used to implement
Slepian-Wolf coding of the quantized source input Q(X) given the side information
Y at the decoder. An optimal non-linear estimator is devised at the joint decoder
to compute the conditional mean of the source X given the dequantized version of
Q(X) and the side information Y . Assuming ideal Slepian-Wolf coding, our scheme
performs only 0.2 dB away from the Wyner-Ziv limit D??W Z(R) at high rate, which
mirrors the performance of entropy-coded TCQ in classic source coding. Practical
designs perform 0.83 dB away from D??W Z(R) at medium rates. With 2-D trellis-coded
vector quantization, the performance gap to D??W Z(R) is only 0.66 dB at 1.0 b/s and
0.47 dB at 3.3 b/s.
We then extend the proposed Wyner-Ziv coding scheme to the quadratic Gaussian
multiterminal source coding problem with two encoders. Both direct and indirect
settings of multiterminal source coding are considered. An asymmetric code design
containing one classical source coding component and one Wyner-Ziv coding component
is first introduced and shown to be able to approach the corner points on the
theoretically achievable limits in both settings. To approach any point on the theoretically
achievable limits, a second approach based on source splitting is then described.
One classical source coding component, two Wyner-Ziv coding components, and a
linear estimator are employed in this design. Proofs are provided to show the achievability
of any point on the theoretical limits in both settings by assuming that both
the source coding and the Wyner-Ziv coding components are optimal. The performance
of practical schemes is only 0.15 b/s away from the theoretical limits for the
asymmetric approach, and up to 0.30 b/s away from the limits for the source splitting
approach
Soft information based protocols in network coded relay networks
Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol
Soft information based protocols in network coded relay networks
Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol
Advanced wireless communications using large numbers of transmit antennas and receive nodes
The concept of deploying a large number of antennas at the base station, often called massive multiple-input multiple-output (MIMO), has drawn considerable interest because of its potential ability to revolutionize current wireless communication systems. Most literature on massive MIMO systems assumes time division duplexing (TDD), although frequency division duplexing (FDD) dominates current cellular systems. Due to the large number of transmit antennas at the base station, currently standardized approaches would require a large percentage of the precious downlink and uplink resources in FDD massive MIMO be used for training signal transmissions and channel state information (CSI) feedback. First, we propose practical open-loop and closed-loop training frameworks to reduce the overhead of the downlink training phase. We then discuss efficient CSI quantization techniques using a trellis search. The proposed CSI quantization techniques can be implemented with a complexity that only grows linearly with the number of transmit antennas while the performance is close to the optimal case. We also analyze distributed reception using a large number of geographically separated nodes, a scenario that may become popular with the emergence of the Internet of Things. For distributed reception, we first propose coded distributed diversity to minimize the symbol error probability at the fusion center when the transmitter is equipped with a single antenna. Then we develop efficient receivers at the fusion center using minimal processing overhead at the receive nodes when the transmitter with multiple transmit antennas sends multiple symbols simultaneously using spatial multiplexing
Fixed-point MAP decoding of channel codes
This paper describes the fixed-point model of the maximum a posteriori (MAP) decoding algorithm of turbo and low-density parity-check (LDPC) codes, the most advanced channel codes adopted by modern communication systems for forward error correction (FEC). Fixed-point models of the decoding algorithms are developed in a unified framework based on the use of the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. This approach aims at bridging the gap toward the design of a universal, multistandard decoder of channel codes, capable of supporting the two classes of codes and having reduced requirements in terms of silicon area and power consumption and so suitable to mobile applications. The developed models allow the identification of key parameters such as dynamic range and number of bits, whose impact on the error correction performance of the algorithm is of pivotal importance for the definition of the architectural tradeoffs between complexity and performance. This is done by taking the turbo and LDPC codes of two recent communication standards such asWiMAX and 3GPP-LTE as a reference benchmark for a mobile scenario and by analyzing their performance over additive white Gaussian noise (AWGN) channel for different values of the fixed-point parameters
On Optimal TCM Encoders
An asymptotically optimal trellis-coded modulation (TCM) encoder requires the
joint design of the encoder and the binary labeling of the constellation. Since
analytical approaches are unknown, the only available solution is to perform an
exhaustive search over the encoder and the labeling. For large constellation
sizes and/or many encoder states, however, an exhaustive search is unfeasible.
Traditional TCM designs overcome this problem by using a labeling that follows
the set-partitioning principle and by performing an exhaustive search over the
encoders. In this paper we study binary labelings for TCM and show how they can
be grouped into classes, which considerably reduces the search space in a joint
design. For 8-ary constellations, the number of different binary labelings that
must be tested is reduced from 8!=40320 to 240. For the particular case of an
8-ary pulse amplitude modulation constellation, this number is further reduced
to 120 and for 8-ary phase shift keying to only 30. An algorithm to generate
one labeling in each class is also introduced. Asymptotically optimal TCM
encoders are tabulated which are up to 0.3 dB better than the previously best
known encoders
- …