English
Related papers

Related papers: Channel Coding over Multiple Coherence Blocks with…

200 papers

A telecommunication system uses carriers in order to transmit information through a cable or wirelessly. If each time only one carrier is transmitted, then the system s signal will not be immune to frequency selective fading. If frequency…

Signal Processing · Electrical Eng. & Systems 2018-07-10 Spyridon K. Chronopoulos , Vasilis Christofilakis , Giorgos Tatsis , Panos Kostarakis

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

The optimization of the pilot overhead in single-user wireless fading channels is investigated, and the dependence of this overhead on various system parameters of interest (e.g., fading rate, signal-to-noise ratio) is quantified. The…

Information Theory · Computer Science 2016-11-17 Nihar Jindal , Angel Lozano

In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov…

Information Theory · Computer Science 2016-12-01 Nadieh Moghadam , Mohammad Mohebbi , Hongxiang Li

We examine deterministic broadcasting on multiple-access channels for a scenario when packets are injected continuously by an adversary to the buffers of the devices at rate $\rho$ packages per round. The aim is to maintain system…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-19 Elijah Hradovich , Marek Klonowski , Dariusz R. Kowalski

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

Content delivery networks often employ caching to reduce transmission rates from the central server to the end users. Recently, the technique of coded caching was introduced whereby coding in the caches and coded transmission signals from…

Information Theory · Computer Science 2016-02-16 Hooshang Ghasemi , Aditya Ramamoorthy

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

With the fast development of wireless technologies, wireless applications have invaded various areas in people's lives with a wide range of capabilities. Guaranteeing Quality-of-Service (QoS) is the key to the success of those applications.…

Networking and Internet Architecture · Computer Science 2016-06-20 Xu Zheng , Zhipeng Cai , Jianzhong Li , Hong Gao

The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as…

Data Structures and Algorithms · Computer Science 2014-08-29 Noga Alon , Mohsen Ghaffari , Bernhard Haeupler , Majid Khabbazian

The problem of serving multicast flows in a crossbar switch is considered. Intra-flow linear network coding is shown to achieve a larger rate region than the case without coding. A traffic pattern is presented which is achievable with…

Networking and Internet Architecture · Computer Science 2016-11-17 MinJi Kim , Jay Kumar Sundararajan , Muriel Medard , Atilla Eryilmaz , Ralf Koetter

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

Networking and Internet Architecture · Computer Science 2013-12-19 Easwar Vivek Mangipudi , Venkatesh Ramaiyan

The second-order coding rate of the multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channel is studied. We tackle this problem via an information-spectrum approach and statistical bounds based on recent random matrix…

Information Theory · Computer Science 2016-11-17 Jakob Hoydis , Romain Couillet , Pablo Piantanida

In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that the secondary transmitter sends the data at two different average power levels, depending…

Information Theory · Computer Science 2009-06-23 Sami Akin , Mustafa Cenk Gursoy

In this paper, we investigate in detail the performance of turbo codes in quasi-static fading channels both with and without antenna diversity. First, we develop a simple and accurate analytic technique to evaluate the performance of turbo…

Information Theory · Computer Science 2016-11-17 M. R. D. Rodrigues , I. Chatzigeorgiou , I. J. Wassell , R. Carrasco

We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding…

Networking and Internet Architecture · Computer Science 2016-11-17 Jay Kumar Sundararajan , Muriel Medard , MinJi Kim , Atilla Eryilmaz , Devavrat Shah , Ralf Koetter

We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e.…

Networking and Internet Architecture · Computer Science 2016-11-15 MinJi Kim , Jay Kumar Sundararajan , Muriel Medard

Channel uncertainty and co-channel interference are two major challenges in the design of wireless systems such as future generation cellular networks. This paper studies receiver design for a wireless channel model with both time-varying…

Information Theory · Computer Science 2009-10-15 Yan Zhu , Dongning Guo , Michael L. Honig
‹ Prev 1 3 4 5 6 7 10 Next ›