Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp0112579v29f
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorPoor, V.en_US
dc.contributor.authorReavy, Maire D.en_US
dc.contributor.authorReavy, Maire D.en_US
dc.date.accessioned2014-09-22T17:02:04Z-
dc.date.available2014-09-22T17:02:04Z-
dc.date.issued1992en_US
dc.identifier.other5729en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp0112579v29f-
dc.format.extent96 Pagesen_US
dc.titleA Continuing Numerical Comparison of the Levinson and the Delta Algorithms to Examine How Well Each Handles Fast-Sampled Data and a Binary Package for That Purposeen_US
dc.typePrinceton University Senior Thesesen_US
pu.projectgrantnumber690-2143en_US
pu.date.classyear1992en_US
pu.departmentElectrical Engineeringen_US
pu.locationThis thesis can be viewed in person at the <a href=http://mudd.princeton.edu>Mudd Manuscript Library</a>. To order a copy complete the <a href="http://rbsc.princeton.edu/senior-thesis-order-form" target="_blank">Senior Thesis Request Form</a>. For more information contact <a href=mailto:mudd@princeton.edu>mudd@princeton.edu</a>.en_US
Appears in Collections:Electrical and Computer Engineering, 1932-2023

Files in This Item:
There are no files associated with this item.


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.