A pyramid vector quantizer

Fischer, Thomas R.

doi:10.1109/tit.1986.1057198

Cited by 280 publications

(102 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The number of codewords in the PVQ codebook can be calculated by the following recurrence relation [8],…”

Section: A Review Of Pvqmentioning

confidence: 99%

“…We now demonstrate how to perform this search. This step is equivalent to Step 3 of the PVQ quantization algorithm provided in [8] intended for a mean-squared error criterion.…”

Section: B Low-complexity Search Algorithmmentioning

confidence: 99%

“…Like SLAQ codebooks, Reflected Simplex codebooks adhere to a geometric construction. The codebook construction is based on Pyramid Vector Quantization (PVQ) [8], but with important modifications tailoring the construction to the beamforming scenario. Specifically, the codebook vectors are (nearly) all of the vectors that consist of integers that lie within the original and reflected images about the axes of R 2NT of a 2N T − 1-dimensional simplex, where N T is the number of transmit antennas.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming

Ryan

Collings

Valin³

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric construction based on simplices and the An lattice. We propose a fast codebook search and indexing algorithm. We show that such codebooks perform superior or comparable to other codebooks, with much lower implementation complexity.

show abstract

“…The number of codewords in the PVQ codebook can be calculated by the following recurrence relation [8],…”

Section: A Review Of Pvqmentioning

confidence: 99%

“…We now demonstrate how to perform this search. This step is equivalent to Step 3 of the PVQ quantization algorithm provided in [8] intended for a mean-squared error criterion.…”

Section: B Low-complexity Search Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming

Ryan

Collings

Valin³

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…The assignment is accomplished in a similar manner as in [14] for the pyramid VQ for the Laplacian source. First, the number of codevectors in each annulus of the shape codebook is counted using the theta function.…”

Section: Index Assignmentmentioning

confidence: 99%

Gaussian source coding with spherical codes

Hamkins

Zeger

2002

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in 1 onto a sphere in , and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate function for rates above 1 bit per sample, and an improvement over existing techniques of similar complexity. An asymptotic analysis of the tradeoff between gain quantization and shape quantization is also given.

show abstract

“…Traditionally, encryption and control access techniques were employed to protect against unauthorized copying after the media have been successfully transmitted and decrypted. Recently, watermark techniques are utilized to maintain the copyright [1].…”

Section: Introductionmentioning

confidence: 99%

Embedding Binary Watermark Image using DWT Coefficients

Park¹,

Bae

2014

Journal of the Korea Academia-Industrial cooperation Society

View full text Add to dashboard Cite

Multimedia documents can be transferred quickly and easily across the Internet, and has attracted considerable interest in multimedia security and multimedia copyright protection. This paper proposes an animage watermarking scheme embedding a binary watermark image using Discrete Wavelet Transform (DWT) coefficients. The original image is transformed to the wavelet domain and decomposed in subbands. The binary watermark image, as a sequence of bits, is embedded into the middle frequency subbands. The original image is not needed to detect the watermark image. The proposed method detected fewer watermark bits but produced an approximately 10dB higher PSNR than the max/min method.

show abstract

A pyramid vector quantizer

Cited by 280 publications

References 27 publications

Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming

Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming

Gaussian source coding with spherical codes

Embedding Binary Watermark Image using DWT Coefficients

Contact Info

Product

Resources

About