In this paper, two distinct optical network design approaches, namely mesh and multi-ring, for survivable WDM networks are investigated. The main objective is to compare these two design approaches in terms of network costs so that their merits in practical environments can be identified. In the mesh network design, a new mathematical model based on integer liner programming (ILP) and a heuristic algorithm are presented for achieving a minimal cost network design. In the multi-ring network design, a heuristic algorithm that can be applied to large network problems is proposed. The influence of wavelength conversion and the number of wavelengths multiplexed in a fiber on system designs are also discussed. Based on the simulation results, the redundancy quantities required for full protection in multi-ring approach are significantly larger in comparison to the minimal cost mesh counterpart.

An AC coupling configuration for the active guard band filters is introduced for suppressing substrate coupling noise in analog and digital mixed-signal integrated circuits. With this method, a substrate-coupling-noise cancellation signal can be supplied to a ground-level substrate by using a single 3-V supply on-chip circuits. Noise was suppressed to a maximum of less than 0.05 from 100 Hz to 2 MHz in a 0.35-µm CMOS test chip. Both experiments and a simulation based on the substrate extraction model showed the similar dependence of the noise-suppression effect on the arrangement of the guard-bands and analog circuits. The simulation is thus effective for optimizing the arrangement to suppress noise effects when designing a chip.

In this paper, we consider the design for testability of a multiplier based on the modified Booth Algorithm. First, we present a basic array implementation of the multiplier. Next, we introduce testability considerations to derive two C-testable designs. The first of the designs is C-testable under the single stuck-at fault model (SAF) with 10 test patterns. And, the second is C-testable under the cell fault model (CFM) with 33 test patterns.

This paper presents an efficient graph-based evolutionary optimization technique called Evolutionary Graph Generation (EGG), and its application to the design of fast constant-coefficient multipliers using parallel counter-tree architecture. An important feature of EGG is its capability to handle the general graph structures directly in evolution process instead of encoding the graph structures into indirect representations, such as bit strings and trees. This paper also addresses the major problem of EGG regarding the significant computation time required for verifying the function of generated circuits. To solve this problem, a new functional verification technique for arithmetic circuits is proposed. It is demonstrated that the EGG system can create efficient multiplier structures which are comparable or superior to the known conventional designs.

Most of current codesign tools or methodologies only support validation in the form of cosimulation and testing of design alternatives. The results of hardware-software codesign of a distributed system are often not verified, because they are not easily verifiable. In this paper, we propose a new formal coverification approach based on linear hybrid automata, and an algorithm for automatically converting codesign results to the linear hybrid automata framework. Our coverification approach allows automatic verification of real-time constraints such as hard deadlines. Another advantage is that the proposed approach is suitable for verifying distributed systems with arbitrary communication patterns and system architecture. The feasibility of our approach is demonstrated through several application examples. The proposed approach has also been successfully used in verifying deadline violations when there are inter-task communications between tasks with different period lengths.

An optimization of the smoothing preprocessing for the correlated signal parameter estimation was considered. Although the smoothing factor (the number of subarrays) is a free parameter in the smoothing preprocessing, a useful strategy to determine it has not yet been established. In this paper, we investigated thoroughly about the smoothing factor and also proposed a new scheme to optimize it. The proposed method, using the smoothed equivalent diversity profile (SED profile), is able to evaluate the effect of smoothing preprocessing without any a priori information. Therefore, this method is applicable in the real multipath parameter estimation.

The application of subsurface radar using electromagnetic waves in the VHF band is wide and includes surveying voids under the ground and archaeological prospecting. To achieve a wider application range, the survey depth must be deeper. In this paper, a method of pulse compression using a chirp signal as one of the methods to fulfill this requirement is described, and its advantages and problems are discussed. First, a delay correlation method is proposed as a processing method of pulse compression. It converts RF band chirp signal directly into a pulse. Moreover, the method improves the S/N ratio by over 40 dB compared with conventional pulse radar. Therefore, it has the same detection ability as conventional pulse radar even though it uses less transmitting power. Next, the influences of RF amplifier saturation and underground propagation characteristics on the chirp signal are discussed; both are shown to have little influence on the detection ability of the method.

In this work, distributed dynamic channel assignment strategies with violation to the reuse pattern using vehicular mobility information for highway microcellular environments are proposed. It is shown that, when vehicular mobility information is included in the acquisition channel policy, the outage probability degradation because of the use of channels with one violation to the reuse pattern is negligible. Also, it is shown that, using different moving direction strategies it is possible to control the tradeoff between capacity and quality of service. The local packing algorithm (LP), was modified to allow the use of two different moving direction strategies with violation to the reuse pattern, resulting the VDLP1 and VDLP2 algorithms. The characteristics of user mobility are considered and a free-flowing vehicular traffic is assumed. Simulation results show that the use of vehicular mobility information in the distributed dynamic channel algorithms with violation to the reuse pattern, produce a considerable increase in the system capacity at the expense of an insignificant degradation of the quality of service. For a grade of service (GOS) of 0.1, the VDLP1 and VDLP2 carry 4% and 1.5% more traffic than the maximum packing algorithm, respectively. For the same GOS, the VDLP1 and VDLP2 carry 68% and 64% more traffic than the fixed channel assignment algorithm, respectively.

The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement exhaustive strategy is more suitable for systems with less non-uniformly distributed traffic; and (iii) the combined frequency and requirement exhaustive strategy with node-color re-ordering is the most efficient algorithm. The frequency spans obtained using the proposed algorithms are much lower than that reported in the literature, and in many cases are equal to the theoretical lower bounds.

This paper proposes a fast implementation technique for RLS adaptive filters. The technique has an adjustable parameter to trade the throughput and the rate of convergence of the filter according to the applications. The conventional methods for improving the throughput do not have this kind of adjustability so that the proposed technique will expand the area of applications for the RLS algorithm. We show that the improvement of the throughput can be easily achieved by rearranging the formula of the RLS algorithm and that there are no need for faster PEs for the improvement.

An approach for analysis of the small signal response of the carriers in semiconductors is presented. The integro-differential equation, describing the phenomenon in the time domain is transformed into a Fredholm integral equation of the second kind. The response of the carrier system to a small signal of a general time dependence can be calculated by the knowledge of the response to an impulse signal, defined by a delta function in time. For an impulse signal, the obtained integral equation resembles the basic structure of the integral form of the time dependent (evolution) Boltzmann equation. Due to this similarity a physical model of the impulse response process is developed. The model explains the response to an impulse signal in terms of a relaxation process of two carrier ensembles, governed by a Boltzmann equation. A Monte-Carlo method is developed which consists of algorithms for modeling the initial distribution of the two ensembles. The numerical Monte-Carlo theory for evaluation of integrals is applied. The subsequent relaxation process can be simulated by the standard algorithms for solving the Boltzmann equation. The presented simulation results for Si and GaAs electrons serve as a test of the Monte-Carlo method and demonstrate that the physical model can be used for explanation of the small signal response process.

This paper describes the formula for dynamic power dissipation of a track/hold circuit as a function of the input frequency, the input amplitude, the sampling frequency, the track/hold duty cycle, the power supply voltage and the hold capacitance for a sinusoidal input.

In this paper, a new set of difference equations is derived for transient analysis of the convergence of adaptive FIR filters using the Sign-Sign Algorithm with Gaussian reference input and additive Gaussian noise. The analysis is based on the assumption that the tap weights are jointly Gaussian distributed. Residual mean squared error after convergence and simpler approximate difference equations are further developed. Results of experiment exhibit good agreement between theoretically calculated convergence and that of simulation for a wide range of parameter values of adaptive filters.

To improve the resolution capability of the directions-of-arrival (DOA) estimation, some subspace-based methods have recently been developed by exploiting the specific signal properties (e.g. non-Gaussian property and cyclostationarity) of communication signals. However, these methods perform poorly as the ordinary subspace-based methods in multipath propagation situations, which are often encountered in mobile communication systems because of various reflections. In this paper, we investigate the direction estimation of coherent signals by jointly utilizing the merits of higher-order statistics and cyclostationarity to enhance the performance of DOA estimation and to effectively reject interference and noise. For estimating the DOA of narrow-band coherent signals impinging on a uniform linear array, a new higher-order cyclostationarity based approach is proposed by incorporating a subarray scheme into a linear prediction technique. This method can improve the resolution capability and alleviate the difficulty of choosing the optimal lag parameter. It is shown numerically that the proposed method is superior to the conventional ones.

This paper presents a new technique for the synthesis of orthogonal-base-set sequences suitable for applications requiring sets of uncorrelated pseudo-white-noise sources. The synthesized sequences (vectors) are orthogonal to each other, and each sequence also has a flat power spectrum and low peak factor. In order to construct the orthogonal-base-set sequences, the new application of ta-sequence (trigonometric function aliasing sequence) introduced in this paper uses Latin-squares and Walsh-Hadamard sequences. The ta-sequence itself is a very new concept, and the method presented here provides the means for generating various orthogonal-base-set sequences at sizes required for such applications as system measurement (needing uncorrelated test signals), pseudo noise synthesis for spread spectrum communication, and audio signal processing (needing synthesis of stereo or multichannel signals from mono sources).

A simple but efficient method to improve readability of discrete pseudo time-frequency representations (TFRs) of nonstationary signals by the reassignment of the representations in discrete frequency dimension is presented. The method does not rely on the nonzero time derivative of the window function employed in the estimation of pseudo TFR. This property of the reassignment method is advantageous because the method can provide an improved readability in the situation when a known reassignment method is unefficient. The reassignment of the TFRs of corrupted signals is discussed. Numerical examples are included to illustrate the performance of the proposed method.

This paper describes an efficient simulation approach of a DSP controlled series-parallel resonant high frequency DC-DC power converter system. Proposed power conversion circuit simulation approach is based on a circuit equation, modeled by substituting time-varying switched resistor circuit in place of all the controllable and uncontrollable power semiconductor switching blocks of power converter circuits. An algebraic algorithm transforms the matrices of the circuit equation into the matrices of the state vector equation. Solution of state equation is by 3rd order Runge Kutta numerical integration method. Simulation results are illustrated and discussed together with experimental results.

This paper theoretically analyzed the performance of the RAKE combining (in the time domain), maximal ratio combining (in the spatial domain), and two-dimensional RAKE combining (in the spatial and time domains) techniques for multipath fading environments, where multipath waves are distributed in the spatial and time domains. The analysis was based on a diversity combining technique that employed the eigenvalues of the covariance matrix between branch signals. It was found that the performance of the fading mitigation was normalized by the beamwidth of an array antenna, for various parameters such as the number of antenna elements, angular spread, and angle of arrival.

A simple phase compensation technique with improved power supply rejection ratio (PSRR) for CMOS opamps is proposed. This technique is based on feeding back a current proportional to a derivative of the voltage difference between an output and an input, and does not require a common-gate circuit or a noise-free bias for the circuit. The proposed technique requires only two additional transistors, which are connected to the differential pair of transistors in a cascade manner, and the compensation capacitor is connected to the source node of the additional transistor. Experimental results show an improvement of more than 20 dB in the PSRR at high frequencies, comparing the technique with a Miller compensation. This technique also improves the unity gain frequency and the phase margin from 0.9 MHz and 17 to 1.8 MHz and 44 for 200 pF load capacitance, respectively.

We present three-wave mixing devices useful for signal processing functions in WDM and TDM systems, including wavelength conversion, spectral inversion, and gated mixing. These mixers exhibit extremely wide bandwidth, low noise, high efficiency, and format transparency.