bluuebunny/crossref_metadata_2025_split huggingface dataset:
The structure of the group of transforming rules on rotation algorithm of a dot matrix
Authors: Nakamori Mario , Hagiwara Yoichi 
Published: July 2007

AbstractAssume that an n x n dot matrix is stored in consecutive n words of a computer with one word being n bit. This paper discusses eight operations to rotate or transpose the dot matrix in horizontal/vertical/slant direction. As is well known, such operations form a group.This paper presents a unified description of the algorithms, and it is shown that all eight algorithms can be derived by suitably setting the constants in the unified algorithm. Then it is shown that the algorithms can be transformed to each other by simple transformation rules for the constants, and those transformation rules are shown to form a group.The foregoing algorithms for the dot matrix are not unique, and there can be different descriptions for the algorithm producing the same result. Consequently, there can be various versions of the eight algorithms as well as versions of transformation rules. This paper shows that one of the two groups formed by the transformation rules is isomorphic to the group of algorithms, but the other is not isomorphic.
A dimensional analysis on chaotic neural networks
Authors: Ikeguchi Tohru , Itoh Susmu , Utsunomiya Toshio , Aihara Kazuyuki 
Published: July 2007

AbstractWe apply a dimensional analysis to a neural network model with chaotic dynamics, or a mathematical model of chaotic neural networks. First, Lyapunov spectra are examined to confirm existence of chaotic network behavior and to calculate the Lyapunov dimension. Then, the correlation dimension is estimated in the following three cases: (1) reconstruction from single variable time series, (2) observation in state subspaces and (3) observation of the macroscopic average activity. The results show good correlation dimension obtained by observation in state subspaces and the characteristics of the correlation dimension estimated by macroscopic observation.
High resolution spectral estimation using complex coefficient filter banks
Authors: Shimamura Tetsuya , Takahashi Shin‐Ichi 
Published: July 2007

AbstractThis paper considers first, for the purpose of estimating the frequency of sinusoids corrupted by noise, a spectral estimation method employing the analytic signal, and proposes an analytical signal pre‐filtering technique for that estimation method. Also, it is shown that the analytic signal processing in spectral estimation gives rise to reduction in the estimation variance.Next, the spectral estimation method with complex‐coefficient bandpass filters is considered and a method with complex‐coefficient filter bank is developed which could analyze the entire frequency region which contains any simusoids to be estimated. This method with filter bank could resolve a problem found in the conventional method with decimation techniques. Furthermore, an algorithm is obtained which could provide considerably more accurate estimation results than the conventional one. This algorithm effectively employs the signals remaining in the sampling operation of decimation, and then averages them.
A computational algorithm for solving 0‐1 goal programming with GUB structures and its application for optimization problems in system reliability
Authors: Gen Mitsuo , Ida Kenichi , Lee Jae‐Uk 
Published: July 2007

AbstractUpon to now, system optimal allocation problems such as system reliability and system availability problems have been formulated as single‐objective problems and solved through the use of various well‐developed optimization techniques.However, in this field, there are many problems that cannot be solved without applying MODM (multiple‐objective decision making) methods. These methods deal with multiple objectives that conflict with each other instead of formulating the problem as a single objective programming problem which optimizes only the reliability of the cost function, as is done in previous methods.GP (goal programming) is one of the most powerful MODM tools in this field. In practical MODM problems, many GP problems involve a large number of 0‐1 decision variables and a special type of 0‐1 variable, which arises during the transformation of non‐linear integer programming into 0‐1 linear programming.In this paper, we propose an efficient and specific algorithm for solving large‐scale 0‐1 GP problems in particular structures, which are termed GUB structures. Furthermore, to illustrate the effectiveness of the algorithm proposed here, we introduce two numerical examples from among the problems of system reliability, and compare the algorithm proposed with previous methods.
An optimal backup policy considering jobs for a hard disk
Authors: Sandoh Hiroaki , Kawai Hajime 
Published: July 2007

AbstractThe advent of the present‐day low‐cost personal computer and work station has seen widespread applications. These personal computers and work stations often are used as a system including the hard computer disk (called the hard disk). Various files are constructed and stored in the hard disks. Often, those files are lost due to the mis‐operation of the user or the failure of the hard disk itself.The usual means to cope with such a situation is to back up the content of the hard disk at specified intervals by the floppy disk and other devices. However, time to backup usually is left to the intuition and the experience of each user. This paper considers this situation, and proposes a backup policy where the backup is executed when a certain number of jobs are completed. Then a formulation is presented to determine the optimal number of jobs, in the sense that the expected cost per unit time is minimized.In this paper, it is assumed that only those parts which are modified or updated after the previous backup are backed up at each time. Based on the formulated expression, the existence condition for the optimal solution is derived.
Certain types of Runge‐Kutta‐type formulas and reproduction of orbits of linear systems
Authors: Maeda Shigeru 
Published: July 2007

AbstractSanz‐Serna derived a condition for a Runge‐Kutta method to give a symplectic mapping when applied to an arbitrary Hamiltonian system. The methods with the condition have a very interesting property even if the system to be integrated is not Hamiltonian.This paper discusses numerical reproduction of the phase portrait of a linear systemwhen using a Runge‐Kutta method which satisfies one condition in addition to that of Sanz‐Serna. Not only is such a method Astable, but its absolute stability region also coincides completely with the left half plane of a complex plane, and, accordingly, either convergence or divergence of atrue solution is reproduced numerically whatever the value of astepsize.Furthermore, it is shown that every elliptic closed orbit is drawn accurately by the numerical method as long as the calculation error is ignored. An explicit Runge‐Kutta method, which usually is employed, does not have these properties. Finally, a four‐dimensional linear system is designated which admits all elliptic orbits, and convergent and divergent solutions. It is illustrated that its phase portrait is reproduced well by using the implicit midpoint method—one of the methods with the forementioned conditions.
A note on error estimation for spline interpolation method with sampling bases
Authors: Kamada Masaru , Toraichi Kazuo , Ikebe Yasuhiko 
Published: July 2007

AbstractThe spline interpolation using the sampling bases has a feature of real‐time computation which is not observed in other methods since the result of interpolation is derived directly from the sampled value sequence. Then it is necessary that the sampling function should be truncated in a finite interval. This paper aims to clarify the relation in this method between the error in the result of interpolation due to the truncation and the length of the truncation interval. The result is summarizes in a correspondence table for the truncation interval length and the error. In the proposed interpolation method, the truncation interval length to ensure the given tolerable range of error can be determined using the correspondence table.
LSI module placement methods using neural computation networks
Authors: Date Hiroshi , Hayashi Terumine 
Published: July 2007

AbstractWhen solving combinatorial optimization problems using the neural networks proposed by Hopfield, the objective function and constraints of (0, 1)‐variable optimization problems must be transformed. Then the problem is that there is no theoretical formula to decide the weighting factors of the terms of the objective function.This paper presents an LSI module placement algorithm which uses neural networks. Then an efficient method is proposed to decide fully adaptive parameters, where these parameters ensure convergence of the solution. Experimental results show that the new algorithm gives better solutions than the min‐cut algorithm, although it is not as good as the simulated annealing algorithm.
Design of a pipelined plane‐rotation algorithm based on the error analysis
Authors: Kikuchi Hisakazu , Nakashizuka Makoto , Watanabe Hiromichi 
Published: July 2007

AbstractThis paper aims at the realization of a discrete‐time lossless scattering system, and proposes a plane‐rotation algorithm in which the pipelined processing can be applied. In the proposed method, the CORDIC algorithm is divided into unit operations. The operational cells realizing the individual unit operation are connected in cascade to reconstruct the CORDIC algorithm into a pipeline. This configuration by the cascade connection realizes the pipelined processing and has a high modularity since the structure is a linear array of the unit cells.Next, the operational error in the proposed algorithm is classified into the error due to the finite operation and the error due to the finite word‐length. A design for the algorithm is presented based on the result of analysis. The feature of the proposed design method is that the necessary operations can be extracted from the specified range of the finite operation error and the rotation angle, while minimizing the finite word‐length error of the algorithm. Finally, application examples are shown for the wave digital filter and the sinusoidal pair oscillator.
Log‐depth circuits for elementary functions using residue number system
Authors: Okabe Yasuo , Takagi Naofumi , Yajima Shuzo 
Published: July 2007

AbstractA new hardware algorithm for evaluating elementary functions internally using residue arithmetic is proposed. The algorithm is an improved generalization of Beame‐Cook‐Hoover's log‐depth divider for evaluation of all elementary functions.The proposed circuit computesn‐bit elementary functions in time proportional to logn. On a residue number system, a polynomial can be evaluated at each residue digit independently. Utilizing this property, each residue digit of an approximation polynomial of the target function is looked up from a small table in parallel. Thus the circuit is faster and smaller than Beame‐Cook‐Hoover's although both have the same order of computation timeO(logn). The circuit based on the algorithm is composed of three parts, i.e., binary‐to‐residue converter, ROM for table looking‐up and residue‐to‐binary converter. It has a regular structure suitable for VLSI implementation. By changing only the contents of looking‐up tables corresponding to the approximation formula, a circuit can compute any elementary function uniformly.
Realization of 2‐D separable‐denominator digital filters for real‐time and parallel processing
Authors: Hinamoto Takao , Muneyasu Mitsuji 
Published: July 2007

AbstractThis paper considers the 2‐D separable‐denominator digital filter, and discusses its real‐time and parallel‐processing‐oriented realization. The aim of this paper is to employ a large number of processors concurrently, and to realize a real‐time processing minimizing the data throughput delay by applying pipeline processing. More precisely, the case where the poles of the 2‐D separable‐denominator transfer function are composed of real and complex poles is considered, and two new methods of realization are presented based on the Roesser‐type local state‐space model, which is suited to the real‐time processing.It is shown that the data throughput delay in those methods is equal to the time for two multiplications and one addition, or the time for one multiplication and two additions. The processor factor and the efficiency in each realization are investigated, and the effectiveness of the realization methods are verified from the viewpoints of real‐time processing and parallel processing.
An orthogonal function‐type adaptive digital filter applying a modified discrete fourier transform
Authors: Itoh Yoshio , Kobayashi Masaki , Morkawa Toshiyuki , Kusaka Hiroji 
Published: July 2007

AbstractAn orthogonal function‐type adaptive digital filter (orthogonal function type ADF) is known as a means of improving the convergence speed of a tap coefficient in the case in which input is a colored signal such as a voice. Two different methods have been used for pole location of a transfer function of this ADF. One is the pole location of equal interval of 2π/N(rad). (N: tap number of ADF) starting at the phase 0 (rad) on the circle whose radius is very close to 1 within the unit circle of the z‐plane. The other is the one resulting from rotating the above location by π/N(rad). In the case of the former pole location, it has been shown that it is equivalent to a frequency sampling type ADF such that input is a periodic process of period N. Why improvement in convergence speed of the latter is the case is not clear at this date.In this paper we first derive an equivalent circuit of an orthogonal function type ADF using the latter pole location. In this circuit a modified discrete Fourier transform (MDFT) appears in which phase of a pole of a resonator of frequency sampling filter is shifted by π/N(rad). Next, we present a condition for expansion coefficients of the MDFT circuit to be orthogonal to one another. Moreover, we clarify that this equivalent circuit is of a construction that satisfies the orthogonal condition of the MDFT circuit. Finally, we verify these results of investigation by several computer simulations.
Multilevel coding for impulsive noise
Authors: Ogiwara Haruo , Kaneda Kazuyuki 
Published: July 2007

AbstractBased on the result of measurement of the balanced pair, the model for the amplitude distribution of the impulsive noise is derived and the optimization of the multilevel coding for the impulsive noise is discussed. It is shown first that in the multilevel coding proposed previously, the burst error is produced at the input of the error‐correcting decoder, even if the noise is random. An improvement by interleaving is proposed.Next, a theoretical approximate expression is derived for the error rate at the decoder output. This theoretical expression can be applied not only to the impulsive noise, but also to the noise with any amplitude distribution.Finally, using that expression, the error rate for various assignments of the error‐correcting capability to each level is calculated, and the assignment realizing the maximum coding gain is determined. It is shown that the coding gain of 22 dB is realized when the baseband 4‐level transmission is encoded into 8‐level transmission, and the BCH code of code length 31 is employed.
A study on convergence speed of an orthogonal function‐type adaptive digital filter
Authors: Itoh Yoshio , Kobayashi Masaki , Morikawa Toshiyuki , Hayahara Eturo 
Published: July 2007

AbstractAn adaptive digital filter (orthogonal function‐type ADF) composed of an orthogonal function system which can locate poles of a transfer function in arbitrary positions in the unit circle in the z plane is known as a way to improve convergence speed in the case in which input is a colored signal (such as voice). However, no sufficient theoretical investigation has been done on the reason why this ADF rapidly converges to the colored signal input.This paper derives an equivalent circuit of an orthogonal function‐type ADF in the case in which poles of a transfer function are located in equal space on the unit circle in the z plane. Then the convergence speed using this equivalent circuit is considered. It is shown that the orthogonal function‐type ADF is equivalent to a construction due to a periodic process of an input of the known ADF using the frequency sampling filter (frequency sampling‐type ADF). In other words, even if input is colored like voice and aperiodic process, in the orthogonal function type it is shown that orthogonality between tap coefficient inputs is preserved. Furthermore, these studied results are verified by computer simulations.
Design of subband transmission systems in time and frequency domain
Authors: Kida Takuro , Yoshioka Leopoldo Rideki 
Published: July 2007

AbstractConsider a system in which N time‐invariant linear circuits Hk(ω)(k=1∼N) are connected in parallel and to each of which M parallel time‐invariant linear circuits Hkm(ω)(k=1 ∼N; m=1∼M) are connected in cascade. Then consider that a certain class of band‐limited signals f(t) is impressed on such a system, and the equal‐interval sampled values gkm(nT+akm)(k=1∼N : m=1 ∼M : n=0, ±1, ±2,…; T>0; akm of the output signals gkm(t)(k=1∼N; m=1∼M) are obtained. By multiplying the sampled values by the interpolation function Økm(t)(k=1∼N; m=1 ∼M), which is obtained by the convolution of the time functions Økm(t)(k=1∼N; m=1 ∼M), and by summing up, an approximation formula y(t) is determined.A unified investigation is made on the approximation problem using y(t) for the response g(t) when the original signal f(t) passes through a given filter H(ω).First, the error e(t)=g(t)‐y(t) is considered for given Hk(ω)(k=1∼N), and Hkm(ω)(k=1∼N; m=1∼M) over the set of f(t) belonging to the considered set of waveforms, and a formula is derived which represents the upper bound ∼max(t) of the error in a form where the interpolation functions Økm(t) and Øk(t) are separated.Then, based on the derived formula, an effective design method for the interpolation filter is established, based on the coefficient equation and linear programming, assuming that all of the interpolation filters are constructed as FIR type.Finally, the optimization of the system with a hierarchical structure is discussed.
Analysis of vehicle behavior at a merging section of APM system with different strategies
Authors: Hamamatsu Yoshio , Yoneyama Tadaaki , Kikuchi Shinya 
Published: July 2007

AbstractThis paper considers the merging section of an APM (automated people mover), which is an approach to the new traffic system. The behavior of the vehicles at the merging section is modeled, and the situation, when different strategies are adopted, is analyzed using the technique of Markov chain. An APM system is considered, where the vehicles in the system do not always run individually, but sometimes run in the form of a train.This paper attempts to point out the essential dependencies of the vehicle behavior on the control strategy. It is assumed that the vehicles arrive individually. The basic idea of the control strategy is that the individually incoming vehicles are connected at the merging section. Thus the vehicle capacity of the outgoing line from the merging section is equivalently increased.As the result of analysis, the relations among the arriving traffic of the vehicles in two incoming lines, the average waiting time of the vehicles in the individual lines, the average number of connected vehicles in a train, and the density of train operations are derived explicitly. The dependencies of the average waiting time of the vehicle and the outflow traffic density of the train on different control strategies are examined.
G‐type quartz crystal resonator with supporting portions in length or width direction of vibrational portion
Authors: Kawashima Hirofumi , Matsuyama Masaru 
Published: July 2007

AbstractThe objective of this paper is to provide a miniature quartz crystal resonator with a frequency around 1 MHz. Here, a new G‐type crystal resonator made of the vibrational portion and the supporting portion is presented. The frequency constant, frequency‐temperature characteristic and electrical characteristics are investigated theoretically and experimentally. The study is conducted with a view to realizing a small quartz crystal resonator superior in the frequency‐temperature characteristics and the electrical characteristics.First, the vibration analysis or the experimental investigation is carried out for the case of supporting portions in the length or width direction of the vibrational portion. It is understood that there exists a zero temperature coefficient in either case and that the series resistanceR1is smaller for the structure with a supporting portion in the width direction. With the cut angles ø =‐60 ∼−70°, and θ = 45° in the present resonator, the frequency constant is much smaller than the one in the GT cut. It is shown that a small quartz crystal resonator can be realized at frequencies near 1 MHz.
A method to minimize sensitivity in cascade SC filters
Authors: Ma Zhiqiang , Nakayama Kenji , Yamamoto Gaishi 
Published: July 2007

AbstractWhen a switched capacitor (SC) filter is made in an LSI form, it is important to reduce the total capacitance for reduction of the chip size, improve high‐frequency operation, and reduce power consumption. The total capacitance can be reduced by reducing the total capacitance when the minimum capacitance, is normalized to unity and y is the miniaturization of the capacitors on the chip. When the capacitor is made smaller, the error in the capacitance ratio increases so that the transfer characteristics of the SC filter are varied. To minimize the effect of this error, a circuit with a low element sensitivity is needed.In this paper, for a cascaded SC filter frequently used as a standard circuit, general conditions have been derived that must be satisfied by the pairing and order of the zeros and poles. First, the element sensitivity of the transfer function of the second‐order SC circuit is derived. Next, based on this result, the formula is derived which represents the element sensitivity of the transfer function of the cascaded SC filter. Based on this formula, the condition is derived for the pairing and order of the zeros and poles to reduce the element sensitivity.From the present study, it is found that the element sensitivity can be reduced by pairing nearby zeros with a high Q pole and that the element sensitivity is independent on the order of poles and zeros. It is found also that the element sensitivity increases in proportion to the cutoff frequency of the filter. The foregoing results are confirmed by the simulation using 11‐th order low‐pass and high‐pass filters.
Design of FIR fan filters using FIR hilbert transformer
Authors: Nishikawa Kiyoshi , Yamamoto Eiko 
Published: July 2007

AbstractA new, more direct method for synthesizing FIR fan filters and quadrantal fan filters using a FIR Hilbert transformer as the one‐dimensional (1‐D) prototype filter is described. Only the case 3 transfer function of the Hilbert transformer is available. When an equiripple design is used for the transformer, the ripple amplitudes in the passbands and stopbands of the resulting fan filter are nearly the same as the ripple amplitude of the transformer. The transfer function of the fan filter has only a few nonzero coefficients because the Hilbert transformer is required to be of even order. Illustrative examples of fan filter synthesis are presented.