English
Related papers

Related papers: A Physical-layer Rateless Code for Wireless Channe…

200 papers

A general lossless joint source-channel coding scheme based on linear codes is proposed and then analyzed in this paper. It is shown that a linear code with good joint spectrum can be used to establish limit-approaching joint source-channel…

Information Theory · Computer Science 2016-11-17 Shengtian Yang , Peiliang Qiu

Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA [1]. In [1], a Maximum…

Information Theory · Computer Science 2010-01-26 Ali Mousavi , Pedram Pad , Farokh Marvasti

Physical layer security has recently been regarded as an emerging technique to complement and improve the communication security in future wireless networks. The current research and development in physical layer security is often based on…

Information Theory · Computer Science 2013-10-02 Biao He , Xiangyun Zhou

For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune…

Information Theory · Computer Science 2023-11-14 Binghui Shi , Yongpeng Wu , Peihong Yuan , Derrick Wing Kwan Ng , Xiang-Gen Xia , Wenjun Zhang

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the aid of relays and cooperation between destinations. The wireless nature of the medium is captured by…

Information Theory · Computer Science 2010-11-15 Sreeram Kannan , Adnan Raja , Pramod Viswanath

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

Information Theory · Computer Science 2019-03-12 Mustafa Cemil Coşkun , Giuseppe Durisi , Thomas Jerkovits , Gianluigi Liva , William Ryan , Brian Stein , Fabian Steiner

An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…

Information Theory · Computer Science 2023-05-24 Thomas Wiegart , Linfang Wang , Diego Lentner , Richard D. Wesel

We use prefix-free code distribution matching (PCDM) for rate matching (RM) in some 5G New Radio (NR) deployment scenarios, realizing a wide range of information rates from 1.4 to 6.0 bit/symbol in fine granularity of 0.2 bit/symbol. We…

Signal Processing · Electrical Eng. & Systems 2020-01-17 Junho Cho , Ori Shental

Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical…

Information Theory · Computer Science 2011-08-17 Puripong Suthisopapan , Kenta Kasai , Anupap Meesomboon , Virasit Imtawil , Kohichi Sakaniwa

We focus on interference mitigation and energy conservation within a single wireless body area network (WBAN). We adopt two-hop communication scheme supported by the the IEEE 802.15.6 standard (2012). In this paper, we propose a dynamic…

Networking and Internet Architecture · Computer Science 2016-11-03 Mohamad Jaafar Ali , Hassine Moungla , Ahmed Mehaoua , Yong Xu

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems…

Information Theory · Computer Science 2007-07-13 Martin J. Wainwright , Emin Martinian

Supporting ultra-reliable and low-latency communication (URLLC) is a challenge in current wireless systems. Channel codes that generate large codewords improve reliability but necessitate the use of interleavers, which introduce undesirable…

Information Theory · Computer Science 2023-07-12 Sahar Allahkaram , Francisco A. Monteiro , Ioannis Chatzigeorgiou

Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…

Information Theory · Computer Science 2025-01-09 Jiajie Xue , Brian M. Kurkoski

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

Information Theory · Computer Science 2022-07-12 YuHao Liu , Teng Fu , Jean Barbier , TianQi Hou

The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…

Information Theory · Computer Science 2018-05-28 Bowen Feng , Jian Jiao , Liu Zhou , Shaohua Wu , Bin Cao , Qinyu Zhang

A new approach for the approximation of the channel log-likelihood ratio (LLR) for wireless channels based on Taylor series is proposed. The approximation is applied to the uncorrelated flat Rayleigh fading channel with unknown channel…

Information Theory · Computer Science 2015-03-19 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari , Hamid Saeedi

In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded…

Information Theory · Computer Science 2016-11-15 Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

NOMA) technique based on an algebraic design is studied. We propose an improved low-density spreading (LDS) sequence design based on projective geometry. In terms of its bit error rate (BER) performance, our proposed improved LDS code set…

Information Theory · Computer Science 2022-01-04 Goldwyn Millar , Michel Kulhandjian , Ayse Alaca , Saban Alaca , Claude D'Amours , Halim Yanikomeroglu

In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific…

Information Theory · Computer Science 2016-11-15 Mahyar Shirvanimoghaddam , Yonghui Li , Shuang Tian , Branka Vucetic
‹ Prev 1 3 4 5 6 7 10 Next ›