English
Related papers

Related papers: Approximately-Universal Space-Time Codes for the P…

200 papers

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Pavan R. Pinnamraju , Constantinos B. Papadias

In this paper, a multi-source multi-relay cooperative wireless network with binary modulation and binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets…

Information Theory · Computer Science 2012-04-24 Marco Di Renzo , Michela Iezzi , Fabio Graziosi

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we…

Quantum Physics · Physics 2022-04-26 Masahito Hayashi , Ning Cai

To fully support vertical industries, 5G and its corresponding channel coding are expected to meet requirements of different applications. However, for applications of 5G and beyond 5G (B5G) such as URLLC, the transmission latency is…

Information Theory · Computer Science 2022-01-11 Xiaohu You , Chuan Zhang , Bin Sheng , Yongming Huang , Chen Ji , Yifei Shen , Wenyue Zhou , Jian Liu

We study a space--time block code from a maximal order in the definite quaternion algebra $(-1,-3)_{\Q}$. Its embedding into $\C^{2\times 2}$ yields an Alamouti--Eisenstein code over $\Z[w]$ with full diversity, orthogonality, and…

Information Theory · Computer Science 2026-04-14 Juliana Souza , Yu-Chih Huang

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the…

Information Theory · Computer Science 2009-03-16 Yijia , Fan , Chao Wang , H. Vincent Poor , John S. Thompson

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…

Information Theory · Computer Science 2016-11-17 Che Lin , Vasanthan Raghavan , Venu Veeravalli

The design of modulation schemes for the physical layer network-coded two way wireless relaying scenario is considered. It was observed by Koike-Akino et al. for the two way relaying scenario, that adaptively changing the network coding map…

Information Theory · Computer Science 2012-01-05 Srishti Shukla , Vijayvaradharaj T. Muralidharan , B. Sundar Rajan

Let $K/F$ and $K/L$ be two cyclic Galois field extensions and $D=(K/F,\sigma,c)$ a cyclic algebra. Given an invertible element $d\in D$, we present three families of unital nonassociative algebras over $L\cap F$ defined on the direct sum of…

Information Theory · Computer Science 2021-04-13 Susanne Pumpluen , Andrew Steele

We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…

Information Theory · Computer Science 2013-01-10 Jean-Claude Belfiore , Frédérique Oggier

Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more frequent training sequences and increasing data rate by sending…

Information Theory · Computer Science 2026-05-04 Duschia Bodet , Muriel Médard , Muralidhar Rangaswamy , Ken Duffy

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Differential distributed space-time coding (D-DSTC) is a cooperative transmission technique that can improve diversity in wireless relay networks in the absence of channel information. Conventionally, it is assumed that channels are…

Information Theory · Computer Science 2014-11-18 M. R. Avendi , Hamid Jafarkhani

In this paper, we propose a novel single-group multicasting relay beamforming scheme. We assume a source that transmits common messages via multiple amplify-and-forward relays to multiple destinations. To increase the number of degrees of…

Information Theory · Computer Science 2023-07-19 Adrian Schad , Ka L. Law , Marius Pesavento

Common signals in public channels of cellular systems are usually transmitted omnidirectionally from the base station (BS). In recent years, both discrete and consecutive omnidirectional space-time block codings (STBC) have been proposed…

Signal Processing · Electrical Eng. & Systems 2019-05-03 Can Liu , Xiang-Gen Xia , Yongzhao Li , Xiqi Gao , Hailin Zhang

A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences…

Information Theory · Computer Science 2015-05-18 H. M. de Oliveira , R. M. Campello de Souza , A. N. Kauffman

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d.…

Information Theory · Computer Science 2016-11-17 Sergey Loyka , Georgy Levin

The problem of dual-hop transmission from a source to a destination via two parallel full-duplex relays in block Rayleigh fading environment is investigated. All nodes in the network are assumed to be oblivious to their forward channel…

Information Theory · Computer Science 2012-06-19 Mahdi Zamani , Amir K. Khandani

In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MMI) on space-time block codes that enable symbolwise maximum…

Information Theory · Computer Science 2007-07-13 Kenji Tanaka , Ryutaroh Matsumoto , Tomohiko Uyematsu