Johannes KNEIP Matthias WEISS Wolfram DRESCHER Volker AUE Jurgen STROBEL Thomas OBERTHUR Michael BOLLE Gerhard FETTWEIS
This paper presents the HiperSonic 1, a multi-standard, application-specific signal processor, designed to execute the baseband conversion algorithms in IEEE802.11a- and HIPERLAN/2-based 5 GHz wireless LAN applications. In contrast to widely existing, dedicated implementations, most of the computational effort here was mapped onto a configurable, data- and instruction-parallel DSP core. The core is supplemented by mixed signal A/D, D/A converters and hardware accelerators. Memory and register architecture, instruction set and peripheral interfaces of the chip were carefully optimized for the targeted applications, leading to a sound combination of flexibility, die area and power consumption. The 120 MHz, 7.6 million-transistor solution was implemented in 0.18 µm CMOS and performs IEEE802.11a or HiperLAN/2 compliant baseband processing at data rates up to 60 Mbit/s.
Yoshiharu FUJISAKU Masatoshi KAGAWA Toshio NAKAMURA Hitoshi MURAI Hiromi T. YAMADA Shigeru TAKASAKI Kozo FUJII
40 Gbit/s optical transceiver using a novel OTDM MUX module has been developed. OTDM (Optical-Time-Division-Multiplexing) MUX module, the core component of the transmitter, consisted of a optical splitter, two electro-absorption (EA) modulators and a combiner in a sealed small package. As the split optical paths run through the "air" in the module, greatly stable optical phase relation between bit-interleaved pulses could be maintained. With the OTDM MUX module, the selection between conventional Return-to-Zero (conventional-RZ) format and carrier-suppressed RZ (CS-RZ) format is performed by slightly changing the wavelength of laser-diode. In a receiver, 40 Gbit/s optical data train is optically demultiplexed to 10 Gbit/s optical train, before detected by the O/E receiver for 10 Gbit/s RZ format. Back-to-back MUX-DEMUX evaluations of the transceiver exhibited good sensitivities of under -30 dBm measured at 40 Gbit/s optical input to achieve the bit-error-rate (BER) of 10-9. Another unique feature of the transceiver system was a spectrum switch capability. The stable RZ and CS-RZ multiplexing operation was confirmed in the experiment. Once we adjust the 40 Gbit/s optical signal to CS-RZ format, the optical spectrum would maintain its CS spectrum shape for a long time to the benefit of the stable long transmission characteristics. In the recirculating loop experiment employing the OTDM MUX transceiver, the larger power margin was successfully observed with CS-RZ format than with conventional-RZ format, indicating that proper encoding of conventional-RZ and CS-RZ was realized with this prototype transceiver. In the case of CS-RZ format, the error free (BER < 10-9) transmission over 720 km was achieved with the long repeater amplifier span of 120 km.
Patrick BRINDEL Bruno DANY Delphine ROUVILLAIN Bruno LAVIGNE Patricia GUERBER Elodie BALMEFREZOL Olivier LECLERC
In this paper, we review recent developments in the field of optical regeneration for both ultra long-haul transmission and terrestrial networking applications. Different techniques (2R/3R) using nonlinear properties of materials and/or devices are proposed such as saturable absorber or InP based interferometer structures showing regenerative capabilities. Principles of operation as well as system experiments are described.
In this paper we discuss how one can delegate his power to authenticate or sign documents to others who, again, can delegate the power to someone else. A practical cryptographic solution would be to issue a certificate that consists of one's signature. The final verifier checks verifies the chain of these certificates. This paper provides an efficient and provably secure scheme that is suitable for such a delegation chain. We prove the security of our scheme against an adaptive chosen message attack in the random oracle model. Though our primary application would be agent systems where some agents work on behalf of a user, some other applications and variants will be discussed as well. One of the variants enjoys a threshold feature whereby one can delegate his power to a group so that they have less chance to abuse their power. Another application is an identity-based signature scheme that provides faster verification capability and less communication complexity compared to those provided by existing certificate-based public key infrastructure.
Deukjo HONG Jaechul SUNG Shiho MORIAI Sangjin LEE Jongin LIM
In this paper, we discuss the impossible differential cryptanalysis for the block cipher Zodiac. The main design principles of Zodiac include simplicity and efficiency. However, the diffusion layer in its round function is too simple to offer enough security. The impossible differential cryptanalysis exploits such weakness in Zodiac. Our attack using a 14-round impossible characteristic derives the 128-bit master key of the full 16-round Zodiac faster than the exhaustive search. The efficiency of the attack compared with exhaustive search increases as the key size increases.
Kazumaro AOKI Tetsuya ICHIKAWA Masayuki KANDA Mitsuru MATSUI Shiho MORIAI Junko NAKAJIMA Toshio TOKITA
We present the new 128-bit block cipher called Camellia. Camellia supports 128-bit block size and 128-, 192-, and 256-bit key lengths, i.e. the same interface specifications as the Advanced Encryption Standard (AES). Camellia was carefully designed to withstand all known cryptanalytic attacks and even to have a sufficiently large security leeway. It was also designed to suit both software and hardware implementations and to cover all possible encryption applications that range from low-cost smart cards to high-speed network systems. Compared to the AES finalists, Camellia offers at least comparable encryption speed in software and hardware. An optimized implementation of Camellia in assembly language can encrypt on a Pentium III (1.13 GHz) at the rate of 471 Mbits per second. In addition, a distinguishing feature is its small hardware design. A hardware implementation, which includes encryption, decryption, and the key schedule for 128-bit keys, occupies only 9.66 K gates using a 0.35 µm CMOS ASIC library. This is in the smallest class among all existing 128-bit block ciphers. It perfectly meets the current market requirements in wireless cards, for instance, where low power consumption is essential.
Masayuki KANDA Tsutomu MATSUMOTO
This paper studies security of Feistel ciphers with SPN round function against differential cryptanalysis, linear cryptanalysis, and truncated differential cryptanalysis from the "designer's standpoint." In estimating the security, we use the upper bounds of differential characteristic probability, linear characteristic probability and truncated differential probability, respectively. They are useful to design practically secure ciphers against these cryptanalyses. Firstly, we consider the minimum numbers of differential and linear active s-boxes. They provide the upper bounds of differential and linear characteristic probability, which show the security of ciphers constructed by s-boxes against differential and linear cryptanalysis. We clarify the (lower bounds of) minimum numbers of differential and linear active s-boxes in some consecutive rounds of the Feistel ciphers by using differential and linear branch numbers, Pd, Pl, respectively. Secondly, we discuss the following items on truncated differential probability from the designer's standpoint, and show how the following items affect the upper bound of truncated differential probability; (a) truncated differential probability of effective active-s-box, (b) XOR cancellation probability, and (c) effect of auxiliary functions. Finally, we revise Matsui's algorithm using the above discussion in order to evaluate the upper bound of truncated differential probability, since we consider the upper bound of truncated differential probability as well as that of differential and linear probability.
A novel scheduling method for asynchronous multirate/multi-task processing by programmable digital signal processors (DSPs) has been developed. This mixed scheduling method combines static and dynamic scheduling, and avoids runtime overheads due to interrupts in context switching to realizes asynchronous multirate systems. The processing delay introduced when using static scheduling with static buffering is avoided by introducing deadline scheduling in the static schedule design. In the developed software design system, a block-diagram description language is extended to describe asynchronous multi-task processing. The scheduling method enables asynchronous multirate processing, such as arbitrary-sampling-ratio rate conversion, asynchronous interface, and multimedia applications, to be efficiently realized by programmable DSPs.
We propose a new and fast full search (FS) motion estimation algorithm for video coding. The computational reduction comes from sequential rejection of impossible candidates with derived formula and subblock norms. Our algorithm reduces more the computations than the recent fast full search (FS) motion estimation algorithms.
Makoto NAKASHIZUKA Hidetoshi OKAZAKI Hisakazu KIKUCHI
In this paper, a new image synthesis model based on a set of wavelet bases is proposed. In the proposed model, images are approximated by the sum of synthesis functions that are translated to image edge positions. By applying the proposed model to sketch-based image coding, no iterative image recovery procedure is required for image decoding. In the design of the synthesis functions, we define the synthesis functions as a linear combination of wavelet bases. The coefficients for wavelet bases are obtained from an iterative procedure. The vector quantization is applied to the vectors of the coefficients to limit the number of the synthesis functions. We apply the proposed synthesis model to the sketch-based image coding. Image coding experiments by eight synthesis functions and a comparison with the orthogonal transform methods are also given.
Sungjae KIM Hyungwoo LEE Juho KIM
We present an efficient heuristic algorithm to reduce glitch power dissipation in CMOS digital circuits. In this paper, gate sizing is classified into three types and the buffer insertion is classified into two types. The proposed algorithm combines three types of gate sizing and two types of buffer insertion into a single optimization process to maximize the glitch reduction. The efficiency of our algorithm has been verified on LGSynth91 benchmark circuits with a 0.5 µm standard cell library. Experimental results show an average of 69.98% glitch reduction and 28.69% power reduction that are much better than those of gate sizing and buffer insertion performed independently.
A 2D photonic crystal surface-emitting laser using a triangular lattice is developed, and current-injected lasing oscillation is demonstrated. From consideration of the Bragg diffraction condition in the 2D triangular-lattice structure, it is shown that the 2D coupling phenomenon occurs in the structure. As a result of the 2D periodicity of the structure, the longitudinal mode and lateral mode can be controlled, and stable single-mode oscillation is possible over a large 2D area. The lasing mode of the structure is analyzed by calculating the photonic band diagram by the 2D plane-wave expansion method, and we show that four band edges at which the lasing oscillation can occur exist at the Γ point. Current-injected lasing oscillation is successfully demonstrated at room temperature under pulsed conditions. The threshold current density is 3.2 kA/cm2 and the lasing wavelength is 1.285 µm. From the near-field and far-field patterns, it is shown that large-area 2D (diameter 480 µm) lasing oscillation occurs in the device and the divergence angle is very narrow (less than 1.8). We also demonstrate the correspondence between the measured lasing wavelengths and calculated band diagram by comparing the polarization characteristics with the calculated distribution of the electromagnetic field. The results indicate that 2D coherent lasing oscillation occurs due to the multi-directional coupling effect in the 2D photonic crystal. Finally, we show that the polarization patterns of the lasers can be controlled by introducing artificial lattice defects from the theoretical calculation.
At present, the global Internet consists of many ASes. Each AS pays a pre-determined connection fee to another AS for connecting its network with that AS's network. The connection fee type charging may be rational in case of transferring the best-effort type traffic. However, usage charging is necessary to transferring the resource guaranteed type traffic such as the Intserv traffic and the Diffserv traffic. In this case, each AS pays a per-flow fee to another AS every time it routes a flow into another AS. The per-flow fee paid by each AS becomes a part of the cost for that AS. Thus, each AS needs to select a route with the lowest price to improve its own profit. In this paper, we call such an inter-AS routing scheme a price-based inter-AS routing scheme. When each AS has a request to route an inter-AS flow, it can select an inter-AS route with the lowest price to improve its own profit by this routing scheme. Cost-dependent pricing scheme is suitable for the price-based inter-AS routing scheme because it can reduce frequency of price information exchange between ASes. However, in the cost-dependent pricing scheme, profit in each AS depends on the distribution of path costs in that AS. Generally, ASes with narrow ranges of path costs cannot obtain sufficient profits compared to ASes with wide ranges of path costs. Thus, we propose a routing policy for ASes with narrow ranges of path costs to improve their profits efficiently and evaluate its effect using a simple routing model.
We propose a call admission control (CAC) scheme for the reverse link of direct sequence-code division multiple access (DS-CDMA) systems with multi-class traffic, in which the admissibility of the set of requested channels is decided by checking the outage probability of the total composite power at a cell-site receiver. The reverse link capacities under various traffic conditions are evaluated. From numerical results, we see that the proposed scheme can utilize a given radio resource more effectively as compared with the existing scheme using constraints on the individual power levels.
Masaharu HYODO Kazi SARWAR ABEDIN Noriaki ONODERA Kamal K. GUPTA Masayoshi WATANABE
Fourier synthesis of ultrafast optical-pulse trains was demonstrated using a simplified experimental configuration consisting of three independent continuous-wave lasers and a semiconductor optical amplifier (SOA) used as a four-wave mixer. When the three lasers were phase-locked, ultrafast optical-pulse trains were successfully generated at repetition frequencies ranging from 504 GHz to 1.8 THz with high waveform stability.
Chik-How TAN Xun YI Chee-Kheong SIEW
In this paper, we propose a new digital signature scheme based on a third order linear feedback shift register for signing documents. This signature scheme is different from most of the signature schemes that are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. An efficient algorithm for computing kth term of a sequence is also presented. The advantage of this scheme is that the computation is efficient than Schnorr scheme. We also show that the security of the proposed signature scheme is equivalent to that of Schnorr signature scheme.
Seiya UCHIDA Kiichi GOTO Akira TACHIKAWA Keiji IRAMINA Shoogo UENO
The purpose of our study is to estimate the imaging of ischemic myocardial muscles in rats. The magnetocardiograms (MCG) of rats were measured by a 12-channel high resolution gradiometer, which consisted of 5 mm diameter pick-up coils with a 7.5 mm distance between each coil. MCGs of seven male rats were measured in a magnetically shielded room pre and post coronary artery occlusion. The source imaging was estimated by minimum norm estimation (MNE). Changes of the current source imaging pre- and post coronary artery occlusion were clarified. As a result, in the ST segment, the current distribution significantly increased at the ischemic area. In the T wave, the direction of the current distribution clearly shifted to the left thorax. We proved that the increased area of the current distribution in the ST segment was related to the ischemic area of the ventricular muscles.
Hassan ABOLHASSANI Hui CHEN Zenya KOONO
This paper reports on clich
Michio MIYAKAWA Kentaroh ORIKASA Mario BERTERO
In Chirp-Pulse Microwave Computed Tomography (CP-MCT) the images are affected by the blur which is inherent to the measurement principle and is described by a space-variant Point Spread Function (PSF). In this paper we investigate the PSF of CP-MCT including the space dependence both experimentally and computationally. The experimental evaluation is performed by measuring the projections of a target consisting of a thin low-loss dielectric rod surrounded by a saline solution and placed at various positions in the measuring region. On the other hand, the theoretical evaluation is obtained by computing the projections of the same target via a numerical solution of Maxwell's equations. Since CP-MCT uses a chirp signal, the numerical evaluation is carried out by the use of a FD-TD method. The projections of the rod could be obtained by computing the field during the sweep time of the chirp signal for each position of the receiving antenna. Since this procedure is extremely time consuming, we compute the impulse response function of the system by exciting the transmitting antenna with a wide-band Gaussian pulse. Then the signal transmitted in CP-MCT is obtained by computing the convolution product in time domain of the input chirp pulse with the impulse response function of the system. We find a good agreement between measured and computed PSF. The rationality of the computed PSF is verified by three distinct ways and the usefulness of this function is shown by a remarkable effect in the restoration of CP-MCT images. Knowledge on the space-variant PSF will be utilized for more accurate image deblurring in CP-MCT.
Atsushi MYOJOYAMA Tsuyoshi YAMAMOTO
We propose new lossless medical image compression method based on hierarchical sorting technique. Hierarchical sorting is a technique to achieve high compression ratio by detecting the regions where image pattern varies abruptly and sorting pixel order by its value to increase predictability. In this method, we can control sorting accuracy along with size and complexity. As the result, we can reduce the sizes of the permutation-tables and reuse the tables to other image regions. Comparison using experimental implementation of this method shows better performance for medical image set measured by X-ray CT and MRI instruments where similar sub-block patterns appear frequently. This technique applies quad-tree division method to divide an image to blocks in order to support progressive decoding and fast preview of large images.