3,980 Hits in 4.6 sec

Fountain code design for data multicast with side information

D. Sejdinovic, R. Piechocki, A. Doufexi, M. Ismail
2009 IEEE Transactions on Wireless Communications  
Sejdinović and R. Piechocki would like to thank Toshiba Telecommunications Research Laboratory and its directors for supporting this work.  ...  We will also adopt this approach in fountain coding with noisy side information.  ...  The error rate vanishes after a large threshold code overhead, whereas for smaller code overheads, error rate generally stays large.  ... 
doi:10.1109/twc.2009.081076 fatcat:qnv6wd6gfrbhtbfrsxok6qn6da

Performance regimes of uncoded linear communications over AWGN channels

Szymon Jakubczak, John Z. Sun, Dina Katabi, Vivek K. Goyal
2011 2011 45th Annual Conference on Information Sciences and Systems  
The conventional approach to JSCC which combines successive refinement with superposition coding is still digital and separable.  ...  We find that there exist regimes where the uncoded scheme is near-optimal for point-to-point communication and provides significant gains over the conventional digital design for broadcast. 978-1-4244-  ...  In this paper, we consider a generalization of this analog system with the restriction that encoding and decoding are linear and allow for a side channel that communicates the subband variances as side  ... 
doi:10.1109/ciss.2011.5766155 dblp:conf/ciss/JakubczakSKG11 fatcat:wqtzoiq7gze25p7uz5t73icpkm

An Efficient Algorithm for Improving Ber and Papr of Ofdm System by Using Nonlinear Companding Transform

A. Vinisha, Kumar keshamoni, S. Swetha
2014 IOSR Journal of Electronics and Communication Engineering  
In this article analyses the improvement in Bit Error Rate and overall system performance by employing non linear companding technique for PAPR reduction in Digital Video Broadcasting system.  ...  Which can use companding for Peak to Average Power Ration control is explored for linking a nonlinear transmit power amplifier with OFDM.  ...  Therefore, when channel coding is used the loss in data rate is increased further due to side information.  ... 
doi:10.9790/2834-09553034 fatcat:dkvetzovtjaj5dbjciahj5hit4

Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network [article]

Yaoqing Yang, Soummya Kar, Pulkit Grover
2017 arXiv   pre-print
while bringing in novel techniques, e.g., from error-control coding and noisy circuits, for both upper and lower bounds.  ...  We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network.  ...  The first one concerns repetition codes and the second one linear block codes for reliable message transmission over noisy communication channels.  ... 
arXiv:1508.01553v3 fatcat:bisscyg7ojfbrf5lqyy5bcz6km

Efficient In-Network Computing with Noisy Wireless Channels

Chengzhi Li, Huaiyu Dai
2013 IEEE Transactions on Mobile Computing  
In particular, we endeavor to improve the design for two exemplary cases: the identity function, and size-restricted type-threshold functions, both focusing on the constant m and N scenario.  ...  We also analyze the bottleneck of this general protocol in different scenarios, which provides insights into designing more efficient protocols for specific functions.  ...  ACKNOWLEGEMENTS This work was supported in part by the US National Science Foundation under Grant CCF-0721815, CCF-0830462 and ECCS-1002258.  ... 
doi:10.1109/tmc.2012.185 fatcat:yqebxpwxkbgffh4nt5lslv6ptq

Interactive Computation of Type-Threshold Functions in Collocated Broadcast-Superposition Networks [article]

Chien-Yi Wang, Sang-Woon Jeon, Michael Gastpar
2013 arXiv   pre-print
This paper considers two network models reflecting both the broadcast and superposition properties of wireless channels: the collocated linear finite field network and the collocated Gaussian network.  ...  This paper focuses on type-threshold functions, e.g., the maximum and indicator functions.  ...  The coding scheme can be easily extended to the case when the same side information is available at all nodes. Theorem 3 (Nazer and Gastpar): Let g be an F p -linear function.  ... 
arXiv:1310.2860v1 fatcat:nwae7os2djgt7egu5ecmnl4knq

Practical understanding of the operating principle of digital communication systems

Gebrehiwet Gebrekrstos Lema, Teklehaymanot Baweke Reda, Dawit Hailu, Tole Sutikno
2019 Indonesian Journal of Electrical Engineering and Computer Science  
The encrypted data is converted in to an 8-bit binary, channel encoded with distinct channel coding styles like linear block encoder, cyclic encoder and convolutional encoder, line coded and band pass  ...  In the system kit development text and audio inputs are taken and encrypted with different encryption techniques including additive cipher, multiplicative cipher and affine ciphers.  ...  in to an 8 bit binary, channel encoded with distinct channel coding styles like linear block encoder, cyclic encoder and convolutional encoder, line coded with RZ, RZ_L, unipolar RZ, AMI, bipolar RZ and  ... 
doi:10.11591/ijeecs.v16.i1.pp299-310 fatcat:gjjmsrmfrzfmdnec3mu3ekzoyu

On the Performance of Hybrid Digital-Analog Coding for Broadcasting Correlated Gaussian Sources

Hamid Behroozi, Fady Alajaji, Tamas Linder
2011 IEEE Transactions on Communications  
Two cases are considered: 1) broadcasting with bandwidth compression, and 2) broadcasting with bandwidth expansion.  ...  We study hybrid digital-analog (HDA) joint source-channel coding schemes and analyze the region of (squared-error) distortion pairs that are simultaneously achievable.  ...  An HDA coding scheme for broadcasting a common source to two receivers with matched bandwidth having different correlated side information is proposed in [35] , where the authors show that under certain  ... 
doi:10.1109/tcomm.2011.101011.100483 fatcat:5q5mvkiypvf2ldg3v3skdc4edu

Lower Bounds for the Noisy Broadcast Problem

Navin Goyal, Guy Kindler, Michael Saks
2008 SIAM journal on computing (Print)  
1 − n −α for a constant parameter α > 0 (this bound applies to all threshold functions, as well as any other boolean-valued function with linear sensitivity).  ...  We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6] .  ...  In the adversarial noise model, we don't know of any examples of decision functions where gnd-trees do better than ordinary noisy decision trees. Are these models equivalent for adversarial noise?  ... 
doi:10.1137/060654864 fatcat:7mp5fknzkre6llsbyhahmxqxe4

Book Review: The theory of information and coding: A mathematical framework for communication

E. R. Berlekamp
1978 Bulletin of the American Mathematical Society  
Metivier, The stochastic integral with respect to processes with values in a reflexive Banach space, Theor. Probability 19 (1974), 758-787. 15. M. Metivier and G.  ...  Meyer, A decomposition theorem for supermartingales, Illinois  ...  The major activity in this area in the last few years has been related to questions about networks of channels, and broadcast channels, in which the same transmitted information is corrupted by different  ... 
doi:10.1090/s0002-9904-1978-14575-3 fatcat:7l4wbmwwqzfo5dufh4uqgrxine

Cross-layer Raptor coding for broadcasting over wireless channels with memory

Yu Cao, Steven D. Blostein
2009 2009 11th Canadian Workshop on Information Theory  
This paper investigates the performance of application layer Raptor codes for broadcasting services over wireless channels with memory.  ...  Raptor codes are a class of rateless codes that have been shown to provide promising performance in erasure channels, and more recently, in noisy channels.  ...  ACKNOWLEDGMENT This work was supported by the Natural Sciences and Engineering Research Council of Canada Strategic Project STPSC 356826.  ... 
doi:10.1109/cwit.2009.5069538 fatcat:wz63zotuujds5ok6iz57y7xqqu

Technical Program

2021 2020 IEEE Information Theory Workshop (ITW)  
The Schalkwijk-Kailath (SK) feedback scheme is a capacity-achieving coding scheme for the point-to-point white Gaussian channel with feedback.  ...  by random coding, and may be strictly lower than the Shannon (matched) capacity.  ...  quantization with side information for Gaussian observations, where the side information is a noisy version of the sender's observation with an unknown noise variance.  ... 
doi:10.1109/itw46852.2021.9457668 fatcat:j425ygeajrbd5esztbe5zgygty

Fountain Coding with Decoder Side Information

D. Sejdinovic, R. J. Piechocki, A. Doufexi, M. Ismail
2008 2008 IEEE International Conference on Communications  
In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder.  ...  , we propose methods of enhancing the design of standard non-systematic DF codes by optimizing their output degree distribution based on the side information assumption.  ...  The first one deals with the standard non-systematic DF code as a single code for source and channel coding and its enhancement based on the assumption that the decoder side information is present.  ... 
doi:10.1109/icc.2008.840 dblp:conf/icc/SejdinovicPDI08 fatcat:pdw2kv3bdbbjrcpmt3u7n6rwbu

Reliable Physical Layer Network Coding [article]

Bobak Nazer, Michael Gastpar
2011 arXiv   pre-print
Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear error-correcting codes, intermediate nodes in a wireless network can directly recover linear combinations  ...  Starting with some simple examples, this survey explores the core ideas behind this new technique and the possibilities it offers for communication over interference-limited wireless networks.  ...  Zamir, and J. Zhan for valuable discussions and N. Devroye for a careful reading of the manuscript.  ... 
arXiv:1102.5724v1 fatcat:3wgxb3ch3zdapehpq5vuhkntwy

V2X System Architecture Utilizing Hybrid Gaussian Process-based Model Structures [article]

Hossein Nourkhiz Mahjoub, Behrad Toghi, S M Osman Gani, Yaser P. Fallah
2019 arXiv   pre-print
Scalable communication is of utmost importance for reliable dissemination of time-sensitive information in cooperative vehicular ad-hoc networks (VANETs), which is, in turn, an essential prerequisite for  ...  The results show the effectiveness of the proposed communication architecture on both reducing the required message exchange rate and increasing the remote agent tracking precision.  ...  Setting a threshold on the tracking error and utilizing a two-state hybrid modeling scheme, compromised of GP (with RBF + Linear kernel) and CV components, this figure (using different colors) shows the  ... 
arXiv:1903.01576v2 fatcat:sxcdhjjddbctvd4nekb4vdz2xe
« Previous Showing results 1 — 15 out of 3,980 results