The rain attenuation in the frequency range from 1 to 1000 GHz was calculated by using the Laws-Parsons, Sekine-Lind and Ihara-Furuhama-Manabe distributions for raindrop-size. The results were compared with the recent microwave measurements from 8 to 312.5 GHz at the rain rate R
Shoichi KOIKE Norinobu YOSHIDA Ichiro FUKAI
The analysis of the coupling characteristics between lines becomes more important because of the progress of high density wiring and large integration. The problems can be treated as energy flow which is represented by the Poynting vector. On this view point, we present the variation of the Poynting vector for crossing striplines on time and space.
We have successfully prepared low anodization voltage high-quality capacitors using anodized hafnium films with the anodization voltage of 40 V under the preferable conditions of anodization and heat-treatment.
The composed thermo-e.m.f. caused by a suitable connection, which is called C-connection, becomes lower than the thermo-e.m.f. of individual reed switch. The composed thermo-e.m.f. is discussed by Nernst effect on the reed contact and is given a reasonable explication by this effect.
Takahiro INOUE Fumio UENO Shinji MASUDA
A low-sensitivity lowpass switched-capacitor filter (SCF) whose worstcase sensitivity becomes zero at zero frequency is presented. The proposed SCF is realized with the fully balanced SC circuits using the op-amps which can provide the outputs of both signs.
Susumu HORIGUCHI Takashi SUZUKI Yoshiharu SHIGEI
In order to reduce the number of bus conflicts, a multiple bus connection and clustering of multiprocessor system have been proposed. In this paper throughputs of these two types of multiprocessor systems are investigated numerically in some detail.
There are many devices which provide vibratory sensation to the skin but only a few use vibratory sensation for practical applications. In this study, the vibration pattern is produced by a 10
In this paper we deal with a class of nonlinear differential equations which arise in physical systems. Up to the present time no proper generalized classification of invariant sets with high dimension has been proposed. Invariant sets under the Poincaré transformation are classified into 2H -types according to the characteristic of their adjacent manifolds, where H is a hyperbolicity defined in the neighborhood of the invariant sets. In the final section of this paper, we apply the reduced classification of invariant sets to the third order nonlinear systems which are derived from parametric excitation circuits and discussed their global behavior of invariant sets and manifolds in the topological space. Doubly asymptotic points, homoclinic and heteroclinic types, located in the three-dimensional space are also obtained.
Kunimaro TANAKA Minoru OZAKI Tohru INOUE Teruo FURUKAWA
The recording format of professional audio recorders has to be considered not only from the error correction point of view but also from the realization of such functions as overdubbing and tape cut editing. At first this paper describes the characteristics of errors which occur in the stationary-head type multi-track high density magnetic recording channel. The effect of fingerprints is also examined. The data shows that a two-dimensional code is effective for correcting the errors because of the nature of the error. Among two-dimensional codes, product code is selected from the stand point of code efficiency and hardware size. As a sub-class of generalized product codes, a code which is a combination of the Reed-Solomon code and the cyclic redundancy check code (CRCC) has been employed. In order to save the data recorded in an erroneous track the Reed-Solomon code is applied across the track and the check bits tracks are provided beside the audio data tracks. The data forms a frame in a track. The frame begins with a frame syncronization code, and is ended by the check bits of the CRCC. The optimum frame length concerning the redundancy and interleaving method of the data is described. The experimental data shows that the error correcting scheme is satisfactory.
We consider the following two fundamental problems: (P1) We are given a rectilinear simple polygon P with n edges and a point s in its interior. Given a query point t in the interior of P, find a rectilinear shortest path between s and t. (P2) We are given a rectilinear simple polygon P with n edges. Given a query point pair (s,t) in the interior of P, find a rectilinear shortest path between s and t. For the problem P1, we present an efficient algorithm which works in O(log n+L) query time and O(n log n) preprocessing time, where L is the number of line segments in the shortest path. Another important thing is that the shortest path obtained by the algorithm is of the minimum bends among all the paths between the two points. If only the distance between s and t is needed, then O(log n) time is enough for the query. On the other hand, for the problem P2, O(n) query time is needed while the preprocessing time is the same. Based on the algorithms, it is shown that given m points in a rectilinear n-edge simple polygon we can compute the distance between every pair of points in O(m(m+n)+nlog n) time.