<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>A </nonSort>
    <title>design of array multiplier</title>
  </titleInfo>
  <name type="personal">
    <namePart>Chen, Peng</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Yulu, Qi</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Murai, Shunji</namePart>
    <role>
      <roleTerm type="text">Examination committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Huynh, Ngoc Phien</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>SEC</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1995</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>38 leaves + 1 online resource</extent>
  </physicalDescription>
  <abstract>In this thesis, a new design technique, 3n-2m scheme, for array multipliers is presented. Its efficiency and flexibility are analyzed. Comparison with existing designs is discussed. The author also provides its application to some existing array multiplier technique for faster speed. The design to combine multiplication with addition is implemented on the basis of existing multiplier technique and new proposed 3n-2m scheme.</abstract>
  <note>A thesis submitted in partial fulfilment of the requirement for the degree of Master of Science</note>
  <note>Thesis (M.Sc.) - Asian Institute of Technology, 1995</note>
  <subject authority="lcsh">
    <topic>Multiplication</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. CS-95-24</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B15030</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B15030</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">080998</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818090226.0</recordChangeDate>
  </recordInfo>
</mods>
