Optimal linear labelling for the minimization of both source and channel distortion

Belfiore, Jean-Claude; Giraud, Xavier; Rodriguez-Guisantes, J.

doi:10.1109/isit.2000.866702

Cited by 10 publications

(12 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will refer to the symmetric TAST code with transmit antennas, layers, symbols per channel use, and component DAST codes as . One can easily see that the rate of symmetric TAST codes using full-rate algebraic rotations [37], [38] is symbols per channel use (i.e.,…”

Section: B Threaded Algebraic Space-time (Tast) Codingmentioning

confidence: 99%

Universal space-time coding

Gamal

Damen

2003

IEEE Trans. Inform. Theory

403

319

View full text Add to dashboard Cite

A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic component codes optimized for single-input-single-output (SISO) channels. Each component code is assigned to a "thread" in the space-time matrix, allowing it thus full access to the channel spatial diversity in the absence of the other threads. Diophantine approximation theory is then used in order to make the different threads "transparent" to each other. Within this framework, a special class of signals which uses algebraic number-theoretic constellations as component codes is thoroughly investigated. The lattice structure of the proposed number-theoretic codes along with their minimal delay allow for polynomial complexity maximum-likelihood (ML) decoding using algorithms from lattice theory. Combining the design framework with the Cayley transform allows to construct full diversity differential and noncoherent space-time codes. The proposed framework subsumes many of the existing codes in the literature, extends naturally to time-selective and frequency-selective channels, and allows for more flexibility in the tradeoff between power efficiency, bandwidth efficiency, and receiver complexity. Simulation results that demonstrate the significant gains offered by the proposed codes are presented in certain representative scenarios.

show abstract

Section: B Threaded Algebraic Space-time (Tast) Codingmentioning

confidence: 99%

Universal space-time coding

Gamal

Damen

2003

IEEE Trans. Inform. Theory

403

319

View full text Add to dashboard Cite

show abstract

“…In [8], the channel distortion of a BSC is proved to be minimized by IA in the form of a linear labeling, while in [9], a linear labeling that minimizes simultaneously the source and channel distortions is constructed. In the case of a zero-mean Gaussian source, this linear labeling is constructed using a subset of lattice constellations with "maximum component diversity."…”

Section: Index Assignment For Gaussian Sourcesmentioning

confidence: 99%

“…Allowing to increase while remains fixed, we get a codebook with codewords , , where BPSK , and . In order to obtain a family of matrices such that is an asymptotically Gaussian source dictionary that minimizes as , must be orthogonal with coefficients going uniformly to 0 as [9]. In this case, the linear mapping BPSK , where matrix , allows the construction of a source dictionary that is asymptotically Gaussian.…”

Section: Index Assignment For Gaussian Sourcesmentioning

confidence: 99%

“…In [9], linear transforms constructed from lattice constellations with "maximum component diversity" were used to build structured VQ codebooks that minimized simultaneously the source and channel distortions for Gaussian sources. In this letter, we develop a JSCC scheme in the channel-constrained source-coding category for the coding of video, wherein the source distribution is not Gaussian.…”

Section: Introductionmentioning

confidence: 99%

“…In this letter, we develop a JSCC scheme in the channel-constrained source-coding category for the coding of video, wherein the source distribution is not Gaussian. Specifically, we describe a scalable video-coding system constructed from motion-compensated temporal filtering (MCTF) coupled with JSCC using the structured VQ of [9]. The VQ indexes are mapped to channel codewords either directly in an uncoded form or through coded IA based on Reed-Muller codes, with the encoder adaptively deciding between the coded and uncoded IA on a subband-by-subband basis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Joint source-channel coding with partially coded index assignment for robust scalable video

Feideropoulou¹,

Trocan²,

Fowler

et al. 2006

IEEE Signal Process. Lett.

Self Cite

View full text Add to dashboard Cite

A scalable video coder consisting of motion-compensated temporal filtering coupled with structured vector quantization plus a linear mapping of quantizer indexes that minimizes simultaneously source and channel distortions is presented. The linear index assignment takes the form of either a direct, uncoded mapping or a coded mapping via Reed-Muller codes. Experimental results compare the proposed system to a similar scheme using unstructured vector quantization as well as to a prominent scalable video coder protected by more traditional convolutional codes. The proposed system consistently outperforms the other two schemes by a significant margin for very noisy channel conditions. Index Terms-Joint source-channel coding (JSCC), scalable video coding.

show abstract

Joint source-channel coding of scalable video

Feideropoulou

Pesquet‐Popescu

Belfiore³

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

Optimal linear labelling for the minimization of both source and channel distortion

Cited by 10 publications

References 3 publications

Universal space-time coding

Universal space-time coding

Joint source-channel coding with partially coded index assignment for robust scalable video

Joint source-channel coding of scalable video

Contact Info

Product

Resources

About