The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Lattice decoding enables significant complexity reduction in multi-input multi-output (MIMO) communications. Unlike most work on the lattice-reduction-aided decoding technique, this paper is aimed at a comparative study of primal versus dual basis reduction for approximate lattice decoding. We derive the respective proximity factors for the two methods, which measure the performance gap to maximum-likelihood...
In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, each with a single antenna, suffering independent channel coefficients and additive Gaussian noises. Since the transmitter is nomadic, the agents do not have any decoding ability. These agents process their channel observations and forward it...
This paper proposes novel successive decoding paradigm for fading channels, K independent codewords of different rates and lengths are interleaved at the transmitter according to a pattern, and successively decoded at the receiver. This enables progressively better channel estimates for the receiver, at a minimal cost of pilot symbols. At each decoding stage, channel estimation and decoding are performed...
We study a multirate layered architecture for multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channels, which uses a diagonal space-time interleaved (DSTI) coded modulation and a low complexity linear successive decoding receiver. The key challenge involved with this architecture is estimating the per-layer rates. We derive the probability density functions of per-layer mutual information,...
We study the end-to-end distortion-delay tradeoff for a Gaussian source transmitted over a fading channel. The analog source is quantized and stored in a buffer until it is transmitted. There are two extreme cases as far as buffer delay is concerned: no delay and infinite delay. We observe that there is a significant power gain by introducing a buffer delay. Our goal is to investigate the situation...
The capacity of pear-power limited, single-antenna, non-coherent, flat-fading channels with memory is considered. The emphasis is on the capacity pre-log, i.e., on the limiting ratio of channel capacity to the logarithm of the signal-to-noise ratio (SNR), as the SNR tends to infinity. It is shown that, among all stationary and ergodic fading processes of given spectral distribution function whose...
A 'queued-code' is a novel channel code, whose input rate is instantaneously adapted to the channel state information, assumed to be known to the transmitter. Previously, a queued-code was demonstrated for i.i.d. block fading channels, demonstrating significant gains, in terms of error exponent, over a fixed rate code. This paper demonstrates the performance gain of the queued-code in the more realistic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.