Volume 33 Issue 04
Apr.  2007
Turn off MathJax
Article Contents
Cui Xiaoping, Wang Chenghua. Optimal block distribution in carry-skip adders[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(04): 495-499. (in Chinese)
Citation: Cui Xiaoping, Wang Chenghua. Optimal block distribution in carry-skip adders[J]. Journal of Beijing University of Aeronautics and Astronautics, 2007, 33(04): 495-499. (in Chinese)

Optimal block distribution in carry-skip adders

  • Received Date: 19 Sep 2006
  • Publish Date: 30 Apr 2007
  • A new type of optimal block distribution algorithm of two level carry-skip adder was described to determine optimal block distribution sizes. According to this algorithm, with the given total worst case delay, the maximum optimal block distribution sizes of the adder for that delay can be determined. It is simplified to obtain optimal block distribution of any desired adder sizes. The carry skip adder optimal block sizes can minimize critical path delay. The analysis of gate delay and complexity were provided. Although the two-level carry skip adder with optimal block distribution uses a few extra gates, it provides better speed than the adders with fixed size blocks. The adder has been functionally verified and simulated by using PSPICE. The simulation analysis of time delay reveals that the two-level optimal block distribution carry-skip adder can provide faster speed than the carry-skip adder with fixed size blokes.

     

  • loading
  • [1] Oklobdzija V G, Zeydel B R, Dao H, et al. Energy-delay estimation technique for high-performance microprocessor VLSI adders Proceedings of the 16th IEEE Symposium on Computer Arithmetic. Los Alamitos, CA, USA :IEEE, 2003:272-279 [2] Nagendra C, Irwin M J, Owens R M. Area-time-power tradeoffs in parallel adders[J]. IEEE Transactions on Circuits and Systems II:Analog and Digital Signal Processing, 1996, 53(10):689-702 [3] 崔晓平,王成华. 基于方块超前进位的快速进位跳跃加法器[J]. 南京航空航天大学学报,2006,38(6):786-790 Cui Xiaoping, Wang Chenghua. Fast carry-skip adder based on block carry-lookahead[J]. Journal of Nanjing University of Aeronautics and Astronautics, 2006, 38(6):786-790(in Chinese) [4] Schulte M J, Chirca K, Glossner J, et al. A low-power carry skip adder with fast saturation Proceedings of the 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors. Los Alamitos, CA, USA :IEEE, 2004:269-279 [5] Burgess N. Accelerated carry-skip adders with low hardware cost Thirty-Fifth Asilomar Conference on Signals, Systems and Computers. Pacific Grove, CA, USA:IEEE, 2001,1(11):852-856 [6] Chan P K, Schlag F, Thomborson C D, et al. Delay optimization of carry-skip adders and block carry-lookahead adders using multidimensional dynamic programming[J]. IEEE Transactions on Computers, 1992, 41(8):154-164 [7] Guyot A, Hochet B, Muller J. A way to build efficient carry-skip adders[J]. IEEE Transactions on Computers, 1987, 36(10):1144-1152 [8] Turrini S. Optimal group distribution in carry-skip adders Proceedings of the 9th Symposium on Computer Arithmetic. Washington, DC, USA :IEEE, 1989:96-103
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2670) PDF downloads(1574) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return