Noncoherent block detection in the presence of DC offset

In this paper, we deal with noncoherent detection of a digitally phasor block-modulated signal in the additive white Gaussian noise channel when a direct-current (DC) offset is present in the receiver baseband processing. By processing the received baseband signal block by block, a generalized linear transform is used to remove the offset prior to data detection, thereby releasing the succeeding detection process from the threat of DC offset. Operating on transform output blocks, a generalized maximum-likelihood scheme is developed for noncoherent data detection without a priori knowledge of channel amplitude and phase. When all the signaling blocks are confined within the space expanded by the basis vectors obtained from the onset-removal transform matrix, the proposed detection scheme can exploit the advantage of performing data detection and estimation on channel amplitude and phase jointly in the maximum-likelihood sense. It is analytically shown that the block detection scheme provides the bit error performance asymptotically approaching that of the corresponding ideal coherent phase-shift-keyed (PSK) detection in the absence of DC offset when the block length is increased. An iterative detection scheme is also modified from the block detection scheme to simplify the realization complexity. Both block and iterative detection schemes are shown to outperform the conventional training-sequence-aided PSK detection scheme under the same transmission throughput efficiency.     

Pseudobinary and Pseudoquaternary Detection Processes for Linearly Distorted Multilevel QAM Signals

The paper describes two new detection processes suitable for QAM signals that have 16 or more levels (possible data symbol values) and that have been subjected to linear distortion, causing severe intersymbol interference in the received signal. The detectors are developments of the pseudobinary systems previously described, and are designed to operate in the presence of severe intersymbol interference. Results of computer simulation tests are presented, comparing the tolerances to additive white Gaussian noise of various arrangements of each detector with those of more conventional detectors. The tests have been carried out on a model of a 19 200 bit/s synchronous serial data transmission system, operating with a 64-level QAM signal that is transmitted, in turn, over two different telephone circuits.     

Source fidelity over fading channels: performance of erasure and scalable codes

We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff between quantization accuracy and probability of outage. Namely, higher quantization accuracy requires a higher channel code rate, which increases the probability of outage. We first treat an outage as an erasure, and evaluate the received mean distortion with erasure coding across blocks as a function of the code length. We then evaluate the performance of scalable, or multi-resolution coding in which coded layers are superimposed within a coherence block, and the layers are sequentially decoded. Both the rate and power allocated to each layer are optimized. In addition to analyzing the performance with a finite number of layers, we evaluate the mean distortion at high signal-to-noise ratios as the number of layers becomes infinite. As the block length of the erasure code increases to infinity, the received distortion converges to a deterministic limit, which is less than the mean distortion with an infinite-layer scalable coding scheme. However, for the same standard deviation in received distortion, infinite layer scalable coding performs slightly better than erasure coding, and with much less decoding delay.     

Large-signal analysis of CMOS analogue functional elements using Fourier-series approximations

This paper discusses the large signal performance of CMOS analogue-functional elements. Fourier-series approximations are obtained for the transfer functions of the basic building blocks such as the linear CMOS transconductance element and the CMOS full-wave rectifier. Using these Fourier-series approximations, simple closed-form analytical expressions are obtained for the amplitudes of the harmonics at the output of a basic building block excited by a sinusoidal input signal. The analysis shows that, while the performance of the basic building blocks is near ideal at relatively small input amplitudes, performance degradation increases as the input amplitudes increase. On the other hand, since these expressions ignore the distortion mechanisms resulting from body effect and channel-length modulation, they cannot reliably predict the performance at small input signal levels. It appears, therefore, that body-effect and channel-length modulation must be taken into consideration for small-signal analysis.     

A noise resistant synchronization scheme for HDTV images

A method that increases the error resistance of the HDTV system and offers graceful picture degradation in the presence of bit errors, is presented. Due to the nature of the presently proposed compression schemes for HDTV systems, an error in a data bit does not only affect the block the bit belongs to, but unfortunately the effects of this error may perpetuate to the following blocks. This is because a bit error may cause loss of synchronization between the data bits and the picture blocks they represent. Our method restricts the effects of a bit error to a picture block whose size is significantly smaller than those used by the HDTV systems. We achieve synchronization by transmitting a header-word for each such synchronization block. Each header-word contains the number of data bits representing the compressed block. This header-word is protected by two levels of FEC code. To decrease the number of extra bits needed by the header-words, two different synchronization block sizes are used, a relatively small block size for the reference frames and a larger size for the inter-frames. The resulting method improves the quality of the picture in the presence of errors and defers the SNR at which the HDTV picture suddenly deteriorates by 2.5 to 3 dB. It also allows operation at higher order modulation transmission schemes, e.g., 32-QAM instead of 16-QAM, without the requirement of increased signal power     

Maximally smooth image recovery in transform coding

The authors consider the reconstruction of images from partial coefficients in block transform coders and its application to packet loss recovery in image transmission over asynchronous transfer mode (ATM) networks. The proposed algorithm uses the smoothness property of common image signals and produces a maximally smooth image among all those with the same coefficients and boundary conditions. It recovers each damaged block by minimizing the intersample variation within the block and across the block boundary. The optimal solution is achievable through two linear transformations, where the transform matrices depend on the loss pattern and can be calculated in advance. The reconstruction of contiguously damaged blocks is accomplished iteratively using the previous solution as the boundary conditions in each new step. This technique is applicable to any unitary block-transform and is effective for recovering the DC and low-frequency coefficients. When applied to still image coders using the discrete cosine transform (DCT), high quality images are reconstructed in the absence of many DC and low-frequency coefficients over spatially adjacent blocks. When the damaged blocks are isolated by block interleaving, satisfactory results have been obtained even when all the coefficients are missing     

可见光通信极性索引正交频分复用技术研究

为了抑制可见光通信(VLC)正交频分复用(OFDM)系 统发光二极管(LED)非线性限幅失真,提出了一种极性 索引OFDM(PIM-OFDM)调制方式。PIM-OFDM通过两个模块分别传输直流偏置 光OFDM(DCO-OFDM)双极性信号的极性信息和幅度信息。在第1模块中,对双极性信号的正 负极性编码并使用 OOK信号传输。在第2模块中,对双极性信号取绝对值得到幅度信息。在相同条件下,PIM- OFDM系统 性能比非对称限幅OFDM(ACO-OFDM)系统提升了接近 3dB。在光功率约束 条件下,在最 大有效(SNR)原则下得到了直流偏置和输入信号的最优功率分配。 仿真结果表明:光功率约束较小时,有 效SNR随着直流偏置增大而变小;光功率约束较大时,有效SNR随着直流 偏置增大会先增大后减小。 实验结果表明:在相同传输速率的情况下,PIM-OFDM误码率(BE R)性能要比ACO-OFDM提升1个数量级。     

Average- and Median-Based Smoothing Techniques for Improving Digital Speech Quality in the Presence of Transmission Errors

In digital speech communication, transmission errors generally introduce impulsive distortions in the received speech waveform. Smoothing of this waveform results at once in a squelching of the distortion component, and in an undesirable smearing of the speech. However, our experience with practical differential PCM (DPCM) codes (with adaptive quantizers and first-order predictors) has shown that if the error probability is fairly significant (for example, 0.025), the noise attenuation is perceptually desirable in spite of the attendant speech-muffling. Our observations are based on computer simulations and informal listening tests. The smoothing can be performed either on the received DPCM word (prediction error signal) or the reconstructed speech amplitude. (The two signals are identical in nondifferential PCM.) Smoothing algorithms can be either linear (based, for example, on running averages) or nonlinear (based, for example, on running medians). Studies with 3-bit quantizers indicate that with independently occurring transmission errors, smoothing of the prediction error signal is perceptually desirable, although the benefits decrease as a function of the predictor coefficient a, with the maximum advantage showing up fora = 0(PCM). Running averages and running medians seem to work equally well, and suggested block lengths for their computations are three or five samples. Results with clustered transmission errors show a higher advantage due to smoothing and a preference of linear methods and longer block lengths.     

Transform domain inter-block interleaving schemes for robust image and video transmission in ATM networks

Data interleaving schemes have proven to be an important mechanism in reducing the impact of correlated network errors on image/video transmission. Current interleaving schemes fall into two main categories: (a) schemes that interleave pixel intensity values and (b) schemes that interleave JPEG/MPEG transform blocks. The schemes in the first category suffer in terms of lower compression ratio since highly correlated information in the spatial domain is de-correlated prior to compression. The schemes in the second category interleave DCT transformed blocks. In this case, in the absence of ARQ, if a packet is lost, an entire block may be lost thus yielding poor image quality and making the error concealment task difficult. Interleaving transform coefficients is tricky and error concealment in the presence of lost coefficients is challenging. In this paper, we develop three different interleaving schemes, namely Triangular, Quadrant, and Coefficient, that interleave frequency domain transform coefficients. The transform coefficients within each block are divided into small groups and groups are interleaved with the groups from other blocks in the image, hence they are referred to as inter-block interleaving schemes. The proposed schemes differ in terms of group size. In the Triangular interleaving scheme AC coefficients in each block are divided into two triangles and interleaving is performed among triangles from different blocks. In the Quadrant interleaving scheme, coefficients in each block are divided into four quadrants and quadrants are interleaved. In the Coefficient interleaving scheme, each coefficient in a block is a group and it is interleaved with the coefficients in other blocks. The compression ratio 3 of the proposed interleaving schemes is impressive ranging from 90 to 98% of the JPEG standard compression while providing much higher robustness in the presence of correlated losses. We also propose two new variable end-of-block (VEOB) techniques, one based on the number of AC coefficients per block (VAC-EOB) and the other based on the number of bits per block (VB–EOB). Our proposed interleaving techniques combined with VEOB schemes yield significantly better compression ratios compared to JPEG (2–11%) and MPEG-2 (3–6.7%) standards while at the same time improve the resilience of the coded data in the presence of transmission errors.     

一种基于方差的匹配方法

文章就分形图象压缩中搜索与匹配过程的相似性提出了一个经过不同对比度实现快速分形编码算法，基于序列块和主块之间当前最小象差的方差信息，该算法排除不必搜索的主块，这样大大减少了每个序列块进行搜索和匹配的主块数与相应的编码时间，该算法在减少的时间内生成了与常规满搜索近乎一致的分形编码。     

基于块调制的MIMO-OFDM系统

该文在MIMO-OFDM系统中提出基于块调制的OFDM算法,降低了循环前缀(CP)所占的系统开销。在每个发射天线,将P个OFDM符号联合调制组帧后共用一个CP,到达接收天线后,接收帧经过分解可得到P个接收数据块,各数据块无相互间干扰。其中第p个接收数据块等于各个发射天线的第p个OFDM符号通过MIMO信道后到达接收天线的和,该文算法与传统MIMO-OFDM系统本质上传输方式相同,因而传输性能也相同,而频带效率则明显提高。     

基于ADSP—TS201S的二维DMA数据传输

针对高速信号处理系统中数据总线传榆的瓶颈问题,采用二维DMA方式进行外设高速缓存到DSP内核的数据块实时传输。对二维DMA控制币口状态寄存器组进行编程控制,结合FPGA与DSP链路接口设计,将存储区的数据块作为一个数据阵列进行传输,使DSP在DMA中断中获得数据。试验结果证明,二维DMA传输方式可解决高速外数据块的连续传输和处理问题,保证整个系统并行信号处理流水线的顺序执行,是一种解决数据总线传输瓶颈问题的实用方法。目前该技术已成功应用于某水声测量系统中。     

Adaptive cosine transform image coding with constant blockdistortion

An adaptive block discrete-cosine transform (DCT) coding scheme is implemented with the same average distortion designated for each block. This constant distortion designation not only has perceptual advantages, but also allows the rate to vary, adjusting to the changing spectral characteristics among the blocks. The successful execution of this scheme requires a different spectral estimate for each block. To keep overhead and computation within limits, a novel technique is introduced by which a two-dimensional block spectrum is characterized by a one-dimensional autoregressive model. Simulations with images of natural scenes and medical radiology provide reconstructions with nearly uniform block distortion and very high visual and measurable quality at low rates     

一种有效的MIMO OFDM信道估计方法

传统的MIMO OFDM信道估计方法总是假设信道在由若干OFDM符号组成的每一帧的传输过程中保持不变,但这个假设在快变信道的条件下就不成立了.本文提出了一种适合快变信道的有效的估计方法.该方法通过在每个OFDM符号中设置若干训练子载波来跟踪快变的信道.首先讨论了在每个OFDM符号中所需的训练子载波的数目及其相应的位置,给出了在多发射天线多接收天线条件下的训练子载波的正交结构,然后在估计出训练子载波处的信道频率响应后.提出了一种不同于根据邻近训练子载波进行线性插值的以获得用于传输数据的子载波的信道频率响应的方法.仿真结果表明了我们所提出的方法的有效性.     

机会网络中高效的数据分发机制—CRLNC

针对如何提高机会网络中数据分发效率的问题,提出了一种数据分簇和随机线性网络编码结合的数据分发机制——CRLNC。其核心思想是先将数据分成几簇,然后在簇内分成相同数量的数据块,源节点发送一簇中的数据块,中间节点运用随机线性编码算法将其中的数据块编码转发出去,目标节点接收到其中的编码数据块后采用高斯—约旦消元法将数据渐进还原。在这种数据分发机制中,针对节点缓存空间的冗余问题提出一种基于簇号和线性相关性的节点缓存策略。理论分析和仿真结果证明,与传统的数据分发相比,该算法可以有效地提高网络吞吐量,减小端到端的时延。     

基于VHDL的线性分组码编译码器设计

数字信号在传输过程中受到干扰的影响,降低了其传输的可靠性,线性分组码作为一种常用的信道编码,在通信传输系统中应用广泛。在对线性分组码的编译码规则研究基础上,讨论了生成矩阵、监督矩阵与错误图样集之间的关系,在Max＋PlusⅡ开发环境中,用VHDL语言设计线性分组码编译码器,对其各项设计功能进行了仿真和验证。结果表明,该设计正确,其功能符合线性分组码编译码器的要求。     

A 64 kbit/s Videophone codec with forward analysis and control

A new combination of coding methods for a 64 kbit/s transmission system for typical videophone situations is investigated. The codec structure is based on a standard hybrid discrete cosine transform (DCT) codec with temporal prediction. The picture is divided blockwise into changed and unchanged areas. One motion vector with subpel accuracy is computed and transmitted for each block of the changed area. For the forward analysis, the prediction error is calculated in the whole picture. Only the blocks with the highest prediction errors are updated by a DCT with a perception adaptive quantization. The number of DCT update blocks depends on the remaining bits after the transmission of the overhead information. The codec is controlled by a forward analysis of the prediction error and is not based on a buffer control. The spatial resolution of the source signal is reduced in two steps to prevent a codec overload caused by too much activity between two frames.     

双重功能图像水印算法

提出一种能同时实现内容认证和版权保护双重功能的图像水印算法.首先,对原始图像进行分块奇异值分解(SVD),计算所有子块最大奇异值的均值,通过比较各子块的最大奇异值与所有子块最大奇异值的均值间的数值关系产生鲁棒零水印序列.然后,对原始图像进行分块离散余弦变换(DCT).调整图像子块DCT高频系数的数值大小,建立同一子块两...     

Structure and texture filling-in of missing image blocks in wireless transmission and compression applications

An approach for filling-in blocks of missing data in wireless image transmission is presented. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8 /spl times/ 8 pixels. When such images are transmitted over fading channels, the effects of noise can destroy entire blocks of the image. Instead of using common retransmission query protocols, we aim to reconstruct the lost data using correlation between the lost block and its neighbors. If the lost block contained structure, it is reconstructed using an image inpainting algorithm, while texture synthesis is used for the textured blocks. The switch between the two schemes is done in a fully automatic fashion based on the surrounding available blocks. The performance of this method is tested for various images and combinations of lost blocks. The viability of this method for image compression, in association with lossy JPEG, is also discussed.     

Low-rank detection of multichannel Gaussian signals using blockmatrix approximation

The exact design of an m-channel matched filter with L taps requires the solution of an mL×mL block system of linear equations with Toeplitz entries. Practical cases where m>50 and L>100 are not uncommon. When the individual sensors of an array are closely spaced, the temporal and spatial correlation of the resulting vector noise process may be modeled in a separable fashion. In this case, the noise covariance block matrix attains a special structure where all block entries are just weighted versions of each other. It is shown that in this case, the complexity of the detector design can be reduced drastically by a factor of mL compared to a conventional multichannel matched filter design procedure. It is further shown that the separable vector noise model facilitates a complete exploitation of the rank properties of noise and data matrices. A constructive procedure for the design of “low-rank” detectors in the multichannel case is derived. These detectors consist of two consecutive blocks: a data and noise dependent “compression” stage, which maps the significant signal energy into a subspace of minimal dimension, followed by a minimal set of independent matched filters, which point in the subspace directions in which the signal is much stronger than the noise. This low-rank detector concept enables discrimination with little or no performance penalty at a minimal computational cost