In this paper, we examine a new initial symbol acquisition method for M-ary spread-spectrum (M-ary/SS) signals that are affected by large carrier frequency offset. By the effect of the carrier frequency offset, preamble signal energy is dispersed to the undersired outputs. The proposed method is based on the collection of such dispersed signal energies by using reference patterns. The reference patterns are constructed by using the characteristic of Hadamard code sequences. The effectiveness of the proposed method is evaluated in terms of mean acquisition time.

In this paper we discuss the binary spreading sequences whose spectral distributions are DC free and spectral distribution's shapes can be easily controlled by a certain parameter denoted by δ. The newly developed sequences, referred to as modified antisymmetric M-sequences, are modified-versions of the conventional antisymmetric (AS)M-sequences. The proposed sequences are designed to increase the varieties of spectral distribution's shapes and improve the correlation properties when compared to those of the FM coded M-sequences which have already proposed by Tsuzuki et al. Some typical line coded M-sequences, i.e. the (differential) Manchester coded M-sequences and the FM coded M-sequences, and the conventional AS M-sequences are included in the set of proposed sequences. The improvement of the average BER (bit error rate) performance for asynchronous DS/SSMA (direct sequence/spread spectrum multiple access) systems using the proposed sequences in comparison to the system using the conventional AO/LSE (auto-optimal phase with least sidelobe energy) M-sequences is also shown.

This paper describes relation between the number of library pairs and error probability to have all the pairs as fixed points for second-order bidirectional associative memory (BAM). To estimate accurate error probability, three methods have been compared; (a) Gaussian approximation, (b) characteristic function method, and (c) Hermite Gaussian approximation (proposed by this paper). Comparison shows that Gaussian approximation is valid for the larger numbers of neurons in both two layers than 1000. While Hermite Gaussian approximation is applicable for the larger number of neurons than 30 when Hermite polynomials up to 8th are considered. Capacity of second-order BAM at the fixed error probability is estimated as the function of the number of neurons.

The numerical property of the recursive least squares (RLS) algorithm has been extensively, studied. However, very few investigations are reported concerning the numerical behavior of the predictor-based least squares (PLS) algorithms which provide the same least squares solutions as the RLS algorithm. In Ref. [9], we gave a comparative study on the numerical performances of the RLS and the backward PLS (BPLS) algorithms. It was shown that the numerical property of the BPLS algorithm is much superior to that of the RLS algorithm under a finite-precision arithmetic because several main instability sources encountered in the RLS algorithm do not appear in the BPLS algorithm. This paper theoretically shows the stability of the BPLS algorithm by error propagation analysis. Since the time-variant nature of the BPLS algorithm, we prove the stability of the BPLS algorithm by using the method as shown in Ref. [6]. The expectation of the transition matrix in the BPLS algorithm is analyzed and its eigenvalues are shown to have values within the unit circle. Therefore we can say that the BPLS algorithm is numerically stable.

This paper deals with a probabilistic formulation of the diffraction and scattering of a plane wave from a periodic surface randomly deformed by a binary sequence. The scattered wave is shown to have a stochastic Floquet's form, that is a product of a periodic stationary random function and an exponential phase factor. Such a periodic stationary random function is then represented in terms of a harmonic series representation similar to Fourier series, where `Fourier coefficients' are mutually correlated stationary processes rather than constants. The mutually correlated stationary processes are written by binary orthogonal functionals with unknown binary kernels. When the surface deformations are small compared with wavelength, an approximate solution is obtained for low-order binary kernels, from which the scattering cross section, coherently diffracted power and the optical theorem are numerically calculated and are illustrated in figures.

In this Letter, we investigate the loss performance of a discrete-time single-server queueing system with periodic vacations, with which we are often confronted in traffic control, such as cell scheduling or priority control schemes, at ATM nodes. Explicit expressions are derived for the cell loss ratio in terms of the distribution of the buffer contents in an infinite capacity queue.

The purpose of this report is to predict far-field EMI spectrum emitted from a signal line on a digital PCB based on near-field EMI measurement. The relation between near magnetic field and far electric field is shown. A method of predicting far electric field from near magnetic field is proposed. Current flowing along a signal line is calculated from measured near magnetic field. Far electric field is estimated from the current. Measurement and prediction of EM emission are carried out using a simple PCB. The result of prediction and measurement of far-field EMI spectrum coincide within the error of 3 dB.

This paper describes a vision system with dual viewing angles, i. e., wide and narrow viewing angles, and a scheme of user-friendly speech dialogue environment based on the vision system. The wide viewing angle provides a wide viewing field for wide range motion tracking, and the narrow viewing angle is capable of following a target in wide viewing field to take the image of the target with sufficient resolution. For a fast and robust motion tracking, modified motion energy (MME) and existence energy (EE) are defined to detect the motion of the target and extract the motion region at the same time. Instead of using a physical device such as a foot switch commonly used in speech dialogue systems, the begin/end of an utterance is detected from the movement of user's mouth in our system. Without recognizing the movement of lips directly, the shape variation of the region between lips is tracked for more stable recognition of the span of a dialogue. The tracking speed is about 10 frames/sec when no recognition is performed and about 5 frames/sec when both tracking and recognition are performed without using any special hardware.

A rigorous radar cross section (RCS) analysis is carried out for two-dimensional rectangular and circular cavities with double-layer material loading by means of the Wiener-Hopf (WH) technique and the Riemann-Hilbert problem (RHP) technique, respectively. Both E and H polarizations are treated. The WH solution for the rectangular cavity and the RHP solution for the circular cavity involve numerical inversion of matrix equations. Since both methods take into account the edge condition explicitly, the convergence of the WH and RHP solutions is rapid and the final results are valid over a broad frequency range. Illustrative numerical examples on the monostatic and bistatic RCS are presented for various physical parameters and the far field scattering characteristics are discussed in detail. It is shown that the double-layer lossy meterial loading inside the cavities leads to the significant RCS reduction.

We consider the problem of estimating one- and two-dimensional direction of arrivals for arbitrary plane waves in an incoherent/coherent source environment. For the one-dimensional case, we use matrix pencil (MP) method developed by Y. Hua for signal-poles estimation. We then extend this method to estimate the two-dimensional direction of arrivals (2D-DOA), resulting in the "Extended Matrix Pencil" (EMP) method. This method can be applied successfully as much for an incoherent source environment as for a coherent source environment. To study the performance of these methods, in both cases results are compared with the "Total Least Squares-Estimation of Signal Parameters via Rotational Invariance Techniques" (TLS-ESPRIT) and the "Spatial Smoothing-TLS-ESPRIT" (SS-TLS-ESPRIT) methods. The results show that the MP method estimates the DOA more accurately and better than the TLS-ESPRIT and the SS-TLS-ESPRIT, even with few snapshots. Simulation results show that the EMP method, presented in this paper, estimates the 2-DOA better than the other two methods used for comparison.

We consider methods to locate sync words in packet or frame transmission over the additive white Gaussian noise channel. Our starting point is the maximization of the probability of correctly locating the sync word. We extend Massey's original result to the specific synchronization problem, where the sync words is prefixed to the data stream and each packet is preceded by idle transmission or additive white Gaussian noise. We give simulation results for several interesting sync words such as Barker sequences of length 7 and 13 and a sync word of length 17 with good cross-correlation properties. One of the conclusions is that the newly derived formula for the probability of correctly locating the sync word enables the reduction of the false sync detection probability.

This paper proposes a general expansion architecture for constructing large-scale multicast ATM switches with any type of small multicast switch, called the multicast Universal Multistage Interconnection Network (multicast UniMIN). The proposed architecture consists of a buffered distribution network that can perform cell routing and replication simultaneously, and a column of output switch modules (OSMs). The adoption of channel grouping and virtual first-in-first-out (FIFO) buffers results in high delay/throughput performance, and the distributed lookup table scheme for multicast addressing greatly reduces the size of a single lookup table. Analytical and simulation results show that high delay/throughput performance is obtained for both unicast and multicast traffic, and the proposed architecture yields an even better performance for multicast traffic than for unicast traffic. In addition, the multicast UniMIN switch has such good features as modular expandability, simple hardware, and no internal speed-up operation.

In this paper, we propose a two-dimensional (2-D) least-squares lattice (LSL) algorithm for the general case of the autoregressive (AR) model with an asymmetric half-plane (AHP) coefficient support. The resulting LSL algorithm gives both order and space recursions for the 2-D deterministic normal equations. The size and shape of the coefficient support region of the proposed lattice filter can be chosen arbitrarily. Furthermore, the ordering of the support signal can be assigned arbitrarily. Finally, computer simulation for modeling a texture image is demonstrated to confirm the proposed model gives rapid convergence.

We propose a method to search all the zeros of a complex function in a given compact region D Cn. The function f: Cn Cn to be considered is assumed to consist of polynomial and transcendental terms and to satisfy f (x) Rn for any x Rn. Using the properties of such a complex function, we can compute the number of zeros and determine the starting points of paths on the boundary of D, which attain all the zeros of f in D without encountering a singular point. A piecewiselinear approximation of the function on a triangulation is used for both computing the number of zeros and following the paths.

In recently year, the analysis of power management becomes more important. It is difficult to obtain the maximum power because this is NP-complete. For an n-input circuit, there are 22n different input patterns to be considered. There are two major methods for this problem. First method is to generate input patterns to obtain the maximal power by simulating these generated patterns. This method is called pattern based. The other one uses probability method to estimate the power density of each node of a circuit to calculate the maximal power. In this paper, we use a pattern based method to estimate the maximal power. This method is better than that of probability for the simulation of power activity. In practical applications, these generated patterns can be applied and observe the activity of a circuit. These simulated data can be used to examined the critical paths for performance optimization. A simulated annealing algorithm is proposed to search input patterns for maximum power. Firstly, it transforms this problem into an optimization problem to adapt the simulated annealing method. In this method, there are three strategies for generating the next input patterns, called neighborhood. In the first strategy, it generates the next input pattern by changing the status of all input nodes. In the second strategy, some input nodes are selected and changed randomly.

A method for recovering the LPC spectrum from a microphone array input signal corrupted by less directional ambient noise is proposed. This method is based on the subspace method, in which directional signal and non-directional noise is classified in the subspace domain using eigenvalue analysis of the spatial correlation matrix. In this paper, the coherent subspace (CSS) method, a broadband extension of the subspace method, is employed. The advantage of this method is that is requires a much smaller number of averages in the time domain for estimating subspace, suitable feature for frame processing such as speech recognition. To enhance the performance of noise reduction, elimination of noise-dominant subspace using projection is further proposed, which is effective when the SNR is low and classification of noise and signals using eigenvalue analysis is difficult.

Let {Xk}k=- be a stationary and ergodic information source, where each Xk takes values in a standard alphabet A with a distance function d: A A [0, ) defined on it. For each sample sequence X = (, x-1, x0, x1, ) and D > 0 let the approximate D-match recurrence time be defined by Rn (x, D) = min {m n: dn (Xn1, Xm+nm+1) D}, where Xji denotes the string xixi+1 xj and dn: An An [0, ) is a metric of An induced by d for each n. Let R (D) be the rate distortion function of the source {Xk}k=- relative to the fidelity criterion {dn}. Then it is shown that lim supn-1/n log Rn (X, D) R (D/2) a. s.

We investigate an importance sampling (IS) simulation of MMPP/D/1 queueing to obtain an estimate for the survivor function P(Q > q) of the queue length Q in the steady state. In Ref.[11], we studied the IS simulation of 2-state MMPP/D/1 queueing and obtained the optimal simulation distribution, but the mathematical fundation of the theory was not enough. In this paper, we construct a discrete time Markov chain model of the n-state MMPP/D/1 queueing and extend the results of Ref.[11] to the n-state MMPP/D/1. Based on the Markov chain model, we determine the optimal IS simulation distribution fo the n-state MMPP/D/1 queueing by applying the large deviations theory, especially, the sample path large deviations theory. Then, we carry out IS simulation with the obtained optimal simulation distribution. Finally, we compare the simulation results of the IS simulation with the ordinary Monte Carlo (MC) simulation. We show that, in a typical case, the ratio of the computation time of the IS simulation to that of the MC simulation is about 10-7, and the 95% confidence interval of the IS is slightly improved compared with the MC.

In this paper the conventional symbol-aided estimation methods are extended to use not only the known pilot symbols but also the previously estimated fading values to extract more information on fading channels. The proposed estimation method is evaluated using theoretical analyses. Recursive formulae are derived for calculating the mean square estimation errors, which are then used to calculate the BER performance of a BPSK system employing the proposed fading estimation method. The results show strong BER performance of the proposed system in the region of high signal to noise ratio under fast fading compared to that of the conventional system. Moreover, the proposed system still sustains its performance under mismatched conditions, where the conventional system degrades exhibiting error floors. Finally the theoretical results are verified by using computer simulations.

This paper analyzes mechanisms of radiated emissions from multilayer printed circuit boards (PCBs) and presents a model to describe the characteristics of such radiation. The radiation mechanism from a four-layer PCB, including the internal power and ground planes, is investigated using a time-domain magnetic field measurement near the PCB. Measurement of the waveform indicates that the main source of radiation is in the power distribution planes. To investigate the characteristics of the radiation from the power distribution, the S21s of the board are measured; the board impedance and the transmission characteristics of the power distribution planes are found to be directly related to the S21 between the two points in the board. The results indicate that the power distribution acts as a transmission line at frequencies higher than 100 MHz. A model that can explain well the radiation properties of these planes treats them as a parallel-plate transmission line interconnected by decoupling circuit comprising a decoupling capacitor and interconnect inductance. From the transmission line theory it is deduced that the line resonance gives rise to strong radiated emissions. The interconnect inductance is an important factor in determining the radiation characteristics.