This report describes an acceleration technique to synthesize time-domain macromodels of interconnects using FDTD method. In FDTD calculation, the characteristic impedance of the interconnect is inserted into every terminal in order to damp quickly the transient waveforms. Additionally, an efficient technique for analyzing the macromodels is proposed. We demonstrate the efficiency of this method with examples.

In this paper, we investigate the performance of the orthogonal frequency division multiplexing (OFDM) system based on a configuration of pilot symbol arrangement under a time-varying fading channel and verify it by simulation. A particular channel of concern is modeled by a wide-sense stationary uncorrelated scattering (WSSUS) Rayleigh fading process and furthermore, the inter-carrier interference (ICI) caused by the fading process is assumed to be Gaussian noise. The current analysis focuses on the performance limit of the pilot symbol-assisted channel estimation, in which a minimum mean squared error (MMSE) channel estimator is employed to exploit both time- and frequency-domain correlation simultaneously. In particular, the optimum pilot symbol arrangement was investigated for the time-varying fading channel, which has been rarely addressed with any analytical approach in previous research. Although the proposed channel estimation scheme is subject to the intensive processing complexity in the receiver, it has been shown that the better BER performance can be achieved as compared with that of the differential detection scheme and the error floor can be removed.

In recent years, more emphasis is placed on the performance of massive databases. It is often required not only that database systems provide high throughputs with rapid response times, but also that they are fully available 24-hours-per-day and 7-days-per-week. Requirements for throughput and response time can be satisfied by upgrading the hardware. As a result, databases in the old hardware environment have to be moved to the new one. Moving a database, however, generally requires taking the database off line for a long time, which is unacceptable for numerous applications. In this paper, a very practical and important subject is addressed: how to upgrade the hardware on line, i.e., how to move a database from an old hardware environment to a new one concurrently with users' reading and writing of the database. A technique for this purpose is proposed. We have implemented a prototype based on this technique. Our experiments with the prototype shown that compared with conventional off-line approach, the proposed technique could give a performance improvement by more than 85% in the query-bound environment and 40% in the update-bound environment.

We formalize a model of "demonstration of program result-correctness," and investigate how to prove this fact against possible adversaries, which naturally extends Blum's theory of program checking by adding zero-knowledge requirements. The zero-knowledge requirements are universal for yes and no instances alike.

The problem of synthesizing a minimum-cost logic network is formulated for a genetic algorithm (GA). When benchmarked against a commercial logic synthesis tool, an odd parity circuit required 24 basic cells (BCs) versus 28 BCs for the design produced by the commercial system. A magnitude comparator required 20 BCs versus 21 BCs for the commercial system's design. Poor temporal performance, however, is the main disadvantage of the GA-based approach. The design of a hardware-based cost function that would accelerate the GA by several thousand times is described.

A method for determination of the location, shape, and material properties of a 3D object from measurements of the scattered field, when the object is successively illuminated by a number of incident fields is presented. This work extends the method previously developed for reconstructions of 2D permittivity and conductivity from electromagnetic measurements to the more complicated full-vector 3D electromagnetic inversion. Furthermore, a frequency hopping strategy to improve the resolution of the unknown objects when the frequency is raised, is underlined. Results of numerical experiments are presented to illustrate both strengths and weaknesses of the method.

We propose an adaptive complex-amplitude texture classifier that takes into consideration height as well as reflection statistics of interferometric synthetic aperture radar (SAR) images. The classifier utilizes the phase information to segment the images. The system consists of a two-stage preprocessor and a complex-valued SOFM. The preprocessor extracts a complex-valued feature vectors corresponding to height and reflectance statistics of blocks in the image. The following SOFM generates a set of templates (references) adaptively and classifies a block into one of the classes represented by the templates. Experiment demonstrates that the system segments an interferometric SAR image successfully into a lake, a mountain, and so on. The performance is better than that of a conventional system dealing only with the amplitude information.

Nonlinear characteristics of a DBR (Distributed Bragg Reflector) Cherenkov laser are investigated with the aid of particle simulation, allowing for the nonlinear properties of the electron beam. Numerical results show that the EM power extracted from the cavity is considerably suppressed by the nonlinear effect of the electron beam. Additionally, the extracted EM power is found to be critically dependent on the reflection coefficient of the DBR at the output end. Thus the DBRs at both ends of the cavity should be carefully designed in order to extract the EM power from the cavity efficiently.

Several types of coplanar waveguide (CPW) resonator are analyzed by use of the field decay method based on the FDTD algorithm in this paper. Quality (Q) factors of a CPW resonator, including radiation Q, conductor Q, dielectric Q and unloaded Q, are investigated thoroughly. A new procedure to calculate conductor Q is proposed. Some CPW resonators are fabricated and measured in order to validate the analysis method. It is shown that radiation from a CPW resonator can be reduced by means of the stepped impedance technique. It is also seen that miniaturization of CPW resonators can be realized if the stepped impedance structure is adopted.

Binary Decision Diagrams (BDDs) are graph representation of Boolean functions. In particular, Ordered BDDs (OBDDs) are useful in many situations, because they provide canonical representation and they are manipulated efficiently. BDD packages which automatically generate OBDDs have been developed, and they are now widely used in logic design area, including formal verification and logic synthesis. Synthesis of pass-transistor circuits is one of successful applications of such BDD packages. Pass-transistor circuits are generated from BDDs by mapping each node to a selector which consists of two or four pass transistors. If circuits are generated from smaller BDDs, generated circuits have smaller number of transistors and hence save chip area and power consumption. In this paper, more generic BDDs which have no restrictions in variable ordering and variable appearance count on its paths are called Generic BDDs (GBDDs), and an algorithm for generating GBDDs is proposed for the purpose of synthesis of pass-transistor circuits. The proposed algorithm consists of two steps. At the first step, parse trees (PTs) for given Boolean formulas are generated, where a PT is a directed tree representation of Boolean formula(s) and it consists of literal nodes and operation nodes. In this step, our algorithm attempts to reduce the number of literal nodes of PTs. At the second step, a GBDD is generated for the PTs using Concatenation Method, where Concatenation Method generates a GBDD by connecting GBDDs vertically. In this step, our algorithm attempts to share isomorphic subgraphs. In experiments on ISCAS'89 and MCNC benchmark circuits, our program successfully generated 32 GBDDs out of 680 single-output functions and 4 GBDDs out of 49 multi-output functions whose sizes are smaller than OBDDs. GBDD size is reduced by 23.1% in the best case compared with OBDD.

Frequency-selective fading due to multipath propagation is serious hindrance in high-speed TDMA mobile communications. An adaptive antenna has been proposed to reduce the frequency-selective fading and realize path-diversity. This paper presents a criterion which selects multipath signals and weighting factors for combining them. First, we describe a selection criterion which chooses the multipath signals for the path-diversity. We propose a ratio of signal power to error power for the criterion. Furthermore, we propose weighting factors which realize approximately the maximal ratio combining. Computer simulation results show that the proposed selection criterion and weighting factors reveal excellent performance.

A Generalized Hypercube Network (GHNet) with shared channels which requires only one fixed-wavelength transmitter and r(m-1) fixed-wavelength receivers per node is proposed. The proposed network topology reduces not only the number of transmitters per node but also the number of WDM channels required to service the same number of nodes compared with the GHNet with dedicated channels by sharing the available WDM channels, while it maintains the same channel efficiency as the GHNet with dedicated channels. The proposed network topology may be preferred in a situation where the number of available WDM channels and the cost of the transmitter may cause a major restriction on the lightwave network construction. For performance analysis, the network capacity and the mean queueing delay for the proposed network topology are obtained. Also, the performance measures of the proposed GHNet with shared channels are compared with those of the ShuffleNet with shared channels.

QoS restoration, a new approach to keep QoS of end-to-end ATM connections for failures is proposed. In a network with QoS restoration, each end-to-end connection's customer pre-defines the minimum QoS requirements such as minimum throughput. When a failure occurs, resources such as bandwidth of working connections are reallocated for restoration if they are dispensable to keep the minimum requirements along with the pre-assigned spare resources. This resource reallocation is done in a distributed manner and the result of the modification of a connection is notified to the customer of the connection to help him adjust the way of using it. The effect of the reallocation is mathematically evaluated. It is shown that the reallocation enables to achieve high restoration ratio with insufficient pre-assigned spare resources, such as to restore double-link failures with spare resources prepared for single-link failures, or even to restore single-link failures with no spare resources. It is also shown that pre-assigned spare resources can be reduced if the reallocation is considered in network design phase. The performance of the proposed distributed algorithm is evaluated with an event-driven simulator. The result shows that regardless of whether or not pre-assigned spare resources exist, a restoration ratio which is close to the theoretical maximum can be achieved. A proof-of-concept experimental system is developed by controlling commercial ATM switches via SNMP. The system shows it can effectively manage failures in WAN environment.

Recently, an efficient algorithm has been proposed for finding all solutions of systems of nonlinear equations using linear programming. In this algorithm, linear programming problems are formulated by surrounding component nonlinear functions by rectangles. In this letter, it is shown that weakly nonlinear functions can be surrounded by smaller rectangles, which makes the algorithm very efficient.

This paper introduces a flexible, stream-oriented dataflow processing model based on the "Communicating Logic (CL)" framework. As the target architecture, we adopt the dual layered "Plastic Cell Architecture (PCA). " Datapath processing functionality is encapsulated in asynchronous hardware objects with variable graining and implemented using look-up tables. Communication (i.e. connectivity and control) between the distributed processing objects is achieved by means of inter-object message passing. The key point of the CL approach is that it offers the merits of scalable performance, low power hardware implementation with the user friendly compilation and linking capabilities unique to software.

In reliable multicast communications, retransmission control plays an important role from the viewpoint of scalability. Previous works show that the implosion of control packets, e.g. ACKs or NAKs, degrades the total performance of reliable multicast communications. Local recovery which enables receivers receiving a packet successfully to initiate recovering a lost packet may have the possibility to solve this scalability problem. This paper presents the performance evaluation of local recovery caused by grouping receiving nodes in reliable multicast communication. There seems to be many features dominating the performance of local recovery, the number of nodes in a group, the shared loss occurring simultaneously at multiple receivers and so on. When the number of receivers in a group increases, the geographical expansion of a group will degrade the delay performance of the receivers. In a configuration where most nodes in a local-recovery group suffer from shared loss, the failure of local recovery degrades the total performance. Our simulation results under a hierarchical network topology like the real Internet show that a local-recovery group configuration with two-adjacent MANs grouping performs well.

CAM (Content Addressable Memory) units are generally designed so that they can be applied to variety of application programs. However, if a particular application runs on CAM units, some functions in CAM units may be often used and other functions may never be used. We consider that appropriate design for CAM units is required depending on the requirements for a given application program. This paper proposes a CAM processor synthesis system based on behavioral descriptions. The input of the system is an application program written in C including CAM functions, and its output is hardware descriptions of a synthesized processor and a binary code executed on it. Since the system determines functions in CAM units and synthesizes a CAM processor depending on the requirements of an application program, we expect that a synthesized CAM processor can execute the application program with small processor area and delay. Experimental results demonstrate its efficiency and effectiveness.

In this paper, a new approach to adaptive direction-of-arrival (DOA) estimation based upon a database retrieval technique is proposed. In this method, angles and signal powers are quantized, and a set of true correlation vectors of the array antenna input vectors for various combinations of the quantized angles and signal powers is stored in a database. The k-d tree is then selected as the data structure to facilitate range searching. Estimated a correlation vector, range searching is performed to retrieve several correlation vectors close to it from the k-d tree. The DOA and the signal power are estimated by taking the weighted average of angles and powers associated with the retrieved correlation vectors. Unlike the other high-resolution methods, this method requires no eigenvalue computation, thus allowing a fast computation. It is shown through simulation results that the processing speed of the proposed method is much faster than that of the root-MUSIC that requires the eigenvalue decomposition.

We analyze a scheme that provides frequency hopping pattern for DS/FH spread spectrum. The proposed scheme, based on the theory of finite projective planes, intends to make the number of transmitting terminals uniform across all channels and distribute the interference to all the participant terminals equally. Thus, when a terminal is in a state of power surge, the probability of having the worst case of interference for terminals sharing the same channel is reduced. In the performance evaluation, we demonstrate that the bit error rate is reduced by an order of magnitude through the use of the proposed hopping pattern for both internal and external interference.

We investigated the dependence of the desired echo return loss on frequency for various hands-free telecommunication conditions by subjective assessment. The desired echo return loss as a function of frequency (DERLf) is an important factor in the design and performance evaluation of a subband echo canceller, and it is a measure of what is considered an acceptable echo caused by electrical loss in the transmission line. The DERLf during single-talk was obtained as attenuated band-limited echo levels that subjects did not find objectionable when listening to the near-end speech and its band-limited echo under various hands-free telecommunication conditions. When we investigated the DERLf during double-talk, subjects also heard the speech in the far-end room from a loudspeaker. The echo was limited to a 250-Hz bandwidth assuming the use of a subband echo canceller. The test results showed that: (1) when the transmission delay was short (30 ms), the echo component around 2 to 3 kHz was the most objectionable to listeners; (2) as the transmission delay rose to 300 ms, the echo component around 1 kHz became the most objectionable; (3) when the room reverberation time was relatively long (about 500 ms), the echo component around 1 kHz was the most objectionable, even if the transmission delay was short; and (4) the DERLf during double-talk was about 5 to 10 dB lower than that during single-talk. Use of these DERLf values will enable the design of more efficient subband echo cancellers.