Yuan-Pei Lin

Wavelet tree quantization for copyright protection watermarking

This paper proposes a wavelet-tree-based blind watermarking scheme for copyright protection. The wavelet coefficients of the host image are grouped into so-called super trees. The watermark is embedded by quantizing super trees. The trees are so quantized that they exhibit a large enough statistical difference, which will later be used for watermark extraction. Each watermark bit is embedded in perceptually important frequency bands, which renders the mark more resistant to frequency based attacks. Also, the watermark is spread throughout large spatial regions. This yields more robustness against time domain geometric attacks. Examples of various attacks will be given to demonstrate the robustness of the proposed technique.

BER minimized OFDM systems with channel independent precoders

We consider the minimization of uncoded bit error rate (BER) for the orthogonal frequency division multiplexing (OFDM) system with an orthogonal precoder. We analyze the BER performance of precoded OFDM systems with zero forcing and minimum mean squared error (MMSE) receivers. In the case of MMSE receivers, we show that for quadrature phase shift keying (QPSK), there exists a class of optimal precoders that are channel independent. Examples of this class include the discrete Fourier transform (DFT) matrix and the Hadamard matrix. When the precoder is the DFT matrix, the resulting optimal transceiver becomes the single carrier system with cyclic prefix (SC-CP) system. We also show that the worst solution corresponds to the conventional OFDM system; the conventional OFDM system has the largest BER. In the case of zero forcing receivers, the design of optimal transceiver depends on the signal-to-noise ratio (SNR). For higher SNR, solutions of optimal precoders are the same as those of MMSE receivers.

A Kaiser window approach for the design of prototype filters of cosine modulated filterbanks

The traditional designs for the prototype filters of cosine modulated filterbanks usually involve nonlinear optimizations. We propose limiting the search of the prototype filters to the class of filters obtained using Kaiser windows. The design process is reduced to the optimization of a single parameter. An example is given to show that very good designs can be obtained in spite of the limit of search.

Periodically nonuniform sampling of bandpass signals

It is known that a continuous time signal x(i) with Fourier transform X(/spl nu/) band-limited to |/spl nu/|</spl Theta//2 can be reconstructed from its samples x(T/sub 0/n) with T/sub 0/=2/spl pi///spl Theta/. In the case that X(/spl nu/) consists of two bands and is band-limited to /spl nu//sub 0/<|/spl nu/|</spl nu//sub 0/+/spl Theta//2, successful reconstruction of x(t) from x(T/sub 0/n) requires an additional condition on the band positions. When the two bands are not located properly, Kohlenberg showed that we can use two sets of uniform samples, x(2T/sub 0/n) and x(2T/sub 0/n+d/sub 1/), with average sampling period T/sub 0/, to recover x(t). Because two sets of uniform samples are employed, this sampling scheme is called Periodically Nonuniform Sampling of second order [PNS(2)]. In this paper, we show that PNS(2) can be generalized and applied to a wider class. Also, Periodically Nonuniform Sampling of Lth-order [PNS(L)] will be developed and used to recover a broader class of band-limited signal. Further generalizations will be made to the two-dimensional case and discrete time case.

Perfect discrete multitone modulation with optimal transceivers

Previously, discrete Fourier transform (DFT)-based discrete multitone modulation (DMT) systems have been widely applied to various applications. In this paper, we study a broader class of DMT systems using more general unitary matrices instead of DFT matrices. For this class, we show how to design optimal DMT systems over frequency-selective channels with colored noise. In addition, asymptotical performance of DFT-based and optimal DMT systems are studied and shown to be equivalent. However, for a moderate number of bands, the optimal DMT system offers significant gain over the DFT-based DMT system, as is demonstrated by examples.

Theory and design of two-dimensional filter banks: a review

There has been considerable interest in the design of multidimensional (MD) filter banks. MD filter banks find application in subband coding of images and video data. MD filter banks can be designed by cascading one-dimensional (1D) filter banks in the form of a tree structure. In this case, the individual analysis and synthesis filters are separable and the filter bank is called a separable filter bank. MD filter banks with nonseparable filters offer more flexibility and usually provide better performance. Nonetheless, their design is considerably more difficult than separable filter banks. The purpose of this paper is to provide an overview of developments in this field on the design techniques for MD filter banks, mostly two-dimensional (2D) filter banks. In some image coding applications, the 2D two-channel filter banks are of great importance, particularly the filter bank with diamond-shaped filters. We will present several design techniques for the 2D two-channel nonseparable filter banks. As the design of MD filters are not as tractable as that of 1D filters, we seek design techniques that do not involve direct optimization of MD filters. To facilitate this, transformations that turn a separable MD filter bank into a nonseparable one are developed. Also, transformations of 1D filter banks to MD filter banks are investigated. We will review some designs of MD filter banks using transformations. In the context of 1D filter bank design, the cosine modulated filter bank (CMFB) is well-known for its design and implementation efficiency. All the analysis filters are cosine modulated versions of a prototype filter. The design cost of the filter bank is equivalent to that of the prototype and the implementation complexity is comparable to that of the prototype plus a low-complexity matrix. The success with 1D CMFB motivate the generalization to the 2D case. We will construct the 2D CMFB by following a very close analogy of 1D case. It is well-known that the 1D lossless systems can be characterized by state space description. In 1D, the connection between the losslessness of a transfer matrix and the unitariness of the realization matrix is well-established. We will present the developments on the study of 2D lossless systems. As in 1D case, the 2D FIR lossless systems can be characterized in terms of state space realizations. We will review this, and then address the factorizability of 2D FIR lossless systems by using the properties of state space realizations.

Minimum redundancy for ISI free FIR filterbank transceivers

There has been great interest in the design of filterbank transceivers. Usually, with proper time domain equalization, the channel is modeled as an FIR filter. It is known that for FIR channels, the introduction of certain redundancy allows the receiver to cancel intersymbol interference (ISI) completely, and channel equalization is performed implicitly using FIR transceivers. This scheme allows us to trade bandwidth for ISI cancellation. In this paper, we derive the minimum redundancy required for the existence of FIR transceivers for a given channel. We see that the minimum redundancy is directly related to the zeros of the channel and to the Smith form of an appropriately defined channel matrix.

Optimal ISI-free DMT transceivers for distorted channels with colored noise

The design of optimal DMT transceivers for distorted channel with colored noise has been of great interest. Of particular interest is the class of block based DMT, where the transmitter and the receiver consist of constant matrices. Two types of block- based DMT transceivers are considered: the DMT system with zero padding (ZP-DMT) and the DMT system with general prefix (GP-DMT). We derive the bit allocation formula. For a given channel and channel noise spectrum, we design the ISI-free optimal transceiver that minimizes the transmission power for a given transmission rate and probability of error. For both ZP-DMT and GP-DMT systems, the optimal ISI-free transceiver can be given in closed from. We will see that for both classes, the optimal transceiver has an orthogonal transmitter. Simulation shows that the optimal DMT system can achieve the same transmission rate and the same probability of error with a much lower transmission power compared with other existing DMT systems.

MAI-Free MC-CDMA Systems Based on Hadamard&#8211;Walsh Codes

It is known that multicarrier code-division multiple-access (MC-CDMA) systems suffer from multiaccess interference (MAI) when the channel is frequency-selective fading. In this paper, we propose a Hadamard-Walsh code-based MC-CDMA system that achieves zero MAI over a frequency-selective fading channel. In particular, we will use appropriately chosen subsets of Hadamard-Walsh code as codewords. For a multipath channel of length L, we partition a Hadamard-Walsh code of size N into G subsets, where G is a power of two with GgesL. We will show that the N/G codewords in any of the G subsets yields an MAI-free system. That is, the number of MAI-free users for each codeword subset is N/G. Furthermore, the system has the additional advantage that it is robust to carrier frequency offset (CFO) in a multipath environment. It is also shown that the MAI-free property allows us to estimate the channel of each user separately and the system can perform channel estimation much more easily. Owing to the MAI-free property, every user can enjoy a channel diversity gain of order L to improve the bit error performance. Finally, we discuss a code priority scheme for a heavily loaded system. Simulation results are given to demonstrate the advantages of the proposed code and code priority schemes

Window designs for DFT-based multicarrier systems

We consider window designs for discrete Fourier transform (DFT) based multicarrier transceivers without using extra cyclic prefix. As in previous works of window designs for DFT-based transceivers, a postprocessing matrix that is generally channel dependent, is needed to have a zero-forcing receiver. We show that postprocessing is channel independent if and only if the window itself has the cyclic-prefixed property. We design optimal windows with minimum spectral leakage subject to the cyclic-prefixed condition. Moreover, we analyze how postprocessing affects the signal-to-noise ratio (SNR) at the receiver, which is an aspect that is not considered in most of the earlier works. The resulting SNR can be given in a closed form. Join optimization of spectral leakage and SNR are also considered. Furthermore, examples demonstrate that we can have a significant reduction in spectral leakage at the cost of a small SNR loss. In addition to cyclic-prefixed systems, window designs for zero-padded DFT-based transceivers are considered. For the zero-padded transceivers, windows that minimize spectral leakage can also be designed.