Jianming LU Takashi YAHAGI Jianting CAO
This letter presents new estimation algorithm of ARMAX systems which do not always satisfy the strictly positive real (SPR) condition. We show how estimated parameters can converge to their true values based on the overparameterized system. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.
We describe a formal verification algorithm for pipelined processors. This algorithm proves the equivalence between a processor's design and its specifications by using rewriting of recursive functions and a new type of mathematical induction: extended recursive induction. After the user indicates only selectors in the design, this algorithm can automatically prove processors having more than 10(1010) states. The algorithm is manuary applied to benchmark processors with pipelined control, and we discuss how data width, memory size, and the numbers of pipeline stages and instructions influence the computation cost of proving the correctness of the processors. Further, this algorithm can be used to generate a pipeline invariant.
Toshiko KIKUCHI Takahide MATSUOKA Toshiaki TAKEDA Koichiro KISHI
We reported that a competitive learning neural network had the ability of self-organization in the classification of questionnaire survey data. In this letter, its self-organized learning was evaluated by means of mutual information. Mutual information may be useful to find efficently the network which can give optimal classification.
In this study, a ring of simple chaotic circuits coupled by inductors is investigated. An extremely simple three-dimensional autonomous circuit is considered as a chaotic subcircuit. By carrying out circuit experiments and computer calculations for two, three or four subcircuits case, various synchronization phenomena of chaos are confirmed to be stably generated. For the three subcircuits case, two different synchronization modes coexist, namely in-phase synchronization mode and three-phase synchronization mode. By investigating Poincar
The recursive least-squares filter and fixed-point smoother are designed in linear discrete-time systems. The estimators require the information of the system matrix, the observation vector and the variances of the state and white Gaussian observation noise in the signal generating model. By appropriate choices of the observation vector and the state variables, the state-space model corresponding to the ARMA (autoregressive moving average) model of order (n,m) is introduced. Here,some elements of the system matrix consist of the AR parameters. This paper proposes modified iterative technique to the existing one regarding the estimation of the variance of observation noise based on the estimation methods of ARMA parameters in Refs. [2],[3]. As a result, the system matrix, the ARMA parameters and the variances of the state and observation noise are estimated from the observed value and its sampled autocovariance data of finite number. The input noise variance of the ARMA model is estimated by use of the autocovariance data and the estimates of the AR parameters and one MA parameter.
Chang-Yu SUN Qi-Hu LI Takashi SOMA
A noise cancelling sonar-ranging system based on the adaptive filtering technique, which can automatically adapt itself to the changes in environmental noise-field and improve the passive sonar-ranging/goniometric precision, was introduced by this paper. In the meantime, the software and hardware design principle of the system using high speed VLSI (Very Large Scale Integrated) DSP (Digital Signal Processing) chips, and the practical test results were also presented. In comparison with the traditional ranging system, the system not only enhanced obviously the ranging precision but also possessed some more characteristics such as simple structure, rapid operation, large data-storage volume, easy programming, high reliability and so on.
Katsuhiko KUBOKI Yusuke UCHIDA
Cross-phase modulation (XPM) induced by residual intensity modulation in coherent optical frequency-shift-keying (FSK) frequency division multiplexing (FDM) transmission systems that use dispersion-shifted fibers is evaluated theoretically and experimentally in terms of spectral profile deformation. The bit-error rate is measured in a 2.5-Gbit/s 4-channel 40-km dispersion-shifted fiber transmission experiment, and we confirm experimentally and theoretically that the power penalty in the presence of residual intensity modulation of over 4 mWp-p exceeds 1dB. Experimental results show that the penalty due to XPM is large even when the power of the newly generated lights caused by four-wave mixing is 20-dB less than that of signals. This confirms that residual intensity modulation must be reduced in continuous-phase (CP)-FSK-FDM systems even though they are designed to avoid generating four-wave mixing.
Atsushi WATANABE Satoru OKAMOTO Ken-ichi SATO
Recent technical advances in WDM (Wavelength Division Multiplexing) technologies suggest that their practical application is imminent. By adopting WDM technologies in the transport network, a bandwidth abundant B-ISDN could be realized cost-effectively. This requires the introduction of WDM technologies, especially into the path layer. This paper explores optical path cross-connect (OPXC) nodes that offer very high levels of expandability because existing traffic demands, which are rather limited, must be efficiently supported while permitting easy step-wise expansion in capacity. This paper highlights modularity with regard to incoming/outgoing links. The OPXC architecture that offers the highest modularity is elaborated, and its transmission characteristics, optical loss and switching power consumption are evaluated. This paper also examines OPXC architecture considering the interface needed to connect electrical path cross-connects. The proposed OPXC architectures provide flexibility and minimum investment to encourage the early introduction of B-ISDN and also supports incremental network growth to match traffic demand. The design of OPXC parameters in terms of transmission performance is shown to ensure the applicability of the proposed OPXC architecture to long-haul optical fiber transmission networks. This is made possible with the low optical component losses offered by the OPXC. The proposed OPXC architectures will, therefore, be applied not only to regional networks, but also to global area networks. Thus they will play a key role in realizing the optical path infrastructure for the future bandwidth abundant B-ISDN.
Suwan RUNGGERATIGUL Weiping ZHAO Yusheng JI Akiko AIZAWA Shoichiro ASANO
When communication network planning-design is performed, especially in a short-term case, it is important to utilize existing facilities in the construction of the new network. In this paper, link capacity assignment problem (CA problem) for packet-switched networks is investigated with the consideration of the existing network. To deal with this, per-unit cost of existing link capacity is thought to be less than that of newly installed capacity and a link cost function is modeled by a non-linear, non-differentiable one which is composed of two portions of capacity cost. After formulating the CA problem, two optimum algorithms derived from Lagrange multiplier method are presented and a modified algorithm is used for solving the CA problem in order to reduce the computation time. Some numerical results show that according to the values of link traffic flows, there will be links whose capacities must be set equally to the existing values. Moreover, when link cost difference is introduced in the CA problem, the number of links that the capacities of which have to be changed from existing values is less than that of linear cost function case, i.e., the case without consideration of the cost difference in link capacity.
With the foreseen growth of communication capacity, further capacity and flexibility enhancements are required for future transport networks. Photonic switching is expected to be a key technology to solve the potential bottleneck, which could be found in transport network nodes. This paper first explains the "Optical Fiber Freeway" concept, as an example of future transport networks. Following this, the possible optical transport network structure using photonic switching technologies, for realizing the Optical Fiber Freeway concept, is explained. An Optical CrossConnect (OXC) and optical Add/Drop Multiplexer (ADM) are key components. Examples of recent development of photonic switching systems toward these targets are also reviewed. An OXC using photonic Space-Division (SD) switching technology has been proposed and demonstrated. This type of OXC will realize flexible reconfiguration and optical hitless switching, and it can meet the introduction of Wavelength Division Multiplexing (WDM) technique. Line failure restoration operation at 2.4Gb/s has been successfully demonstrated. An optical packet network with a slotted ring/bus structure using a wavelength address technique has been proposed as a packet/cell based optical ADM. The experimental system employs a practical media access control system as well as a fast-wavelength switched transmitter suppressing thermally induced wavelength drift. Cell communication at 622Mb/s has been demonstrated with the experimental system. These results show that hardware technologies have been developed steadily. With a future study on an all optical network management scheme, a high capacity and flexible optical network would be realized.
Reducing switching noise is a key point in increasing signal transmission capability. This noise is related to the pin assignment of connectors and the inner layer structure of the printed circuit board (PCB). This paper presents and evaluates experimental results on the relationships between pin assignment, the number of the signal outputs, and switching noise. It shows that calculated and experimental results agree well if we assume that the distribution of return current, causing switching noise in a connector, does not uniformly decrease with increases in the number of ground pins. We also assume that the effective number of ground pins is related to the number of signal pins even if there are more ground pins than there are signal pins.
A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.
This paper considers properties of language classes with finite elasticity in the viewpoint of set theoretic operations. Finite elasticity was introduced by Wright as a sufficient condition for language classes to be inferable from positive data, and as a property preserved by (not usual) union operation to generate a class of unions of languages. We show that the family of language classes with finite elasticity is closed under not only union but also various operations for language classes such as intersection, concatenation and so on, except complement operation. As a framework defining languages, we introduce restricted elementary formal systems (EFS's for short), called max length-bounded by which any context-sensitive language is definable. We define various operations for EFS's corresponding to usual language operations and also for EFS classes, and investigate closure properties of the family Ge of max length-bounded EFS classes that define classes of languages with finite elasticity. Furthermore, we present theorems characterizing a max length-bounded EFS class in the family Ge, and that for the language class to be inferable from positive data, provided the class is closed under subset operation. From the former, it follows that for any n, a language class definable by max length-bounded EFS's with at most n axioms has finite elasticity. This means that Ge is sufficiently large.
Akira ADACHI Ken'ichi OKAJIMA Youichi TAKADA Saburo TANAKA Hideo ITOZAKI Haruhisa TOYODA Hisashi KADO
This study shows that using the direct offset integration technique (DOIT) and additional positive feedback (APF) in a high-Tc dc superconducting quantum interference device (SQUID) improves the effective flux-to-voltage transfer function and reduces the flux noise of a magnetometer, thus improving the magnetic field noise. The effective flux-to-voltage transfer function and the flux noise with APF were measured at different values of the positive feedback parameter βa, which depends on the resistance of the APF circuit. These quantities were also compared between conditions with and without APF. This investigation showed that a βa condition the most suitable for minimizing the flux noise of a magnetometer with APF exists and that it is βa=0.77. The effective flux-to-voltage transfer function with APF is about three times what it is without APF (93 µV/Φ0 vs. 32 µV/Φ0). The magnetic field noise of a magnetometer with APF is improved by a factor of about 3 (242 fT/Hz vs. 738 fT/Hz).
Hiroaki SUZUKI Toshichika SAKAI Hisao HARIGAI Yoichi YANO
A 32-bit RISC microprocessor "V810" that has 5-stage pipeline structure and a 1 Kbyte, direct-mapped instruction cache realizes 2.5 MHz operation at 0.9 V with 2.0 mW power consumption. The supply voltage can be reduced to 0.75 V. To overcome narrow noise margin, all the signals are set to have rail-to-rail swing by pseudo-static circuit technique. The chip is fabricated by a 0.8 µm double metal-layer CMOS process technology to integrate 240,000 transistors on a 7.4 mm7.1 mm die.
Tetsuya YOKOTANI Tatsuki ICHIHASHI Chikara MATSUDA Michihiro ISHIZAKA
Data communication by using TCP/IP is one of important services on ATM networks. At one approach in traffic control of this service, the dedicated bandwidth for data transfer is not guaranteed and the feedback congestion control to prevent cell loss is performed in the congestion case. However, when a large quantity of data is transferred within a short period, this traffic control cannot be expected to achieve high efficiency. In this case, it is suitable that the dedicated bandwidth is guaranteed by FRP (Fast Reservation Protocol) before the data is transferred. This paper describes that FRP is superior to the feedback congestion control for large size data transmission. Next, it proposes a selectable traffic control which selects adaptively one of the feedback congestion control and FRP.
Ken HIGUCHI Etsuji TOMITA Mitsuo WAKATSUKI
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). When it accepts by empty stack, it is called strict. A deterministic one-counter automaton (doca) is a dpda having only one stack symbol, with the exception of a bottom-of-stack marker. The class of languages accepted by strict droca's is a subclass of the class of languages accepted by doca's. Valiant has proved the decidability of the equivalence problem for doca's and the undecidability of the inclusion problem for doca's. Hence the decidablity of the equivalence problem for strict droca's is obvious. In this paper, we present a new direct branching algorithm for checking the inclusion for a pair of languages accepted by strict droca's. Then we show that the worst-case time complexity of our algorithm is polynomial with respect to these automata.
Naotake KAMIURA Hidetoshi SATOH Yutaka HATA Kazuhara YAMATO
In this paper, we propose a method to design ternary cellular arrays by using Ternary Decision Diagrams (TDD's). Our cellular array has a rectangular structure composed of ternary switch cells. The ternary functions represented by TDD's are realized by mapping the TDD's to the arrays directly. That is, both the nodes and the edges in the TDD are realized by some sets of the cells. Since TDD's can represent easily multiple-output functions without large memory requirements, our arrays are wuitable for the realization of multiple-output functions. To evaluate our method, we apply our method to some benchmark circuits, and compare our arrays with the ternary PLA's. The experimental results show that our arrays have the advantage for their sizes, especially in the realization of symmetric functions. The results also clarify that the size of our arrays depends on the size of TDD's.
The state of the art of low-voltage (LV) analog circuit design techniques is reviewed, and fundamental design techniques are identified and classified as follows: 1) current-mode, 2) series-to-parallel, 3) signal range sharing, 4) dynamic bias, 5) linear bias, and 6) LV regulator. A relatively wide variety of low frequency application circuits have been developed, but future development is expected for wide-bandwidth application circuits such as a voltage-controlled-oscillator (VCO), a balanced multiplier, etc. The circuit techniques such as current-mode, signal range sharing, and dynamic bias will probably be most important for advanced future circuit designs.
Kazuya HAYATA Tsutomu KOSHIDA Masanori KOSHIBA
A self-induced-transparent (SIT) system that takes advantage of morphology dependent resonances (MDR's) in a Mie-sized microsphere doped with a resonant material is proposed. The present system is doubly resonant: one has microscopic origin (the two-level system), while the other has macroscopic origin (the MDR). In this geometry, owing to the feedback action of MDR's, the pulse area can be much expanded, and thus the electric-field amplitude of the incident pulse can be reduced substantially compared with the conventional one-way SIT propagation. Theoretical results that incorporate dephasing due to structural imperfections are shown.