A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Universal Algorithms for Channel Decoding of Uncompressed Sources
2008
IEEE Transactions on Information Theory
Preserved Fulltext
This paper proposes several universal channel decoders that take advantage of the source redundancy without requiring prior knowledge of its statistics. ...
In many applications, an uncompressed source stream is systematically encoded by a channel code (which ignores the source redundancy) for transmission over a discrete memoryless channel. ...
ACKNOWLEDGMENT The authors would like to thank Marcelo Weinberger and Tsachy Weissman for discussions that led to this work. ...
doi:10.1109/tit.2008.920187
fatcat:rbhi7exrtfbmtdgjrxyfjqn7em
Lossless data compression with error correcting codes
2003
IEEE International Symposium on Information Theory, 2003. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Figure 2 shows the histogram of achieved compression with the universal algorithm for a fourstate Markov chain in comparison with LZ (gzip) and a conventional BWT-based compressor (bzip). ...
(for stationary ergodic tree sources) with the the length, location, and distribution of the i.i.d. segments depending on the statistics of the source. ...
Figure 2 shows the histogram of achieved compression with the universal algorithm for a fourstate Markov chain in comparison with LZ (gzip) and a conventional BWT-based compressor (bzip). ...
doi:10.1109/isit.2003.1228036
fatcat:aglyo2gnune4zclvgelmlmooey
Error correction scheme for uncompressed HD video over wireless
2009
2009 IEEE International Conference on Multimedia and Expo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Our scheme uses the large amount of spatial redundancy already present in uncompressed HD video data to provide an extra layer of protection in addition to that provided by channel coding. ...
Digital transmission of uncompressed high-definition video is challenging because of its high data rate and its extreme sensitivity to bit errors. ...
Furthermore, the HDMI connector interface for HD video sources and displays supports uncompressed HD transmission. ...
doi:10.1109/icme.2009.5202616
dblp:conf/icmcs/ManoharaMGM09
fatcat:6tyufaa2r5e3xfazgdlubl5stm
Joint Source-Channel Coding in Dictionary Methods of Lossless Data Compression
2010
International Journal of Electronics and Telecommunications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper contains a description of methods of joint source-channel coding based on the popular data compression algorithms LZ'77 and LZSS. ...
One of the solutions to this problem is the application of joint source and channel coding. ...
This paper addresses joint source-channel coding for two algorithms belonging to the family of dictionary compression methods. ...
doi:10.2478/v10177-010-0046-8
fatcat:npzgwzi23fcofb5e4pk4ksyrpm
Universal lossless source controlled channel decoding for I.I.D. sequences
2005
IEEE Communications Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We propose to integrate universal lossless source coding techniques into channel decoding of redundant sequences with unknown statistics to improve performance of Viterbi and turbo decoding. ...
Messages coded and transmitted over a channel usually contain some redundancy which is not utilized by channel decoding techniques, especially if its governing statistical parameters are unknown. ...
ACKNOWLEDGMENTS The authors gratefully acknowledge Shlomo Shamai and an anonymous reviewer for providing feedback that led to improving the simulation results and their presentation. ...
doi:10.1109/lcomm.2005.1431168
fatcat:akbrpqotengbhkt57oxxv4txye
Entanglement-Assisted Classical Communication Over Quantum Channels for Binary Markov Sources
2018
IEEE Transactions on Vehicular Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Symbol-based iterative decoding is proposed for the transmission of classical Markov source signals over a quantum channel using a three-stage serial concatenation of a convolutional code (CC), a unity-rate ...
A modified symbol-based maximum a posteriori algorithm is employed for CC decoding to exploit the Markov source statistics during the iterative decoding process. ...
source correlation using a soft-bit source decoder [10] - [16] and by modifying the channel decoding algorithm to incorporate the a priori or a posteriori source knowledge [9] , [17] - [21] . ...
doi:10.1109/tvt.2017.2778192
fatcat:mju42edvmzdq3lmwgaiuwhys5y
On the Use of Standards for Microarray Lossless Image Compression
2006
IEEE Transactions on Biomedical Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This is not surprising, since the appearance and fast growth of the technology responsible for producing these images is also quite recent. ...
We concluded that the compression technology behind JBIG seems to be the one that offers the best combination of compression efficiency and flexibility for microarray image compression. ...
uncompressed. ...
doi:10.1109/tbme.2005.869782
pmid:16532784
fatcat:sauyedayvrffxovh66hpqug7yq
Adaptive multiple description coding and transmission of uncompressed video over 60GHz networks
2014
ACM SIGMOBILE Mobile Computing and Communications Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The performance of the proposed scheme is validated with simulations. * This work is based on an earlier work: Multiple Description Coding for Uncompressed Video Streaming over 60GHz Networks, in ACM CRAB ...
In this paper, we investigate the problem of streaming uncompressed High Definitio (HD) videos over 60GHz networks. ...
Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflec the views of the foundation. ...
doi:10.1145/2581555.2581558
fatcat:ejpr27csxnanndr4jojoh3x2za
A framework for evaluating wavelet based watermarking for scalable coded digital item adaptation attacks
2009
Wavelet Applications in Industrial Processing VI
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed framework is beneficial not only as an evaluation tool but also as design tool for new wavelet based watermark algorithms by picking and mixing of available tools and finding the optimum design ...
WEBCAM accommodates all major wavelet based watermarking in single generalised framework by considering a global parameter space, from which the optimum parameters for a specific algorithm may be chosen ...
The bit stream is adapted according to the channel capacity followed by channel coding, channel model for transmission. At the receiving node a channel decoding is done to reproduce the bitstream. ...
doi:10.1117/12.816307
fatcat:5wfgmddumrhprebnjtkjpqifk4
Multiple description coding for uncompressed video streaming over 60GHz networks
2013
Proceedings of the 1st ACM workshop on Cognitive radio architectures for broadband - CRAB '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The performance of the proposed scheme is validated with simulations. * This work is based on an earlier work: Multiple Description Coding for Uncompressed Video Streaming over 60GHz Networks, in ACM CRAB ...
In this paper, we investigate the problem of streaming uncompressed High Definitio (HD) videos over 60GHz networks. ...
Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflec the views of the foundation. ...
doi:10.1145/2508478.2508485
dblp:conf/mobicom/HeM13
fatcat:vhdo5m7q5zbb5lwnp23ziluape
Joint coding rate control for audio streaming in short range wireless networks
2009
IEEE transactions on consumer electronics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The major strength of the proposed algorithm is in its ability to match the source and channel coding parameters to the given channel conditions, thus providing better quality and lower latency of audio ...
Retransmission and data buffering, as common techniques in data transfer over error-prone channels, are not adequate for delay sensitive applications such as high quality audio streaming. ...
Basic idea of the proposed algorithm is to increase the quantization noise of the source when channel bandwidth decreases, which will result in lower source data rates. ...
doi:10.1109/tce.2009.5174411
fatcat:5yzhgyat6ndsnd65vzrd6pfjwq
Robust Transmission Of Html Files: Iterative Joint Source-Channel Decoding Of Deflate Codes
2008
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Publication in the conference proceedings of EUSIPCO, Lausanne, Switzerland, 2008 ...
The authors of reference [4] proposed a joint source channel coding algorithm to protect the universal Lempel-Ziv-77 (LZ-77) codes against a number of errors. ...
At the same time, the interest for joint source channel coding and decoding has considerably increased ( [6] , [7] ). ...
doi:10.5281/zenodo.41269
fatcat:5jn6bxain5db3ie46ci32sjv3y
Fifty Years of Shannon Theory
[chapter]
2009
Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication. ...
for universal source coding with various knowledge of the statistics of the source. ...
Universal Source Coding A. Kolmogorov [80] coined the term "universal" to refer to data-compression algorithms that do not know a priori the distribution of the source. ...
doi:10.1109/9780470544907.ch2
fatcat:h22tqdqxsjcblhwqvrphmwzvhu
Fifty years of Shannon theory
1998
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication. ...
for universal source coding with various knowledge of the statistics of the source. ...
Universal Source Coding A. Kolmogorov [80] coined the term "universal" to refer to data-compression algorithms that do not know a priori the distribution of the source. ...
doi:10.1109/18.720531
fatcat:gj4lp6rgtza5bd6becmv3kx2zu
Joint source-channel coding for motion-compensated DCT-based SNR scalable video
2002
IEEE Transactions on Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The algorithm utilizes universal rate distortion characteristics which are obtained experimentally and show the sensitivity of the source encoder and decoder to channel errors. ...
We present the results of this rate allocation algorithm for video transmission over a wireless channel using the H.263 Version 2 signal-to-noise ratio (SNR) scalable codec for source coding and rate-compatible ...
Fig. 6 . 6 Universal rate-distortion characteristics of the source; typical end-to-end distortion versus bit error rate response characterizing the source and channel for a set of source coding rates, ...
doi:10.1109/tip.2002.802507
pmid:18249725
fatcat:hqbpvtqte5d3vhwl2jkr77myzy
« Previous
Showing results 1 — 15 out of 1,411 results