Search Results

1 - 4 of 4 items

  • Author: Mhnd Farhan x
Clear All Modify Search

Abstract

This paper presents a system that employs the use of speech technology to control electronic devices attached to PC. The work in this paper is implemented in two major phases. Phase one is the software part of the system. Its role is to accept voice signal from a microphone attached to the PC and perform speech recognition on the signal, determine operating commands from the recognized phrases and control devices attached to the computer ports. Phase two is hardware logic circuit connected between the PC’s printer port and the devices being controlled. This logic circuit which is implemented using simple logic gates performs addressing and control mode for the electronic devices being controlled. The system runs on windows vista operating system and it is capable of authenticating users and validating their action. User response for the system is provided in both voice response and graphic display messages.

Abstract

Owing to the increase in the internet traffic, any calculation that requires more than linear time would be considered unreasonably moderate for constant applications. One cure is to utilize numerous processors to build up associations in parallel and the other is to construct low cost, high speed, large capacity non-blocking switching architecture. In this paper, our focus is on developing parallel algorithms for routing which will ensure high-speed internet connectivity and at the same time making the system to be cost effective.

Abstract

This paper implores the parallelization of Fast Fourier Transform (FFT) algorithms and evaluates the resultant parallelized source codes. The FFT algorithm is considered to be among the most important algorithms in the digital era. There are various FFT algorithms but just a few are considered in this paper. The Cooley-Tukey FFT is the most widely known and used. With no exception, in this paper, the radix-2 Decimation in Time (DIT) and Decimation in Frequency (DIF) are studied and implemented. Another important FFT algorithm that is the Goertzel is also considered in this paper.

Abstract

Nobody in this world wants to be held hostage in a traffic jam for hours and hours. The need to have efficient traffic flow in our roads cannot be overemphasized. It is in this understanding that this paper delves into the study and implementation of a suitable algorithm for traffic routing. The implementation is based on graph theory, where a road network map is first converted to a graph with nodes and edges where the edges represent the roads and the nodes represent the various road intersections. The roads are given various weights depending on their distance and traffic density, and the time a motorist would take to move from one point to another is estimated. A suitable routing algorithm, which in this case is the Dijkstra’s algorithm is applied on the weighted graph.