Toshifumi NAKATANI Toru MATSUURA Koichi OGAWA
A simple method has been proposed for the measurement of the output power and phase characteristics of the 3rd-order inter-modulation distortion (IM3) components appearing in multistage power amplifiers. By adopting a unique definition of the phase for the IM3 components that is independent of the delay time caused by transmission lines and other instrument devices, it is possible to measure the phase, merely by using a vector signal analyzer. It is demonstrated that an accurate estimation of the IM3 characteristics of two-stage cascaded power amplifiers for cellular radio handheld terminals can be made by using the IM3 characteristics of the 1st and 2nd-stage amplifiers as measured by the proposed method. The results indicate that it is possible to reduce the dissipation power by 18% at 28 dBm RF output power with respect to conventional measurement methods. Further studies show that the error in the resultant vector of the estimated IM3 is less than 1 dB, when the asymmetry characteristics of the IM3 sidebands in the 2nd-stage amplifier are less than 7.3%.
Futoshi TASAKI Fumito UTA Hiroshi TAMURA Masakazu SENGOKU Shoji SHINODA
Recently, the mulitihop wireless network system attracts the interest of many people as a communication network system of the next generation. The multihop wireless network has unique features in which neither base stations nor wired backbone networks are required and a terminal can communicate with the other terminal beyond the transmission range by multihopping. In this network, a communication link between two terminals which can communicate directly is required a channel. Since cochannel interference may occur, we need to assign channels to communication links carefully. In this paper, we describe a channel assignment strategy which takes the degree of cochannel interference into consideration, and we evaluate an effectiveness of this strategy by computer simulations. We show that this strategy is more effective than a strategy which does not take the degree of cochannel interference into consideration. And we also consider a few channel assignment algorithms briefly.
In this paper, the design of signature waveforms for asynchronous CDMA systems equipped with a correlation receiver is first considered. Optimal signature waveforms that minimize the average multiple access interference (MAI) at the output of a correlation receiver are found, while satisfying the constraint on available transmission bandwidth. Comparison to signature waveforms previously obtained for synchronous systems is also made to justify the superior performance of the designed signature waveforms in asynchronous systems. Furthermore, for direct-sequence CDMA (DS-CDMA) systems with random signature sequences, the use of multiple chip waveforms is also proposed as a means of suppressing MAI. Bandwidth constrained multiple chip waveforms that maximize the signal-to-interference ratio (SIR) at the output of each correlation receiver are found. Numerical results show that by using double chip waveforms instead of a single chip waveform, it is possible to reduce the MAI by 10% for a fixed transmission bandwidth (or equivalently, to save about 10% of transmission bandwidth for a given SIR requirement). The advantage of using double chip waveforms is also demonstrated in terms of the bit error rate (BER), whose calculation is based on our extension to Holtzman's approximation in.
Takeshi OKAMOTO Hirofumi KATSUNO Eiji OKAMOTO
In this paper, we propose a fast signature scheme which realizes short transmissions and minimal on-line computation. Our scheme requires a modular exponentiation as preprocessing (i.e., off-line computation). However, we need to acknowledge the existance of the following remarkable properties: neither multiplication nor modular reduction is used in the actual signature generation (i.e., on-line computation). Our scheme requires only two operations: hashing and addition. Although some fast signature schemes with small on-line computation have been proposed so far, those schemes require multiplication or modular reduction in the on-line phase. This leads to a large amount of work compared to that of addition. As far as we know, this is the first approach to obtain the fast signature without those two calculus methods.
Junji SHIKATA Goichiro HANAOKA Yuliang ZHENG Tsutomu MATSUMOTO Hideki IMAI
In this paper, we formally define and analyze the security notions of authenticated encryption in unconditional security setting. For confidentiality, we define the notions, APS (almost perfect secrecy) and NM (non-malleability), in terms of an information-theoretic viewpoint along with our model where multiple senders and receivers exist. For authenticity, we define the notions, IntC (integrity of ciphertexts) and IntP (integrity of plaintexts), from a view point of information theory. And then we combine the above notions to define the security notions of unconditionally secure authenticated encryption. Then, we analyze relations among the security notions. In particular, it is shown that the strongest security notion is the combined notion of APS and IntC. Finally, we formally define and analyze the following generic composition methods in the unconditional security setting along with our model: Encrypt-and-Sign, Sign-then-Encrypt and Encrypt-then-Sign. Consequently, it is shown that: the Encrypt-and-Sign composition method is not always secure; the Sign-then-Encrypt composition method is not always secure; and the Encrypt-then-Sign composition method is always secure, if a given encryption meets APS and a given signature is secure.
Takanori NOMURA Keita KAWANO Kazuhiko KINOSHITA Koso MURAKAMI
As various mobile communication systems have developed, dramatically integrated wireless network, where users can communicate seamlessly via several wireless access systems, have become expected. At present, there are many studies of integrated wireless network, but no study of a network design method. Therefore, in this paper, we discuss a network design method for integrated wireless networks. Because of the handover procedure, the network design where adjacent base stations are connected to the same router, regardless of radio system type, is simply considered. However, in such a design, where mobile users crowd into a particular area and users' access to the base stations located there increases, the load of these accesses is centralized to the single router. To overcome this problem, we propose a new network design wherein the base stations of heterogeneous wireless communication systems, the service areas of which overlap, are connected to a different router. In the proposed network design, although users' accesses are concentrated on the base stations located in a particular area, users in that area can be assigned bandwidth of several upper links according to the access conditions of the base stations in neighboring areas. Finally, we show the excellent performance of the proposed design by simulation experiments.
We present a method for recognition of continuous Korean Sign Language (KSL). In the paper, we consider the segmentation problem of a continuous hand motion pattern in KSL. For this, we first extract sign sentences by removing linking gestures between sign sentences. We use a gesture tension model and fuzzy partitioning. Then, each sign sentence is disassembled into a set of elementary motions (EMs) according to its geometric pattern. The hidden Markov model is adopted to classify the segmented individual EMs.
Kei KAWAUCHI Yuichi KOMANO Kazuo OHTA Mitsuru TADA
We proposed a one-way trapdoor permutation f based multi-signature scheme which can keep tighter reduction rate. Assuming the underlying hash functions are ideal, our proposed scheme is not only provably secure, but are so in a tight. An ability to forge multi-signatures with a certain amount of computational resources implies the ability to invert a one-way trapdoor permutation f (on the same size modulus) with about the same computational effort. The proposed scheme provides the exact security against Adaptive-Chosen-Message-Attack and Adaptive-Insider-Attack by . can also attack in key generation phase, and act in collusion with corrupted signers.
Yusuke KANNO Hiroyuki MIZUNO Nobuhiro OODAIRA Yoshihiko YASU Kazumasa YANAGISAWA
A power-aware interconnect circuit design--called µI/O architecture--has been developed to provide low-cost system solutions for System-on-Chip (SoC) and System-in-Package (SiP) technologies. The µI/O architecture provides a common interface throughout the module enabling hierarchical I/O design for SoC and SiP. The hierarchical I/O design allows the driver size to be optimized without increasing design complexity. Moreover, it includes a signal-level converter for integrating wide-voltage-range circuit blocks and a signal wall function for turning off each block independently--without invalid signal transmission--by using an internal power switch.
Yoshitaka HARA Yunjian JIA Toshihisa NABETANI Shinsuke HARA
This paper presents time slot assignment algorithms applicable to uplink of space division multiple access (SDMA)/time division multiple access (TDMA) systems with adaptive antennas. In the time slot assignment process for a new terminal in a cell, we consider not only the signal quality of the new terminal but also that of active terminals in the same cell. Intra-cell hand over is performed for an active terminal when its signal quality deteriorates. We evaluate the blocking and forced termination probabilities for pure TDMA systems, sectorized systems, and SDMA/TDMA systems in cellular environments by computer simulations. The simulation results show that the SDMA/TDMA systems have much better performance than the pure TDMA and sectorized systems.
Hiroyuki YOKOYAMA Hajime NAKAMURA Shinichi NOMOTO
This paper describes the implementation of an optical switch control system for best-effort multi-wavelength path assignment in DWDM networks based on the SLAMNet (Statistical Lambda Multiplexing Network) that provides dynamic path assignment capabilities without signaling between nodes. The platform of the prototype system consists of a hardware and operation system that are commercially available in the market. We developed the control functions of the SLAMNet as application software to run on the platform. The control function monitors the instantaneous bit rate of the traffic in the wavelength paths and autonomously sets up or releases optical channels in an independent and distributed manner. We demonstrate that the prototype system achieves a switching time of less than 28 milliseconds, which can respond to the burst traffic that emerges and disappears within a fraction of a second in backbone networks. This result indicates that the network architecture SLAMNet is applicable for best-effort multi-wavelength path assignment as an overlay network built on a legacy infrastructure that has no signaling capabilities. The design description and detail hardware configuration are presented. The control mechanisms and performance analysis are also included.
Hiroshi KAZATO Minoru TAKAISHI Takashi KOBAYASHI Motoshi SAEKI
Refactoring is one of the promising techniques for improving software design by means of behavior-preserving structural transformation, and is widely taken into practice. In particular, it is frequently applied to design models represented with UML such as class diagrams. However, since UML design models includes multiple diagrams which are closely related from various views, to get behavior-preserving property, we should get the other types of design information and should handle with the propagation of the change on a diagram to the other diagrams. For example, to refactor a class diagram, we need behavioral information of methods included in the class and should also refactor diagrams which represent the behavior, such as state diagrams, activity diagrams. In this paper, we introduce refactoring on design models as transformations of a graph described by UML class diagram and action semantics. First, we define basic transformations of design models that preserve the behavior of designed software, and compose them into refactoring operations. We use Object Constraint Language (OCL) to specify when we can apply a refactoring operation. Furthermore we implement our technique on a graph transformation system AGG to support the automation of refactoring, together with evaluation mechanism of OCL expressions. Some illustrations are presented to show its effectiveness. The work is the first step to handle with refactoring on UML design models in integrated way.
This paper presents an imaging technique using the MUSIC algorithm to localize cylindrical reflectors in cross-borehole radar arrangements. Tomographic measurement, in which a transmitting and a receiving antenna are individually moved in separate boreholes, can be considered as a combination of a transmitting and a receiving array. A decorrelation technique with the transmitting array, which has been proposed for imaging point reflectors, is applied for imaging cylindrical reflectors using the MUSIC algorithm. Simulated and experimental results are shown to verify the validity of this algorithm for cylindrical targets. We analyze the evaluation error caused by the increase in the radius of the cylinder.
Xun YI Chik-How TAN Eiji OKAMOTO
Recently, Kuwakado and Tanaka proposed a transitive signature scheme for directed trees. In this letter, we show that Kuwakado-Tanaka scheme is insecure against a forgery attack, in which an attacker is able to forge edge signatures by composing edge signatures provided by a signer.
Je-Hoon LEE YoungHwan KIM Kyoung-Rok CHO
In this paper, we design and implement a fast asynchronous embedded CISC microprocessor, A8051, introducing well-tuned pipeline architecture and enhanced control schemes. This work shows an asynchronous design methodology for a CISC type processor, handling the complicated control structure and various instructions. We tuned the proposed architecture to the 5-stage pipeline, reducing the number of idle stages. For the work, we regrouped the instructions based on the number of the machine cycles identified. A8051 has three enhanced control features to improve the system performance: multi-looping control of the pipeline stage, variable length instruction register to get a multiple word instruction in a time, and branch prediction accelerating. The proposed A8051 was synthesized to a gate level design using a 0.35 µm CMOS standard cell library. Simulation results indicate that A8051 provides about 18 times higher speed than the traditional Intel 8051 and about 5 times higher speed than the previously designed asynchronous 8051. In power consumption, core of A8051 shows 15 times higher MIPS/Watt than the synchronous H8051.
This paper presents a Quiet-Noisy scan technique for low power delay fault testing. The novel scan cell design provides both the quiet and noisy scan modes. The toggling of scan cell outputs is suppressed in the quiet scan mode so the power is saved. Two-pattern tests are applied in the noisy scan mode so the delay fault testing is possible. The experimental data shows that the Quiet-Noisy scan technique effectively reduces the test power to 56% of that of the regular scan. The transition fault coverage is improved by 19.7% compared to an existing toggle suppression low power technique. The presented technique requires very minimal changes in the existing MUX-scan Design For Testability (DFT) methodology and needs virtually no computation. The penalties are area overhead, speed degradation, and one extra control in test mode.
The issue of scalable Differentiated Services (DiffServ) admission control now is still an open research problem. We propose a new admission control model that can not only provide coarse grain Quality of Services (QoS), but also guarantee end-to-end QoS for assured service without per-flow state management at core routers within DiffServ domain. Associated with flow aggregation model, a hybrid signaling protocol is proposed to select the route satisfying the end-to-end QoS requirements. Simulation result shows that the proposed model can accurately manage resource, leading to much better performance when compared to other schemes.
Felipe A. CRUZ-PEREZ Lauro ORTIGOZA-GUERRERO
Flexible Resource Allocation (FRA) strategies selectively control the transmission rates of users allowing them to specify maximum and minimum bandwidth requirements for the service type requested ensuring a minimum quality of service (QoS) is met. Complete, Partial, and Non Resource Sharing are the three types of resource sharing policies that can be used in systems with integrated services (voice, video and data) with different QoS and elasticities requirements. In this paper, an FRA strategy with Partial Resource Sharing, called Primary Unavailable Secondary Minimum (PUSMin), is presented. An analytical method is developed to assess its performance in an environment where several service types (with different bandwidth and elasticities requirements) exist. Results show that PUSMin decreases the resource reassignment rate as the offered traffic increases. This decreases the signalling overhead and computational complexity in the Base Station Controller (BSC) or Base Transceiver Station (BTS).
Hideho ARAKIDA Masafumi TAKAHASHI Yoshiro TSUBOI Tsuyoshi NISHIKAWA Hideaki YAMAMOTO Toshihide FUJIYOSHI Yoshiyuki KITASHO Yasuyuki UEDA Tetsuya FUJITA
We present a single-chip MPEG-4 audiovisual LSI in a 0.13 µm CMOS, 5-layer metal technology with 16 Mbit embedded DRAM, which integrates four 16 bit RISC and dedicated hardware accelerators including a 5 GOPS post filtering unit. It consumes 160 mW at 125 MHz and dissipates 80 nA in the standby mode. The chip is the world first LSI handling MPEG-4 CIF video encoding at 15 frames/sec and audio/speech encoding simultaneously.
Kenji TAKATSUKASA Shinya MATSUFUJI Yoshihiro TANADA
This paper formulates functions generating four kinds of binary sequence sets of length 2n with zero correlation zone, which have been discussed for approximately synchronized CDMA systems without co-channel interference nor influence of multipath. They are logic functions of a binary vector of order n, expressed by EXOR and AND operations.