An efficient algorithm is presented for finding all solutions of piecewise-linear resistive circuits. In this algorithm, a simple sign test is performed to eliminate many linear regions that do not contain a solution. Therefore, the number of simultaneous linear equations to be solved is substantially decreased. This test, in its original form, requires O(Ln2) additions and comparisons in the worst case, where n is the number of variables and L is the number of linear regions. In this paper, an effective technique is proposed that reduces the computational complexity of the sign test to O(Ln). Some numerical examples are given, and it is shown that all solutions can be computed very efficiently. The proposed algorithm is simple and can be easily programmed by using recursive functions.

Acceleration techniques have been incorporated into the generalized method of characteristics (GMC) to perform transient analysis of uniform transmission lines, for the special case when the transmission lines are driven by digital signals. These techinques have been proved to improve the simulation speed to a great extent when the analysis is carried out using iterative waveform relaxation method. It has been identified that the load impedance connected to the transmission line has a bearing on the efficiency of one of these acceleration techniques. Examples of an RLCG line terminated with linear loads as well as nonlinear loads are given to illustrate the advantage of incorporating these acceleration techniques.

This paper describes an overview of wireless communications based on fiber-radio technologies from the viewpoint of system applications, particularly in the area of microcell radio systems. Feasible fiber-radio networks design are detailed in order to increase system performance and cost effectiveness. The benefits of the evolving fiber-radio microcell system are discussed with a spectral delivery scheme to meet traffic demands. Foreseeable electronic and optic technologies are reviewed in light of the key parameters to optimize the overall system. This strategy will play a role in broadband and flexible networks.

In this study, an expression of the regression relationship with less information loss is concretely derived in the form suitable to the existence of amplitude constraint of the observed data and the prediction of response probability distribution. The effectiveness of the proposed method is confirmed experimentally by applying it to the actual acoustic data.

In this paper, we investigate various technology aspects in fiber-to-the-microcell systems. Background studies on radio propagation environment and system operations are provided first. The fundamental linearity characteristics of a directly and externally modulated optical links are analyzed next. An overall comparison between the two types of optical links, and system requirements among all types of wireless systems (from macrocells to picocells) are presented. Future research and development directions are also suggested.

In this paper, a new method of synthesizing multi-level logic circuits directly from binary decision diagrams (BDDs) is proposed. In the simple multiplexer implementation, the depth of the synthesized circuit was always O (n), where n is the number of input variables. The new synthesis method attempts to reduce the depth of circuits. The depth of the synthesized circuits is O (log n log w) where w is the maximum width of given BDDs. The synthesized circuits are 2-rail-input 2-rail-output logic circuits. The circuits have good testability; it is proved that the circuits are robustly path-delay fault testable and also totally self-checking for single stuck-at faults.

We propose a decoding algorithm for the t-EC/AUED code proposed by Böinck and Tiborg. The proposed algorithm also reveals some remarkable properties of the code.

Corresponding to the development of B-ISDN, integrated services for data, voice, etc. are imperatively required for the so called third generation wireless communication networks. In this paper, I-ISMA (Idle Signal Multiple Access for Integrated services) is proposed to transmit integrated voice and data traffic from dispersed terminals to a base station. In the system, data packets and the first packets of talkspurts of conversational speeches are transmitted using ISMA protocol over a shared channel while subsequent packets of talkspurts are sent with time reservation technique. The channel capacity of I-ISMA is evaluated and compared with that of PRMA. The region in which I-ISMA has larger capacity than PRMA is figured out. Generally speaking, I-ISMA has larger capacity than PRMA when the duration for transmitting and detecting an idle signal is not too long and the channel is not too congested by the reserved voice transmissions. When we concern real time voice transmission, delay is one of the most important performance measures. Only is a qualitative discussion on delay performance given here. The quantitative evaluation is obtained by the dynamic analysis in our succeeding paper.

Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.

Since the time required for testing logic circuits is proportional to the number of test vectors, the size of test sets as well as test generation time is one of the most important factors to be considered in test generation. The size of test sets becomes an essential issue, especially for scan designed circuits, because of the need to shift a test vector serially into the scan path. In this paper, we propose new methods of generating compact test sets to detect al the irredundant single stuck-at faults in combinational circuits. The proposed algorithms calculate a test function for each fault which corresponds to the set of all test vectors for the fault and generate a compact test set by analyzing the test functions. The analysis is based on finding a test vector which detects the largest number of remaining faults. Since our methods select a test vector among all the test vectors, represented by a test function, for a target fault, smaller test sets can be generated, in general, than that by conventional test set compaction methods. The experimental results show that the size of test sets generated by our method is about one-third as large as that without compaction.

A model for a large network with an unidirectional linear respone (ULR) is proposed in this letter. This deterministic system has powerful computing properties in very close correspondence with earlier stochastic model based on McCulloch-Pitts neurons and graded neuron model based on sigmoid input-output relation. The exclusive OR problems and other digital computation properties of the earlier models also are present in the ULR model. Furthermore, many analog and continuous signal processing can also be performed using the simple ULR neural network. Several examples of the ULR neural networks for analog and continuous signal processing are presented and show extemely promising results in terms of performance, density and potential for analog and continuous signal processing. An algorithm for the ULR neural network is also developed and used to train the ULR network for many digital and analog as well as continuous problems successfully.

A technique for reducing fiber four-wave mixing (FWM) in multichannel transmissions is proposed. Birefringent elements are inserted on the way of transmission lines. Due to the effect of birefringent elements on the polarization states, the effective crosstalk due to FWM is expected to be 3/16 of that in the worst case in conventional systems.

We present algorithms for the optimization of sequential synchronous digital circuits using structural model, i.e. interconnections of combinational logic gates and synchronous registers. This approach contrasts traditional methods using state diagrams or transition tables and leveraging state minimization and encoding techniques. In particular, we model circuits by synchronous logic networks, that are weighted multigraphs representing interconnections of gates implementing scalar combinational functions. With this modeling style, area and path delays are explicit and their variation is easy to compute when circuit transformations are applied. Sequential logic optimization may target cycle-time or area minimization, possibly under area or cycle-time constraints. Optimization is performed by a sequence of transformations, directed to the desired goal. This paper describes the fundamental mechansms for transformations applicable to sequential circuits. We review first retiming and peripheral retiming techniques. The former method optimizes the position of the registers, while the latter repositions the registers to enlarge maximally the combinational region where combinational restructuring algorithms can be applied. We consider then synchronous algebraic and Boolean transformations, that blend combinational transformations with local retiming. Both classes of transformations require the representation of circuits by means of logic expressions with labeled variables, the labels representing discrete time-points. Algebraic transformations entail manipulation of time-labeled expressions with algebraic techniques. Boolean transformations exploit the properties of Boolean algebra and benefit from the knowledge of don't care conditions in the search for the best implementation of local functions. Expressing don't care conditions for sequential circuits is harder than for combinational circuits, because of the interaction of variables with different time labels. In addition, the feasibility of replacing a local function with another one may not always be verified by checking for the inclusion of the induced perturbation in local explicit don't care set. Indeed, the behavior of sequential circuits, that can be described appropriately by the relation between input and output traces, may require relational models to express don't care conditions. We describe a general formalism for sequential optimization by Boolean transformations, where the don't care conditions are expressed implicitly by synchronous recurrence equations. We present then an optimization method for this model, that can exploit degrees of freedom in optimization not possible for other methods, and hence providing solutions of possible superior quality. We conclude by summarizing the major features and limitations of optimization methods using structural models.

An adaptive multichannel IIR lattice predictor for k-step ahead prediction is constructed and the effectiveness of the proposed predictor is evaluated using digital simulations.

In multidimensional signal sampling, the orthogonal sampling scheme is the simplest one and is employed in various applications, while a non-orthogonal sampling scheme is its alternative candidate. The latter sampling scheme is used mainly in application where the reduction of the sampling rate is important. In three-dimensional (3-D) signal processing, there are two typical sampling schemes which belong to the non-orthogonal samplings; one is face-centered cubic sampling (FCCS) and the other is body-centered cubic sampling (BCCS). This paper proposes a new design method for 3-D band-limiting FIR filters required for such non-orthogonal sampling schemes. The proposed method employs the McClellan transformation technique. Unlike the usual 3-D McClellan transformation, however, the proposed design method uses 2-D prototype filters and 2-D transformation filters to obtain 3-D FIR filters. First, 3-D general sampling theory is discussed and the two types of typical non-orthogonal sampling schemes, FCCS and BCCS, are explained. Then, the proposed design method of 3-D bandlimiting filters for these sampling schemes is explained and an effective implementation of the designed filters is discussed briefly. Finally, design examples are given and the proposed method is compared with other method to show the effectiveness of our methos.

The Cooper pairing interaction in high Tc oxide superconductor is discussed in terms of an empirical expression; TcDexp[1/g], gcωo which was derived in our previous investigation. The dual character of this expression consisting of the phonon Debye temperature D and electronic excitation ωo in the mid-infrared region can be interpreted on the basis of the phonon-assisted mechanism on carrier conduction and the electronic excitation. A tunneling spectrum here presented shows certain evidence of the phonon contribution. The characteristics of the long range superconductive proximity phenomena recently reported are also may be interpreted by this mechanism.

A new method of multipath diversity combination is proposed for Direct Sequence Spread Spectrum (DS-SS) mobile communications. In this method, the transmitted signal from the base staion is the sum of a number of the same spread signal, each one delayed and scaled according to the delay and the strength of the multipaths of the transmission channel. As a result the received signal at the mobile unit will already be a Rake combination of the multipath signals. This new method is called Pre-Rake diversity combination because the Rake diversity combination process is performed before transmission By this method the size and complexity of the mobile unit can be minimized, and the unit is made as simple as a non-combining single path receiver. A theoretical examination of the Signal to Noise Ratio (SNR) and the Bit Error Rate (BER) results for the traditional Rake and the Pre-Rake combiners as well as computer simulations show that the performance of the Pre-Rake combiner is equivalent to that of the Rake combiner.

The spread spectrum system (abbreviated as SS system) is known to be an excellent communication system which resists jamming. Recently, its application to a simplified wireless communication system has been considered to be suited for consumer communication. In Japan, SS wireless LAN system has got the approval on 2.4GHz ISM band already. A compact SS transceiver for the SS wireless LAN is realized, whose data ratio is 230kbps. The SS transceiver is based on a direct sequence for the modulation, and the demodulation is carried out by a specially developed SAW device. In the first part of this paper, the technical conditions of the SS wireless LAN are mentioned. Then the SAW device and the principle of the demodulation are discussed. Finally, the configuration of the SS transceiver and the protocol of the SS wireless LAN are presented.

The bit error performance of a Direct Sequence Spread Spectrum Communication system in actual land mobile satellite channel is evaluated with experiments. Field test results with the ETS-V satellite in urban and suburban environments at L-band frequency show that this land mobile satellite channel of 3MHz bandwidth can be seen as a non-frequency selective Rician fading channel as well as shadowing channel. The bit error performance can be estimated from signal power measurement as in the case of narrow band modulation signals.

Properties of a strongly-coupled nonlinear directional coupler (NLDC) with a lossy MQW coupling layer is analyzed using the Galerkin finite element method accompanied by a predictor-corrector algorithm. It is shown that the propagation attenuation along the NLDC is considerably smaller than that in the bulk MQW and tends to reduce with the input power. By the presence of losses, the powers guided in two waveguides do not become a maximum and a minimum at the same propagation length, unlike the lossless coupler. The losses make the nonlinear effect weak due to the decrease in guided power, and hence the coupling length decreases and the switching power increases. The extinction ratio of the switching becomes the largest value not in the cases of nonloss and high losses but in the case of moderately high losses, although the switching power is somewhat larger than that of the lossless case.