constance Amannah | Rivers State University of Education,Port Harcourt,Nigeria (original) (raw)

Uploads

Papers by constance Amannah

Algorithms for Intelligent Systems

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary fo... more This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reaso...

This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascer... more This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascertain a faster numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCFC-TNADSP (Compared Resultant-TNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the FC-TNADSP and FBNADSP which were hitherto simulated on the c++ programming technologies. The c++ served as a signal processing language simulator (SPLS). The execution times of the fast Cooley-Tukey and the fast Bluestein algorithms were 1.70 seconds and 1.74 seconds respectively. On comparing the speeds of the fast Cooley-Tukey and the fast Bluestein algorithms we observed that the fast Cooley-Tukey algorithm has 0.04 seconds speed improvement over the fast Bluestein algorithm. In line with this outcome, we concluded that the fast Cooley-Tukey algorithm (FC-TNA...

The binary search algorithm, which is used in searching a linear collection of sorted items, has ... more The binary search algorithm, which is used in searching a linear collection of sorted items, has a fast runtime of O(logn), but incurs the overhead of performing a search even when the search key is in the non-feasible search space (i.e. outside the range of values in the list). This research presents an optimized Binary Search algorithm that ensures that search is performed if and only if the search key is within the feasible search space, thus exhibiting a faster time complexity than the Binary Search algorithm- in particular, when the search key is outside the feasible search space of the list. The waterfall design approach was chosen since this design is simple, and also the problem was well understood. The design was implemented using java programming language by compares Binary Search Algorithm. When the search key is outside the feasible search space i.e. searching a least for an element that is not in the feasible search space, therefore enabling search to be performed with ...

Science Journal of Circuits, Systems and Signal Processing, 2021

Estate valuation is the art, practice and science for the determination of the value of the entir... more Estate valuation is the art, practice and science for the determination of the value of the entire property description and the interest therein. Estate valuers quest for a better method that will bring effectiveness, accuracy and efficiency in their practice. The need to optimize valuation process and method has become a timely contemporary demand. The research was designed to develop architectural model for estate valuation. The study was poised to; identify the traditional method of estate valuation, design a template for estate valuation, implement the estate valuation template, test and deploy the estate valuation template. The study adopted the waterfall model. It breaks down the project activity into linear sequential phases where each phase depended on the deliverable of the existing one and the next one to a specialization of events. The study achieved its aim; architectural model for estate valuation system (AMVS). The AMVS was implemented on the PHP programming platform w...

Journal of Remote Sensing & GIS, 2018

ON THE DEVELOPMENT OF REAL TIME PARCEL TRACKING AND MONITORING SYSTEM The ability to track packag... more ON THE DEVELOPMENT OF REAL TIME PARCEL TRACKING AND MONITORING SYSTEM The ability to track packages in real time is essential for manufacturers and customers alike. Tracking abilities for customer products and goods began as a way to provide accurate and timely information regarding the expected time of delivery. This study focused on the computing model for real-time parcel tracking and monitoring. It was designed to solve the problem in the tracking system in Nigeria. The real-time parcel tracking and monitoring application is an automated application intended to be accessible online. This allows the application to be available to both mobile phone and pc users who can access the information online. The methodology used was the object oriented technique (OOT). The system produced in this research work has functions that will enable both the receiver and sender of various packages to track and monitor their packages with ease from the comfort of their homes, offices and market usin...

Our contemporary global society is driving towards making all actions and activities digitalized.... more Our contemporary global society is driving towards making all actions and activities digitalized. In Nigeria for instance the Broadcasting Institution is determine to go all digitalized in the year 2018. The speed and scope of transmitting from analog to digital remain issues that need scientific resolution. In view of the foregoing an efficient computing algorithmic platform is a requirement for effective transition from analog to digital transmission. This research was therefore designed to develop a simplified Cooley-Tukey numerical FFT algorithm (SC-TNADSP) necessary for processing digital signals in digital computers. In order to attain this aim, the following objectives were considered; investigation of the Cooley-Tukey FFT numerical algorithm for digital signal processing, re-indexing of the Cooley-Tukey FFT numerical algorithm, decomposition of the re-indexed Cooley-Tukey FFT numerical algorithm, and simplification of the decomposed Cooley-Tukey FFT numerical algorithm. The ...

Micro-Electronics and Telecommunication Engineering

International Journal of Advanced Research in Computer Science and Software Engineering

This study was designed to compare the computing efficiency of C-TNADSP and the BNADSP to ascerta... more This study was designed to compare the computing efficiency of C-TNADSP and the BNADSP to ascertain a more efficient numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCC-TNADSP (Resultant Compared C-TBNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the C-TNADSP and BNADSP, and the c++. The c++ served as a signal processing language simulator (SPLS). The execution times of the Cooley-Tukey and the Bluestein algorithms were 3.44 seconds and 3.50 seconds respectively. On comparing the speeds of the fast Cooley–Tukey and the fast Bluestein algorithms we observed that the Cooley-Tukey algorithm has 0.06 seconds speed improvement over the Bluestein algorithm. In line with this outcome, we concluded that the Cooley-Tukey algorithm (C-TNADSP) is faster than the Bluestein algorithm (BNADSP). In the same vein t...

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary fo... more This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reaso...

This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascer... more This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascertain a faster numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCFCTNADSP (Compared Resultant-TNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the FCTNADSP and FBNADSP which were hitherto simulated on the c++ programming technologies. The c++ served as a signal processing language simulator (SPLS). The execution times of the fast Cooley-Tukey and the fast Bluestein algorithms were 1.70 seconds and 1.74 seconds respectively. On comparing the speeds of the fast Cooley–Tukey and the fast Bluestein algorithms we observed that the fast Cooley-Tukey algorithm has 0.04 seconds speed improvement over the fast Bluestein algorithm. In line with this outcome, we concluded that the fast Cooley-Tukey algorithm (FC-TNADS...

Teaching is an act occasioned by one of the three philosophical maxims of knowledge acquisition o... more Teaching is an act occasioned by one of the three philosophical maxims of knowledge acquisition or both; a teacher may impart by means of his naturally endowed talents, by means of systematically acquired knowledge and pedagogics, or by means of skillful imaginative thinking. The combination of the three maxims is required for the teaching and training on Algorithms. An algorithm is a detailed series of instructions for carrying out an operation or solving a problem. In a non-technical approach, we use algorithms in everyday tasks, such as a recipe to bake a cake or a do-it-yourself handbook. Algorithms are everywhere. Computers use them, your friends use them, and even you use them. Learn more about what algorithms are, as well as... To simplify the involvements associated with Algorithms and their pedagogy, this text is compositely arranged according to the organs Algorithms, according to the major areas of algorithms; Recursive, Backtracking, Divide and Conquer, Dynamic Programmi...

Algorithms for Intelligent Systems

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary fo... more This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reaso...

This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascer... more This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascertain a faster numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCFC-TNADSP (Compared Resultant-TNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the FC-TNADSP and FBNADSP which were hitherto simulated on the c++ programming technologies. The c++ served as a signal processing language simulator (SPLS). The execution times of the fast Cooley-Tukey and the fast Bluestein algorithms were 1.70 seconds and 1.74 seconds respectively. On comparing the speeds of the fast Cooley-Tukey and the fast Bluestein algorithms we observed that the fast Cooley-Tukey algorithm has 0.04 seconds speed improvement over the fast Bluestein algorithm. In line with this outcome, we concluded that the fast Cooley-Tukey algorithm (FC-TNA...

The binary search algorithm, which is used in searching a linear collection of sorted items, has ... more The binary search algorithm, which is used in searching a linear collection of sorted items, has a fast runtime of O(logn), but incurs the overhead of performing a search even when the search key is in the non-feasible search space (i.e. outside the range of values in the list). This research presents an optimized Binary Search algorithm that ensures that search is performed if and only if the search key is within the feasible search space, thus exhibiting a faster time complexity than the Binary Search algorithm- in particular, when the search key is outside the feasible search space of the list. The waterfall design approach was chosen since this design is simple, and also the problem was well understood. The design was implemented using java programming language by compares Binary Search Algorithm. When the search key is outside the feasible search space i.e. searching a least for an element that is not in the feasible search space, therefore enabling search to be performed with ...

Science Journal of Circuits, Systems and Signal Processing, 2021

Estate valuation is the art, practice and science for the determination of the value of the entir... more Estate valuation is the art, practice and science for the determination of the value of the entire property description and the interest therein. Estate valuers quest for a better method that will bring effectiveness, accuracy and efficiency in their practice. The need to optimize valuation process and method has become a timely contemporary demand. The research was designed to develop architectural model for estate valuation. The study was poised to; identify the traditional method of estate valuation, design a template for estate valuation, implement the estate valuation template, test and deploy the estate valuation template. The study adopted the waterfall model. It breaks down the project activity into linear sequential phases where each phase depended on the deliverable of the existing one and the next one to a specialization of events. The study achieved its aim; architectural model for estate valuation system (AMVS). The AMVS was implemented on the PHP programming platform w...

Journal of Remote Sensing & GIS, 2018

ON THE DEVELOPMENT OF REAL TIME PARCEL TRACKING AND MONITORING SYSTEM The ability to track packag... more ON THE DEVELOPMENT OF REAL TIME PARCEL TRACKING AND MONITORING SYSTEM The ability to track packages in real time is essential for manufacturers and customers alike. Tracking abilities for customer products and goods began as a way to provide accurate and timely information regarding the expected time of delivery. This study focused on the computing model for real-time parcel tracking and monitoring. It was designed to solve the problem in the tracking system in Nigeria. The real-time parcel tracking and monitoring application is an automated application intended to be accessible online. This allows the application to be available to both mobile phone and pc users who can access the information online. The methodology used was the object oriented technique (OOT). The system produced in this research work has functions that will enable both the receiver and sender of various packages to track and monitor their packages with ease from the comfort of their homes, offices and market usin...

Our contemporary global society is driving towards making all actions and activities digitalized.... more Our contemporary global society is driving towards making all actions and activities digitalized. In Nigeria for instance the Broadcasting Institution is determine to go all digitalized in the year 2018. The speed and scope of transmitting from analog to digital remain issues that need scientific resolution. In view of the foregoing an efficient computing algorithmic platform is a requirement for effective transition from analog to digital transmission. This research was therefore designed to develop a simplified Cooley-Tukey numerical FFT algorithm (SC-TNADSP) necessary for processing digital signals in digital computers. In order to attain this aim, the following objectives were considered; investigation of the Cooley-Tukey FFT numerical algorithm for digital signal processing, re-indexing of the Cooley-Tukey FFT numerical algorithm, decomposition of the re-indexed Cooley-Tukey FFT numerical algorithm, and simplification of the decomposed Cooley-Tukey FFT numerical algorithm. The ...

Micro-Electronics and Telecommunication Engineering

International Journal of Advanced Research in Computer Science and Software Engineering

This study was designed to compare the computing efficiency of C-TNADSP and the BNADSP to ascerta... more This study was designed to compare the computing efficiency of C-TNADSP and the BNADSP to ascertain a more efficient numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCC-TNADSP (Resultant Compared C-TBNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the C-TNADSP and BNADSP, and the c++. The c++ served as a signal processing language simulator (SPLS). The execution times of the Cooley-Tukey and the Bluestein algorithms were 3.44 seconds and 3.50 seconds respectively. On comparing the speeds of the fast Cooley–Tukey and the fast Bluestein algorithms we observed that the Cooley-Tukey algorithm has 0.06 seconds speed improvement over the Bluestein algorithm. In line with this outcome, we concluded that the Cooley-Tukey algorithm (C-TNADSP) is faster than the Bluestein algorithm (BNADSP). In the same vein t...

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary fo... more This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reaso...

This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascer... more This study was designed to compare the computing efficiency of FC-TNADSP and the FBNADSP.to ascertain a faster numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCFCTNADSP (Compared Resultant-TNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the FCTNADSP and FBNADSP which were hitherto simulated on the c++ programming technologies. The c++ served as a signal processing language simulator (SPLS). The execution times of the fast Cooley-Tukey and the fast Bluestein algorithms were 1.70 seconds and 1.74 seconds respectively. On comparing the speeds of the fast Cooley–Tukey and the fast Bluestein algorithms we observed that the fast Cooley-Tukey algorithm has 0.04 seconds speed improvement over the fast Bluestein algorithm. In line with this outcome, we concluded that the fast Cooley-Tukey algorithm (FC-TNADS...

Teaching is an act occasioned by one of the three philosophical maxims of knowledge acquisition o... more Teaching is an act occasioned by one of the three philosophical maxims of knowledge acquisition or both; a teacher may impart by means of his naturally endowed talents, by means of systematically acquired knowledge and pedagogics, or by means of skillful imaginative thinking. The combination of the three maxims is required for the teaching and training on Algorithms. An algorithm is a detailed series of instructions for carrying out an operation or solving a problem. In a non-technical approach, we use algorithms in everyday tasks, such as a recipe to bake a cake or a do-it-yourself handbook. Algorithms are everywhere. Computers use them, your friends use them, and even you use them. Learn more about what algorithms are, as well as... To simplify the involvements associated with Algorithms and their pedagogy, this text is compositely arranged according to the organs Algorithms, according to the major areas of algorithms; Recursive, Backtracking, Divide and Conquer, Dynamic Programmi...