Motion estimation is the key issue in video compressing. Several methods for motion estimation based on the center biased strategy and minimum mean square error trend searching have been proposed, such as TSS, FSS, UCBDS and MIBAS, but these methods yield poor estimates or find local minima. Many other methods predict the starting point for the estimation; such methods include PMEA, PSA and GPS: these can be fast but are inaccurate. This study addresses the causes of wrong estimates, local minima and incorrect predictions in the prior estimation methods. The Multiple Searching Trend (MST) is proposed to overcome the problems of ineffective searches and local minima, and the Adaptive Dilated Searching Field (ADSF) is described to prevent prediction from wrong location. Applying MST and ADSF to the listed estimating methods, such as UCBDS, a fast and accurate can be reached. For this this reason, the method is called CockTail Searching (CTS).

The Camera sensor network is a new advent of technology in which each sensor node can capture video signal, process and communicate with other nodes. We have investigated a dense node configuration. The requested processing task in this network is arbitrary view generation among nodes view. To avoid unnecessary communication between nodes in this network and to speed up the processing time, we propose a distributed processing architecture where the number of nodes sharing image data are optimized. Therefore, each sensor node processes part of the interpolation algorithm with local communication between sensor nodes. Two processing methods are used based on the image size shared. These two methods are F-DP (Fully image shared Distributed Processing) and P-DP (Partially image shared Distributed Processing). In this research, the network processing time has been theoretically analyzed for one user. The theoretical results are compatible with the experimental results. In addition, the performance of proposed DP methods were compared with Centralized Processing (CP). As a result, the best processing method for optimum number of nodes can be chosen based on (i) communication delay of the network, (ii) whether the network has one or more channels for communication among nodes and (iii) the processing ability of nodes.

This paper proposes an alternative learning algorithm for a stereophonic acoustic echo canceller without pre-processing which can identify the correct echo-paths. By dividing the filter coefficients into the former/latter parts and updating them alternatively, conditions both for unique solution and for perfect echo cancellation are satisfied. The learning for each part is switched from one part to the other when that part converges. Convergence analysis clarifies the condition for correct echo-path identification. For fast and stable convergence, a convergence detection and an adaptive step-size are introduced. The modification amount of the filter coefficients determines the convergence state and the step-size. Computer simulations show 10 dB smaller filter coefficient error than those of the conventional algorithms without pre-processing.

In uplink multicarrier code division multiple access (MC-CDMA), the inter-code interference (ICI) caused by the independent and frequency-selective fading channel of each user and the inter-carrier interference caused by the asynchronous reception of each user's OFDM symbols result in multiple access interference (MAI). This paper evaluates the ICI in frequency-selective Rayleigh fading channels for uplink MC-CDMA. We derive theoretical expressions for the desired-to-undesired signal power ratio (DUR) as a quantitative representation of ICI, and validate them by comparison with computer simulations using a Walsh-Hadamard (WH) code. Based on the analytical results, we obtain the optimum spreading sequence that minimizes the ICI (in short, maximizes the multiplexing performance); this sequence appears to be orthogonal. Three equalization combining methods are examined; equal gain combining (EGC), orthogonality restoring combining (ORC), and maximum ratio combining (MRC).

Call Admission Control (CAC) is a very important issue in CDMA systems to guarantee a required quality of service (QoS) and to increase system capacity. In this paper, we proposed and analyzed the CAC scheme using multiple criterions (MCAC), which can provide a quicker processing time and better performance. One is based on the number of active users with the minimum/maximum threshold by considering the spillover ratio, and the other is based on the signal to interference ratio (SIR). If active users are lower/higher than the minimum/maximum number of users threshold (N_min )/(N_max ), we accept/reject the new call without any other considerations based on the first criterion. And if the number of active users is between the N_min and N_max, we consider the current SIR to guarantee QoS based on the second criterion. Then the system accepts the new call when the SIR satisfies the system requirements, otherwise, the call is rejected. The multiple criterions scheme is investigated and its performance is compared with the number of user based CAC and power based CAC.

Arrival of the packet data is acknowledged by detecting the preambles of the received bursty packets. To increase system throughput and reduce transmission latency, a simple and robust signal detection algorithm is required. Furthermore, the threshold for signal detection must be set adaptively for different channel conditions. In this paper, we design and compare three signal detection algorithms for bursty packet systems.

A round-ended wide straight slot cut in the broad wall of a rectangular waveguide is analyzed by the Method of Moments (MoM) using numerical eigenmode basis functions derived by the edge-based finite element method (FEM), referred to as MoM/FEM. The frequency characteristics of the calculated transmission coefficients are compared with the measured ones, and good agreement is observed for a wide variety of antenna parameters. For simpler analysis that does not use MoM/FEM, an equivalent rectangular slot approximation for a round-ended slot is discussed. The resonant frequencies of empirically introduced "equal-area" and "equal-perimeter" slots are compared with those of round-ended slots for a wide variety of parameters such as slot width, wall thickness and dielectric constant inside the waveguide. Based upon MoM/FEM, which can be a reliable reference, it is found that the equal-area slot always gives a better approximation of the order of 1% over that of the equal-perimeter one which is of the order of 5%. For higher accuracy, a new rectangular slot approximation of a round-ended slot is proposed to be a linear combination of equal-area and equal perimeter approximation. The error is around 0.25% for a wide variety of parameters such as slot width-to-length ratio, wall thickness and dielectric constant of the filling material inside the waveguide.

In this paper, the design of a QoS scheduling scheme for the Internet traffic is proposed by considering the correlation property of the arriving traffic. The basic concept of the Weighted Fair Queuing (WFQ) is adopted in the proposed scheme, however, the correlation property of the traffic stream is applied as the heuristic to adjust the share weight factors of each traffic type dynamically. The Auto Regressive Integrated Moving Average (ARIMA) model is applied in this paper to characterize the correlation property of the Internet traffic. And the share weight factors are derived from the parameters of the AR part and MA part. Experimental simulations are performed to illustrate the effectiveness of the proposed scheme. In addition to comparing the performance of each service types, we also define a fair play parameter (FPP) to examine the fairness index among various traffic streams of the proposed scheme. The experimental results indicate that the proposed scheme demonstrates a quite good performance in scheduling the integrated services and the fairness among service classes can also be achieved, especially when the link capacity is limited.

Transmission performance of a multi-input multi-output (MIMO) antenna system (i.e., antenna diversity, adaptive antenna array, and space division multiplexing) highly depends on the arrival angle distribution of propagation paths. In this letter, a multipath fading simulator based on distributed scattering model is presented. The impacts of the arrival angle distribution of propagation paths on the bit error rates (BER) performance are measured using an implemented fading simulator and compared with the theoretically predicted performance.

This paper presents a multipath interference canceller (MPIC) configuration based on multipath interference (MPI) replica generation per transmit antenna (called PTA-MPIC). This configuration is associated with Space Time Transmit Diversity (STTD) for the common control physical channel (CCPCH), which takes advantage of tentative decision data after STTD decoding, and with closed-loop type phase control (PC) transmit diversity for the dedicated physical channel (DPCH) employing tentative decision data after diversity combining, in the W-CDMA forward link. This paper also proposes transmitter carrier phase verification, i.e., an antenna verification method used in PC transmit diversity, that utilizes the dedicated pilot symbols in a DPCH after the PTA-MPIC removes the MPI components. The one-stage PTA-MPIC removes the MPI from the common pilot channel (CPICH), the CCPCH, and the synchronization channel (SCH). The simulation results show that this canceller reduces the required average transmit Eb/N0 of the DPCH at the average BER of 10-3 by approximately 3.0 dB compared to that using a MF-based Rake receiver (the transmit power ratio of each common channel to DPCH is RCPICH/DPCH = 3 dB, RCCPCH/DPCH = 5 dB, and RSCH/DPCH = 3 dB, with TPC and without antenna diversity reception at the user equipment). Furthermore, it is shown that in the two-stage PTA-MPIC with MPI suppression for all channels associated with PC transmit diversity, the required average transmit Eb/N0 employing the proposed antenna verification is reduced by approximately 0.3 dB, 0.5 dB, and 1.2 dB compared to that using the conventional antenna verification when the transmission power ratio of the interfering DPCH to the desired DPCH is RInt/Des = 0 dB, 3 dB, and 6 dB for ten DPCHs. This is because the number of detection errors of the transmitted carrier phase in the second antenna due to feedback information bit decoding error is reduced.

We propose a class of multiple input multiple output (MIMO) systems using the transmit diversity pre-combining (TDPC) scheme, assuming perfect channel state information (CSI) at a transmitter. In such a class of systems, each transmitter antenna is weighted independently according to the channel condition so that the Euclidean distance between the closest symbols at a receiver could be maximized under a total transmit power constraint. We also introduce an effective space-time trellis code (STTC) for the proposed class of MIMO systems. From computer simulations, we see that incorporating both the TDPC scheme and the proposed STTC outperforms the MIMO system using only the TDPC scheme and the conventional STTC-MIMO system.

The advanced satellite broadcasting system in the 21 GHz band or higher frequency bands is expected to be suitable for use in high quality multimedia services in the future. To establish this system, rain attenuation mitigation is very important and the time diversity system has been proposed as an appropriate technology for this purpose. This paper shows principle of time diversity as an attenuation mitigation technology and also shows the effect of time diversity. We also propose a method for predicting time diversity gain as a function of the rain attenuation, cumulative time percentage, and time delay of two data contents or broadcasts.

This paper presents a new automatic-frequency control (AFC) configuration capable of removing wide range frequency offsets (up to about 0.625 fs, where fs is signal symbol rate). The new configuration consists of an AFC that removes frequency offsets between 0.125 fs and another AFC that detects the frequency offset range coarsely between 0.625 fs. This paper describes the principle of the new AFC configuration. The proposed AFC configuration employs four correlators to enhance the acquisition range. It also adopts the reverse modulation scheme to decrease the acquisition time. The performance of the new AFC configuration is confirmed via computer simulations. It is shown that the proposed configuration can accommodate wide range frequency offsets as well as reduce the acquisition time.

By modelling the quantization error as additive white noise in the transform domain, Wiener filter is used to reduce quantization noise for DCT coded images in DCT domain. Instead of deriving the spectrum of the transform coefficient, a DPCM loop is used to whiten the quantized DCT coefficients. The DPCM loop predicts the mean for each coefficient. By subtracting the mean, the quantized DCT coefficient is converted into the sum of prediction error and quantization noise. After the DPCM loop, the prediction error can be assumed uncorrelated to make the design of the subsequent Wiener filter easy. The Wiener filter is applied to remove the quantization noise to restore the prediction error. The original coefficient is reconstructed by adding the DPCM predicted mean with the restored prediction error. To increase the prediction accuracy, the decimated DCT coefficients in each subband are interpolated from the overlapped blocks.

The DAPDNA®-2 is the world's first general purpose dynamically reconfigurable processor for commercial usage. It is a dual-core processor consisting of a custom RISC core called the Digital Application Processor (DAP), and a two dimensional array of dynamically reconfigurable processing elements referred to as the Distributed Network Architecture (DNA). The DAP has a 32 bit instruction set architecture with an 8 KB instruction cache and 8 KB data cache that can be accessed in one clock cycle. It has an interrupt control function to detect data processing completion in the DNA-Matrix. The DNA-Matrix has different types of data processing elements such as ALU, delay, and memory elements to process fully parallel computations. The DNA-Matrix includes 32 independent 16 KB high speed SRAM elements (in total 512 KB). The DNA-Matrix, even with its parallel computational capability, can be synchronized and co-work at the same clock frequency as the DAP. The processor operates at a 166 MHz working frequency and fabricated with a 0.11 µm CMOS process. The DAPDNA-2 device can be connected directly with up to 16 units with linear scalability in processing performance, provided the bandwidth requirement is within the maximum communication speed between DNAs, which is 32 Gbps. The DAPDNA-2 performs at a level that is two orders of magnitude higher than conventional high performance processors.

This paper proposes a PCB plane model for generic circuit simulators (SPICE). The proposed model reflects two frequency-dependent losses, namely, skin and dielectric losses. Once power/ground plane pair is divided into arrays of unit-cells, each unit-cell is modeled using a transmission line and the loss model. The loss model is composed of a resistor for DC loss, series RL ladder circuit for skin loss and series RC ladder circuit for dielectric loss. To verify the validity of the proposed model, it is compared with SPICE ac analysis using frequency-dependent resistors. Also, we show that the estimation results using the proposed model have a good correlation with that of VNA measurement for the typical PCB stack-up structure of general desktop PCs. With the proposed model, not only ac analysis but also transient analysis can be easily done for circuits including various non-linear/linear devices since the model consists of passive elements only.

The effect of the structure with difference on cross-section for the enlarged models that simulates signal transmission line (STL) in the magnetic head of HDD is discussed. The experimental results suggested that strip and shield structure are effective for suppression of EMI.

This paper proposes the design and implementation of a real-time image compressor using 2-Dimensional Discrete Wavelet Transform (2DDWT), which targets an FPGA as its platform. The image compressor uses Daubechies' bi-orthogonal DWT filters (9, 7) and 16-bit fixed-point data formats for wavelet coefficients in the internal calculation. The target image is NTSC 640240 pixels per field whose color format is Y:Cb:Cr = 4:2:2. We developed for the 2DDWT a new structure with four Multipliers and Accumulators (MACs) for real-time operations. We designed and used a linear fixed scalar quantizer, which includes the exceptional treatment of the coefficients whose absolute values are larger than the quantization region. Only a Huffman entropy encoder was included due to the hardware overhead. The quantizer and Huffman encoder merged into a single functional module. Due to the insufficient memory space of an FPGA, we utilized external memory (SDRAM) as the working and memory storage space. The proposed image compressor maps into an APEX20KC EP20K600CB652-7 from Altera and uses 45% of the Logic Array Block (LAB) and 9% of the Embedded System Block (ESB). With a 33 MHz clock frequency, the proposed image compressor shows a speed of 67 fields per second (33 frames per second), which is more than real-time operation. The resulting image quality from reconstruction is approximately 28 dB in PSNR and its compression ratio is 29:1. Consequently, the proposed image compressor is expected to be used in a dedicated system requiring an image-processing unit.

A novel public watermarking algorithm based on chaotic properties is proposed. Thanks to good randomness and easy reproducibility of chaos, firstly the watermark is permuted by chaotic sequences, then a small number of reference points are selected randomly in the middle frequency bands of DCT domain, and the variable number disorder watermark bits are embedded into the neighborhood of each reference point according to chaotic sequences. The experimental results show the invisibility and robustness.

In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.