完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYeh, WCen_US
dc.contributor.authorJen, CWen_US
dc.date.accessioned2014-12-08T15:27:03Z-
dc.date.available2014-12-08T15:27:03Z-
dc.date.issued2000en_US
dc.identifier.isbn0-7803-6488-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/19273-
dc.description.abstractThis work formulates a set of equations to describe logarithmic time parallel adders. The equations can be used to explain several popular fast adder schemes and derive new adder schemes easily. It is shown that if there is an adder constructed from conditional-sum rule, then we can always obtain another adder based on carry-lookahead rule with equivalent topology and structure, and vice versa.en_US
dc.language.isoen_USen_US
dc.titleOn the study of logarithmic time parallel addersen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2000 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: DESIGN AND IMPLEMENTATIONen_US
dc.citation.spage459en_US
dc.citation.epage466en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000165893400046-
顯示於類別:會議論文