{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/12412"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/12412","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Redundant adder architectures for cell-based technology","abstract":"The amenity of our daily lives has come to rely on an enormous number of embedded systems, such as mobile phones, anti-spin systems for cars, high de nition streaming video and portable devices. The utmost important operation used in these systems and digital system in general is addition, since it is a fundamental operation of most arithmetic operations. The choice of arithmetic numbering system for this operation, its digit set and its possible encoding in addition to algorithms and their hardware implementations has been subject to continual advancement to allow superior speed and to reduce digital circuit area and power consumptions. In the case of conventional number systems, addition speed is logarithmically bounded by the number of digits. However, unconventional number systems provide the possibility of performing the addition operation with sub-logarithmic and even constant latency. In this dissertation, we present the hardware-e cient addition rules for the unconventional binary signed digit number (BSDN) system to facilitate the BSDN adders design. We use the rules with the possible addition schemes and the two bits encodings to investigate and introduce new architectures. The implementation results of the existing and proposed structures show that each structure has its own performance gures based on the employed encoding. Moreover, it show that the hardware-e cient rules provide designs that demonstrate higher gures compared to existing designs when considering area, delay, power and combined performance measures. This work also presents the hardware design and performance analysis of a BSDN adder structure employing the 1-out-of-3 encoding. This encoding adds an error detection capability to the adder's architecture at di erent levels. The adder performance gures indicate that its bene t lies primarily on providing error detection features as it is slower, consumes more area and dissipate more power compared to designs employing the two-bits encoding. We also present the limited selective redundancy injection (LSRI) technique to introduce limited redundancy to conventional adders. The theoretical analysis and implementation results show that the conventional adders with LSRI outperform adders without LSRI in area, delay, power and combined performance measures where there is no strict requirement on accuracy","abstract_html":"The amenity of our daily lives has come to rely on an enormous number of embedded systems, such as mobile phones, anti-spin systems for cars, high de nition streaming video and portable devices. The utmost important operation used in these systems and digital system in general is addition, since it is a fundamental operation of most arithmetic operations. The choice of arithmetic numbering system for this operation, its digit set and its possible encoding in addition to algorithms and their hardware implementations has been subject to continual advancement to allow superior speed and to reduce digital circuit area and power consumptions. In the case of conventional number systems, addition speed is logarithmically bounded by the number of digits. However, unconventional number systems provide the possibility of performing the addition operation with sub-logarithmic and even constant latency. In this dissertation, we present the hardware-e cient addition rules for the unconventional binary signed digit number (BSDN) system to facilitate the BSDN adders design. We use the rules with the possible addition schemes and the two bits encodings to investigate and introduce new architectures. The implementation results of the existing and proposed structures show that each structure has its own performance gures based on the employed encoding. Moreover, it show that the hardware-e cient rules provide designs that demonstrate higher gures compared to existing designs when considering area, delay, power and combined performance measures. This work also presents the hardware design and performance analysis of a BSDN adder structure employing the 1-out-of-3 encoding. This encoding adds an error detection capability to the adder's architecture at di erent levels. The adder performance gures indicate that its bene t lies primarily on providing error detection features as it is slower, consumes more area and dissipate more power compared to designs employing the two-bits encoding. We also present the limited selective redundancy injection (LSRI) technique to introduce limited redundancy to conventional adders. The theoretical analysis and implementation results show that the conventional adders with LSRI outperform adders without LSRI in area, delay, power and combined performance measures where there is no strict requirement on accuracy","abstract_has_math":false,"creators":["Kharbash, Fekri Q."],"institution":"University of Missouri--Kansas City","degree_name":"Ph.D.","degree_level":"Doctoral","degree_discipline":"Electrical and Computer Engineering (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Chaudhry, Ghulam M. (Ghulam Miran)"],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-01-06","date_published":"2012-01-06","updated_at":"2026-07-24T05:16:57Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10355/12412","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chaudhry, Ghulam M. (Ghulam Miran)"]},{"key":"dc:creator","label":"Author","values":["Kharbash, Fekri Q."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-01-06T17:39:23Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-01-06T17:39:23Z"]},{"key":"dc:date.issued","label":"Date","values":["2012-01-06"]},{"key":"dc:publisher","label":"Institution","values":["University of Missouri--Kansas City"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering (UMKC)","Telecommunications and Computer Networking (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10355/12412"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed on January 6, 2012","Dissertation advisor: Ghulam Chaudhry","Vita","Includes bibliographic references (p. 186-202)","Thesis (Ph.D.)--School of School of Computing and Engineering. University of Missouri--Kansas City, 2011"]},{"key":"dc:description.abstract","label":"Abstract","values":["The amenity of our daily lives has come to rely on an enormous number of embedded systems, such as mobile phones, anti-spin systems for cars, high de nition streaming video and portable devices. The utmost important operation used in these systems and digital system in general is addition, since it is a fundamental operation of most arithmetic operations. The choice of arithmetic numbering system for this operation, its digit set and its possible encoding in addition to algorithms and their hardware implementations has been subject to continual advancement to allow superior speed and to reduce digital circuit area and power consumptions. In the case of conventional number systems, addition speed is logarithmically bounded by the number of digits. However, unconventional number systems provide the possibility of performing the addition operation with sub-logarithmic and even constant latency. In this dissertation, we present the hardware-e cient addition rules for the unconventional binary signed digit number (BSDN) system to facilitate the BSDN adders design. We use the rules with the possible addition schemes and the two bits encodings to investigate and introduce new architectures. The implementation results of the existing and proposed structures show that each structure has its own performance gures based on the employed encoding. Moreover, it show that the hardware-e cient rules provide designs that demonstrate higher gures compared to existing designs when considering area, delay, power and combined performance measures. This work also presents the hardware design and performance analysis of a BSDN adder structure employing the 1-out-of-3 encoding. This encoding adds an error detection capability to the adder's architecture at di erent levels. The adder performance gures indicate that its bene t lies primarily on providing error detection features as it is slower, consumes more area and dissipate more power compared to designs employing the two-bits encoding. We also present the limited selective redundancy injection (LSRI) technique to introduce limited redundancy to conventional adders. The theoretical analysis and implementation results show that the conventional adders with LSRI outperform adders without LSRI in area, delay, power and combined performance measures where there is no strict requirement on accuracy"]},{"key":"dc:title","label":"Title","values":["Redundant adder architectures for cell-based technology"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chaudhry, Ghulam M. (Ghulam Miran)"],"dc:creator":["Kharbash, Fekri Q."],"dc:date.accessioned":["2012-01-06T17:39:23Z"],"dc:date.available":["2012-01-06T17:39:23Z"],"dc:date.issued":["2012-01-06"],"dc:description":["Title from PDF of title page, viewed on January 6, 2012","Dissertation advisor: Ghulam Chaudhry","Vita","Includes bibliographic references (p. 186-202)","Thesis (Ph.D.)--School of School of Computing and Engineering. University of Missouri--Kansas City, 2011"],"dc:description.abstract":["The amenity of our daily lives has come to rely on an enormous number of embedded systems, such as mobile phones, anti-spin systems for cars, high de nition streaming video and portable devices. The utmost important operation used in these systems and digital system in general is addition, since it is a fundamental operation of most arithmetic operations. The choice of arithmetic numbering system for this operation, its digit set and its possible encoding in addition to algorithms and their hardware implementations has been subject to continual advancement to allow superior speed and to reduce digital circuit area and power consumptions. In the case of conventional number systems, addition speed is logarithmically bounded by the number of digits. However, unconventional number systems provide the possibility of performing the addition operation with sub-logarithmic and even constant latency. In this dissertation, we present the hardware-e cient addition rules for the unconventional binary signed digit number (BSDN) system to facilitate the BSDN adders design. We use the rules with the possible addition schemes and the two bits encodings to investigate and introduce new architectures. The implementation results of the existing and proposed structures show that each structure has its own performance gures based on the employed encoding. Moreover, it show that the hardware-e cient rules provide designs that demonstrate higher gures compared to existing designs when considering area, delay, power and combined performance measures. This work also presents the hardware design and performance analysis of a BSDN adder structure employing the 1-out-of-3 encoding. This encoding adds an error detection capability to the adder's architecture at di erent levels. The adder performance gures indicate that its bene t lies primarily on providing error detection features as it is slower, consumes more area and dissipate more power compared to designs employing the two-bits encoding. We also present the limited selective redundancy injection (LSRI) technique to introduce limited redundancy to conventional adders. The theoretical analysis and implementation results show that the conventional adders with LSRI outperform adders without LSRI in area, delay, power and combined performance measures where there is no strict requirement on accuracy"],"dc:identifier.uri":["http://hdl.handle.net/10355/12412"],"dc:language.iso":["en_US"],"dc:publisher":["University of Missouri--Kansas City"],"dc:title":["Redundant adder architectures for cell-based technology"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical and Computer Engineering (UMKC)","Telecommunications and Computer Networking (UMKC)"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:16:57Z"}