Universal trellis coded quantization

A new form of trellis coded quantization based on uniform quantization thresholds and "on-the-fly" quantizer training is presented. The universal trellis coded quantization (UTCQ) technique requires neither stored codebooks nor a computationally intense codebook design algorithm. Its performance is comparable with that of fully optimized entropy-constrained trellis coded quantization (ECTCQ) for most encoding rates. The codebook and trellis geometry of UTCQ are symmetric with respect to the trellis superset. This allows sources with a symmetric probability density to be encoded with a single variable-rate code. Rate allocation and quantizer modeling procedures are given for UTCQ which allow access to continuous quantization rates. An image coding application based on adaptive wavelet coefficient subblock classification, arithmetic coding, and UTCQ is presented. The excellent performance of this coder demonstrates the efficacy of UTCQ. We also present a simple scheme to improve the perceptual performance of UTCQ for certain imagery at low bit rates. This scheme has the added advantage of being applied during image decoding, without the need to reencode the original image.     

Trellis coded vector quantization

A vector generalization of trellis coded quantization (TCQ), called trellis coded vector quantization (TCVQ), and experimental results showing its performance for an i.i.d. Gaussian source are presented. For a given rate, TCVQ yields a lower distortion that TCQ at the cost of an increase in implementation complexity. In addition, TCVQ allows fractional rates, which TCQ does not     

On entropy-constrained trellis coded quantization

An entropy-constrained trellis coded quantization (TCQ) scheme is presented for encoding memoryless sources. A simple 8-state trellis is used to encode the memoryless Gaussian source with mean-squared-error (MSE) performance within about 0.5 dB of the rate-distortion function. This performance is achieved at all non-negative encoding rates     

Performance analysis of time-hopping spread-spectrum multiple-access systems: uncoded and coded schemes

An ultra-wide bandwidth time-hopping spread-spectrum code division multiple-access system employing a binary PPM signaling has been introduced by Scholtz (1993), and its performance was obtained based on a Gaussian distribution assumption for the multiple-access interference. In this paper, we begin first by proposing to use a practical low-rate error correcting code in the system without any further required bandwidth expansion. We then present a more precise performance analysis of the system for both coded and uncoded schemes. Our analysis shows that the Gaussian assumption is not accurate for predicting bit error rates at high data transmission rates for the uncoded scheme. Furthermore, it indicates that the proposed coded scheme outperforms the uncoded scheme significantly, or more importantly, at a given bit error rate, the coding scheme increases the number of users by a factor which is logarithmic in the number of pulses used in time-hopping spread-spectrum systems.     

二维网格编码矢量量化及其在静止图像量化中的应用

该文提出了在二维码书空间中，在矢量量化（VQ）的基础上，应用网格编码量化（TCQ）的思想来实现量化的新方法－－二维网格编码矢量量化（2D－TCVQ）。该方法首先把小码书扩展成大的虚码书，然后用网格编码矢量量化（TCVQ）的方法在扩大的二维码书空间中用维物比算法来寻找最佳量化路径。码书扩大造成第一子集最小失真减小从提高了量化性能。由于二维TCVQ采用的码书尺寸较小，因而可以应用到低存贮、低功耗的编解码环境。仿真结果表明，同一码书尺寸下，二维TCVQ比TCVQ好0．5dB左右。同时，该方法具有计算量适中，解码简单以及对误差扩散不敏感的优点。     

Joint trellis coded quantization/modulation

A joint source/channel coding system constructed using trellis coded quantization (TCQ) and trellis coded modulation (TCM) is described. Identical trellises are used in the TCQ and TCM systems, and a straightforward mapping of TCQ codewords to TCM symbols is presented which guarantees that Euclidean squared distance in the channel is commensurate with quantization mean-square error (MSE). Hence, likely TCM error events of small Euclidean distance cause only a small increase in overall source coding MSE     

Trellis coded quantization of memoryless and Gauss-Markov sources

Trellis-coded quantization (TCQ) is developed and applied to the encoding of memoryless and Gauss-Markov sources. The theoretical justification for the approach is alphabet-constrained rate distortion theory, which is a dual to the channel capacity argument that motivates trellis-coded modulation (TCM). The authors adopt the notions of signal set expansion, set partitioning, and branch labeling of TCM, but modify the techniques to account for the source distribution, to design TCQ coders of low complexity with excellent mean-squared-error (MSE) performance. For a memoryless uniform source, TCQ provides an MSE within 0.21 dB of the distortion-rate bound at all positive (integral) rates. The performance is superior to that promised by the coefficient of quantization for all of the best lattices known in dimensions 24 or less. For a memoryless Gaussian source, the TCQ performance at rates of 0.5, 1, and 2 b/sample is superior to all previous results the authors found in the literature. The encoding complexity of TCQ is very modest. TCQ is incorporated into a predictive coding structure for the encoding of Gauss-Markov sources. Simulation results for first-, second-, and third-order Gauss-Markov sources are presented     

Maximum likelihood decoding of uncoded and coded PSK signalsequences transmitted over Rayleigh flat-fading channels

The problem of maximum likelihood (ML) detection for uncoded and coded M-PSK signals on Rayleigh fading channels is investigated. It is shown that, if the received signal is sampled at baud-rate, a ML receiver employing per-survivor processing can be implemented. The error rate performance of this receiver is evaluated by means of computer simulations and its limitations are discussed. In addition, it is shown that, on a fast fading channel, the error floor in the BER curve can be appreciably lowered if more than one received signal sample per symbol interval is processed by the receiver algorithm, Finally, a sub-optimum two-stage receiver structure for interleaved coded PSK systems is proposed. Its error rate performance is assessed for simple trellis-coded modulation schemes and compared to that provided by other receiver structures     

Joint data detection and channel estimation for coded and uncoded continuous phase modulation signals

The performance of decision‐directed approach for joint data detection and channel estimation for continuous phase modulation (CPM) signal is limited because of an inevitable decision delay, which results in a trade‐off between data detection and channel estimation. In this paper, a novel hard output demodulation that solves the conflict requirement on the decision delay by predicting the channel coefficients over a given observation interval through a Kalman filter is proposed for uncoded CPM signal. The prediction guarantees high channel tracking capability and meanwhile maintains the accuracy of data detection. The proposed hard output demodulator is further extended to design a soft‐input soft‐output demodulator for serially concatenated CPM signal, which allows iterative processing. The convergence behavior of the proposed iterative receiver is presented. Simulation results show that the proposed demodulators provide improved performance in terms of bit error rate over some existing algorithms. Copyright © 2014 John Wiley & Sons, Ltd.     

Embedded trellis coded quantization for JPEG2000

A modified embedded trellis coded quantization (TCQ) for JPEG2000 is presented in this paper. The method for approximately inverting TCQ in the absence of the least significant bits is improved. Experimental results, presented using the optimal rate control algorithm and different embedded TCQ formulations, show that modified embedded TCQ yields significant performance improvement compared to the original one in JPEG2000.     

Progressive image coding using trellis coded quantization

In this work, we present coding techniques that enable progressive transmission when trellis coded quantization (TCQ) is applied to wavelet coefficients. A method for approximately inverting TCQ in the absence of least significant bits is developed. Results are presented using different rate allocation strategies and different entropy coders. The proposed wavelet-TCQ coder yields excellent coding efficiency while supporting progressive modes analogous to those available in JPEG.     

Multisampling receivers for uncoded and coded PSK signal sequencestransmitted over Rayleigh frequency-flat fading channels

An algorithm, based on previous work [Vitetta and Taylor 1994, 1995], for the detection of coded and uncoded PSK sequences transmitted on a frequency-flat fading channel is investigated. It is based on the Viterbi algorithm and processes more than one signal sample per signaling interval. Its performance is evaluated by means of computer simulations for both uncoded and coded systems     

Hyperspectral image compression using entropy-constrainedpredictive trellis coded quantization

A training-sequence-based entropy-constrained predictive trellis coded quantization (ECPTCQ) scheme is presented for encoding autoregressive sources. For encoding a first-order Gauss-Markov source, the mean squared error (MSE) performance of an eight-state ECPTCQ system exceeds that of entropy-constrained differential pulse code modulation (ECDPCM) by up to 1.0 dB. In addition, a hyperspectral image compression system is developed, which utilizes ECPTCQ. A hyperspectral image sequence compressed at 0.125 b/pixel/band retains an average peak signal-to-noise ratio (PSNR) of greater than 43 dB over the spectral bands.     

Performance analysis of multicarrier frequency-hopping (MC-FH) code-division multiple-access systems: uncoded and coded schemes

In this paper, we provide multiuser performance analysis of a multicarrier frequency-hopping (MC-FH) code-division multiple-access system as first introduced in the work of Lance and Kaleh. We propose to use a practical low-rate convolutional error-correcting code in this system, which does not require any additional bandwidth than what is needed by the frequency-hopping spread-spectrum modulation. We provide multiuser exact performance analysis of the system for both uncoded and coded schemes in additive white Gaussian noise and fading channels for a single-user correlator receiver. We also derive the performance analysis of the system based on a Gaussian distribution assumption for multiuser interference at the receiver output. Our numerical results first indicate that the coded scheme significantly increases the number of users supported by the system at a fixed bit error rate, in comparison with the uncoded MC-FH scheme. Moreover, it shows that the Gaussian analysis in some cases does not accurately predict the number of users supported by the system.     

自适应网格编码量化在图像压缩中的应用

提出了一种对网格编码量化(TCQ)算法进行改进的方法-自适应网格编码量化算法(ADTCQ),并将其应用于JPEG2000图像压缩.自适应网格编码量化算法(ADTCQ)采用了多级TCQ的结构,并且通过利用已处理的数据对网格结构做出自适应调整.实验结果显示,应用于图像压缩时自适应网格编码量化(ADTCQ)算法的性能要明显优于标准TCQ算法.     

编码协作通信的码字选择

用户编码协作通信能提供很好的空间分集增益,克服信号在在无线网络中传输遭受的衰落.基于正交频分复用OFDM系统实现编码协作通信.在协作通信过程中,由于伙伴在用户间信道侦听到的信息受到噪声和衰落特性的干扰,所以用于协作通信的码字需经过合理选择、设计以提供最优的性能.基于重新编码和打孔卷积编码两种信道编码方法分析了用于编码协作通信的码字设计方法,并给出了编码协作通信的误帧率FEP仿真性能.     

多功能电子密码锁的VHDL设计

利用EDA技术,在可编程逻辑器件CPLD上实现了一种多功能电子密码锁。为弥补传统密码锁的不足,进一步提高可靠性,该系统中所有数据的存储、运算都完全由硬件实现。利用VHDL语言对电路进行行为描述,QuartusⅡ软件中的EDA工具进行仿真及下载。整个设计过程采用自顶向下方案,设计效率高,开发成本低。采用了MAXⅡ系列的CPLD作为硬件核心,其功耗低,逻辑执行速度远高于单片机,在安防行业中有较强的市场竞争力。     

Nonlinear optimization algorithm using monotonically increasing quantization resolution

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.     

Conditional entropy-constrained vector quantization: high-ratetheory and design algorithms

The performance of optimum vector quantizers subject to a conditional entropy constraint is studied. This new class of vector quantizers was originally suggested by Chou and Lookabaugh (1990). A locally optimal design of this kind of vector quantizer can be accomplished through a generalization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization of the ECVQ algorithm to a conditional entropy-constrained is called CECVQ, i.e., conditional ECVQ. Furthermore, we have extended the high-rate quantization theory to this new class of quantizers to obtain a new high-rate performance bound. The new performance bound is compared and shown to be consistent with bounds derived through conditional rate-distortion theory. A new algorithm for designing entropy-constrained vector quantizers was introduced by Garrido, Pearlman, and Finamore (see IEEE Trans. Circuits Syst. Video Technol., vol.5, no.2, p.83-95, 1995), and is named entropy-constrained pairwise nearest neighbor (ECPNN). The algorithm is basically an entropy-constrained version of the pairwise nearest neighbor (ECPNN) clustering algorithm of Equitz (1989). By a natural extension of the ECPNN algorithm we develop another algorithm, called CECPNN, that designs conditional entropy-constrained vector quantizers. Through simulation results on synthetic sources, we show that CECPNN and CECVQ have very close distortion-rate performance