Results 1 - 10
of
16
Turbo reconstruction of structured sparse signals
- in Proc. 44th Annual Conf. Information Sciences and Systems
, 2010
"... Abstract—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by hidden binary pattern, and a structured probabilistic prior (e.g., Markov random chain/field/tree) is assumed on the ..."
Abstract
-
Cited by 17 (11 self)
- Add to MetaCart
Abstract—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by hidden binary pattern, and a structured probabilistic prior (e.g., Markov random chain/field/tree) is assumed on the pattern. Exact inference is discussed and an approximate inference scheme, based on loopy belief propagation (BP), is proposed. The proposed scheme iterates between exploitation of the observation-structure and exploitation of the pattern-structure, and is closely related to noncoherent turbo equalization, as used in digital communication receivers. An algorithm that exploits the observation structure is then detailed based on approximate message passing ideas. The application of EXIT charts is discussed, and empirical phase transition plots are calculated for Markov-chain structured sparsity. 1 I.
Max-SINR ISI/ICI-Shaping Multicarrier Communication Over the Doubly Dispersive Channel
, 2007
"... For communication over doubly dispersive channels, we consider the design of multicarrier modulation (MCM) schemes based on time–frequency shifts of prototype pulses. We consider the case where the receiver knows the channel state and the transmitter knows the channel statistics (e.g., delay spread ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
For communication over doubly dispersive channels, we consider the design of multicarrier modulation (MCM) schemes based on time–frequency shifts of prototype pulses. We consider the case where the receiver knows the channel state and the transmitter knows the channel statistics (e.g., delay spread and Doppler spread) but not the channel state. Previous work has examined MCM pulses designed for suppression of inter-symbol/inter-carrier interference (ISI/ICI) subject to orthogonal or biorthogonal constraints. In doubly dispersive channels, however, complete suppression of ISI/ICI is impossible, and the ISI/ICI pattern generated by these (bi)orthogonal schemes can be difficult to equalize, especially when operating at high bandwidth efficiency. We propose a different approach to MCM pulse design, whereby a limited expanse of ISI/ICI is tolerated in modulation/demodulation and treated near-optimally by a downstream equalizer. Specifically, we propose MCM pulse designs that maximize a signal-to-interference-plus-noise ratio (SINR) which suppresses ISI/ICI outside a target pattern. In addition, we propose two low-complexity turbo equalizers, based on minimum mean-squared error and maximum likelihood criteria, respectively, that leverage the structure of the target ISI/ICI pattern. The resulting system exhibits an excellent combination of low complexity, low bit-error rate, and high spectral efficiency.
Multi-dimensional mappings for iteratively decoded BICM on multiple antenna channel
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 2005
"... ..."
Compressive Imaging using Approximate Message Passing and a
- Markov-Tree Prior, Proc. Asilomar Conf. on Signals, Systems, and Computers
, 2010
"... Abstract—We propose a novel algorithm for compressive imaging that exploits both the sparsity and persistence across scales found in the 2D wavelet transform coefficients of natural images. Like other recent works, we model wavelet structure using a hidden Markov tree (HMT) but, unlike other works, ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Abstract—We propose a novel algorithm for compressive imaging that exploits both the sparsity and persistence across scales found in the 2D wavelet transform coefficients of natural images. Like other recent works, we model wavelet structure using a hidden Markov tree (HMT) but, unlike other works, ours is based on loopy belief propagation (LBP). For LBP, we adopt a recently proposed “turbo ” message passing schedule that alternates between exploitation of HMT structure and exploitation of compressive-measurement structure. For the latter, we leverage Donoho, Maleki, and Montanari’s recently proposed approximate message passing (AMP) algorithm. Experiments on a large image database show that our turbo LBP approach maintains state-ofthe-art reconstruction performance at half the complexity. 1 I.
Joint Estimation and Decoding for Sparse Channels via Relaxed Belief Propagation
"... Abstract—We consider the problem of communicating efficiently over an N-block Rayleigh-fading channel with a K-sparse L-length discrete-time impulse response (with 0
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Abstract—We consider the problem of communicating efficiently over an N-block Rayleigh-fading channel with a K-sparse L-length discrete-time impulse response (with 0<K <L<N), where both the channel’s coefficients and support are unknown to both the transmitter and receiver. For this, we propose to use bit-interleaved coded orthogonal frequency division multiplexing (OFDM) in conjunction with a novel belief-propagation (BP) based demodulation scheme. Unlike the conventional “decoupled” approach, where pilots are used to estimate the sparse channel, and the resulting channel estimate is used for data decoding, we perform joint sparse-channel estimation and data decoding. Simulations suggest that the proposed scheme performs remarkably well at both low and high-SNR—achieving, e.g., the channel capacity prelog factor—with reasonable complexity: O(NL). 1 I.
Iterative Frequency-Domain Channel Estimation and Equalization for Single-Carrier Transmissions without Cyclic-Pre�x
"... Abstract—Compared to conventional time-domain equalization, frequency-domain equalization (FDE) presents a computationally ef�cient alternative for the reception of single carrier (SC) transmissions. In this paper, we consider iterative FDE (IFDE) with explicit frequency-domain channel estimation (F ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Abstract—Compared to conventional time-domain equalization, frequency-domain equalization (FDE) presents a computationally ef�cient alternative for the reception of single carrier (SC) transmissions. In this paper, we consider iterative FDE (IFDE) with explicit frequency-domain channel estimation (FDCE) for non-cyclic-pre�xed SC systems. First, an improved IFDE algorithm is presented based on soft iterative interferencecancellation. Second, a new adaptive FDCE (AFDCE) algorithm based on per-tone Kalman �ltering is proposed to track and predict the frequency-domain channel coef�cients. The AFDCE algorithm employs across-tone noise reduction, exploits temporal correlation between successive blocks, and adaptively updates the auto-regressive model coef�cients, bypassing the need for prior knowledge of channel statistics. Finally, block-overlapping is used to facilitate the joint operation of IFDE and AFDCE. Simulation results show that, compared to related IFDE and adaptive channel estimation schemes, the proposed schemes offer lower mean-square error (MSE) in channel prediction, lower bit error rate (BER) after decoding, and robustness to non-stationary channels. Index Terms—Iterative frequency-domain equalization, frequency-domain channel estimation, Kalman �lter, MMSE, single carrier, time-varying frequency-selective channels.
Equalization algorithms in the frequency domain for continuous phase modulations,”IEEE
- Trans. Commun
, 2006
"... In this paper novel equalization algorithms for continuous phase modulations (CPMs) are illustrated. Both conventional (linear and decision- feedback) and turbo equaliza-tion techniques are devised. All of them operate in the frequency domain, process two samples per channel symbol and their derivat ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this paper novel equalization algorithms for continuous phase modulations (CPMs) are illustrated. Both conventional (linear and decision- feedback) and turbo equaliza-tion techniques are devised. All of them operate in the frequency domain, process two samples per channel symbol and their derivation is based on the Laurent decomposition of CPM signals. Numerical results evidence that the proposed equalization strategies enable the use of CPMs over severely frequency selective wireless channels.
Linear Turbo Equalization Analysis via BER Transfer and EXIT Charts
"... Abstract—In this paper, two analytical methods are presented to investigate the soft information evolution characteristics of a soft-input soft-output (SISO) linear equalizer and its application to the design of turbo equalization systems without the reliance on extensive simulation. Given the chann ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—In this paper, two analytical methods are presented to investigate the soft information evolution characteristics of a soft-input soft-output (SISO) linear equalizer and its application to the design of turbo equalization systems without the reliance on extensive simulation. Given the channel and a SISO equalization algorithm, one method explored is to analytically compute the bit-error rate (BER) of the SISO equalizer in two extreme cases (no and perfect a priori information) from which a BER transfer characteristic is estimated. The second approach is to compute the mutual information [a key parameter of the extrinsic information transfer (EXIT) chart] at the two end points of the EXIT function. Then, by modeling the SISO equalizer BER transfer and EXIT functions as linear, some of the behavior of linear turbo equalization, such as how the BER performance can be improved as iterations proceed, can be predicted. Further, soft information evolution characteristics of different linear SISO equalizers can be compared and the usefulness of iterative methods such as linear turbo equalization for a given channel can be determined. Compared with existing methods for generating EXIT functions, these predictive methods provide insight into the iterative behavior of linear turbo equalizers with substantial reduction in numerical complexity. Index Terms—Bit-error rate (BER) analysis, extrinsic information transfer (EXIT) chart, iterative decoding, linear equalizer, soft-input soft-output (SISO) equalizer, turbo equalizer. I.
EM-BASED SOFT NONCOHERENT EQUALIZATION OF DOUBLY SELECTIVE CHANNELS USING TREE SEARCH AND BASIS EXPANSION
"... We propose a soft noncoherent equalizer for coded transmissions over unknown time- and frequency-selective, or doubly selective, channels. Such a soft equalizer can be used in conjunction with a soft decoder as part of a turbo reception scheme. Like a number of existing designs, ours is motivated by ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We propose a soft noncoherent equalizer for coded transmissions over unknown time- and frequency-selective, or doubly selective, channels. Such a soft equalizer can be used in conjunction with a soft decoder as part of a turbo reception scheme. Like a number of existing designs, ours is motivated by the use of the expectation maximization (EM) algorithm to estimate the unknown channel parameters, and manifests as an iteration between soft channel estimation and soft coherent equalization. As a departure from the existing designs, which assume a Gauss-Markov (i.e., autoregressive) channel and employ a trellis whose number-of-states grows exponentially in the channel length, we use a basis expansion (BE) model for the channel and a soft tree-search in place of the trellis, leveraging recent ideas from the MIMO literature. The complexity of our schemes grows only linearly in the block length and quadratically in the number of BE coefficients. Numerical experiments show performance that is close to genie-aided bounds and robust to mismatch in channel-fading rate. 1.
Frequency-domain equalization of single carrier . . .
, 2007
"... Wireless communication systems targeting at broadband and mobile data trans-missions commonly face the challenge of fading channels which are both time and frequency selective. Therefore, the design of effective equalization and estimation algorithms for such channels becomes a fundamental problem o ..."
Abstract
- Add to MetaCart
Wireless communication systems targeting at broadband and mobile data trans-missions commonly face the challenge of fading channels which are both time and frequency selective. Therefore, the design of effective equalization and estimation algorithms for such channels becomes a fundamental problem of communication sys-tems. On one hand, multi-carrier transmission systems demonstrate prominent po-tential to combat the doubly selective fading, however, several factors may retard their applications, such as: high peak-to-average power ratio, sensitivity to phase noise, etc. On the other hand, single carrier transmission is a conventional approach and has important applications, such as HDTV broadcasting systems, underwater acoustic communication systems. In this dissertation, we focus on receiver design for effective and efficient reception of single-carrier transmissions through doubly se-lective channels. Our target is to design and develop a group of channel estimation and equalization algorithms in the frequency-domain, which enable high performance reception of single-carrier transmission with low computational complexity. Motivated by

