Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/6906
DC FieldValueLanguage
dc.contributor.advisorAyoubi, Raficen_US
dc.contributor.authorNicolas, Elieen_US
dc.date.accessioned2023-07-26T07:15:03Z-
dc.date.available2023-07-26T07:15:03Z-
dc.date.issued2023-
dc.identifier.urihttps://scholarhub.balamand.edu.lb/handle/uob/6906-
dc.descriptionIncludes bibliographical references (p. 49-55)en_US
dc.description.abstractApproximation techniques have always been of great benefit to engineering and other applications which involve real-life data which can sometimes be of high complexity to solve exactly. In many situations, exact solutions to complex problems may be challenging or impossible to obtain, making approximation techniques necessary for making informed decisions. In this study, Chebyshev approximation technique is thoroughly investigated along with its convergence rate and accuracy. An FPGA implementation of this approximation technique is discussed and analyzed. This implementation will be compared to other implementations of approximation techniques such as Taylor series with parameters such as accuracy, speed, and design size taken into consideration. Applications of this FPGA implementation were also discussed and shown such as approximating the sigmoid function for machine learning in an efficient manner. In comparison with other methods, Chebyshev approximation is preferred for its fast convergence rate, global approximation capability, and robustness in approximating functions with rapid variations. Chebyshev approximation is also known to be well-suited for implementation in hardware due to its simplicity in computation and high accuracy. This study proved the adequacy of the Chebyshev approximation and its accelerated FPGA implementation for various applications including machine learning, filter design, DSP, and many other practical applications in engineering and science.en_US
dc.description.statementofresponsibilityby Elie Nicolasen_US
dc.format.extent1 online resource (x, 64 pages) : ill., tablesen_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.subjectApproximation Theory, Approximation Techniques, Chebyshev Approximation, Chebyshev Polynomial, Taylor Series, FPGA, Pipeliningen_US
dc.subject.lcshChebyshev approximationen_US
dc.subject.lcshChebyshev approximation--Computer programen_US
dc.subject.lcshUniversity of Balamand--Dissertationsen_US
dc.subject.lcshDissertations, Academicen_US
dc.titleChebyshev approximation technique: analysis and applicationsen_US
dc.typeThesisen_US
dc.contributor.corporateUniversity of Balamanden_US
dc.contributor.departmentDepartment of Computer Engineeringen_US
dc.contributor.facultyFaculty of Engineeringen_US
dc.contributor.institutionUniversity of Balamanden_US
dc.date.catalogued2023-07-26-
dc.description.statusUnpublisheden_US
dc.identifier.OlibID315924-
dc.rights.accessrightsThis item is under embargo until end of year 2025.en_US
dc.provenance.recordsourceOliben_US
Appears in Collections:UOB Theses and Projects
Show simple item record

Record view(s)

60
checked on Dec 1, 2023

Google ScholarTM

Check


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