Adaptive reconstruction technique for the lost information of the rectangular image area

The adaptive reconstruction for the lost information of the rectangular image area is very important for the robust transmission and restoration of the image. In this paper, a new reconstruction method based on the Discrete Cosine Transform (DCT) domain has been put forward. According to the low pass character of the human visual system and the energy distribution of the DCT coefficients on the rectangular boundary, the DCT coefficients of the rectangular image area are adaptively selected and recovered. After the Inverse Discrete Cosine Transform (IDCT), the lost information of the rectangular image area can be reconstructed. The experiments have demonstrated that the subjective and objective qualities of the reconstructed images are enhanced greatly than before.     

Realization of quick-look imaging for spaceborne SAR based on parallel processing

Large range cell migration is a severe challenge to imaging algorithm for spaceborne SAR. Based on design of Finite Impulse Response (FIR) filter and Range Doppler (RD) algorithm,a realization of quicklook imaging for large range cell migration is proposed. It realized quick-look imaging of 8 times reduced resolution with parallel processing on memory shared 8 CPU SGI server. According to simulation experiment, this quick-look imaging algorithm with parallel processing can image 16384x16384 SAR raw data within 6 seconds. It reaches the requirement of real-time imaging.     

Scalable perceptual audio representation with an adaptive three time-scale sinusoidal signal model

This work is concerned with the development and optimization of a signal model for scalable perceptual audio coding at low bit rates. A complementary two-part signal model consisting of Sines plus Noise (SN) is described. The paper presents essentially a fundamental enhancement to the sinusoidal modeling component. The enhancement involves an audio signal scheme based on carrying out overlap-add sinusoidal modeling at three successive time scales, large, medium, and small. The sinusoidal modeling is done in an analysis-by-synthesis overlapadd manner across the three scales by using a psychoacoustically weighted matching pursuits. The sinusoidal modeling residual at the first scale is passed to the smaller scales to allow for the modeling of various signal features at appropriate resolutions. This approach greatly helps to correct the pre-echo inherent in the sinusoidal model. This improves the perceptual audio quality upon our previous work of sinusoidal modeling while using the same number of sinusoids. The most obvious application for the SN model is in scalable, high fidelity audio coding and signal modification.     

Improved Locally Conformal Finite-Difference Time-Domain method for edge inclined slots in a finite wall thickness waveguide

An Improved Locally Conformal Finite-Difference Time-Domain (ILC-FDTD) method is presented in this paper, which is used to analyze the edge inclined slots penetrating adjacent broadwalls of a finite wall thickness waveguide. ILC-FDTD not only removes the instability of the original locally conformal FDTD algorithm, but also improves the computational accuracy by locally modifying magnetic field update equations and the virtual iterative electric fields according to the complexity of the slot fringe fields. The mutual coupling between two edge inclined slots can also be analyzed by ILC-FDTD effectively.     

Adaptive histogram-based filter for image restoration

A novel filter for image restoration is proposed in this paper. The filter estimates histogram of original image via input image. It gets a membership function through the histogram, and the membership function contains a lot of information of original image. Then a weighted fuzzy mean filter is established based on this membership function; meanwhile, the filter adaptively adopts different filter scale according to the character divergence of image region and intensity of impulsive noise. Experimental result shows that new filter gives superior performance to conventional filters and currently used fuzzy filter.     

Two fast algorithms for computing point scalar multiplications on elliptic curves

The key operation in Elliptic Curve Cryptosystems(ECC) is point scalar multiplication. Making use of Frobenius endomorphism, Mfiller and Smart proposed two efficient algorithms for point scalar multiplications over even or odd finite fields respectively. This paper reduces thec orresponding multiplier by modulo τ^k-1 … τ 1 and improves the above algorithms. Implementation of our Algorithm 1 in Maple for a given elliptic curve shows that it is at least as twice fast as binary method. By setting up a precomputation table, Algorithm 2, an improved version of Algorithm 1, is proposed. Since the time for the precomputation table can be considered free, Algorithm 2 is about (3/2) log2 q - 1 times faster than binary method for an elliptic curve over Fq.     

Fault detection for multiple-valued logic circuits with fanout-free

The single fault and multiple fault detections for multiple-valued logic circuits are studied in this paper. Firstly, it is shown that the cardinality of optimal single fault test set for fanout-free m-valued circuits with n primary inputs is not more than n + 1, for linear tree circuits is two, and for multiplication modulo circuits is two if n is an odd number or if n is an even number and m > 3, where the optimal test set of a circuit has minimal number of test vectors. Secondly, it is indicated that the cardinality of optimal multiple fault test set for linear tree circuits with n primary inputs is 1 + [n/(m - 1)], for multiplication modulo circuits is n + 1, for fanout-free circuits that consist of 2-input linear tree circuits and 2-input multiplication modulo circuits is not greater than n+ 1, where [x] denotes the smallest integer greater than or equal to x. Finally, the single fault location approaches of linear tree circuits and multiplication modulo circuits are presented, and all faults in th     

Complement block coding scheme for reducing peak-to-average power ratio of OFDM systems

A new scheme termed as Complement Block Coding (CBC) technique is proposed to reduce the Peak-to-Average Power Ratio (PAPR) of OFDM signals. Utilizing the complement bits which are added to the original information bits, this method can effectively reduce the PAPR of OFDM systems with random frame size N and the coding rate R≤(N - κ)/N, where k is a positive integer and k≤N/2. The performance results obtained with CBC are given and compared with that of some well known schemes, such as Simple Block Coding (SBC), Modified Simple Block Coding (MSBC) and Simple Odd Parity Code (SOPC) for the same purpose. The results show that, at the same coding rate 3/4, the CBC can achieve almost the same performance as SBC, MSBC, but with lower complexity, and that the same performance can be obtained with higher coding rate by using CBC. At the same coding rate (N - 1)IN, the PAPR reduction ofCBC is almost the twice as that of SOPC when N≥16. Further more, the PAPR reductions with coding rate (N - 1)IN are almost the same as that with coding rate less than (N - 1)/N,so the proposed scheme CBC is more suitable for the large frame size with high coding rate and can provide error detection.     

Two types of new subliminal channels

Two types of new subliminal channels are constructed respectively based on provable secure public key cryptosystems and identity recognition in some network applications. Research shows that there are some new characteristics which are in favor of covert communication in our constructions. It is hard to make the subliminal channels free, and the channels have large capacity and high transmission efficiency. We also point out that the hardness to make the channels free is disadvantageous to the warden who tries to thwart the covert communication.     

Performance analysis of time-hopping m-ary UWB wireless system using V-BLAST algorithm

Ultra WideBand (UWB) transmissions are attractive for low power, baseband asynchronous multiple access and peer-to-peer wireless communications. Multiple Input Multiple Output (MIMO) technology is useful in combating against multipath and at the same time improves system performance by using multielement antennas at both transmitter and receiver. This letter proposes a time hopping M-ary UWB systems using V-BLAST algorithm, and power control is considered for better performance. Simulations are provided to compare performance with different antennas.