<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T10:02:31Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/43638" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/43638</identifier><datestamp>2026-05-14T13:50:22Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Karl, Julia</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Manohar,Rajit</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Albonesi,David H.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Studer,Christoph</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-04-04T18:05:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-02-01T07:01:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016-02-01</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/43638</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">9597097</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Most bit serial computation is done least significant bit first (LSB) because it is a natural implementation of the carry chain. However, number comparisons need to start at the most significant bit (MSB) making MSB-first logic very important for executing programs with a lot of comparisons. This paper presents the design of an asynchronous bit serial MSB-first adder that uses a conventional two's complement binary encoding. The adder can process varying unmatched input bit lengths at run time and produce the minimal bit length addition result. However, since it has a data-dependent output latency, it is only suitable only for an asynchronous implementation. We compare this adder to an asynchronous bitserial LSB-first adder and a bit-parallel carry ripple adder in HSPICE using a 90nm process. The results will show that this MSB-first adder uses 3.15 times the energy as the analogous LSB-first adder. It also produces the most significant bit 1.10 times faster than the LSB-first adder and carry ripple adder. Optimizations made to a constant-response time counter used in the design are also described.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">Arithmetic</dim:field>
   <dim:field mdschema="dc" element="subject">Asynchronous</dim:field>
   <dim:field mdschema="dc" element="title">Most Significant Bit-First Serial Adder</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Electrical Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Master of Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">M.S., Electrical Engineering</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Karl, Julia</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="85a28160-0363-4533-b8ac-c7591018d29c">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Most Significant Bit-First Serial Adder&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2016-02-01&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Karl, Julia&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Arithmetic&lt;/Keyword>
    &lt;Keyword>Asynchronous&lt;/Keyword>
   	&lt;Abstract>Most bit serial computation is done least significant bit first (LSB) because it is a natural implementation of the carry chain. However, number comparisons need to start at the most significant bit (MSB) making MSB-first logic very important for executing programs with a lot of comparisons. This paper presents the design of an asynchronous bit serial MSB-first adder that uses a conventional two&amp;apos;s complement binary encoding. The adder can process varying unmatched input bit lengths at run time and produce the minimal bit length addition result. However, since it has a data-dependent output latency, it is only suitable only for an asynchronous implementation. We compare this adder to an asynchronous bitserial LSB-first adder and a bit-parallel carry ripple adder in HSPICE using a 90nm process. The results will show that this MSB-first adder uses 3.15 times the energy as the analogous LSB-first adder. It also produces the most significant bit 1.10 times faster than the LSB-first adder and carry ripple adder. Optimizations made to a constant-response time counter used in the design are also described.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>