• Title/Summary/Keyword: Signed-Digit Number

Search Result 36, Processing Time 0.027 seconds

Design of Parallel Decimal Multiplier using Limited Range of Signed-Digit Number Encoding (제한된 범위의 Signed-Digit Number 인코딩을 이용한 병렬 십진 곱셈기 설계)

  • Hwang, In-Guk;Kim, Kanghee;Yoon, WanOh;Choi, SangBang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.50-58
    • /
    • 2013
  • In this paper, parallel decimal fixed-point multiplier which uses the limited range of Singed-Digit number encoding and the reduction step is proposed. The partial products are generated without carry propagation delay by encoding a multiplicand and a multiplier to the limited range of SD number. With the limited range of SD number, the proposed multiplier can improve the partial product reduction step by increasing the number of possible operands for multi-operand SD addition. In order to estimate the proposed parallel decimal multiplier, synthesis is implemented using Design Compiler with SMIC 180nm CMOS technology library. Synthesis results show that the delay of proposed parallel decimal multiplier is reduced by 4.3% and the area by 5.3%, compared to the existing SD parallel decimal multiplier. Despite of the slightly increased delay and area of partial product generation step, the total delay and area are reduced since the partial product reduction step takes the most proportion.

Differential Power Analysis on Countermeasures Using Binary Signed Digit Representations

  • Kim, Tae-Hyun;Han, Dong-Guk;Okeya, Katsuyuki;Lim, Jong-In
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.619-632
    • /
    • 2007
  • Side channel attacks are a very serious menace to embedded devices with cryptographic applications. To counteract such attacks many randomization techniques have been proposed. One efficient technique in elliptic curve cryptosystems randomizes addition chains with binary signed digit (BSD) representations of the secret key. However, when such countermeasures have been used alone, most of them have been broken by various simple power analysis attacks. In this paper, we consider combinations which can enhance the security of countermeasures using BSD representations by adding additional countermeasures. First, we propose several ways the improved countermeasures based on BSD representations can be attacked. In an actual statistical power analysis attack, the number of samples plays an important role. Therefore, we estimate the number of samples needed in the proposed attack.

  • PDF

Implementation of the modified signed digit number (MSD) adder using joint spatial encoding method (Joint Spatial Encoding 방법을 이용한 변형부호화자리수 가산기 구현)

  • 서동환;김종윤
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.987-990
    • /
    • 1998
  • An optical adder for a modified signed-digit(MSD) number system using joint spatial encoding method is proposed. In order to minimize the numbers of symbolic substitution rules, nine input patterns were divided into five groups of the same addition results. For recognizing the input reference patterns, masks and reference patterns without any other spatial operations are used. This adder is implemented by smaller system in size than a conventional adder.

  • PDF

Implementation of the modified-signed digit(MSD) number adder using triple rail-coding input and symbolic substitution (Triple rail-coding 입력과 기호치환을 이용한 변형부호화자리수 가산기 구현)

  • Shin, Chang-Mok;Kim, Soo-Joong;Seo, Dong-Hoan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.6
    • /
    • pp.43-51
    • /
    • 2004
  • An optical parallel modified signed-digit(MSD) number adder system is proposed by using triple rail-coding input patterns and serial arrangement method of symbolic substitution. By combing overlapped arithmetic results. which are produced by encoding MSD input as triple rail-coding patterns. into the same patterns, symbolic substitution rules are reduced and also by using serialized and space-shifted input patterns in optical experiments, the optical adder without space-shifting operation, NOR operation and threshold operation is implemented.

Design of Multi-Valued Process using SD, PD (SD 수, PD 수를 이용한 다치 연산기의 설계)

  • 임석범;송홍복
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.3
    • /
    • pp.439-446
    • /
    • 1998
  • This paper presents design of SD adder and PD adder on Multi-Valued Logic. For implementing of Multi-valued logic circuits we use Current-mode CMOS circuits and also use Voltage-mode CMOS circuits partially. The proposed arithmetic circuits was estimated by SPICE simulation. At the SD(Signed-Digit) number presentation applying Multi-Valued logic the carry propagation is always limited to one position to the left this number presentation allows fast parallel operation. The addition method that add M operands using PD( positive digit number) is effective not only for the realization of the high-speed compact arithmetic circuit, but also for the reduction of the interconnection in the VLSI processor. therefor, if we use PD number representation, the high speed processor can be implementation.

  • PDF

Compressive Sensing of the FIR Filter Coefficients for Multiplierless Implementation (무곱셈 구현을 위한 FIR 필터 계수의 압축 센싱)

  • Kim, Seehyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2375-2381
    • /
    • 2014
  • In case the coefficient set of an FIR filter is represented in the canonic signed digit (CSD) format with a few nonzero digits, it is possible to implement high data rate digital filters with low hardware cost. Designing an FIR filter with CSD format coefficients, whose number of nonzero signed digits is minimal, is equivalent to finding sparse nonzero signed digits in the coefficient set of the filter which satisfies the target frequency response with minimal maximum error. In this paper, a compressive sensing based CSD coefficient FIR filter design algorithm is proposed for multiplierless and high speed implementation. Design examples show that multiplierless FIR filters can be designed using less than two additions per tap on average with approximate frequency response to the target, which are suitable for high speed filtering applications.

Low Area Design and Implementation for IEEE 802.11a OFDM Timing Synchronization Block (IEEE 802.11a OFDM 타이밍 동기화기 블록의 저면적 설계 및 구현)

  • Seok, Sang-Chul;Jang, Young-Beom
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.2
    • /
    • pp.31-38
    • /
    • 2012
  • In this paper, a low area timing synchronization structure for the IEEE 802.11a OFDM MODEM SoC is proposed. The timing synchronization block of the IEEE 802.11a OFDM MODEM SoC requires large implementation area. In the proposed timing synchronization structure, it is shown that the number of multiplication can be reduced by using the transposed direct form filter. Furthermore, implementation area of the proposed structure can be more reduced using CSD(Canonic Signed Digit) and Common Sub-expression Sharing techniques. Through Verilog-HDL coding and synthesis, it is shown that the 22.7 % of implementation area can be reduced compared with the conventional one.

Implementation of the two-step modified signed digit number adders using joint spatial encoding method (결합 공간 부호화 방법을 이용한 두 단계 변형부호화자리수 가산기 구현)

  • Seo, Dong-Hwan;Kim, Jong-Yun;Park, Se-Jun;Jo, Ung-Ho;No, Deok-Su;Kim, Su-Jung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.11
    • /
    • pp.810-820
    • /
    • 2001
  • Conventional binary adder requires a carry propagation to the most significant bit, and leads to serial addition. However, optical adder using a modified signed digit(MSD) number system has been Proposed to reduce the carry propagation chain encountered in binary adder. In this paper, in order to minimize the number of symbolic substitution(SS) rules, nine input patterns were divided into five groups of the same addition results. For recognizing the input reference patterns, serial connections of joint spatial encoded patterns and masks without any other spatial operations are used.

  • PDF

Low-power/high-speed DCT structure using common sub-expression sharing (Common sub-expression sharing을 이용한 고속/저전력 DCT 구조)

  • Jang, Young-Beom;Yang, Se-Jung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.119-128
    • /
    • 2004
  • In this paper, a low-power 8-point DCT structure is proposed using add and shift operations. Proposed structure adopts 4 cycles for complete 8-point DCT in order to minimize size of hardware and to enable high-speed processing. In the structure, hardware for the first cycle can be shared in the next 3 cycles since all columns in the DCT coefficient matrix are common except sign. Conventional DCT structures implemented with only add and shift operation use CSD(Canonic Signed Digit) form coefficients to reduce the number of adders. To reduce the number of adders further, we propose a new structure using common sub-expression sharing techniques. With this techniques, the proposed 8-point DCT structure achieves 19.5% adder reduction comparison to the conventional structure using only CSD coefficient form.

Low-power MPEG audio filter implementation using Arithmetic Unit (Arithmetic unit를 사용한 저전력 MPEG audio필터 구현)

  • 장영범;이원상
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.5
    • /
    • pp.283-290
    • /
    • 2004
  • In this paper, a low-power structure for 512 tap FIR filter in MPEG audio algorithm is proposed. By using CSD(Canonic Signed Digit) form filter coefficients and maximum sharing of input signal sample, it is shown that the number of adders of proposed structure can be minimized. To minimize the number of adders, the proposed structure utilizes the 4 steps of sharing, i.e., common input sharing, linear phase symmetric filter coefficient sharing, block sharing for common input, and common sub-expression sharing. Through Verilog-HDL coding, it is shown that reduction rates in the implementation area and relative power consumption of the proposed structure are 60.3% and 93.9% respectively, comparison to those of the conventional multiplier structure.