Zobrazeno 1 - 10
of 155
pro vyhledávání: '"Ram Zamir"'
Autor:
Ram Zamir
Unifying information theory and digital communication through the language of lattice codes, this book provides a detailed overview for students, researchers and industry practitioners. It covers classical work by leading researchers in the field of
Publikováno v:
Østergaard, J, Erez, U & Zamir, R 2022, ' Incremental Refinements and Multiple Descriptions with Feedback ', I E E E Transactions on Information Theory, vol. 68, no. 10, pp. 6915-6940 . https://doi.org/10.1109/TIT.2022.3176396
It is well known that independent (separate) encoding of K correlated sources may incur some rate loss compared to joint encoding, even if the decoding is done jointly. This loss is particularly evident in the multiple descriptions problem, where the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25e07ddf3a501f18a7758fb55265b7bf
https://doi.org/10.1109/tit.2022.3176396
https://doi.org/10.1109/tit.2022.3176396
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
It is common to assess the "memory strength" of a stationary process looking at how fast the normalized log-determinant of its covariance submatrices (i.e., entropy rate) decreases. In this work, we propose an alternative characterization in terms of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::023d3dde722f1d0150f0873e1d2ae03d
https://doi.org/10.1109/isit50566.2022.9834592
https://doi.org/10.1109/isit50566.2022.9834592
Autor:
Ram Zamir, Sergey Tridenski
Publikováno v:
ISIT
For the model of communication through a discrete memoryless channel using i.i.d. random block codes, where the channel is changing slowly from block to block, we propose a stochastic algorithm for adaptation of the generating distribution of the cod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ade68d3a915267f9cbad8a8d17c6d71
https://doi.org/10.1109/tit.2019.2941930
https://doi.org/10.1109/tit.2019.2941930
Autor:
Royee Yosibash, Ram Zamir
Publikováno v:
ISTC
Distributed computation is a framework used to break down a complex computational task into smaller tasks and distributing them among computational nodes. Erasure correction codes have recently been introduced and have become a popular workaround to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad82d7b286d62372e731ef6bc9583e3a
https://doi.org/10.1109/istc49272.2021.9594259
https://doi.org/10.1109/istc49272.2021.9594259
Publikováno v:
IEEE Transactions on Information Theory. 65:7669-7681
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient vector quan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df16834981d055601c7fe849c3842bee
https://doi.org/10.1109/tit.2019.2933219
https://doi.org/10.1109/tit.2019.2933219
Publikováno v:
Erez, U, Østergaard, J & Zamir, R 2021, An Orthogonality Principle for Select-Maximum Estimation of Exponential Variables . in IEEE International Symposium on Information Theory (ISIT) . IEEE, pp. 3162-3166, 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Victoria, Australia, 12/07/2021 . https://doi.org/10.1109/ISIT45174.2021.9518218
ISIT
ISIT
It was recently proposed to encode the one-sided exponential source X via K parallel channels, Y1, ..., YK , such that the error signals X - Yi, i = 1,...,K, are one-sided exponential and mutually independent given X. Moreover, it was shown that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb9f7862ee8200f9d9f462d81a851dc
https://vbn.aau.dk/da/publications/21282ada-7e6c-4574-9df2-d44850f8aaa4
https://vbn.aau.dk/da/publications/21282ada-7e6c-4574-9df2-d44850f8aaa4
Publikováno v:
ISIT
This paper proposes an effective and asymptotically optimal framework for stochastic, adaptive codebook regeneration for sequential (“on the fly”) lossy coding of continuous alphabet sources. Earlier work has shown that the rate-distortion bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e31047aaa706d5697d58817d653f9e9d
https://doi.org/10.1109/isit45174.2021.9517877
https://doi.org/10.1109/isit45174.2021.9517877
Publikováno v:
IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. 30
Diversity “multiple description” (MD) source coding promises graceful degradation in the presence of a priori unknown number of erased packets in the channel. A simple coding scheme for the case of two packets consists of oversampling the source
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b9c79395d7d015bc2f8081291e4b63d
https://pubmed.ncbi.nlm.nih.gov/34125679
https://pubmed.ncbi.nlm.nih.gov/34125679
Over-complete systems of vectors, or in short, frames, play the role of analog codes in many areas of communication and signal processing. To name a few, spreading sequences for code-division multiple access (CDMA), over-complete representations for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a98c1632b715323e065e3ab9838fd1d1