The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] sign(2667hit)

1561-1580hit(2667hit)

  • A Hierarchically Distributed Network Management System for Multi-Layered IP/Photonic GMPLS Networks

    Hiroshi MATSUURA  Hideo IMANAKA  Kazumasa TAKAMI  

     
    PAPER-Optical Network Operation

      Vol:
    E87-B No:7
      Page(s):
    1844-1853

    The cost-effective provision of IP services requires multi-layered traffic engineering to obtain dynamic cooperation between IP and photonic layers. The effective control and management of generalized multi-protocol label-switching (GMPLS) networks is an essential part of this. Huge photonic capacities and the number of IP and photonic networks make it likely that enormous amounts of GMPLS network-related data will have to be managed in the near future. At the same time, routing burdens on individual GMPLS routers are critical because of the strong need for per-path quality of service (QoS). To solve these problems, we propose a hierarchically distributed network-management system (NMS) in which we flexibly allocate a GMPLS subnetwork to each sub-NMS and at the same time conduct QoS routing. The distributed nature of our architecture reduces the burden on the NMS as a whole and also lets us remove the routing-burden from GMPLS routers with minimum effect on management processes.

  • Ultrafast All-Optical 3R-Regeneration

    Shigeki WATANABE  Reinhold LUDWIG  Fumio FUTAMI  Colja SCHUBERT  Sebastian FERBER  Christof BOERNER  Carsten SCHMIDT-LANGHORST  Joern BERGER  Hans-Georg WEBER  

     
    INVITED PAPER

      Vol:
    E87-C No:7
      Page(s):
    1114-1118

    The configuration and operation of an all-optical 3R-regenerator for high-speed data transmission are described. An all-optical 3R-regenerator using a fiber-based optical switch is proposed and successfully demonstrated in a 160 Gbit/s 3R-regenerating transmission experiment.

  • Efficient Architectures for the Biorthogonal Wavelet Transform by Filter Bank and Lifting Scheme

    Yeu-Horng SHIAU  Jer Min JOU  Chin-Chi LIU  

     
    PAPER-VLSI Systems

      Vol:
    E87-D No:7
      Page(s):
    1867-1877

    In this paper, two efficient VLSI architectures for biorthogonal wavelet transform are proposed. One is constructed by the filter bank implementation and another is constructed by the lifting scheme. In the filter bank implementation, due to the symmetric property of biorthogonal wavelet transform, the proposed architecture uses fewer multipliers than the orthogonal wavelet transform. Besides, the polyphase decomposition is adopted to speed up the processing by a factor of 2. In the lifting scheme implementation, the pipeline-scheduling technique is employed to optimize the architecture. Both two architectures are with advantages of lower implementation complexity and higher throughput rate. Moreover, they can also be applied to realize the inverse DWT efficiently. Based on the above properties, the two architectures can be applied to time-critical image compressions, such as JPEG2000. Finally, the architecture constructed by the lifting scheme is implemented into a single chip on 0.35 µm 1P4M CMOS technology, and its area and working performance are 5.005 5.005 mm2 and 50 MHz, respectively.

  • A Low-Power Tournament Branch Predictor

    Sung Woo CHUNG  Gi Ho PARK  Sung Bae PARK  

     
    LETTER-Computer Systems

      Vol:
    E87-D No:7
      Page(s):
    1962-1964

    This letter proposes a low-power tournament branch predictor, in which the number of accesses to the branch predictors (local predictor or global predictor) is reduced. Analysis results with Samsung Memory Compiler show that the proposed branch predictor reduces the power consumption by 24-45%, compared to the conventional tournament branch predictor, not requiring any additional storage arrays, not incurring any additional delay and never harming accuracy.

  • Two-Step Search for DNA Sequence Design

    Satoshi KASHIWAMURA  Atsushi KAMEDA  Masahito YAMAMOTO  Azuma OHUCHI  

     
    PAPER

      Vol:
    E87-A No:6
      Page(s):
    1446-1453

    DNA Sequence Design Problem is a crucial problem in information-based biotechnology such as DNA computing. In this paper, we introduce a powerful design strategy for DNA sequences by refining Random Generator. Random Generator is one of the design strategies and offers great advantages, but it is not a good algorithm for generating a large set of DNA sequences. We propose a Two-Step Search algorithm, then show that TSS can generate a larger set of DNA sequences than Random Generator by computer simulation.

  • The Structures of CPW PHEMT's for Applications of Millimeter-Waves

    Byeong-Ok LIM  Tae-Shin KANG  Bok-Hyung LEE  Mun-Kyo LEE  Jin-Koo RHEE  

     
    PAPER

      Vol:
    E87-A No:6
      Page(s):
    1323-1329

    The parasitic capacitances induced in the spaces between an air-bridge interconnection and a drain pad (Cad), and between an air-bridge interconnection and a gate head (Cag) from a power CPW PHEMT are not negligible. In this paper, a modified equivalent circuit model for a CPW PHEMT and an improved CPW PHEMT for millimeter-wave applications are proposed. These were proved by measuring the fabricated CPW PHEMT and improved CPW PHEMT. These capacitances were confirmed by measuring the gate-source coupling using CPW PHEMT patterns without an active layer. From the measurements, the improved CPW PHEMT has the lowest coupling (loss) and the highest S21 gain among four different types tested at 60 GHz. And the improved CPW PHEMT is a feasible device which can be directly applied in millimeter-waves as a power device.

  • Robust Watermarking Based on Time-spread Echo Method with Subband Decomposition

    Byeong-Seob KO  Ryouichi NISHIMURA  Yoiti SUZUKI  

     
    LETTER-Information Security

      Vol:
    E87-A No:6
      Page(s):
    1647-1650

    A robust watermarking scheme based on the time-spread echo method is proposed in this letter. The embedding process is achieved by subband decomposition of a host signal and by controlling the amount of distortion, i.e., power of watermark, of each subband according to the Signal to Mask Ratio (SMR) calculated from MPEG psychoacoustic model. The decoding performance and robustness of the proposed method were evaluated.

  • Sequential Estimation of Angles of Arrival via Signal Subspace Projection

    Yang-Ho CHOI  

     
    LETTER-Antenna and Propagation

      Vol:
    E87-B No:6
      Page(s):
    1760-1763

    Sequential estimation of arrival angles allows us to resolve closely located sources that the standard MUSIC fails to do so. A new sequential estimation method is proposed which utilizes only the signal subspace components of the steering vectors for some estimates of the arrival angles. It is theoretically shown that the asymptotic performance of the proposed method is better than that of the conventional sequential method which exploits both the signal and the noise subspace components. Simulation results show that the former outperforms the latter in correlated sources as well as in uncorrelated sources.

  • Efficient Routing of Board-Level Optical Clocks for Ultra High-Speed Systems

    Chung-Seok (Andy) SEO  Abhijit CHATTERJEE  

     
    PAPER

      Vol:
    E87-A No:6
      Page(s):
    1310-1317

    A new approach to optical clock distribution utilizing optical waveguide interconnect technology is introduced. In this paper, we develop a new algorithm for design and optimization of embedded optical clock distribution networks for printed wiring boards. The optimization approach takes into account bending and propagation losses of optical waveguides. Less than 26.1 psec in signal timing skew is obtained for a signal flight time of 614.38 psec. About 15% reduction in optical power consumption is also obtained over clock nets routed with existing (optical) methods.

  • Bidirectional Path Setup Scheme Using on Upstream Label Set in Optical GMPLS Networks

    Eiji OKI  Nobuaki MATSUURA  Kohei SHIOMOTO  Naoaki YAMANAKA  

     
    PAPER-Network

      Vol:
    E87-B No:6
      Page(s):
    1569-1576

    Generalized Multi-Protocol Label Switching (GMPLS) is being developed in the Internet Engineering Task Force (IETF). In GMPLS-based wavelength-division-multiplexing (WDM) optical networks, a wavelength in a fiber is used as a label. In the existing GMPLS signaling protocol for bidirectional paths in WDM networks with the wavelength continuity constraint, bidirectional path setup fails with high probability because the upstream label allocated by the previous hop node may not be accepted at the transit node. To solve this problem, this paper proposes an efficient bidirectional label switched path (LSP) setup scheme based on an upstream label set. Called the Upstream Label Set (ULS) scheme, it is an extension of the existing GMPLS signaling protocol. The ULS scheme is consistent with the existing GMPLS signaling procedure and so offers backward compatibility. The numerical results suggest that when the number of the LSP setup retries is limited, the ULS scheme offers lower blocking probability than the existing GMPLS signaling scheme which uses only with the upstream label (UL). In addition, under the condition that the constraint of the number of LSP setup retries is relaxed, the LSP setup time of the ULS scheme is faster than that of the existing scheme. Furthermore, by using our developed prototype of the GMPLS control system, in which the ULS scheme was installed, we demonstrated that the ULS scheme successfully setup bidirectional LSPs.

  • Cryptanalysis of Publicly Verifiable Authenticated Encryption

    Ting-Yi CHANG  Chou-Chen YANG  Min-Shiang HWANG  

     
    LETTER-Information Security

      Vol:
    E87-A No:6
      Page(s):
    1645-1646

    Recently, Ma and Chen proposed a new authenticated encryption scheme with public verifiability. The signer can generate a signature with message recovery for a specified recipient. With a dispute, the recipient has ability to convert the signature into an ordinary one that can be verified by anyone without divulging her/his private key and the message. However, we point out that any adversary can forge a converted signature in this article.

  • Dialogue Languages and Persons with Disabilities

    Akira ICHIKAWA  

     
    INVITED PAPER

      Vol:
    E87-D No:6
      Page(s):
    1312-1319

    Any utterances of dialogue, spoken language or sign language, have functions that enable recipients to achieve real-time and easy understanding and to control conversation smoothly in spite of its volatile characteristics. In this paper, we present evidence of these functions obtained experimentally. Prosody plays a very important role not only in spoken language (aural language) but also in sign language (visual language) and finger braille (tactile language). Skilled users of a language may detect word boundaries in utterances and estimate sentence structure immediately using prosody. The gestures and glances of a recipient may influence the utterances of the sender, leading to amendments of the contents of utterances and smooth exchanges in turn. Individuality and emotion in utterances are also very important aspects of effective communication support systems for persons with disabilities even more so than for those non-disabled persons. The trials described herein are universal in design. Some trials carried out to develop these systems are also reported.

  • Mixed Signal SoC Era

    Akira MATSUZAWA  

     
    INVITED PAPER

      Vol:
    E87-C No:6
      Page(s):
    867-877

    Application area of mixed signal technology is currently expanded to digital communication, networking, and digital storage systems from conventional digital audio and video systems. Digital consumer electronics are emerged and their markets are extremely increased. Rapid progress of integrated circuit technology has enabled a system level integration on a SoC. Thus mixed signal SoC becomes a majority in LSI industry. Almost all the analog functions should be realized by CMOS technology on SoC, yet some difficulties such as a low transconductance, a large mismatch voltage, and a large 1/f noise should be solved. CMOS device has been considered as a poor device for the analog use, however in reality, it has attained a remarkable progress for analog applications. CMOS device has a variety of circuit techniques to address its own issues and also has an analog performance that increases rapidly with technology scaling. The mixed signal SoC needs a new development strategy and design methodology that covers from system level to device level for addressing tough needs for a shorter development time, a lower cost, and a higher design quality. The optimizations over analog and digital and over system to device must be established for the development success. Difficulty of low voltage operation of further scaled CMOS in analog circuits will be the most serious issue. This results in the saturation of performance and increase of cost. The system level optimization over analog and digital, digital calibration and compensation, and the use of sigma-delta modulation method will give us the solution.

  • A Combined Approach to Integrity Protection and Verification of Palette Images Using Fragile Watermarks and Digital Signatures

    Chih-Hsuan TZENG  Wen-Hsiang TSAI  

     
    PAPER-Image

      Vol:
    E87-A No:6
      Page(s):
    1612-1619

    Conventional authentication methods, proposed mainly for gray-scale and color images, are not appropriate for palette images, which usually contain simple contents with a limited number of colors. In this paper, a new approach is proposed to verify the integrity of palette images and to locate tampered regions without re-quantization and re-indexing processes. The proposed approach is based on a combined use of both the fragile watermarking and the digital signature approaches, taking the advantages of both approaches and avoiding their drawbacks. To protect a block of an image, authentication signals are first generated according to a secret key. Based on an embeddability property defined in the study, the pixels of each block are classified as embeddable or non-embeddable. Only the former ones are used to embed the authentication signals. A corresponding digital signature is generated as well to compensate the possibly limited embedding capacity of the embeddable pixels that are insufficient in number. To authenticate a block, the recovered authentication signals, yielded from the extracted watermark and the received digital signature, are compared with the one generated according to the correct secret key, to prove the block's legitimacy. The effectiveness and the security of the proposed method are analyzed and tested with a variety of palette images. The results indicate that the proposed method can offer high authentication accuracy as well as maintain a good tradeoff between the authentication signal portability and the resulting image quality.

  • A Timing Driven Crosstalk Optimizer for Gridded Channel Routing

    Shih-Hsu HUANG  Yi-Siang HSU  Chiu-Cheng LIN  

     
    LETTER-Computer Components

      Vol:
    E87-D No:6
      Page(s):
    1575-1581

    The relative window method provides quantitative crosstalk delay degradation for the post-layout timing analysis in deep sub-micron VLSI design. However, to the best of our knowledge, the relative window method has not been applied to the crosstalk minimization in gridded channel routing problem. Most conventional crosstalk optimizers only use the coupling length to estimate the crosstalk. In this paper, we present a post-layout timing driven crosstalk optimizer based on the relative window method. According to the relative signal arrival time and the coupling length, we define a delay degradation graph to describe the crosstalks between nets in a routing solution. Our optimization goal is to maximize the time slack by iteratively improving the delay degradation graph without increasing the channel height. Benchmark data consistently show that our post-layout timing driven crosstalk optimizer can further improve the routing solution obtained by a conventional crosstalk optimizer.

  • Robotic Hand System for Non-verbal Communication

    Kiyoshi HOSHINO  Ichiro KAWABUCHI  

     
    PAPER

      Vol:
    E87-D No:6
      Page(s):
    1347-1353

    The purpose of this study is to design a humanoid robotic hand system that is capable of conveying feelings and sensitivities by finger movement for the non-verbal communication between men and robots in the near future. In this paper, studies have been made in four steps. First, a small-sized and light-weight robotic hand was developed to be used as the humanoid according to the concept of extracting required minimum motor functions and implementing them to the robot. Second, basic characteristics of the movement were checked by experiments, simple feedforward control mechanism was designed based on velocity control, and a system capable of tracking joint time-series change command with arbitrary pattern input was realized. Third, tracking performances with regard to sinusoidal input with different frequencies were studied for evaluation of the system thus realized, and space- and time-related accuracy were investigated. Fourth, the sign language motions were generated as examples of information transmission by finger movement. A series of results thus obtained indicated that this robotic hand is capable of transmitting information promptly with comparatively high accuracy through the movement.

  • Designing a Group Communication Media that is Connectedness Oriented

    Takeshi OHGURO  Kazuhiro KUWABARA  Koji KAMEI  

     
    PAPER

      Vol:
    E87-D No:6
      Page(s):
    1320-1327

    Connectedness oriented communication denotes a mode of communication in which the activities of communication are more important than the contents of communication. It is targeted at maintaining and enhancing human social relationships. As our lifestyles and societies are shifting along with the progress of Information Technology, communication media that are connectedness oriented will play an important role. In this paper we propose a media called FaintPop, which is an example of such new media that are suitable for connectedness oriented communication. It is a communication media designed for a community, with which the sense of connectedness can be shared among members. Furthermore, it provides a general overview of the communication activities occurring in the community. We discuss several principles and points in designing the media, especially about the interaction of the users. Results and findings from the experiment using the media are reported.

  • Signature and Chip Waveform Designs for Asynchronous CDMA Systems

    Ha H. NGUYEN  Ed SHWEDYK  

     
    PAPER-Wireless Communication Technology

      Vol:
    E87-B No:5
      Page(s):
    1306-1317

    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.

  • Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation

    Kei KAWAUCHI  Yuichi KOMANO  Kazuo OHTA  Mitsuru TADA  

     
    LETTER

      Vol:
    E87-A No:5
      Page(s):
    1141-1153

    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.

  • Unconditionally Secure Authenticated Encryption

    Junji SHIKATA  Goichiro HANAOKA  Yuliang ZHENG  Tsutomu MATSUMOTO  Hideki IMAI  

     
    LETTER

      Vol:
    E87-A No:5
      Page(s):
    1119-1131

    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.

1561-1580hit(2667hit)