A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.
Filters
Report on Dirty Paper Coding Estimation with multidimensional lattices [article]
2016 arXiv pre-print
Preserved Fulltext
In this report we include some derivations on a channel estimation method based on the use of Dirty Paper Coding. ... Specifically, we analyze the proposed method, named Dirty Paper-based Channel Estimation (DPCE), when the considered codebooks are high-dimensional lattices. ... Nearcapacity dirty-paper code designs based on TCQ and IRA codes. In International Symposium on Information Theory, pages 184-188, September 2005. [5] Ram Zamir and Meir Feder. ...
arXiv:1603.06848v1 fatcat:zb5b5y7zanc73pl4cij3wrunpa
Trellis coded modulation to improve dirty paper trellis watermarking
2007 Security, Steganography, and Watermarking of Multimedia Contents IX
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 2011; you can also visit the original URL. The file type is application/pdf.
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. ... In previous work, we designed a new class of codes, called dirty paper trellis codes (DPTC), which are by construction immune to valuemetric scaling. ... These are lattice codes, 7 syndrome codes 6 and dirty paper trellis codes (DPTC). 8 Up to now, lattice codes, also referred to as quantization index modulation (QIM), have received most attention due ...
doi:10.1117/12.704379 dblp:conf/sswmc/WangDC07 fatcat:em27wqwmpzhrpk2xk62oko43pm
Nested linear/lattice codes for structured multiterminal binning
2002 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.
These ideas connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications. ... However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. ... The Costa Problem: "Writing on Dirty Paper" The second setting we consider is a special case of channel coding with side information at the transmitter, known as "writing on dirty paper." ...
doi:10.1109/tit.2002.1003821 fatcat:foany7d6gjh2notqtnqd3vbf2q
Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design
2006 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.
Practical designs of one-and two-dimensional nested lattice quantizers together with multilevel low-density parity-check (LDPC) codes for Slepian-Wolf coding give performance close to the theoretical limits ... This paper examines the high-rate performance of nested lattice quantizers and gives the theoretical performance for general continuous sources. ... The binning scheme for Wyner-Ziv coding can be applied to other related problems (e.g., Gelfand-Pinsker coding [17] and its special case of dirty-paper coding [8] ) based on the duality between source ...
doi:10.1109/tit.2006.881833 fatcat:pz246ucbwbhufd47hipbscjuba
Scalable Informative Rule Mining
2017 2017 IEEE 33rd International Conference on Data Engineering (ICDE)
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 2020; you can also visit the original URL. The file type is application/pdf.
In this thesis we present SIRUM: a system for Scalable Informative RUle Mining from multidimensional data. ... We implemented SIRUM in Spark and observed significant performance improvements on real data due to our optimizations. iii I would also like to thank my committee members, Professor TamerÖzsu, Professor ... The bottom level of the cube lattice is the tuple itself, the next level up corresponds to the elements with exactly one Cube lattice for a multidimensional database relation with a single tuple (Fri, ...
doi:10.1109/icde.2017.101 dblp:conf/icde/FengGS17 fatcat:iotetdbca5fmpgewbosnabtzkm
Julian Ernst Besag, 26 March 1945 -- 6 August 2010, a biographical memoir [article]
2018 arXiv pre-print
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.
Other Versions
Julian Besag was an outstanding statistical scientist, distinguished for his pioneering work on the statistical theory and analysis of spatial processes, especially conditional lattice systems. ... into the efficacy of nearest neighbour models to accommodate spatial dependence in the analysis of data from agricultural field trials, image restoration from noisy data, and texture generation using lattice ... Quite early in his career, paper (6) explored the auto-correlation structure of stationary auto-normal schemes on an infinite square lattice. ...
arXiv:1711.10262v2 fatcat:elfnpkkn2rginfhrad7pwvgyjm
Improving the performance of RDM watermarking by means of trellis coded quantisation
2006 IEE Proceedings Information Security
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 vector quantiser is based on a properly modified version of classical trellis coded quantisation, thus leading to the new trellis-coded RDM scheme (TC-RDM). ... reasonably low while ensuring a minimal loss with respect to the optimal scheme. ... Such a procedure has been used in this paper to get the optimum polynomials configurations which will be reported in the Results section for different n values. ...
doi:10.1049/ip-ifs:20055152 fatcat:egdimzoeifcejmrzahczk4atre
Fast Parallel I/O on Cluster Computers [article]
2003 arXiv pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections. The file type is application/pdf.
In this paper, we demonstrate how the ParaStation3 communication system helps speed-up the performance of parallel I/O on clusters using the open source parallel virtual file system (PVFS) as testbed and ... Our benchmarks are giant, I/O-intensive eigenmode problems from lattice quantum chromodynamics, demonstrating stability and performance of PVFS over Parastation in large-scale production runs. ... [13] , where performance results on 60 nodes of the Chiba-City cluster at Argonne National Laboratory have been reported. This cluster is equipped with the same Myrinet version as ALiCE. ...
arXiv:cs/0303016v1 fatcat:odppcpjyc5bv5axmnqe2mocheu
Julian Ernst Besag. 26 March 1945—6 August 2010
2018 Biographical Memoirs of Fellows of the Royal Society
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.
was an outstanding statistical scientist, distinguished for his pioneering work on the statistical theory and analysis of spatial processes, especially conditional lattice systems. ... into the efficacy of nearest-neighbour models to accommodate spatial dependence in the analysis of data from agricultural field trials, image restoration from noisy data, and texture generation using lattice ... Quite early in his career, paper (6) explored the auto-correlation structure of stationary auto-normal schemes on an infinite square lattice. ...
doi:10.1098/rsbm.2017.0039 fatcat:qarcmkoznvcnbexuczpv7fatyi
Quantization
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.
Beginning with these three papers of fifty years ago, we trace the history of quantization from its origins through this decade, and we survey the fundamentals of the theory and many of the popular and ... The fundamental role of quantization in modulation and analog-to-digital conversion was first recognized during the early development of pulsecode modulation systems, especially in the 1948 paper of Oliver ... The problem can be seen as trying to compress a dirty source into a clean reproduction, or as doing estimation of the original source based on a quantized version of a noise-corrupted version. ...
doi:10.1109/18.720541 fatcat:55w3lmruijalxe4yht676re62e
Computational Physics on Graphics Processing Units [chapter]
2013 Lecture Notes in Computer Science
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 2020; you can also visit the original URL. The file type is application/pdf.
Other Versions
In this review, we discuss advances made in the field of computational physics, focusing on classical molecular dynamics, and on quantum simulations for electronic structure calculations using the density ... In a recent paper [80] , the authors solve the gauge fixing problem by using overrelaxation techniques and they report an increase in performance by using multiple threads per site, although in this case ... lattice site to the neighbouring one. ...
doi:10.1007/978-3-642-36803-5_1 fatcat:matvw5vr5nfnxfm5satskv6emq
PhantomNet: Exploring Optimal Multicellular Multiple Antenna Systems
2004 EURASIP Journal on Advances in Signal 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 2017; you can also visit the original URL. The file type is application/pdf.
SD and dirty paper (DP) are two schemes previously reported to achieve capacity in special cases. For PhantomNet, we show that DP coding at the BS is equal to or better than SD. ... Gerard has done extensive research on pointto-point systems as well as on networks. He has authored one hundred papers and holds seven patents. He has won the IEEE Eric E. ... Figure 2 : 2 Encoding of L substreams in a dirty paper scheme. ...
doi:10.1155/s1110865704312072 fatcat:ssx63ejyrbgdjjomriggvc4wju
2013 Index
2014 IEEE Transactions on Wireless Communications
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 2022; you can also visit the original URL. The file type is application/pdf.
This index covers all technical items -papers, correspondence, reviews, etc. ... The primary entry includes the coauthors' names, the title of the paper or other item, and its location, specified by the publication abbreviation, year, month, and inclusive pagination. ... Marques, Antonio G., +, TWC January 2013 333-345 Beamformer Designs for MISO Broadcast Channels with Zero-Forcing Dirty Paper Coding. ...
doi:10.1109/twc.2011.09.499-tw1401-index fatcat:w5ya5mg3sbcodb2crtuaoyk3su
Design of large polyphase filters in the Quadratic Residue Number System
2010 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers
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.
The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of ... version of the carbon-copying onto dirty paper. ...
doi:10.1109/acssc.2010.5757589 fatcat:ccxnu5owr5fyrcjcqukumerueq
An Efficient SF-ISF Approach for the Slepian-Wolf Source Coding Problem
2005 EURASIP Journal on Advances in Signal 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 2017; you can also visit the original URL. The file type is application/pdf.
Simulation using conventional and asymmetric turbo codes demonstrates a compression rate that is only 0.06 bit/symbol from the theoretical limit, which is among the best results reported so far. ... without the need to modify the code structure or the decoding strategy. ... Having its root in network information theory, distributed source coding is tightly related to a wealth of information and communication problems and applications including, for example, the dirty paper ...
doi:10.1155/asp.2005.961 fatcat:doq2jdjefncf3muus5qafmjx3e
« Previous Showing results 1 — 15 out of 142 results