English
Related papers

Related papers: Full Rate L2-Orthogonal Space-Time CPM for Three A…

200 papers

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This…

Information Theory · Computer Science 2007-09-19 G. Susinder Rajan , B. Sundar Rajan

This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic…

Information Theory · Computer Science 2026-05-12 Juane Li , Qi-yue Yu , Khaled Abdel-Ghaffar , Shu Lin

We develop practical coding schemes for the cognitive overlay radios as modeled by the cognitive interference channel, a variation of the classical two user interference channel where one of the transmitters has knowledge of both messages.…

Information Theory · Computer Science 2012-06-12 Ernest Kurniawan , Andrea Goldsmith , Stefano Rini

A decode and forward protocol based Trellis Coded Modulation (TCM) scheme for the half-duplex relay channel, in a Rayleigh fading environment, is presented. The proposed scheme can achieve any spectral efficiency greater than or equal to…

Information Theory · Computer Science 2011-09-06 Vijayvaradharaj T Muralidharan , B. Sundar Rajan

Space-time block codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zeros. The zeros in the designs result in high peak-to-average power ratio and also…

Information Theory · Computer Science 2008-12-15 Smarajit Das , B. Sundar Rajan

This paper investigates practical 5G strategies for power-balanced non-orthogonal multiple access (NOMA). By allowing multiple users to share the same time and frequency, NOMA can scale up the number of served users and increase spectral…

Information Theory · Computer Science 2017-01-25 Haoyuan Pan , Lu Lu , Soung Chang Liew

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

The sixth generation (6G) wireless communication system will improve the key technical indicators by one to two orders of magnitude, and come with some new features. As a crucial technique to enhance the reliability and efficiency of data…

Information Theory · Computer Science 2025-04-08 Li Shen , Yongpeng Wu , Yin Xu , Xiaohu You , Xiqi Gao , Wenjun Zhang

Recently, a quasi-orthogonal space-time block code (QSTBC) capable of achieving a significant fraction of the outage mutual information of a multiple-input-multiple output (MIMO) wireless communication system for the case of four transmit…

Information Theory · Computer Science 2008-07-22 A. Sezgin , T. J. Oechtering

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

This paper presents an efficient quadratic programming (QP) decoder via the alternating direction method of multipliers (ADMM) technique, called QP-ADMM, for binary low-density parity-check (LDPC) codes. Its main contents are as follows:…

Information Theory · Computer Science 2020-02-19 Jing Bai , Yongchao Wang , Qingjiang Shi

The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…

Information Theory · Computer Science 2009-10-13 Ender Ayanoglu , Erik G. Larsson , Eleftherios Karipidis

This paper proposes an efficient identification algorithm for spatial multiplexing (SM) and Alamouti (AL) coded orthogonal frequency division multiplexing (OFDM) signals. The cross-correlation between the received signals from different…

Information Theory · Computer Science 2016-12-12 Yahia A. Eldemerdash , Octavia A. Dobre , Bruce J. Liao

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

We develop two new designs of unitary differential space-time modulation (DSTM) with low decoding complexity. Their decoder can be separated into a few parallel decoders, each of which has a decoding search space of less than sqrt(N) if the…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , T. T. Tjhung

Compute-and-forward relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a compute-and-forward scheme, a relay tries to decode a linear combination composed of transmitted messages from other…

Information Theory · Computer Science 2018-01-22 Satoshi Takabe , Yuta Ishimatsu , Tadashi Wadayama , Masahito Hayashi

The perfect space-time block codes (STBCs) are based on four design criteria - full-rateness, non-vanishing determinant, cubic shaping and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at…

Information Theory · Computer Science 2012-12-12 K. Pavan Srinath , B. Sundar Rajan

A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of…

Information Theory · Computer Science 2017-01-24 A. Tasdighi , M. R. Sadeghi

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical…

Information Theory · Computer Science 2015-12-16 Sebastian Cammerer , Vahid Aref , Laurent Schmalen , Stephan ten Brink

We propose novel deep joint source-channel coding (DeepJSCC) algorithms for wireless image transmission over multi-input multi-output (MIMO) Rayleigh fading channels, when channel state information (CSI) is available only at the receiver.…

Signal Processing · Electrical Eng. & Systems 2023-06-22 Chenghong Bian , Yulin Shao , Haotian Wu , Deniz Gunduz