English
Related papers

Related papers: Low-delay, Low-PAPR, High-rate Non-square Complex …

200 papers

A coding scheme for two-page unrestricted-rate PRIO code that each page may have different code rates is proposed. In the second page, the code for each messages consists of two complementary codewords with code length n. There are a total…

Information Theory · Computer Science 2017-02-10 Shan Lu , Horoshi Kamabe , Jun Cheng , Akira Yamawaki

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

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

We extend earlier work on the design of convolutional code-specific CRC codes to $Q$-ary alphabets, with an eye toward $Q$-ary orthogonal signaling. Starting with distance-spectrum optimal, zero-terminated, $Q$-ary convolutional codes, we…

Information Theory · Computer Science 2022-10-04 Jacob King , William Ryan , Richard D. Wesel

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…

Information Theory · Computer Science 2016-11-17 Dung Ngoc Dao , Chau Yuen , Chintha Tellambura , Yong Liang Guan , Tjeng Thiang Tjhung

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…

Combinatorics · Mathematics 2022-07-18 Tim Alderson

In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…

Information Theory · Computer Science 2016-07-04 Fabian Steiner , Patrick Schulte

Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Sandro Scalise , Marco Chiani

To achieve multi-Gb/s data rates in 6G optical wireless access networks based on narrow infrared (IR) laser beams, a high-speed receiver with two key specifications is needed: a sufficiently large aperture to collect the required optical…

We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$…

Information Theory · Computer Science 2016-11-17 Ahmed Badr , Pratik Patil , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range,…

Networking and Internet Architecture · Computer Science 2016-11-18 Xiumin Wang , Chau Yuen , Yinlong Xu

A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the…

Information Theory · Computer Science 2015-04-15 Fabian Steiner , Georg Böcherer , Gianluigi Liva

The construction of polar codes for channels other than BECs requires sorting of all bit channels and then selecting the best $K$ of them for a block length $N=2^n$. In this paper, two types of partial orders (PO) of polar codes are…

Information Theory · Computer Science 2017-04-25 Wei Wang , Liping Li

Maximum distance separable convolutional codes are characterized by the property that the free distance reaches the generalized Singleton bound, which makes them optimal for error correction. However, the existing constructions of such…

Information Theory · Computer Science 2023-05-26 Zita Abreu , Raquel Pinto , Rita Simões

Convolutional codes with a maximum distance profile attain the largest possible column distances for the maximum number of time instants and thus have outstanding error-correcting capability especially for streaming applications. Explicit…

Information Theory · Computer Science 2024-01-09 Zitan Chen

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani

In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…

Information Theory · Computer Science 2012-02-28 Camilla Hollanti , Nadya Markin

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum…

Information Theory · Computer Science 2015-03-19 Laura Luzzi , Frédérique Oggier

In this paper, we introduce further our recently designed family of L2 orthogonal Space-Time codes for CPM. With their advantage of maintaining both the constant envelope properties of CPM, the diversity of Space-Time codes and moreover…

Information Theory · Computer Science 2009-02-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti