English
Related papers

Related papers: Low-Complexity Joint Channel Estimation and List D…

200 papers

Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…

Information Theory · Computer Science 2007-07-13 Mohammad H. Taghavi N. , Paul H. Siegel

In this paper, we study the problem of uplink channel estimation for near-filed orthogonal frequency division multiplexing (OFDM) systems, where a base station (BS), equipped with an extremely large-scale antenna array (ELAA), serves…

Signal Processing · Electrical Eng. & Systems 2026-01-27 Jionghui Wang , Jun Fang , Hongbin Li , Boyu Ning

The focus of this letter is on the reduction of the large pilot overhead in orthogonal frequency division multiplexing (OFDM) based massive multiple-input multiple-output (MIMO) systems. We propose a novel joint channel estimation and…

Information Theory · Computer Science 2022-12-16 Danilo Lelin Li , Arman Farhang

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

We identify and characterize dedicated pilot symbols and other predictable elements embedded within the Starlink Ku-band downlink waveform. Exploitation of these predictable elements enables precise opportunistic positioning, navigation,…

Signal Processing · Electrical Eng. & Systems 2026-02-04 Wenkai Qin , Mark L. Psiaki , John R. Bowman , Todd E. Humphreys

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

Peak to Average Power Ratio (PAPR) of Orthogonal Frequency Division Multiplexing (OFDM) is a long-standing problem which has been hindering its performance for decades. In this paper, we propose a new PAPR reduction scheme based on shifting…

Information Theory · Computer Science 2017-12-20 Md. Sakir Hossain , Tetsuya Shimamura

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…

Networking and Internet Architecture · Computer Science 2014-03-27 Avi Zanko , Amir Leshem , Ephraim Zehavi

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at the receiver. First, a decoding metric…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest…

Quantum Physics · Physics 2013-05-29 A. J. F. Hayes , H. L. Haselgrove , Alexei Gilchrist , T. C. Ralph

A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded…

Information Theory · Computer Science 2016-11-15 Mark F. Flanagan , Vitaly Skachek , Eimear Byrne , Marcus Greferath

Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. In this paper, we evaluate the performance of different test pattern sets using three methods. For test pattern sets with a certain structure…

Information Theory · Computer Science 2026-05-12 Tim Janz , Simon Obermüller , Andreas Zunker , Stephan ten Brink

We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decoding problem can be reduced to a series of repetition codes…

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…

Quantum Physics · Physics 2024-04-15 Paula Belzig , Matthias Christandl , Alexander Müller-Hermes

Probabilistic constellation shaping (PCS) offers a significant performance improvement over uniform signaling. It was recently discovered that long blocks are not required to achieve maximum shaping gain when transmitting over the nonlinear…

Signal Processing · Electrical Eng. & Systems 2020-12-15 Tobias Fehenberger , Helmut Griesser , Jörg-Peter Elbers

A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path.…

Information Theory · Computer Science 2018-01-16 Peter Trifonov , Vera Miloslavskaya , Ruslan Morozov

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we…

Information Theory · Computer Science 2016-10-05 Gianluigi Liva , Lorenzo Gaudio , Tudor Ninacs , Thomas Jerkovits

Polar codes have been gaining a lot of interest due to it being the first coding scheme to provably achieve the symmetric capacity of a binary memoryless channel with an explicit construction. However, the main drawback of polar codes is…

Information Theory · Computer Science 2019-11-11 Heshani Gamage , Vismika Ranasinghe , Nandana Rajatheva , Matti Latva-aho

We propose several differential decoding schemes for asynchronous multi-user MIMO systems based on orthogonal space-time block codes (OSTBCs) where neither the transmitters nor the receiver has knowledge of the channel. First, we derive…

Information Theory · Computer Science 2014-12-22 Sina Poorkasmaei , Hamid Jafarkhani
‹ Prev 1 8 9 10 Next ›