This paper deals with the problem of assigning tasks to the processors of a multiprocessor system such that the sum of execution and communication costs is minimized. If the number of processors is two, this problem can be solved efficiently using the network flow approach pioneered by Stone. This problem is, however, known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. In this paper, we propose a network flow approach for the task assignment problem in homogeneous hypercube networks, i.e., hypercube networks with functionally identical processors. The task assignment problem for an n-dimensional homogeneous hypercube network of N (=2n) processors and M tasks is first transformed into n two-terminal network flow problems, and then solved in time no worse than O(M3 log N) by applying the Goldberg-Tarjan's maximum flow algorithm on each two-terminal network flow problem.

This paper proposes a designing algorithm for quadrilateral recursive filters which consist of four quarter-plane filters in the four quadrants. This can realize a perfect zero-phase filtering which is essential for image processing. Furthermore, several parallel processing algorithms capable of performing under very high parallel efficiency are developed on line-connected and mesh-connected processor arrays. By these proposals, the advantage of two-dimensional non-causal zero-phase recursive digital filters is made clear.

A current source with current switches (switched current source) is widely used in various analog ICs. One of its typical application is data converters. This paper describes an analysis of the transient behavior of a switched current source. The analysis has clarified conditions and causes of overshooting in the output waveform. The analysis also clarifies dependence of the settling time on parameters. The waveform heavily depends on time constant and initial charge at the internal node where current source and current switch are connected. They can cause the overshooting and limit the settling time. A phenomenon of acceleration of the settling time and an influence of the charge coupling through current switches are also discussed. A chart mentioned in this paper is useful for the initial design and the improvement of switched current sources.

This paper investigates the compositionality of operational models for concurrency induced by labeled transition systems (LTS's). These models are defined on the basis of a metric domain first introduced by de Bakker and Zucker; the domain is a complete metric space consisting of tree-like structures called processes. Transition system specifications (TSS's) define LTS's; the set of states of such a LTS A is the set of terms generated by a signature Σ. For the syntactical operators F contained in Σ, semantic operations (on processes) associated with F are derived from the TSS S by which A is defined, provided that S satisfies certain syntactical restrictions. By means of these operations, the compositionality of the operational model induced by A is established. A similar result was obtained by Rutten from TTS's which define finitely branching LTS's. The main contribution of this paper is generalization of Rutten's result to be applicable to TSS's which are based on applicative languages including recursion, parameterized statements, and value passing, and which define infinitely branching LTS's. A version of typed λ-calculus incorporating µ-notation is employed as a formalism for treating recursion, parameterized statements, and value-passing. Infinitely branching LTS's are needed to treat programming languages including value passing such as CCS.

It is sometimes required to change the frequency characteristics of a digital filter during its operation. In this paper a new synthesis of variable even-order IIR digital filters is proposed. The cut-off frequency of the filter can be changed by a single parameter. The fundamental filter structure is a cascade of second-order sections. The multiplier coefficients of each section are determined by using the Taylor series expansion of the lowpass to lowpass frequency transformation. For this method any second-order section can be used as a prototype, but here in this paper only the direct form and the lattice form are described. Unlike the conventional method, any transfer functions can be used for the proposed method. Finally a designed example shows that the proposed filter has wider tuning range than the conventional filter, and the advantage of the proposed filters is confirmed.

Radiation properties of magnetic noise from the harness wires of a spacecraft (GEOTAIL) have been studied experimentally and theoretically. A simulation experiment on the noise radiation using a minimum set of subsystems of the spacecraft has shown that the intensity and the directional patterns of the noise radiation from the wires were largely changed by the existence of a conductive plate near the harness wires. The change in the noise characteristics is explained by eddy currents induced in the conductive plate by the signal current flowing in the wires. The eddy currents distributed in the conductive plate were calculated by the Finite Element analysis Method (FEM). The magnetic flux densities calculated from both the source signal current and its induced eddy currents for the wiring configuration of the simulation experiment have shown to be consistent with the values obtained in the experiment. The results in the present study have provided us an important information on a wiring method to diminish noise radiation from harness wires.

This paper outlines an approach for specifying emissions performance at the component level. The objective is to move towards an industry specification for radiated emissions from large integrated circuits in order to facilitate cost effective system design for EMI compliance. Simple models of the mechanisms of direct chip radiation are provided based on the physical and electrical structure of large integrated circuits. These models lead to simple algorithms for estimating the total IC radiation based on IC design parameters. These models can be related to proposed emissions limits based on the desired application of the IC. Finally a measurement methodology is described which permits evaluation of the IC's relative to the limits and provides the information required to make detailed simulation models.

For the efficient circuit simulation by the direct method, network tearing and latency techniques have been studied. This letter describes a circuit simulator SPLIT with hierarchical decomposition and latency. The block size of the latent subcircuit can be determined dynamically in SPLIT. We apply SPLIT to the MOS circuit simulation and verify its availability.

Mechanism for radiation phenomenon caused by a finite-length transmission line is discussed. Coupling of an external wave to a transmission line has been studied by using a circuit concept because of a TEM transmission. Since the relationship between coupling and radiation is reciprocal, radiation can be treated by using the circuit concept. It is shown that the equations obtained by using the field theory are quite coincident with those by the circuit theory. From the resultant, it can be concluded that the radiated fields are composed of those by the line current of TEM and the terminal currents. A method for an application of the circuit concept to radiation due to a trace on a printed circuit board is studied by comparing the experimental results.

We present schemes for disseminating information in the n-dimensional hypercube with some faulty nodes/edges. If each processor can send a message to t neighbors at each round, and if the number of faulty nodes/edges is k(kn), then this scheme will broadcast information from any source to all destinations within any consecutive n+[(k+l)/t] rounds. We also discuss the case where the number of faulty nodes is not less than n.

Binaural effects in two measures are studied. One measure is the detectable limen of click sounds under lateralization of diotic or dichotic noise signals, and the other is phoneme articulation score under localization or lateralization of speech and noise signals. The experiments use a headphones system with listener's own head related transfer function (HRTF) filters. The HRTF filter coefficients are calculated individually from the impulse responses due to the listener's HRTF measured in a slightly sound reflective booth. The frequency response of the headphone is compensated for using an inverse filter calculated from the response at the subject's own ear canal entrance point. Considering the speech frequency band in tele-communication systems is not sufficiently wide, the bandwidth of the HRTF filter is limited below 6.2 kHz. However, the experiments of the localization simulation in the horizontal plane show that the sound image is mostly perceived outside the head in the simulated direction. Under simulation of localization or lateralization of speech and noise signals, the phoneme articulation score increases when the simulation spatially separates the phonemes from the noise signals while the total signal to noise ratio for both ears is maintained constant. This result shows the binaural effect in speech intelligibility under the noise disturbance condition, which is regarded as a part of the cocktail party effect.

We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.

We study the depth of planar Boolean circuits. We show that planar Boolean circuits of depth D(n) are simulated by on-line Turing machines in space O(D(n)). From this relationship, it is shown that any planar circuit for computing integer multiplication requires linear depth. It is also shown that a planar analogue to the NC-hierarchy is properly separated.

A method is presented for analyzing the scalar wave scattering from a conducting target of arbitrary shape in random media for both the Dirichlet and Neumann problems. The current generators on the target are introduced and expressed generally by the Yasuura method. When using the current generators, the scattering problem is reduced to the wave propagation problem in random media.

In this paper, some classes of arithmetic circuits are introduced that capture the computational complexity of computing the determinant of matrices with entries either indeterminates or constants from a field. An arithmetic circuit is just like a Boolean circuit, except that all AND and OR gates (with fan-in two) are replaced by gates realizing a multiplication and an addition, respectively, of two polynomials over some indeterminates with coefficients from the field, and the circuit computes a (formal multivariate) polynomial in the obvious sense. An arithmetic circuit is said to be skew if at least one of the inputs of each multiplication gate is either an indeterminate or a constant. Then it is shown that for all square matrices M of dimension q, the determinant of M can be computed by a skew arithmetic circuit of (q20) gates, and is shown that for all skew arithmetic circuits C of size q, the polynomial computed by C can be defined as the determinant of a square matrix M of dimension (q). Thus the size of skew arithmetic circuit is polynomially related to the dimension of square matrices when it is considered to represent multivariate polynomials in both arithmetic circuits and the determinant. The results are extended to some other classes of arithmetic circuits less restricted than skew ones, and by using such an extended result, a difference and a similarity are demonstrated between polynomials represented as the determinant of matrix of relatively small dimension and those polynomials computed by arithmetic formulas and arithmetic circuits of relatively small size and degree.

This article briefly looks at the future of telecommunication education in the universities as it evolves from present concerns and trends. Five year bachelor's programs and top-down curricular design will be common. Textbooks supplemented by advance organizers, instruction and testing according to individual learning styles and global integration of education using multi-media services and broadband technology will be some of the other features. Finally, the importance of industry-university partnership in all aspects of engineering education is emphasized.

The semantics of a language for communicating processes is investigated, and three full abstractness results for are established. The language contains atomic actions, termination, inaction, sequential composition, alternative composition, parallel composition, action restriction, and a form of guarded recursion. (The guardedness restriction on recursion is needed to establish one of the full abstractness results.) Three Plotkin-style operational semantics WL, CWL, and IWL of the language are defined. These semantics are linear in that the meaning of each program in any of these semantics is a set of action sequences the program may perform, and are weak in that the action sequences are obtained by ignoring (finte sequences of) internal moves. All the three semantics distinguish divergence (an infinite sequence of internal moves) from deadlock. The semantics IWL differs from the other two in that IWL is a so-called interal action semantics taking into account only internal moves under the assumption that the environment allows no (external) communication actions, and hence, the only possible actions for processes are internal moves, whereas the other two semantics take into account communication actions in addition to internal moves. The two semantics WL and CWL differ each other in that CWL is a so- called completed trace semantics, whereas WL is not. Then, two compositional models RF and IRF for the language are proposed, and the full a bstractness of RF (resp. of IRF) w. r. t. WL and CWL (resp. w. r. t. IWL), as expressed in the following, is established:s1s2(*) S[][S[]is a context of ⇒S[s1]S[s2]],where ,RF,WL, RF,CWL, IRF,IWL. A similar full abstractness result has been established by Bergstra, Klop, and Olderog for a language without recursion or internal moves. Moreover, Rutten investigated the semantics of a language similar to , in the framework of complete metric spaces, and showed that the failures model is fully abstract w. r. t. a strong linear semantics L, where L is strong in that it does not abstract from internal moves. The full abstractness of RF w. r. t. CWL, expressed in (*) with ,RF,CWL, is an extension of the result of Bergstra et al. to a language with recursion and internal moves. Also, the full abstractness of IRF w. r. t. IWL, expressed in (*) with ,IRF,IWL, is an extension of the Rutten's result, to the case of weak linear semantics with divergence.

By adding some functions to memories, highly parallel computation may be realized. We have proposed memory-based parallel computation models, which uses a new functional memory as a SIMD type parallel computation engine. In this paper, we consider models with communication between the words of the functional memory. The memory-based parallel computation model consists of a random access machine and a functional memory. On the functional memory, it is possible to access multiple words in parallel according to the partial match with their memory addresses. The cube-FRAM model, which we propose in this paper, has a hypercube network on the functional memory. We prove that PSPACE is accelerated to polynomial time on the model. We think that the operations on each word of the functional memory are, in a sense, the essential ones for SIMD type parallel computation to realize the computational power.