16,184 research outputs found
Iterative Near-Maximum-Likelihood Detection in Rank-Deficient Downlink SDMA Systems
AbstractāIn this paper, a precoded and iteratively detected downlink multiuser system is proposed, which is capable of operating in rankdeficient scenarios, when the number of transmitters exceeds the number of receivers. The literature of uplink space division multiple access (SDMA) systems is rich, but at the time of writing there is a paucity of information on the employment of SDMA techniques in the downlink. Hence, we propose a novel precoded downlink SDMA (DL-SDMA) multiuser communication system, which invokes a low-complexity nearmaximum-likelihood sphere decoder and is particularly suitable for the aforementioned rank-deficient scenario. Powerful iterative decoding is carried out by exchanging extrinsic information between the precoderās decoder and the outer channel decoder. Furthermore, we demonstrate with the aid of extrinsic information transfer charts that our proposed precoded DL-SDMA system has a better convergence behavior than its nonprecoded DL-SDMA counterpart. Quantitatively, the proposed system having a normalized system load of Ls = 1.333, i.e., 1.333 times higher effective throughput facilitated by having 1.333 times more DL-SDMA transmitters than receivers, exhibits a āturbo cliffā at an Eb/N0 of 5 dB and hence results in an infinitesimally low bit error rate (BER). By contrast, at Eb/N0 = 5 dB, the equivalent system dispensing with precoding exhibits a BER in excess of 10%. Index TermsāIterative decoding, maximum likelihood detection, space division multiple access (SDMA) downlink, sphere decoding
Irregular Generic Detection Aided Iterative Downlink SDMA Systems
AbstractāWhen an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper, we propose the novel framework of generic detection, which invokes appropriately amalgamated multiple detectors. Hence the proposed Irregular Generic Detection (IrGD) algorithm may reduce the complexity of iterative detectors. We show in the context of an iterative Down-Link (DL) Space Division Multiple Access (SDMA) system that the proposed IrGD may indeed reduce the complexity of the iterative receiver. The IrGD aided DL-SDMA system detects the appropriate fractions of the received bitstream with the aid of different detectors. This allows us to match the Extrinsic Information Transfer (EXIT) curve of the detector to that of the channel decoder, hence facilitating a near-capacity operation, which reducing the detection complexity by about 28% compared to a powerful near-Maximum-Likelihood (ML) sphere detector benchmark system
Single-RF spatial modulation requires single-carrier transmission: frequency-domain turbo equalization for dispersive channels
In this paper, we propose a broadband single-carrier (SC) spatial-modulation (SM) based multiple-input multipleoutput (MIMO) architecture relying on a soft-decision (SoD) frequency-domain equalization (FDE) receiver. We demonstrate that conventional orthogonal frequency-division multiplexing (OFDM)-based broadband transmissions are not readily suitable for the singleāradio frequency (RF) assisted SM-MIMO schemes, since this scheme does not exhibit any substantial performance advantage over single-antenna transmissions. To circumvent this limitation, a low-complexity soft-decision (SoD) FDE algorithm based on the minimum mean-square error (MMSE) criterion is invoked for our broadband SC-based SM-MIMO scheme, which is capable of operating in a strongly dispersive channel having a long channel impulse response (CIR) at a moderate decoding complexity. Furthermore, our SoD FDE attains a near-capacity performance with the aid of a three-stage concatenated SC-based SM architecture
A Unified Framework for Linear-Programming Based Communication Receivers
It is shown that a large class of communication systems which admit a
sum-product algorithm (SPA) based receiver also admit a corresponding
linear-programming (LP) based receiver. The two receivers have a relationship
defined by the local structure of the underlying graphical model, and are
inhibited by the same phenomenon, which we call 'pseudoconfigurations'. This
concept is a generalization of the concept of 'pseudocodewords' for linear
codes. It is proved that the LP receiver has the 'maximum likelihood
certificate' property, and that the receiver output is the lowest cost
pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and
linear-programming pseudoconfigurations is also proved. A concept of 'system
pseudodistance' is defined which generalizes the existing concept of
pseudodistance for binary and nonbinary linear codes. It is demonstrated how
the LP design technique may be applied to the problem of joint equalization and
decoding of coded transmissions over a frequency selective channel, and a
simulation-based analysis of the error events of the resulting LP receiver is
also provided. For this particular application, the proposed LP receiver is
shown to be competitive with other receivers, and to be capable of
outperforming turbo equalization in bit and frame error rate performance.Comment: 13 pages, 6 figures. To appear in the IEEE Transactions on
Communication
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
In this paper, a random access scheme is introduced which relies on the
combination of packet erasure correcting codes and successive interference
cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph
representation of the SIC process, resembling iterative decoding of generalized
low-density parity-check codes over the erasure channel, is exploited to
optimize the selection probabilities of the component erasure correcting codes
via density evolution analysis. The capacity (in packets per slot) of the
scheme is then analyzed in the context of the collision channel without
feedback. Moreover, a capacity bound is developed and component code
distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10
figure
An Iterative Receiver for OFDM With Sparsity-Based Parametric Channel Estimation
In this work we design a receiver that iteratively passes soft information
between the channel estimation and data decoding stages. The receiver
incorporates sparsity-based parametric channel estimation. State-of-the-art
sparsity-based iterative receivers simplify the channel estimation problem by
restricting the multipath delays to a grid. Our receiver does not impose such a
restriction. As a result it does not suffer from the leakage effect, which
destroys sparsity. Communication at near capacity rates in high SNR requires a
large modulation order. Due to the close proximity of modulation symbols in
such systems, the grid-based approximation is of insufficient accuracy. We show
numerically that a state-of-the-art iterative receiver with grid-based sparse
channel estimation exhibits a bit-error-rate floor in the high SNR regime. On
the contrary, our receiver performs very close to the perfect channel state
information bound for all SNR values. We also demonstrate both theoretically
and numerically that parametric channel estimation works well in dense
channels, i.e., when the number of multipath components is large and each
individual component cannot be resolved.Comment: Major revision, accepted for IEEE Transactions on Signal Processin
- ā¦