Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/4015
DC FieldValueLanguage
dc.contributor.advisorAyoubi, Raficen_US
dc.contributor.authorAkkad, Ghattasen_US
dc.date.accessioned2020-12-23T14:39:51Z-
dc.date.available2020-12-23T14:39:51Z-
dc.date.issued2014-
dc.identifier.urihttps://scholarhub.balamand.edu.lb/handle/uob/4015-
dc.descriptionIncludes bibliographical references (p.42-43).en_US
dc.descriptionSupervised by Dr. Rafic Ayoubi.en_US
dc.description.abstractSorting is known to be executed very frequently on many computers, mostly in software to handle wide variety of tasks. However software implementations suffer from low speed when dealing with large number of keys. On the other hand, little work has been done to implement sorting in hardware. Most of these implementations suffer from high resource consumption, where sorting large number of keys is prohibitively expensive and thus unrealistic. This thesis presents the implementation of a serial Odd – Even Transposition sorting algorithm. The main motivation of the proposed implementation is the ability to sort large number of keys in real time. Therefore, a bit-wise implementation is proposed; reducing the size of each sorting cell. This, in turn, lead to a higher clock rate, while maintaining its high parallelism. The advantages of such implementation are twofold. First, it is not affected by the width of each key, as opposed to word-wise implementation. Second, it leads to a higher clock rate than previous implementations. These advantages, along with high parallelism, lead to real time sorting. This serial implementation is simulated on FPGA Virtex IV and hosted by FPGA Virtex II Labview PCI card with a DMA based data transfer from computer to FPGA.en_US
dc.description.statementofresponsibilityBy Ghattas Akkaden_US
dc.format.extentix, 43 p. :ill.,tables ;30 cmen_US
dc.language.isoengen_US
dc.rightsThis object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holderen_US
dc.subject.lcshComputer engineeringen_US
dc.subject.lcshComputer algorithmsen_US
dc.subject.lcshSorting (Electronic computers)en_US
dc.titleEfficient serial implementation of Odd-Even transposition sort on FPGAen_US
dc.typeThesisen_US
dc.contributor.departmentDepartment of Computer Engineeringen_US
dc.contributor.facultyFaculty of Engineeringen_US
dc.contributor.institutionUniversity of Balamanden_US
dc.date.catalogued2014-04-15-
dc.description.degreeMS in Computer Engineeringen_US
dc.description.statusPublisheden_US
dc.identifier.ezproxyURLhttp://ezsecureaccess.balamand.edu.lb/login?url=http://olib.balamand.edu.lb/projects_and_theses/GP-CoE-76.pdfen_US
dc.identifier.OlibID153382-
dc.provenance.recordsourceOliben_US
Appears in Collections:UOB Theses and Projects
Show simple item record

Record view(s)

1
checked on Jun 11, 2021

Google ScholarTM

Check


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