Mitsuji MUNEYASU Kouichiro ASOU Yuji WADA Akira TAGUCHI Takao HINAMOTO
This paper presents a new implementation of fuzzy filters for edge-preserving smoothing of an image corrupted by impulsive and white Gaussian noise. This filter structure is expressed as an adaptive weighted mean filter that uses fuzzy control. The parameters of this filter can be adjusted by learning. Finally, simulation results demonstrate the effectiveness of the proposed technique.
Osamu HOSHUYAMA Brigitte BEGASSE Akihiko SUGIYAMA
This paper proposes a new adaptation-mode control (AMC) for a robust adaptive microphone array with an adaptive blocking matrix (RAMA-ABM). The proposed AMC is based on cross correlations of two microphone signals and uses a state machine for controlling the adaptation to avoid target-signal cancellation. Evaluation with sound data obtained in different acoustic environments demonstrates that the noise reduction by the proposed AMC is 3 dB better than that by the AMC based on the SNR estimate. Subjective listening tests show that the quality of the output signal by the proposed AMC is comparable to or even better than those by the conventional AMCs.
Ken-ichi SAKINA Suomin CUI Makoto ANDO
Modified Edge Representation (MER) empirically proposed by one of the authors is the line integral representation for computing surface radiation integrals of diffraction. It has remarkable accuracy in surface to line integral reduction even for sources very close to the scatterer. It also overcomes false and true singularities in equivalent edge currents. This paper gives the mathematical derivation of MER by using Stokes' theorem; MER is not only asymptotic but also global approximation. It proves remarkable applicability of MER, that is, to smooth curved surface, closely located sources and arbitrary currents which are irrelevant to Maxwell equations.
The maximum likelihood estimate of a mixture model is usually found by using the EM algorithm. However, the EM algorithm suffers from a local optima problem and therefore we cannot obtain the potential performance of mixture models in practice. In the case of mixture models, local maxima often have too many components of a mixture model in one part of the space and too few in another, widely separated part of the space. To escape from such configurations we proposed a new variant of the EM algorithm in which simultaneous split and merge operations are repeatedly performed by using a new criterion for efficiently selecting the split and merge candidates. We apply the proposed algorithm to the training of Gaussian mixtures and the dimensionality reduction based on a mixture of factor analyzers using synthetic and real data and show that the proposed algorithm can markedly improve the ML estimates.
The interconnect analysis of on- and off-chips is very important in the design of high-speed signal processing, digital communication, and microwave electronic systems. When the interconnects are characterized by sampled data via electromagnetic analysis, the circuit-level simulation of the network requires rational approximation of the sampled data. Since the frequency band of the sampled data is more than 10 GHz, the rational function must fit into it at many frequency points. The rational function is approximated using the orthogonal least-squares method. With an increase in the number of the fitting data, the least-squares method suffers from a singularity problem. To avoid this, the sampled data are hierarchically approximated in this paper. Moreover, to reduce the computational cost of the circuit-level simulation, the parameter matrix of the interconnects is approximated by a rational matrix with one common denominator polynomial, and the selective orthogonalization procedure is presented.
Yasuyuki SAKAI Kouichi SAKURAI
We consider the performance of hyperelliptic curve cryptosystems over the fields Fp vs. F2n. We analyze the complexity of the group law of the jacobians JC(Fp) and JC(F2n) and compare their performance taking into consideration the effectiveness of the word size (32-bit or 64-bit) of the applied CPU (Alpha and Pentium) on the arithmetic of the definition field. Our experimental results show that JC(F2n) is faster than JC(Fp) on an Alpha, whereas JC(Fp) is faster than JC(F2n) on a Pentium. Moreover, we investigate the algorithm of the jacobian and the definition-field arithmetic to clarify our results from a practical point of view, with theoretical analysis.
Suomin CUI Ken-ichi SAKINA Makoto ANDO
Mathematical proof for the equivalent edge currents for physical optics (POEECs) is given for plane wave incidence and the observer in far zone; the perfect accuracy of POEECs for plane wave incidence as well as the degradation for the dipole source closer to the scatterer is clearly explained for the first time. POEECs for perfectly conducting plates are extended to those for impedance plates.
We review public-key cryptosystems from lattice problems, which are inspired by Ajtai's remarkable result, and consider their security from the point of view of both theory and practice. We also survey recent results on the power of the lattice reduction algorithm in cryptanalysis.
Toshinori MORI Masakatsu SENDA
Magnetic tape incorporating a soft magnetic alloy film has been developed to reduce the electromagnetic interference (EMI) noise current in an electrical cable. The advantage of the magnetic film compared to a ferrite core is shown using an eddy current loss model. The magnetic film exhibited the expected high-loss characteristics above 30 MHz. Laminated resin gives the tape sufficient strength to be wound inside a cable sheath. The fabricated 60- and 90-µm-thick tape wound along the whole cable length exhibited noise reduction ratios of 4 to 5 dB for both radiated emission in the range from 30 to 300 MHz, and surge immunity with a magnetic substance whose volume was one-sixth that of a conventional ferrite core. The tape also exhibited no significant degradation in the mechanical and environmental tests and showed the practical durability.
Kunihiro ASADA Makoto IKEDA Satoshi KOMATSU
This paper summarizes power reduction methods applicable for VLSI bus systems in terms of reduction of signal swing, effective capacitance reduction and reduction of signal transition, which have been studied in authors' research group. In each method the basic concept is reviewed quickly along with some examples of its application. A future perspective is also described in conclusion.
Ching-Yun LEE Yi-Shiung YEH Deng-Jyi CHEN Kuo-Lung KU
The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. Internet security has become an important issue for both academic and industrial sectors. Much related network security research has been conducted such as user authentication, data confidentiality, and data integrity. In some applications, a critical document can be divided into pieces and allocated in different locations over the Internet for security access concern. To access such an important document, one must reconstruct the divided pieces from different locations under the given Internet environment. In this paper, a probability model for reconstructing secret sharing and algorithms to perform share assignment are presented. Also, an evaluation algorithm to measure the probability of secret sharing reconstruction is proposed. Illustrative examples and simulation results are provided to demonstrate the applicability of our method.
Masahide NAKAMURA Tohru KIKUNO
Feature interaction detection determines whether interactions occur or not between the new and existing telecommunication services. Most of conventional detection methods on state transition model utilize an exhaustive search. The exhaustive search is fundamentally very powerful in the sense that all interactions are exactly detected. However, it may suffer from the state explosion problem due to the exponential growth of the number of states in the model when the number of users and the number of features increase. In order to cope with this problem, we propose a new detection method using a state reduction technique. By means of a symmetric relation, called permutation symmetry, we succeed in reducing the size of the model while preserving the necessary information for the interaction detection. Experimental evaluation shows that, for practical interaction detection with three users, the proposed method achieves about 80% reduction in space and time, and is more scalable than the conventional ones especially for the increase of the number of users in the service.
Seong Ill PARK So Ryoung PARK Iickho SONG Jooshik LEE Young-Sup JOO Dae Jin KIM
In this paper, we investigate an inherent noise reduction characteristic of a modulated orthogonal sequence. The modulated orthogonal sequence generates length N2 sequences from N information symbols. Using the amplitudes of received sequences, we first estimate the smallest amplitude noise. Then the noise is reduced by the proposed scheme. The noise reduction scheme is shown to have an excellent performance in non-Gaussian noise environment.
Yutaka JITSUMATSU Tetsuo NISHI
We consider a circuit composed of linear capacitors, nonlinear resistors, and dc voltage sources and show the possibility that the total energy dissipated at resistors in the above circuit is smaller than the energy stored at capacitors. Linear passive circuits cannot possess such a property.
Takahiro HOZUMI Osamu KAKUSHO Yutaka HATA
This paper shows the best operators for sum-of-products expressions. We first describe conditions of functions for product and sum operations. We examine all two-variable functions and select those that meet the conditions and then evaluate the number of product terms needed in the minimum sum-of-products expressions when each combination of selected product and sum functions is used. As a result of this, we obtain three product functions and nine sum functions on three-valued logic. We show that each of three product functions can express the same functions and MODSUM function is the most suitable for reduction of product terms. Moreover, we show that similar results are obtained on four-valued logic.
Osamu HOSHUYAMA Akihiko SUGIYAMA Akihiro HIRANO
This paper proposes a new robust adaptive beamformer applicable to microphone arrays. The proposed beamformer is a generalized sidelobe canceller (GSC) with a variable blocking matrix using coefficient-constrained adaptive filters (CCAFs). The CCAFs, whose common input signal is the output of a fixed beamformer, minimize leakage of the target signal into the interference path of the GSC. Each coefficient of the CCAFs is constrained to avoid mistracking. In the multiple-input canceller, leaky adaptive filters are used to decrease undesirable target-signal cancellation. The proposed beamformer can allow large look-direction error with almost no degradation in interference-reduction performance and can be implemented with a small number of microphones. The maximum allowable look-direction error can be specified by the user. Simulation results show that the proposed beamformer, when designed to allow about 20of look-direction error, can suppress interference by more than 17 dB.
We have investigated the operation of a reflection type magnetostatic wave signal-to-noise enhancer in detail. It has good enhancement characteristics, low insertion loss, and low operating power. It is also composed of a transducer using a ceramic substrate having a high dielectric constant and an LaGa-YIG film with low saturation magnetization to enable direct operation in the 400-MHz band (the IF band of current DBS receivers). Enhancement of 8 dB was achieved over a 40-MHz bandwidth. Although its operating frequency range depends critically on device temperature, we can compensate for the temperature dependence by adjusting the bias magnetic field. Experiments showed that the enhancer improved the received carrier-to-noise ratio by 2 to 3 dB, providing good noise reduction in DBS reception.
Mototaka KURIBAYASHI Masaaki YAMADA Hideki TAKEUCHI Masami MURAKATA
This paper describes an efficient SPICE netlist reduction method, which enables collective simulation of large circuits. The method reduces a SPICE netlist to only those devices which affect the simulation results. Parts of the netlist can be significantly reduced in size, with relatively discrepancies arising between the original SPICE simulation and the reduced SPICE simulation. The authors' reduction method is more general than previous works, since it reduces circuits using the features of MOS transistors. According to experimental results, reduction rates can range from 1/2 to 1/223. Depending on the reduction, the time taken time to run a SPICE simulation was reduced by between one and two oder of magnitude. Using this method and working on the reduced netlist, SPICE could even handle netlist for very large circuits which it could not ordinarily handle. The simulation error between the original SPICE simulation and the reduced SPICE simulation was about 3.5%.
A trinary-phased array, in which a phase quantization unit of phase shifters is 120 degrees is examined. The phase quantization unit of 120 degrees is the roughest value in practical phased array applications. Despite its rough phase quantization, the sidelobe level of less than -9 dB is attained by a genetic algorithm approach.
Minoru TOMISAKA Tomohiro YONEDA
In order to reduce state explosion problem, techniques such as symbolic state space traversal and partial order reduction have been proposed. Combining these two techniques, however, seems difficult, and only a few research projects related to this topic have been reported. In this paper, we propose handling single place zero reachability problem of Petri nets by using both partial order reduction and symbolic state space traversal based on ZBDDs. We also show experimental results of several examples.