EDBT 2026 Demo / reviewers in the wild / expert
Tingting Zhu 0007
dblp:29/7666-7
· DBLP profile ↗
2ranked-venue papers in the field
2as first author
2since 2021 · last 2022
0009-0005-9887-683XORCID · conflict
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 2 (2 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Lossy Compression of Gaussian Source Using Low Density Generator Matrix CodesabstractWe present a tandem scheme for Gaussian source compression, where a dead-zone quantizer is concatenated with a ternary low density generator matrix (LDGM) code. Both theoretical analysis and simulation results show that the LDGM codes can be universally optimal for near-lossless compression of ternary sources. Consequently, the distortion with the tandem scheme is mainly caused by the quantization, which can be negligible for high-rate quantizer. The most distinguished feature of the proposed scheme is its flexibility. The dead-zone quantizer can choose a suitable quantization level according to the distortion allowed, while the LDGM codes can adapt the code rate to approach the entropy of the quantized sequence. This is helpful to trade off between bandwith and distortion. In the meanwhile, the proposed scheme is robust when combined with the channel codes for transmission over noisy channels because of the fixed-length feature. Tingting Zhu 0007, Jifan Liang, Xiao Ma 0001 |
DCC | 1 |
| 2021 | Near-Lossless Compression for Sparse Source Using Convolutional Low Density Generator Matrix CodesabstractIn this paper, we present a new coding approach to near-lossless compression for binary sparse sources by using a special class of low density generator matrix (LDGM) codes. On the theoretical side, we proved that such a class of block LDGM codes are universal in the sense that any source with an entropy less than the coding rate can be compressed and reconstructed with an arbitrarily low bit-error rate (BER). On the practical side, we employ spatially coupled LDGM codes to reduce the complexity of reconstruction by implementing an iterative sliding window decoding algorithm. Figure of merits of the proposed scheme include its flexibility and universality. The encoder does not require the knowledge of the source statistic, while the decoder can estimate easily the source parameter as required by the iterative decoding. The implementation complexity is analyzed and the performance is simulated. Numerical results show that the proposed scheme performs well over a wide range of sources. Tingting Zhu 0007, Xiao Ma 0001 |
DCC | 1 |