A 1.0-nsec 32-bit prefix tree adder in 0.25-/spl mu/m static CMOS
暂无分享,去创建一个
[1] Akhilesh Tyagi,et al. A Reduced-Area Scheme for Carry-Select Adders , 1993, IEEE Trans. Computers.
[2] Earl E. Swartzlander,et al. A Spanning Tree Carry Lookahead Adder , 1992, IEEE Trans. Computers.
[3] Mary Jane Irwin,et al. Regular, area-time efficient carry-lookahead adders , 1985, IEEE Symposium on Computer Arithmetic.
[4] Harold S. Stone,et al. A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.
[5] G. De Micheli,et al. Approaching a nanosecond: a 32 bit adder , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.
[6] H. T. Kung,et al. A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.
[7] Ralph K. Cavin,et al. A 250-MHz wave pipelined adder in 2-/spl mu/m CMOS , 1994 .
[8] G. Baccarani,et al. A 3.5 ns, 64 bit, carry-lookahead adder , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.
[9] Neil Burgess,et al. A GaAs 32-bit adder , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.
[10] A. L. Fisher,et al. Ultrafast compact 32-bit CMOS adders in multiple-output domino logic , 1989 .
[11] Earl E. Swartzlander,et al. Low Power Arithmetic Components , 1996 .
[12] Graham A. Jullien,et al. Fast adders using enhanced multiple-output domino logic , 1997 .
[13] J. L. Smith,et al. A One-Microsecond Adder Using One-Megacycle Circuitry , 1956, IRE Trans. Electron. Comput..
[14] Simon Knowles,et al. A family of adders , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).
[15] O. Takahashi,et al. A 1.0 GHz single-issue 64 b powerPC integer processor , 1998, 1998 IEEE International Solid-State Circuits Conference. Digest of Technical Papers, ISSCC. First Edition (Cat. No.98CH36156).