This paper evaluate the performance of a PN (pseudonoise) code acquisition for a direct-sequence/code-division-multiple-access (DS/CDMA) system in a mobile satellite environment. The acquisition scheme considered consists of a parallel matched-filter and a FFT processor. The uplink of mobile satellite channel is modeled as shadowed Rayleigh fading channel. The effects of power control error and shadowing are considered in the analysis of acquisition performance. It is shown that the power control error causes acquisition to be slower than the case of perfect power control, and for high SNR/chip, the effect of power control error becomes less significant. It is also shown that the case with heavy shadowing takes longer time to achieve acquisition than that with light shadowing. For the subinterval-based PN code search, the parallel MF scheme is thought to be more appropriate than the serial MF scheme at the cost of complexity. The analysis in the paper can be applied to the uplink of a DS/CDMA system for packet-type services in a mobile satellite channel.
Wen-Shenq JUANG Chin-Laung LEI
In this paper, we propose a practical and secure electronic voting scheme which meets the requirements of large scale general elections. This scheme involves voters, the administrator or so called the government and some scrutineers. In our scheme, a voter only has to communicate with the administrator three times and it ensures independence among voters without the need of any global computation. This scheme uses the threshold cryptosystem to guarantee the fairness among the candidate's campaign and to provide mechanism for achieving the function that any voter can make an open objection to the tally if his vote has not been published. This scheme preserves the privacy of a voter against the administrator, scrutineers, and other voters. Completeness, robustness, and verifiability of the voting process are ensured and hence no one can produce a false tally, corrupt or disrupt the election.
Toyohisa TANAKA Ryu MIURA Yoshio KARASAWA
We have proposed a digital beamforming (DBF) self-beam-steering array antenna which features maximal ratio combining enabling it to efficiently use the received power or to rapidly track the desired signal. The DBF self-beam-steering array antenna utilizes digital signal processing with an active array antenna configuration. ASIC implementation of the digital signal processor is inevitable for DBF antenna application in practical mobile communications environments. In this paper, we present a scheme for implementing a digital signal processor in ASICs using ten FPGAs (Field Programmable Gate Arrays) for the DBF self-beam-steering array antenna. Results of some experiments obtained in a large radio anechoic chamber are shown to confirm a basic function of the system.
Eisuke NIHEI Takaaki ISHIGURE Norihisa TANIO Yasuhiro KOIKE
The status of the plastic optical fiber (POF) for high-speed data communication is described. Very recently, the low-loss and high-bandwidth perfluorinated GI POF which has no serious absorption loss from visible to 1.3-µm wavelength was successfully prepared at Keio University. Since the core diameter (300-1000 µm) of the GI POF is much larger than that of the multimode silica fiber (62.5 µm), the serious modal noise in the conventional multimode silica fiber was virtually eliminated, resulting in stable giga bit order data transmission with inexpensive couplers and connectors.
Michael J. ROBERTSON Ian F. LEALMAN John V. COLLINS
At present, the widespread use of optoelectronic components is restricted by their high cost. Up to 90% of the cost of a semiconductor laser is in the packaging, with the fibre-chip alignment the major part. In this paper, an approach to low cost packaging is described, which uses an integrated mode size transformer to match the laser output to the fibre mode. This improves the alignment tolerance of the laser-fibre coupling by more than a factor of three, allowing simple passive alignment approaches to be used. It requires only minor modification to the processing of a standard buried heterostructure laser, and allows the coupling efficiency to be optimised without compromising the performance of the laser. The design of a silicon submount for passive laser-fibre alignment is described and coupling losses as low as 1.2 dB to standard cleaved single mode fibre are reported. The technology that has been developed is generic and its successful application to other optoelectronic devices such as fibre grating lasers, semiconductor optical amplifiers and laser arrays is described.
Takakazu SATOH Kiyomichi ARAKI
We review a fundamental weak point of the OSS digital signature scheme against cryptanalysis by Pollard et al., and propose a new scheme of digital signature which overcomes this defect. More specifically, instead of the ring of the rational integer, we use the ring of integral quaternions, which is a non-commutative Euclidean ring. Known attacks to OSS signature do not work our scheme due to the non-commutativity. On the other hand, this scheme causes little increase in the burden of generation and verification of digital signature for the legitimate users, with respect to the original OSS scheme.
Hiroyuki MORIKAWA Yoshiyuki MIZUI Moriyuki MIZUMACHI
Periodic reservation allows periodic and random packets to share the same satellite random access channel efficiently. The periodic reservation protocol is particularly suitable for mobile satellite position reporting services, where some of the information messages, such as dispatch function, are classified as "periodic" and others, such as signaling, are classified as "random." When a new mobile terminal logs on to the system, Network Management Center (NMC) reserves subsequent time slots for transmitting periodic packets without contention. A mobile terminal recognizes each time slot as "reserved" or "unreserved (available)" according to the broadcast message received from NMC. Other random packets use the slotted ALOHA protocol to contend with other mobile terminals for an unreserved time slot. The performance results suggest that the use of the periodic reservation protocol can be regarded as a viable solution for mobile satellite position reporting services such as automatic dependent surveillance (ADS).
NPO-PB is the class of NP optimization problems with polynomially bounded values. In this paper we provide a new characterization for the class: That is, NPO-PB = MIN Σ0. This result shows that quantifiers are not relevant in characterizing approximability for minimization problems, unlike maximization problems. In proving the result, we develop a generic reduction, which combines maximization and minimization problems. Based on the new characterization, several problems are shown to be NPO-PB-complete. All of these problems are shown to be hard to approximate and tighter bounds are given.
In this paper we discuss the limiting behavior of the search direction of the steepest descent method in minimizing the Rayleigh quotient. This minimization problem is equivalent to finding the smallest eigenvalue of a matrix. It is shown that the search direction asymptotically alternates between two directions represented by linear combinations of two eigenvectors of the matrix. This is similar to the phenomenon in minimizing the quadratic form. We also show that these eigenvectors correspond to the largest and second-smallest eigenvalues, unlike in the case of the quadratic form.
Osamu YAMANAKA Hiromitsu OHMORI Akira SANO
For finite Volterra series systems, this paper investigates the stability of the exact model matching (EMM) control we have already presented. First, in order to analyze the stability of the EMM system, we present modified small gain theorems depending on the magnitude of the external input (s) in the cases of one input and two inputs. Next, with the help of the theorem for feedback systems with two inputs, we clarify the condition under which the control system is stable for the reference input magnitude within a certain range, and is also robust for small disturbances. The modified small gain theorems are effective for the stability analysis of the nonlinear feedback control systems which do not have affine finite gain.
Choong Ho LEE Masayuki KAWAMATA Tatsuo HIGUCHI
Roundoff error due to iterative computation with finite wordlength degrades the quality of decoded images in fractal image coding that employs a deterministic iterated function system. This paper presents a state-space approach to roundoff error analysis of fractal image coding for grey-scale images. The output noise variance matrix and the noise matrix are derived for the measures of error and the output noise variance is newly defined as the pixel mean of diagonal elements of the output noise matrix. A quantitative comparison of experimental roundoff error with analytical result is made for the output noise variance. The result shows that our analysis method is valid for the fractal image coding. Our analysis method is useful to design a real-time and low-cost decoding hardware with finite wordlength for fractal image coding.
Takayuki NAKACHI Katsumi YAMASHITA Nozomu HAMADA
The present paper examines a two-dimensional (2-D) joint-process lattice estimator and its implementation for image restoration. The gradient adaptive lattice (GAL) algorithm is used to update the filter coefficients. The proposed adaptive lattice estimator can represent a wider class of 2-D FIR systems than the conventional 2-D lattice models. Furthermore, its structure possesses orthogonality between the backward prediction errors. These results in superior convergence and tracking properties versus the transversal and other 2-D adaptive lattice estimators. The validity of the proposed model for image restoration is evaluated through computer simulations. In the examples, the implementation of the proposed lattice estimator as 2-D adaptive noise cancellator (ANC) and 2-D adaptive line enhancer (ALE) is considered.
Achim GOTTSCHEBER Akinori NISHIHARA
This paper is concened with the design and implementation of a 2-channel, 2-dimensional filter bank using rectangular (analog/digital) and quincunx (digital/digital) sampling. The associated analog low-pass filters are separable where as the digital low-pass filters are non-separable for a minimum sampling density requirement. The digital low-pass filters are Butterworth type filters, N = 9, realized as LWDFs. They, when itterated, approximate a valid scaling function (raised-consine scaling function). The obtained system can be used to compute a discrete wavelet transform.
Achim GOTTSCHEBER Akinori NISHIHARA
In this paper, new wavelet bases are presented. We address problems associated with the proposed matched filter in multirate systems, using an optimum receiver that maximises the SNR at the sampling instant. To satisfy the Nyquist (ISI-free transmission) and matched filter (maximum SNR at the sampling instant) criteria, the overall system filtering strategy requires to split the narrowest filter equally between transmitter and receiver. In data transmission systems a raised-cosine filter is therefore often used to bandlimit signals from which wavelet bases are derived. Sampling in multiresolution subspaces is also discussed.
Kensei OIMATSU Shizuma YAMAGUCHI Kazuoki KURAMOTO Shin'ya KUWAHARA
For designing the underwater transmission system using directly projected audible sound by underwater loudspeaker to prevent a diving accident and/or to give a working instrucion, it is important to estimate the transmission loss for a wall not onl for pure tones but also for wideband signal such as voice and noise. In this paper, two practical methods of evaluating the underwater insulation effect for a single wall are discussed. One is a reconfirmation that the mass law which is frequently used in air still explains the transmission loss in water. Because parameters such as surface density and sound velocity in the mass law are widely changeable depending on the depth in water, much complexity is involved in preparing a theoretical curve for every parameter. So to avoid such complexity, a unified parameter Φ(=ωm cos θ/2ρc) is introduced to describe the mass law. This newly presented curve as a function of Φ is in good agreement with all rearranged experimental data for every kind of plates. The other is a proposition of new evaluating method of insulation effect of a wall for a wideband signal, using an idea of (100-α) percentage point of the noise level probability destribution, Lα. Firstly proposed method is confirmed experimentally and secondly proposed method is confirmed by a simulation experiment.
Koji OKADA Wakaha OGATA Keiichi SAKANO Kaoru KUROSAWA
Lower bounds on the size of shares |Vi| which are more tight than |Vi>| |S| is the size of the secret, are known only for some graphical access structures. This paper shows lower bounds on |Vi| greater than |S| for some non-graphical access structures Γ. We first prove that if {P1, Pi} Γ-for any Pi P^ = {P2, , Pn} and Γ ^= 2P^ Γ is the access structure of a (k, n-1) -threshold scheme on P^, thenmaxilog|Vi>| n+k-3/n-1 log|S|for Pi {P1, P2, , Pn}. Next, we show that maxilog |Vi| 1.5log |S| holds for a wider class of access structures.
Shiho MORIAI Kazumaro AOKI Kazuo OHTA
In estimating the vulnerability of a block cipher to differential cryptanalysis and linear cryptanalysis, we must consider the fact that the differential probability and the linear probability vary with the key. In the case of cryptosystems where the round key is XORed to the input data of each round, the difference in both types of probability with different keys is regarded as negligible. However, this is not the case with RC5. This paper makes a primary analysis of the key-dependency of linear probability of RC5. Throughout this paper we study "precise" linear probability. We find some linear approximations that have higher deviation (bias) for some keys than the "best linear approximation" claimed by Kaliski and Yin in CRYPTO'95. Using one linear approximation, we find 10 weak keys of RC5-4/2/2 with linear probability 2-1, 2 weak keys of RC5-4/5/16 with linear probability 2-2, and a weak key of RC5-16/5/16 with linear probability 2-15.4, while Kaliski-Yin's "best biases" are 2-3, 2-9, and 2-17, respectively.
Nyberg and Knudsen proved that the maximum average of differential probability (ADPmax) and the maximum average of linear probability (ALPmax) of Feistel cipher with over 4 rounds can be evaluated as ADPmax 2DCP2max and ALPmax 2LCP2max using the maximum of defferential characteristic probability (DCPmax) and the maximum of linear characteristic probability (LCPmax) per round. This paper shows ADPmax DCP2max and ALPmax LCP2max if the F function is a bijection and the Feistel cipher has more than 3 rounds. The results prove that Feistel ciphers are stronger against differential and linear cryptanalyses than previously thought. Combining this result with that of Luby and Rackoff, the implication is that the 3-round Feistel cipher could be used as a building block cipher for the construction of provable secure block cipher algorithm.
Noriyoshi ITAZAKI Yasutaka IDOMOTO Kozo KINOSHITA
With the scale-down of VLSI chip size and the reduction of switching time of logic gates, crosstalk faults become an important problem in testing of VLSI. For synchronous sequential circuits, the crosstalk pulses on data lines will be considered to be harmless, because they can be invalidated by a clocking phase. However, crosstalk pulses generated on clock lines or reset lines will cause an erroneous operation. In this work, we have analyzed a crosstalk fault scheme, and developed a fault simulator based on the scheme. Throughout this work, we considered the crosstalk fault as unexpected strong capacitive coupling between one data line and one clock line. Since we must consider timing in addition to a logic value, the unit delay model is used in our fault simulation. Our experiments on some benchmark circuits show that fault activation rates and fault detection rates vary widely depending on circuit characteristics. Fault detection rates of up to 80% are obtained from our simulation with test vectors generated at random.
Eun Mi KIM Shinji KUSUMOTO Tohru KIKUNO
In this paper, we present a first step for developing a method of verifying both safety and correctness of object-oriented design specification. At first, we analyze the discrepancies, which can occur between requirements specification and design specification, to make clear target faults. Then, we propose a new design review method which aims at detecting faults in the design specification by using three kinds of information tables. Here, we assume that component library, standards for safety and design specification obtained from the Booch's object-oriented design method are given. At the beginning, the designers construct a design table based on a design specification, and the verifiers construct a correctness table and a safety table from component library and standards for safety. Then, by comparing the items on three tables, the verifiers review a given design specification and detect faults in it. Finally, using a small example of object-oriented design specification, we show that faults concerning safety or correctness can be detected by the new design review method.