Results 231 to 240 of about 52,700 (275)

Superposition coding for wireless mesh networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking, 2007
A major barrier for the adoption of wireless mesh networks is severe limits on throughput. In this paper, we apply superposition coding to substantially improve network capacity of large, dense wireless mesh networks. Superposition coding is a physical layer technique that allows a transmitter to simultaneously send independent packets to multiple ...
Li (Erran) Li, Richard Alimi, Ramachandran Ramjee, Jingpu Shi, Yanjun Sun, Harish Viswanathan, Yang Richard Yang   +6 more
openaire   +1 more source

Cooperative diversity based on code superposition

2006 IEEE International Symposium on Information Theory, 2006
This paper proposes a new approach to cooperative diversity based on the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two "partners" ? Node A and Node B ? cooperate in transmitting information to a single destination; each partner transmits both locally-generated information and relayed ...
Lei Xiao, Thomas E. Fuja, Jörg Kliewer, Daniel J. Costello Jr.   +3 more
openaire   +1 more source

Superposition Coding with Peak-Power Limitation

2006 IEEE International Conference on Communications, 2006
This paper presents a peak-power-limited superposition coding scheme based on clipping. A low-complexity soft compensation algorithm (SCA) for combating the clipping effect is investigated. It can be easily combined with soft-input soft-output (SISO) decoding algorithms in an iterative manner. Various numerical results show that the SCA can effectively
Jun Tong, Li Ping 0001, Xiao Ma 0001
openaire   +1 more source

Quasi-Orthogonal Sparse Superposition Codes

2019 IEEE Global Communications Conference (GLOBECOM), 2019
We introduce a new family of error correction codes based on sparse superposition called Quasi- Orthogonal} Sparse Superposition Codes (QO-SSC). The core of QO-SSC is a special structure of the SSC projection matrix which is obtained by concatenation of orthogonal submatrices. Concrete examples of QO-SCC constructions based on Zadoff- Chu sequences and
Alberto G. Perotti, Branislav M. Popovic
openaire   +1 more source

The performance of layered broadcast with superposition coding

International Journal of Communication Systems, 2011
AbstractIn wireless broadcast system, where feedback is limited and channel state information is only available at the receiver side, layered broadcasting approach has been proposed to fully utilize the channel resources by providing different levels of service quality to users with different channel conditions.
Dongyan Wei, Wenbo Wang 0007, Mugen Peng, Dong Liang 0010, Yang Liu 0024   +4 more
openaire   +1 more source

Performance analysis of superposition coded modulation

Physical Communication, 2010
This paper presents a comprehensive analysis of superposition coded modulation (SCM). Two types of SCM schemes, i.e., the single-code SCM (SC-SCM) and multi-code SCM (MC-SCM), are analyzed. The basic features of SCM are described, followed by the information-theoretic analysis. Different encoding/decoding strategies are compared from the capacity point
Jun Tong, Li Ping 0001
openaire   +2 more sources

Superposition modulation with irregular convolutional coding

2012 IEEE Global Communications Conference (GLOBECOM), 2012
Bijective mapping techniques with uniformly distributed constellation diagrams, like PSK and QAM, are standard in today's communications systems. Yet, it is well known that without additional effort in form of active signal shaping, bijective mapping techniques are not capacity achieving.
Meelis Noemm, Alaa Mourad, Peter Adam Hoeher   +2 more
openaire   +1 more source

Superposition coding for side-information channels

IEEE Transactions on Information Theory, 2006
We present simple, practical codes designed for the binary and Gaussian dirty-paper channels. We show that the dirty-paper decoding problem can be transformed into an equivalent multiple-access decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez.
Amir Bennatan, David Burshtein, Giuseppe Caire, Shlomo Shamai   +3 more
openaire   +1 more source

Sparse superposition codes: A practical approach

2015 IEEE Workshop on Signal Processing Systems (SiPS), 2015
Sparse Superposition Codes are a class of capacity achieving codes for which decoding can be interpreted as a compressive sensing problem. The approximate message passing algorithm, proven to be effective in compressive sensing, has been proposed in different incarnations as a valid decoding approach.
Carlo Condo, Warren J. Gross
openaire   +1 more source

Superposition block coded modulation

CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436), 2004
In this paper, we introduce a novel superposition coded modulation (SCM) scheme that uses block codes as the component codes. The proposed scheme is termed as superposition block coded modulation (SBCM). An SBCM system example with very simple component codes is presented.
G. Karabulut, A. Yongacoglu
openaire   +1 more source