RC6 is a common-key block cipher that was proposed as one of the AES candidates. Although any weakness of RC6 in the use of the confidentiality is not known, Saarinen pointed out the existence of almost equivalent keys in RC6 with 176-byte keys. This means that the Davies-Meyer hash function based on RC6 with 176-byte keys is not a good collision-resistance function. However, Saarinen could not find a precise collision of it. In this paper, we propose a practical method for obtaining a collision of the Davies-Meyer hash function based on RC6-32/20/176. In other words, there exist equivalent user supplied keys in RC6-32/20/176, and it is possible to obtain them practically. This means that the essential key space of RC6-32/20/176 is smaller than the space provided by 176-byte keys. Our computer simulation shows that a collision can be found in about 100 minutes. We should notice that the result of this paper does not affect the security of the AES version of RC6 because RC6-32/20/176 discussed in this paper is different from the parameter of the AES version.

We study the reliability functions or the minimum r-achievable rates of the lossless coding for the general sources in the sense of Han-Verdu, where r means the exponent of the error probability. Han has obtained formulas for the minimum r-achievable rates of the general sources. Our aim is to give alternative expressions for the minimum r-achievable rates. Our result seems to be a natural extension of the known results for the stationary memoryless sources and Markov sources.

The even-odd transform (EOT) converts a complex sequence set into another one with even and odd correlation distributions exchanged. The Fukumasa-Kohno-Imai transform (FKIT) converts a real-valued sequence set into a complex one with improved generalized even-odd-equivalent (EOE) correlation distributions. In this work, the EOT is generalized for asynchronous M-PSK/CDMA. A subclass of the generalized EOTs coincides with the FKITs. New bounds on the correlation gains achievable by the FKITs are then derived.

The temperature compensation technique of InGaP/GaAs power heterojunction bipolar transistor (HBT) with novel bias circuit using Schottky diodes has been developed. The variation in the quiescent current to the temperature is less than 30% from -30C to 90C by this technique, where that is about 125% by the conventional bias circuit. The RF performance of the power HBT MMIC with novel bias circuit shows flat temperature characteristics enough to be used for power application of wireless communications.

A periodic approach introduced previously is applied to the TM wave scattering from a finite periodic surface. A mathematical relation is proposed to estimate the scattering amplitude from the diffraction amplitude for the periodic surface, where the periodic surface is defined as a superposition of surface profiles generated by displacing the finite periodic surface by every integer multiple of the period . From numerical examples, it is concluded that the scattering cross section for the finite periodic surface can be well estimated from the diffraction amplitude for a sufficiently large .

Successful e-commerce presupposes techniques by which autonomous trading entities can interoperate. Although progress has been made on data exchange and payment protocols, interoperation in the face of autonomy is still inadequately understood. Current techniques, designed for closed environments, support only the simplest interactions. We develop a multiagent approach for interoperation of business process in e-commerce. This approach consists of (1) a behavioral model to specify autonomous, heterogeneous agents representing different trading entities (businesses, consumers, brokers), (2) a metamodel that provides a language (based on XML) for specifying a variety of service agreements and accommodating exceptions and revisions, and (3) an execution architecture that supports persistent and dynamic (re)execution.

In this paper, we propose a new type of hybrid ARQ protocol, in which a channel-adaptive variable rate channel coding scheme is combined with a multi-copy retransmission strategy so as to enhance the system performance under the delay constraint of real-time ATM services in broadband radio access networks. The main feature of a multi-copy retransmission strategy in this scheme is to improve the average throughput for a given Forward Error Correction (FEC) rate, subject to the prescribed cell loss requirement of the real-time wireless ATM services, while augmenting the reliability of channel state information required for a channel-adaptive FEC scheme. Our analysis shows that under a harsh fading channel, the proposed approach is useful for achieving the prescribed cell loss performance without significantly degrading the average throughput performance.

This paper describes an electromagnetically coupled microstrip divider that provides high output port isolation and DC cutting. The device consists of a parasitic resonator placed above microstrip patch resonators, achieving tight coupling for both input and output ports. FDTD simulation and measurements reveal that the device has a high isolation between output ports. Equal and unequal 2-way and 3-way power dividers are presented in this paper.

Today, people want highly-customized products to satisfy their individual requirements. However traditional manufacturing technology is not geared towards high-mix, low-volume manufacturing. Holonic Manufacturing Systems (HMS) is a new paradigm to bridge this divide. HMS offers enterprises a new breed of technology to continuously reconfigure themselves to manufacture a larger variety of products in smaller batch sizes, and do this profitably. A suitable metaphor for implementing the holonic manufacturing system is the emerging IEC function block architecture. The paper describes how function blocks can be used to build such holonic manufacturing systems. We also illustrate the merits of our approach through a real-world engine assembly line being developed by DaimlerChrysler.

A method is described that can allocate bandwidth to each user flow fairly in a scalable network architecture such as differentiated services architecture. As promising queueing techniques for providing differentiated services, class-based packet scheduling and selective packet discarding have been attracting attention. However, if we consider that bandwidth should be allocated to each flow in a weighted manner, the parameters used in these methods such as the weight assigned to each class queue should be pre-determined appropriately based on an assumption about the number of flows in each class. Thus, when the actual traffic pattern differs from the assumed one, they may not work well. Instead of assuming the traffic conditions, our method estimates the number of active flows in each class by simple traffic measurement and dynamically changes the weight assigned to each class queue based on the estimated number. Our method does not need to maintain the per-flow state, which gives it scalability. Simulation showed that this method is effective under various patterns of the number of active flows.

Before we gave a fast generalized minimum distance (GMD) decoding algorithm for one-point algebraic-geometry (AG) codes. In this paper, we propose another fast GMD decoding algorithm for these codes, where the present method includes an erasure deletion procedure while the past one uses an erasure addition procedure. Both methods find a minimal polynomial set of a given syndrome array, which is a candidate for an erasure-and-error locator polynomial set constrained with an erasure locator set of each size. Although both erasure addition and deletion GMD decoding algorithms have been established for one-dimensional algebraic codes such as RS codes, nothing but the erasure addition GMD decoding algorithm for multidimensional algebraic codes such as one-point AG codes have been given. The present erasure deletion GMD decoding algorithm is based on the Berlekamp-Massey-Sakata (BMS) algorithm from the standpoint of constrained multidimensional shift register synthesis. It is expected that both our past and present methods play a joint role in decoding for one-point AG codes up to the error correction bound.

A new architecture and methods for an enhanced autonomous decentralized production system (EADPS) are described. This EADPS was developed to ensure high flexibility of production systems consisting of intelligent devices based on the autonomous decentralized system model and to guarantee the time used for communication to simultaneously maintain high productivity. The system architecture of the EADPS guarantees the time by managing groups of nodes and the priorities in these groups. A bit-arbitration method is used to prevent collision of messages. The nodes autonomously check the waveforms in the network and terminate transmission when the nodes with a higher priority are transmitting. A parallel-filtering method is used to speed up message acceptance. The nodes check the identifiers of the messages using parallel-filtering circuits and each node determines autonomously where a message should be accepted or not. Implementing the system architecture and these methods as circuits and integrating the circuits into a chip using system LSI technologies resulted in low-cost implementation of the system. Experimental evaluation demonstrated the effectiveness of this system.

This paper introduces a new digital ATC (Automatic Train Control device) system. In the current ATC, the central ATC logic device calculates permissive speed of each blocking section and controls speed of all trains. On the other hand, in the new digital ATC, the central logic controller calculates each position to which a train can move safely, and sends the information on positions to all trains. On each train, the on-board equipment calculates an appropriate braking pattern with the information, and controls velocity of the train. That is, in the new system, the device on each train autonomously calculates permissive speed of that train. These special features realize ideal speed control of each train making full use of its performance for acceleration and deceleration, which in turns allows high-density train operations.

This paper presents improved versions of three-stage positive-output and two-stage negative-output Dickson charge-pump circuits which are intended to replace switching regulators in video-product CCD driver applications (where 12 V and -6.5 V are needed), and are designed and fabricated in a custom CMOS process. From a power supply Vdd of 4.0 to 5.5 V, the positive charge pump generates a positive output voltage of greater than 3.9Vdd, while the negative charge pump generates a negative voltage of greater than -1.9Vdd, both with efficiencies of greater than 94% at 2 mA output currents.

This document analyzes the characteristics of Waiting Time Jitter (WTJ) generated in High-bit-rate Digital Subscriber Lines (HDSL) systems transmitting non-uniform frames. It also derives the Fourier transform of the above WTJ.

The present paper treats the analysis and design method of the (H)NRD guide and E-plane rectangular waveguide integrated structures on the basis of the transverse resonance technique. The analysis is made by assuming a resonant cavity short-circuited at appropriate reference planes and considering the cavity as a waveguide discontinuity problem in the transverse direction. The resonant lengths are determined from the transverse equivalent circuit, and the scattering parameters are calculated from the lengths. We analyze (H)NRD discontinuities and design two types of HNRD guide to E-plane waveguide transitions and a directional coupler composed of HNRD and E-plane waveguide. The theoretical results are in good agreement with results calculated by an EM-simulator.

Using a point matching method, we have numerically analyzed resonance frequencies and unloaded Q factor of whispering gallery modes in a millimeter wave region that are well known as an intrinsic mode of a dielectric disk resonator. We express field distributions of the resonance modes by a summation of spherical waves. Tangential electromagnetic fields inside the disk are matched to those outside the disk at appropriate matching points on a boundary. As the result, a 4N 4N (N; number of matching points) determinant is derived as an eigenvalue equation of the disk resonator. Since elements of the determinant are complex numbers, a complex angular frequency is introduced to make a value of the determinant zero. For a location of the matching points, we also introduce a new technique which is derived from a field expression of the whispering gallery modes. Since an azimuthal angle dependence of the field distributions with a resonance mode number m is presented by the associated Legendre function Pnm(cos θ), we define abscissas θi of the matching points as solutions of Pm+2N-1m (cos θ) = 0. Considering the field symmetry, we also modify the eigenvalue equation to a new eigenvalue equation which is expressed (4N - 2) (4N - 2) determinant. From the results of our numerical analysis, we can find that the resonance frequencies and unloaded Q factor well converge for number of matching points N. A comparison of numerical results and experimental ones, in a millimeter wave band (50 - 100 GHz), shows a good agreement with each other. It is found that our analysis is effective for practical use in the same wave band.

Reliability-based decoding algorithm in multistage decoding of multilevel codes is discussed. Through theoretical analyses, effects of soft reliability information are examined for different types of partitionings.

Simulation based education and training, especially wargame simulations, are being used widely in the field of defense modeling and in simulation communities. In order to efficiently train students and trainees, the wargame simulations must have both high performance and high fidelity. In this paper, we discuss design and implementation issues for a prototype of a parallel and distributed wargame simulation system. This wargame simulation system is based on High Level Architecture (HLA) and employs some optimization to achieve both high performance and high fidelity in the simulation system. The results show that the proposed optimization method is effective when optimization is applied to 93.5% or less of the moving objects (PFs) within the range of detection (RofD) of both the red and blue teams. Specifically, when each team has 1000 PFs we found that if the percentage of PFs within RofD is less than 50% for both teams, our method is over two times better than for the situation where there is no optimization.

We consider iterative soft-decision decoding algorithms in which bounded distance decodings are carried out with respect to successively selected input words, called search centers. Their error performances are degraded by the decoding failure of bounded distance decoding and the duplication in generating candidate codewords. To avoid those weak points, we present a new method of selecting sequences of search centers. For some BCH codes, we show the effectiveness by simulation results.