111,069 research outputs found
Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping
For finite coupling lengths, terminated spatially coupled low-density
parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we
investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in
conjunction with iterative demapping of higher order modulation formats.
Therefore, we examine the BP threshold of different coupled and uncoupled
ensembles. A comparison between the decoding thresholds approximated by EXIT
charts and the density evolution results of the coupled and uncoupled ensemble
is given. We investigate the effect and potential of different labelings for
such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM
system, e.g., using set partitioning labelings. A hybrid mapping is proposed,
where different sub-blocks use different labelings in order to further optimize
the decoding thresholds of tail-biting codes, while the computational
complexity overhead through iterative demapping remains small.Comment: presentat at the International Symposium on Turbo Codes & Iterative
Information Processing (ISTC), Brest, Sept. 201
Energy Efficient Transmission over Space Shift Keying Modulated MIMO Channels
Energy-efficient communication using a class of spatial modulation (SM) that
encodes the source information entirely in the antenna indices is considered in
this paper. The energy-efficient modulation design is formulated as a convex
optimization problem, where minimum achievable average symbol power consumption
is derived with rate, performance, and hardware constraints. The theoretical
result bounds any modulation scheme of this class, and encompasses the existing
space shift keying (SSK), generalized SSK (GSSK), and Hamming code-aided SSK
(HSSK) schemes as special cases. The theoretical optimum is achieved by the
proposed practical energy-efficient HSSK (EE-HSSK) scheme that incorporates a
novel use of the Hamming code and Huffman code techniques in the alphabet and
bit-mapping designs. Experimental studies demonstrate that EE-HSSK
significantly outperforms existing schemes in achieving near-optimal energy
efficiency. An analytical exposition of key properties of the existing GSSK
(including SSK) modulation that motivates a fundamental consideration for the
proposed energy-efficient modulation design is also provided
Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping
For finite coupling lengths, terminated spatially coupled low-density
parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we
investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in
conjunction with iterative demapping of higher order modulation formats.
Therefore, we examine the BP threshold of different coupled and uncoupled
ensembles. A comparison between the decoding thresholds approximated by EXIT
charts and the density evolution results of the coupled and uncoupled ensemble
is given. We investigate the effect and potential of different labelings for
such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM
system, e.g., using set partitioning labelings. A hybrid mapping is proposed,
where different sub-blocks use different labelings in order to further optimize
the decoding thresholds of tail-biting codes, while the computational
complexity overhead through iterative demapping remains small.Comment: presentat at the International Symposium on Turbo Codes & Iterative
Information Processing (ISTC), Brest, Sept. 201
Adaptive OFDM Index Modulation for Two-Hop Relay-Assisted Networks
In this paper, we propose an adaptive orthogonal frequency-division
multiplexing (OFDM) index modulation (IM) scheme for two-hop relay networks. In
contrast to the traditional OFDM IM scheme with a deterministic and fixed
mapping scheme, in this proposed adaptive OFDM IM scheme, the mapping schemes
between a bit stream and indices of active subcarriers for the first and second
hops are adaptively selected by a certain criterion. As a result, the active
subcarriers for the same bit stream in the first and second hops can be varied
in order to combat slow frequency-selective fading. In this way, the system
reliability can be enhanced. Additionally, considering the fact that a relay
device is normally a simple node, which may not always be able to perform
mapping scheme selection due to limited processing capability, we also propose
an alternative adaptive methodology in which the mapping scheme selection is
only performed at the source and the relay will simply utilize the selected
mapping scheme without changing it. The analyses of average outage probability,
network capacity and symbol error rate (SER) are given in closed form for
decode-and-forward (DF) relaying networks and are substantiated by numerical
results generated by Monte Carlo simulations.Comment: 30 page
Recommended from our members
The role of HG in the analysis of temporal iteration and interaural correlation
Optimized Bit Mappings for Spatially Coupled LDPC Codes over Parallel Binary Erasure Channels
In many practical communication systems, one binary encoder/decoder pair is
used to communicate over a set of parallel channels. Examples of this setup
include multi-carrier transmission, rate-compatible puncturing of turbo-like
codes, and bit-interleaved coded modulation (BICM). A bit mapper is commonly
employed to determine how the coded bits are allocated to the channels. In this
paper, we study spatially coupled low-density parity check codes over parallel
channels and optimize the bit mapper using BICM as the driving example. For
simplicity, the parallel bit channels that arise in BICM are replaced by
independent binary erasure channels (BECs). For two parallel BECs modeled
according to a 4-PAM constellation labeled by the binary reflected Gray code,
the optimization results show that the decoding threshold can be improved over
a uniform random bit mapper, or, alternatively, the spatial chain length of the
code can be reduced for a given gap to capacity. It is also shown that for
rate-loss free, circular (tail-biting) ensembles, a decoding wave effect can be
initiated using only an optimized bit mapper
Depth Fields: Extending Light Field Techniques to Time-of-Flight Imaging
A variety of techniques such as light field, structured illumination, and
time-of-flight (TOF) are commonly used for depth acquisition in consumer
imaging, robotics and many other applications. Unfortunately, each technique
suffers from its individual limitations preventing robust depth sensing. In
this paper, we explore the strengths and weaknesses of combining light field
and time-of-flight imaging, particularly the feasibility of an on-chip
implementation as a single hybrid depth sensor. We refer to this combination as
depth field imaging. Depth fields combine light field advantages such as
synthetic aperture refocusing with TOF imaging advantages such as high depth
resolution and coded signal processing to resolve multipath interference. We
show applications including synthesizing virtual apertures for TOF imaging,
improved depth mapping through partial and scattering occluders, and single
frequency TOF phase unwrapping. Utilizing space, angle, and temporal coding,
depth fields can improve depth sensing in the wild and generate new insights
into the dimensions of light's plenoptic function.Comment: 9 pages, 8 figures, Accepted to 3DV 201
- …