This Paper is a review study of FPGA implementation of Finite Impulse response (FIR) with low cost and high performance. The key observation of this paper is an elaborate analysis about hardware implementations of FIR filters using different algorithm i.e., Distributed Arithmetic (DA), DA-Offset Binary Coding (DA-OBC), Common Sub-expression Elimination (CSE) and sum-of-power-of-two (SOPOT) with less resources and without affecting the performance of the original FIR Filter.
High Performance DSP with Xilinx All Programmable Devices (Design Conference ...Analog Devices, Inc.
This session includes a discussion on rapid prototyping concepts using Xilinx All Programmable FPGAs and SoCs with Analog Devices high speed and precision products. Covered in this session will be common use cases for Xilinx devices in DSP applications that interface to high speed analog. An overview will be provided of how Xilinx accelerates development with DSP platforms that can be used to quickly evaluate and prototype systems that include high speed analog, programmable logic, and embedded processing. Also covered will be an introduction to Xilinx’s new Vivado Design Suite development environment that shortens design cycles by providing an IP centric design flow, easy to use design analysis and debug, and high level design flows supporting C/C++ and MATLAB/Simulink.
Histogram Processing
Histogram Equalization
Histogram Matching
Local Histogram processing
Using histogram statistics for image enhancement
Uses for Histogram Processing
Histogram Equalization
Histogram Matching
Local Histogram Processing
Basics of Spatial Filtering
Overlap Add, Overlap Save(digital signal processing)Gourab Ghosh
In DSP to solve a convolution of a long duration sequence there are two popular methods. Overlap Add, Overlap Save. In this presentation i've discussed about both.
- Gourab Ghosh
High Performance DSP with Xilinx All Programmable Devices (Design Conference ...Analog Devices, Inc.
This session includes a discussion on rapid prototyping concepts using Xilinx All Programmable FPGAs and SoCs with Analog Devices high speed and precision products. Covered in this session will be common use cases for Xilinx devices in DSP applications that interface to high speed analog. An overview will be provided of how Xilinx accelerates development with DSP platforms that can be used to quickly evaluate and prototype systems that include high speed analog, programmable logic, and embedded processing. Also covered will be an introduction to Xilinx’s new Vivado Design Suite development environment that shortens design cycles by providing an IP centric design flow, easy to use design analysis and debug, and high level design flows supporting C/C++ and MATLAB/Simulink.
Histogram Processing
Histogram Equalization
Histogram Matching
Local Histogram processing
Using histogram statistics for image enhancement
Uses for Histogram Processing
Histogram Equalization
Histogram Matching
Local Histogram Processing
Basics of Spatial Filtering
Overlap Add, Overlap Save(digital signal processing)Gourab Ghosh
In DSP to solve a convolution of a long duration sequence there are two popular methods. Overlap Add, Overlap Save. In this presentation i've discussed about both.
- Gourab Ghosh
Talk on Optimization for Deep Learning, which gives an overview of gradient descent optimization algorithms and highlights some current research directions.
Describes ARM7-TDMI Processor Instruction Set. Explains classes of ARM7 instructions, syntax of data processing instructions, branch instructions, load-store instructions, coprocessor instructions, thumb state instructions.
This slides about brief Introduction to Image Restoration Techniques. How to estimate the degradation function, noise models and its probability density functions.
Talk on Optimization for Deep Learning, which gives an overview of gradient descent optimization algorithms and highlights some current research directions.
Describes ARM7-TDMI Processor Instruction Set. Explains classes of ARM7 instructions, syntax of data processing instructions, branch instructions, load-store instructions, coprocessor instructions, thumb state instructions.
This slides about brief Introduction to Image Restoration Techniques. How to estimate the degradation function, noise models and its probability density functions.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
RISC Implementation Of Digital IIR Filter in DSPiosrjce
This paper is base on the implementation of Reduce Instruction set computer with the application of
Discrete Cosine transform (DCT) , Inverse DCT, Discrete Fourier Transform (DFT) and Fast Fourier
Transform (FFT), Digital filter are performed by DSP system. Digital filter is one of the important contents of
digital signal process. The performance of the processor design is improved by using the pipeline approach. It
allows the processor to work on different steps of the instruction at the same time, thus more instruction can be
executed in a shorter period of time. The analysis of this processor will provide various features including
arithmetic operations. The speed of operation is mainly affected by the computational complexity due to
multipliers and adder modules of the digital systems. Our work will targets the computer architecture courses
and presents an FPGA (Field Programmable Gate Array) implementation of a MIPS (Microprocessor without
Interlocked Pipeline Stages) via VHDL (Very high speed integrated circuit Hardware Description Language)
design. The latency and computational time is utmost important in microprocessor. Thus we design the
multiplier and adder module with improve latency and computational time.
Next Generation Fiber Structured Cabling and Migration to 40/100gPanduit
The new high speed Ethernet standards, 40GBASE-SR4 and 100GBASE-SR10, will require a change in the fiber cable plant. Here we examine the media and connectivity solutions needed to ease the migration for 10 Gigabit Ethernet to 40 and 100 Gigabit Ethernet.
Digital Beamforming for Simultaneous Power and Information Transmission in Wi...idescitation
This paper proposes a Beamforming algorithm for
simultaneous transmission of information and power in multi-
antenna linear array system. Here we considered three node
system in which transmitter and receiver are largely separated
from each other whereas energy harvesting circuit is co-
located with the information receiver i.e. encounters the same
channel from the transmitter. Our primary motto is to
maximize the energy harvested by the harvester circuit, at
the same time maintaining the information rate above a
certain threshold level. Firstly, we used an algorithm to steer
the antenna beam in a desired direction. Secondly, we
combined this algorithm with another algorithm that
maximizes the harvested energy. The hybrid algorithm
produces an improvement in the result in terms of received
signal level and side-lobe level. Finally, simulation results
are presented to justify the effectiveness of the proposed
algorithm.
Design of Multiplier Less 32 Tap FIR Filter using VHDLIJMER
This Paper provide the principles of Distributed Arithmetic, and introduce it into the FIR
filters design, and then presents a 32-Tap FIR low-pass filter using Distributed Arithmetic, which save
considerable MAC blocks to decrease the circuit scale and pipeline structure is also used to increase the
system speed. The implementation of FIR filters on FPGA based on traditional method costs considerable
hardware resources, which goes against the decrease of circuit scale and the increase of system speed.
It is very well known that the FIR filter consists of Delay elements, Multipliers and Adders. Because of
usage of Multipliers in early design gives rise to 2 demerits that are:
(i) Increase in Area and
(ii) Increase in the Delay which ultimately results in low performance (Less speed).
So the Distributed Arithmetic for FIR Filter design and Implementation is provided in this work to solve
this problem. Distributed Arithmetic structure is used to increase the recourse usage and pipeline
structure is used to increase the system speed. Distributed Arithmetic can save considerable hardware
resources through using LUT to take the place of MAC units
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Linear Phase FIR Low Pass Filter Design Based on Firefly Algorithm IJECEIAES
In this paper, a linear phase Low Pass FIR filter is designed and proposed based on Firefly algorithm. We exploit the exploitation and exploration mechanism with a local search routine to improve the convergence and get higher speed computation. The optimum FIR filters are designed based on the Firefly method for which the finite word length is used to represent coefficients. Furthermore, Particle Swarm Optimization (PSO) and Differential Evolution algorithm (DE) will be used to show the solution. The results will be compared with PSO and DE methods. Firefly algorithm and Parks–McClellan (PM) algorithm are also compared in this paper thoroughly. The design goal is successfully achieved in all design examples using the Firefly algorithm. They are compared with that obtained by using the PSO and the DE algorithm. For the problem at hand, the simulation results show that the Firefly algorithm outperforms the PSO and DE methods in some of the presented design examples. It also performs well in a portion of the exhibited design examples particularly in speed and quality.
Implementation and Performance Analysis of Kaiser and Hamming Window Techniqu...IJERA Editor
Considering the importance of real time filtering, a comparison was done between two prominent window
techniques known for digital filtering. A 16 tap digital band pass FIR filter is designed for each design technique
(Kaiser and Hamming) and implemented over FPGA. The Simulink model of the filter confirms the correctness
and other properties of the digital filter. Further a hardware descriptive code (VHDL) is generated for the
designed filter which then will be loaded on to the FPGA. The VHDL code is speed optimized. The VHDL code
is simulated and synthesized in Xilinx ISE. Further the performance analysis is done on FPGA to determine the
applicability of the filter.
“FIELD PROGRAMMABLE DSP ARRAYS” - A NOVEL RECONFIGURABLE ARCHITECTURE FOR EFF...sipij
Digital Signal Processing functions are widely used in real time high speed applications. Those functions
are generally implemented either on ASICs with inflexibility, or on FPGAs with bottlenecks of relatively
smaller utilization factor or lower speed compared to ASIC. The proposed reconfigurable DSP processor is
redolent to FPGA, but with basic fixed Common Modules (CMs) (like adders, subtractors, multipliers,
scaling units, shifters) instead of CLBs. This paper introduces the development of a reconfigurable DSP
processor that integrates different filter and transform functions. The switching between DSP functions is
occurred by reconfiguring the interconnection between CMs. Validation of the proposed reconfigurable
architecture has been achieved on Virtex5 FPGA. The architecture provides sufficient amount of flexibility,
parallelism and scalability.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
A Novel Architecture for Different DSP Applications Using Field Programmable ...journal ijme
This paper presents a reconfigurable processor for different digital signal processing applications. The performance of the proposed architecture has been evaluated by taking different dsp applications like Low pass filter, high pass filter, finite impulse response (FIR) filter and FFT module. We designed the architecture of the processor and realizing the architecture using adder, multiplier, delay unit and validate it in the FPGA, which show that the hardware scheme is feasible for practical application. The experimental results clearly reveal the novelty of the architecture for dsp applications. This paper investigates the potential use of FPGAs for implementing efficient “Reconfigurable Processor” for different dsp applications. The proposed processor is based on parallel re-configurable which is implemented on FPGA. FPGAs have become an important component for implementing these functions with respect to cost, performance and flexibility. The general purpose SPARTAN 3AN FPGA kit has been employed for developing reconfigurable processor, with all the coding done using the hardware description language VERILOG.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Design and implementation of two-dimensional digital finite impulse response...IJECEIAES
The main purpose of this paper is to design a two-dimensional digital finite impulse response (FIR) filter using data broadcast and non-broadcast structure. The implementation of two-dimensional digital FIR filter is done using very high speed integrated circuit hardware description language (VHDL). Rectangular window method is used for calculating 2D digital FIR filter coefficients for data broadcast and non-broadcast structure. The coefficients of the one-dimensional digital FIR filter are obtained using the MATLAB filter design and analysis (FDA) tool for two different cut-off frequencies and are multiplied to get the necessary coefficient for the two-dimensional FIR filter to be designed; the simulation is done on Artix-7 series field programmable gate array (FPGA), target device (xc7a35t-cpg236) using Vivadov.2015.2. The proposed design reduces the area utilization and the power consumption when compared with the existing literature. The experimental result shows that the power consumption is improved by 97% and there is an improvement of 24% in area utilization for the two-dimensional with and without data broadcast one dimensional FIR filter structures.
FPGA based Efficient Interpolator design using DALUT Algorithmcscpconf
Interpolator is an important sampling device used for multirate filtering to provide signal processing in wireless communication system. There are many applications in which sampling rate must be changed. Interpolators and decimators are utilized to increase or decrease the sampling rate. In this paper an efficient method has been presented to implement high speed and area efficient interpolator for wireless communication systems. A multiplier less technique is used which substitutes multiplyand-accumulate operations with look up table (LUT) accesses. Interpolator has been implemented using Partitioned distributed arithmetic look up table (DALUT) technique. This technique has been used to take an optimal advantage of embedded LUTs of the target FPGA. This method is useful to enhance the system performance in terms of speed and area. The proposed interpolator has been designed using half band poly phase FIR structure with Matlab, simulated with ISE, synthesized with Xilinx Synthesis Tools (XST) and implemented on Spartan-3E and Virtex2pro device. The proposed LUT based multiplier less approach has shown a maximum operating frequency of 92.859 MHz with Virtex Pro and 61.6 MHz with Spartan 3E by consuming considerably less resources to provide cost effective solution for wireless communication systems.
FPGA based Efficient Interpolator design using DALUT Algorithmcscpconf
Interpolator is an important sampling device used for multirate filtering to
provide signal processing in wireless communication system. There are many
applications in which sampling rate must be changed. Interpolators and decimators are
utilized to increase or decrease the sampling rate. In this paper an efficient method has
been presented to implement high speed and area efficient interpolator for wireless
communication systems. A multiplier less technique is used which substitutes multiplyand-accumulate
operations with look up table (LUT) accesses. Interpolator has been
implemented using Partitioned distributed arithmetic look up table (DALUT)
technique. This technique has been used to take an optimal advantage of embedded
LUTs of the target FPGA. This method is useful to enhance the system performance in
terms of speed and area. The proposed interpolator has been designed using half band
poly phase FIR structure with Matlab, simulated with ISE, synthesized with Xilinx
Synthesis Tools (XST) and implemented on Spartan-3E and Virtex2pro device. The
proposed LUT based multiplier less approach has shown a maximum operating
frequency of 92.859 MHz with Virtex Pro and 61.6 MHz with Spartan 3E by
consuming considerably less resources to provide cost effective solution for wireless
communication systems.
Efficient FPGA implementation of high speed digital delay for wideband beamfor...journalBEEI
In this paper, the authors present an FPGA implementation of a digital delay for beamforming applications. The digital delay is based on a Parallel Farrow Filter. Such architecture allows to reach a very high processing rate with wideband signals and it is suitable to be used with Time-Interleaved Analog to Digital Converters (TI-ADC). The proposed delay has been simulated in MATLAB, implemented on FPGA and characterized in terms of amplitude and phase response, maximum clock frequency and area.
Analysis of different FIR Filter Design Method in terms of Resource Utilizati...ijsrd.com
In this paper fully parallel FIR filters are designed with different design method on FPGA for resource utilization and response analysis. fully parallel band-pass FIR filters with same specification designed and simulated on ISE. The suggested implementations are synthesized with Xilinx ISE 14.2 version. Results show comparison of three different filter design methods in terms of resource utilization.
Fault Tolerant Parallel Filters Based On Bch CodesIJERA Editor
Digital filters are used in signal processing and communication systems. In some cases, the reliability of those
systems is critical, and fault tolerant filter implementations are needed. Over the years, many techniques that
exploit the filters’ structure and properties to achieve fault tolerance have been proposed. As technology scales,
it enables more complex systems that incorporate many filters. In those complex systems, it is common that
some of the filters operate in parallel, for example, by applying the same filter to different input signals.
Recently, a simple technique that exploits the presence of parallel filters to achieve multiple fault tolerance has
been presented. In this brief, that idea is generalized to show that parallel filters can be protected using Bose–
Chaudhuri–Hocquenghem codes (BCH) in which each filter is the equivalent of a bit in a traditional ECC. This
new scheme allows more efficient protection when the number of parallel filters is large.
DESIGN OF QUATERNARY LOGICAL CIRCUIT USING VOLTAGE AND CURRENT MODE LOGICVLSICS Design
In VLSI technology, designers main concentration were on area required and on performance of the
device. In VLSI design power consumption is one of the major concerns due to continuous increase in chip
density and decline in size of CMOS circuits and frequency at which circuits are operating. By considering
these parameter logical circuits are designed using quaternary voltage mode logic and quaternary current
mode logic. Power consumption required for quaternary voltage mode logic is 51.78 % less as compared
to binary . Area in terms of number of transistor required for quaternary voltage mode logic is 3 times
more as compared to binary. As quaternary voltage mode circuit required large area as compared to
quaternary current mode circuit but power consumption required in quaternary voltage mode circuit is less
than that required in quaternary current mode circuit .
Similar to FPGA Implementation of FIR Filter using Various Algorithms: A Retrospective (20)
Help the Genetic Algorithm to Minimize the Urban Traffic on IntersectionsIJORCS
Control of traffic lights at the intersections of the main issues is the optimal traffic. Intersections to regulate traffic flow of vehicles and eliminate conflicting traffic flows are used. Modeling and simulation of traffic are widely used in industry. In fact, the modeling and simulation of an industrial system is studied before creating economically and when it is affordable. The aim of this article is a smart way to control traffic. The first stage of the project with the objective of collecting statistical data (cycle time of each of the intersection of the lights of vehicles is waiting for a red light) steps where the data collection found optimal amounts next it is. Introduced by genetic algorithm optimization of parameters is performed. GA begin with coding step as a binary variable (the range specified by the initial data set is obtained) will start with an initial population and then a new generation of genetic operators mutation and crossover and will Finally, the members of the optimal fitness values are selected as the solution set. The optimal output of Petri nets CPN TOOLS modeling and software have been implemented. The results indicate that the performance improvement project in intersections traffic control systems. It is known that other data collected and enforced intersections of evolutionary methods such as genetic algorithms to reduce the waiting time for traffic lights behind the red lights and to determine the appropriate cycle.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 4). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
All paper submissions (http://www.ijorcs.org/submit-paper) are received and managed electronically by IJORCS Team. Detailed instructions about the submission procedure are available on IJORCS website (http://www.ijorcs.org/author-guidelines)
License plate recognition system is one of the core technologies in intelligent traffic control. In this paper, a new and tunable algorithm which can detect multiple license plates in high resolution applications is proposed. The algorithm aims at investigation into and identification of the novel Iranian and some European countries plate, characterized by both inclusion of blue area on it and its geometric shape. Obviously, the suggested algorithm contains suitable velocity due to not making use of heavy pre-processing operation such as image-improving filters, edge-detection operation and omission of noise at the beginning stages. So, the recommended method of ours is compatible with model-adaptation, i.e., the very blue section of the plate so that the present method indicated the fact that if several plates are included in the image, the method can successfully manage to detect it. We evaluated our method on the two Persian single vehicle license plate data set that we obtained 99.33, 99% correct recognition rate respectively. Further we tested our algorithm on the Persian multiple vehicle license plate data set and we achieved 98% accuracy rate. Also we obtained approximately 99% accuracy in character recognition stage.
Using Virtualization Technique to Increase Security and Reduce Energy Consump...IJORCS
An approach has been presented in this paper in order to generate a secure environment on internet Based Virtual Computing platform and also to reduce energy consumption in green cloud computing. The proposed approach constantly checks the accuracy of stored data by means of a central control service inside the network environment and also checks system security through isolating single virtual machines using a common virtual environment. This approach has been simulated on two types of Virtual Machine Manager (VMM) Quick EMUlator (Qemu), HVM (Hardware Virtual Machine) Xen and outputs of the simulation in VMInsight show that when service is getting singly used, the overhead of its performance will be increased. As a secure system, the proposed approach is able to recognize malicious behaviors and assure service security by means of operational integrity measurement. Moreover, the rate of system efficiency has been evaluated according to the amount of energy consumption on five applications (Defragmentation, Compression, Linux Boot Decompression and Kernel Boot). Therefore, this has been resulted that to secure multi-tenant environment, managers and supervisors should independently install a security monitoring system for each Virtual Machines (VMs) which will come up to have the management heavy workload of. While the proposed approach, can respond to all VM’s with just one virtual machine as a supervisor.
Algebraic Fault Attack on the SHA-256 Compression FunctionIJORCS
The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is proposed under the word-oriented random fault model. During the attack, an automatic tool STP is exploited, which constructs binary expressions for the word-based operations in SHA-256 compression function and then invokes a SAT solver to solve the equations. The simulation of the new attack needs about 65 fault injections to recover the chaining value and the input message block with about 200 seconds on average. Moreover, based on the attack on SHA-256 compression function, an almost universal forgery attack on HMAC-SHA-256 is presented. Our algebraic fault analysis is generic, automatic and can be applied to other ARX-based primitives.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 2). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
To view complete list of topics coverage of IJORCS, Aim & Scope, please visit, www.ijorcs.org/scope
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 1). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
Voice Recognition System using Template MatchingIJORCS
It is easy for human to recognize familiar voice but using computer programs to identify a voice when compared with others is a herculean task. This is due to the problem that is encountered when developing the algorithm to recognize human voice. It is impossible to say a word the same way in two different occasions. Human speech analysis by computer gives different interpretation based on varying speed of speech delivery. This research paper gives detail description of the process behind implementation of an effective voice recognition algorithm. The algorithm utilize discrete Fourier transform to compare the frequency spectra of two voice samples because it remained unchanged as speech is slightly varied. Chebyshev inequality is then used to determine whether the two voices came from the same person. The algorithm is implemented and tested using MATLAB.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
A Review and Analysis on Mobile Application Development Processes using Agile...IJORCS
Over a last decade, mobile telecommunication industry has observed a rapid growth, proved to be highly competitive, uncertain and dynamic environment. Besides its advancement, it has also raised number of questions and gained concern both in industry and research. The development process of mobile application differs from traditional softwares as the users expect same features similar to their desktop computer applications with additional mobile specific functionalities. Advanced mobile applications require assimilation with existing enterprise computing systems such as databases, legacy applications and Web services. In addition, the lifecycle of a mobile application moves much faster than that of a traditional Web application and therefore the lifecycle management associated therein must be adjusted accordingly. The Security and application testing are more stimulating and interesting in mobile application than in Web applications since the technology in mobile devices progresses rapidly and developers must stay in touch with the latest developments, news and trends in their area of work. With the rising competence of software market, researchers are seeking more flexible methods that can adjust to dynamic situations where software system requirements are changing over time, producing valuable software in short duration and within low budget. The intrinsic uncertainty and complexity in any software project therefore requires an iterative developmental plan to cope with uncertainty and a large number of unknown variables. Agile Methodologies were thus introduced to meet the new requirements of the software development companies. The agile methodologies aim at facilitating software development processes where changes are acceptable at any stage and provide a structure for highly collaborative software development. Therefore, the present paper aims in reviewing and analysing different prevalent methodologies utilizing agile techniques that are currently in use for the development of mobile applications. This paper provides a detailed review and analysis on the use of agile methodologies in the proposed processes associated with mobile application skills and highlights its benefit and constraints. In addition, based on this analysis, future research needs are identified and discussed.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Improving the Efficiency of Spectral Subtraction Method by Combining it with ...IJORCS
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal from time domain to frequency domain is required. On the other hand, Wavelet transform displays another aspect of speech signal. In this paper we have applied a new approach in which SSM is cascaded with wavelet thresholding technique (WTT) for improving the quality of speech signal by removing the problem of musical noise to a great extent. Results of this proposed system have been simulated on MATLAB.
An Adaptive Load Sharing Algorithm for Heterogeneous Distributed SystemIJORCS
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
The Design of Cognitive Social Simulation Framework using Statistical Methodo...IJORCS
Modeling the behavior of the cognitive architecture in the context of social simulation using statistical methodologies is currently a growing research area. Normally, a cognitive architecture for an intelligent agent involves artificial computational process which exemplifies theories of cognition in computer algorithms under the consideration of state space. More specifically, for such cognitive system with large state space the problem like large tables and data sparsity are faced. Hence in this paper, we have proposed a method using a value iterative approach based on Q-learning algorithm, with function approximation technique to handle the cognitive systems with large state space. From the experimental results in the application domain of academic science it has been verified that the proposed approach has better performance compared to its existing approaches.
An Enhanced Framework for Improving Spatio-Temporal Queries for Global Positi...IJORCS
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
A PSO-Based Subtractive Data Clustering AlgorithmIJORCS
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional clustering algorithms such as the k-means algorithm are the most popular algorithms for clustering large datasets. The major problem with partitional clustering algorithms is that they are sensitive to the selection of the initial partitions and are prone to premature converge to local optima. Subtractive clustering is a fast, one-pass algorithm for estimating the number of clusters and cluster centers for any given set of data. The cluster estimates can be used to initialize iterative optimization-based clustering methods and model identification methods. In this paper, we present a hybrid Particle Swarm Optimization, Subtractive + (PSO) clustering algorithm that performs fast clustering. For comparison purpose, we applied the Subtractive + (PSO) clustering algorithm, PSO, and the Subtractive clustering algorithms on three different datasets. The results illustrate that the Subtractive + (PSO) clustering algorithm can generate the most compact clustering results as compared to other algorithms.
Cancer cell metabolism: special Reference to Lactate PathwayAADYARAJPANDEY1
Normal Cell Metabolism:
Cellular respiration describes the series of steps that cells use to break down sugar and other chemicals to get the energy we need to function.
Energy is stored in the bonds of glucose and when glucose is broken down, much of that energy is released.
Cell utilize energy in the form of ATP.
The first step of respiration is called glycolysis. In a series of steps, glycolysis breaks glucose into two smaller molecules - a chemical called pyruvate. A small amount of ATP is formed during this process.
Most healthy cells continue the breakdown in a second process, called the Kreb's cycle. The Kreb's cycle allows cells to “burn” the pyruvates made in glycolysis to get more ATP.
The last step in the breakdown of glucose is called oxidative phosphorylation (Ox-Phos).
It takes place in specialized cell structures called mitochondria. This process produces a large amount of ATP. Importantly, cells need oxygen to complete oxidative phosphorylation.
If a cell completes only glycolysis, only 2 molecules of ATP are made per glucose. However, if the cell completes the entire respiration process (glycolysis - Kreb's - oxidative phosphorylation), about 36 molecules of ATP are created, giving it much more energy to use.
IN CANCER CELL:
Unlike healthy cells that "burn" the entire molecule of sugar to capture a large amount of energy as ATP, cancer cells are wasteful.
Cancer cells only partially break down sugar molecules. They overuse the first step of respiration, glycolysis. They frequently do not complete the second step, oxidative phosphorylation.
This results in only 2 molecules of ATP per each glucose molecule instead of the 36 or so ATPs healthy cells gain. As a result, cancer cells need to use a lot more sugar molecules to get enough energy to survive.
Unlike healthy cells that "burn" the entire molecule of sugar to capture a large amount of energy as ATP, cancer cells are wasteful.
Cancer cells only partially break down sugar molecules. They overuse the first step of respiration, glycolysis. They frequently do not complete the second step, oxidative phosphorylation.
This results in only 2 molecules of ATP per each glucose molecule instead of the 36 or so ATPs healthy cells gain. As a result, cancer cells need to use a lot more sugar molecules to get enough energy to survive.
introduction to WARBERG PHENOMENA:
WARBURG EFFECT Usually, cancer cells are highly glycolytic (glucose addiction) and take up more glucose than do normal cells from outside.
Otto Heinrich Warburg (; 8 October 1883 – 1 August 1970) In 1931 was awarded the Nobel Prize in Physiology for his "discovery of the nature and mode of action of the respiratory enzyme.
WARNBURG EFFECT : cancer cells under aerobic (well-oxygenated) conditions to metabolize glucose to lactate (aerobic glycolysis) is known as the Warburg effect. Warburg made the observation that tumor slices consume glucose and secrete lactate at a higher rate than normal tissues.
This pdf is about the Schizophrenia.
For more details visit on YouTube; @SELF-EXPLANATORY;
https://www.youtube.com/channel/UCAiarMZDNhe1A3Rnpr_WkzA/videos
Thanks...!
Professional air quality monitoring systems provide immediate, on-site data for analysis, compliance, and decision-making.
Monitor common gases, weather parameters, particulates.
(May 29th, 2024) Advancements in Intravital Microscopy- Insights for Preclini...Scintica Instrumentation
Intravital microscopy (IVM) is a powerful tool utilized to study cellular behavior over time and space in vivo. Much of our understanding of cell biology has been accomplished using various in vitro and ex vivo methods; however, these studies do not necessarily reflect the natural dynamics of biological processes. Unlike traditional cell culture or fixed tissue imaging, IVM allows for the ultra-fast high-resolution imaging of cellular processes over time and space and were studied in its natural environment. Real-time visualization of biological processes in the context of an intact organism helps maintain physiological relevance and provide insights into the progression of disease, response to treatments or developmental processes.
In this webinar we give an overview of advanced applications of the IVM system in preclinical research. IVIM technology is a provider of all-in-one intravital microscopy systems and solutions optimized for in vivo imaging of live animal models at sub-micron resolution. The system’s unique features and user-friendly software enables researchers to probe fast dynamic biological processes such as immune cell tracking, cell-cell interaction as well as vascularization and tumor metastasis with exceptional detail. This webinar will also give an overview of IVM being utilized in drug development, offering a view into the intricate interaction between drugs/nanoparticles and tissues in vivo and allows for the evaluation of therapeutic intervention in a variety of tissues and organs. This interdisciplinary collaboration continues to drive the advancements of novel therapeutic strategies.
Observation of Io’s Resurfacing via Plume Deposition Using Ground-based Adapt...Sérgio Sacani
Since volcanic activity was first discovered on Io from Voyager images in 1979, changes
on Io’s surface have been monitored from both spacecraft and ground-based telescopes.
Here, we present the highest spatial resolution images of Io ever obtained from a groundbased telescope. These images, acquired by the SHARK-VIS instrument on the Large
Binocular Telescope, show evidence of a major resurfacing event on Io’s trailing hemisphere. When compared to the most recent spacecraft images, the SHARK-VIS images
show that a plume deposit from a powerful eruption at Pillan Patera has covered part
of the long-lived Pele plume deposit. Although this type of resurfacing event may be common on Io, few have been detected due to the rarity of spacecraft visits and the previously low spatial resolution available from Earth-based telescopes. The SHARK-VIS instrument ushers in a new era of high resolution imaging of Io’s surface using adaptive
optics at visible wavelengths.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Richard's entangled aventures in wonderlandRichard Gill
Since the loophole-free Bell experiments of 2020 and the Nobel prizes in physics of 2022, critics of Bell's work have retreated to the fortress of super-determinism. Now, super-determinism is a derogatory word - it just means "determinism". Palmer, Hance and Hossenfelder argue that quantum mechanics and determinism are not incompatible, using a sophisticated mathematical construction based on a subtle thinning of allowed states and measurements in quantum mechanics, such that what is left appears to make Bell's argument fail, without altering the empirical predictions of quantum mechanics. I think however that it is a smoke screen, and the slogan "lost in math" comes to my mind. I will discuss some other recent disproofs of Bell's theorem using the language of causality based on causal graphs. Causal thinking is also central to law and justice. I will mention surprising connections to my work on serial killer nurse cases, in particular the Dutch case of Lucia de Berk and the current UK case of Lucy Letby.
Richard's aventures in two entangled wonderlandsRichard Gill
Since the loophole-free Bell experiments of 2020 and the Nobel prizes in physics of 2022, critics of Bell's work have retreated to the fortress of super-determinism. Now, super-determinism is a derogatory word - it just means "determinism". Palmer, Hance and Hossenfelder argue that quantum mechanics and determinism are not incompatible, using a sophisticated mathematical construction based on a subtle thinning of allowed states and measurements in quantum mechanics, such that what is left appears to make Bell's argument fail, without altering the empirical predictions of quantum mechanics. I think however that it is a smoke screen, and the slogan "lost in math" comes to my mind. I will discuss some other recent disproofs of Bell's theorem using the language of causality based on causal graphs. Causal thinking is also central to law and justice. I will mention surprising connections to my work on serial killer nurse cases, in particular the Dutch case of Lucia de Berk and the current UK case of Lucy Letby.
Deep Behavioral Phenotyping in Systems Neuroscience for Functional Atlasing a...Ana Luísa Pinho
Functional Magnetic Resonance Imaging (fMRI) provides means to characterize brain activations in response to behavior. However, cognitive neuroscience has been limited to group-level effects referring to the performance of specific tasks. To obtain the functional profile of elementary cognitive mechanisms, the combination of brain responses to many tasks is required. Yet, to date, both structural atlases and parcellation-based activations do not fully account for cognitive function and still present several limitations. Further, they do not adapt overall to individual characteristics. In this talk, I will give an account of deep-behavioral phenotyping strategies, namely data-driven methods in large task-fMRI datasets, to optimize functional brain-data collection and improve inference of effects-of-interest related to mental processes. Key to this approach is the employment of fast multi-functional paradigms rich on features that can be well parametrized and, consequently, facilitate the creation of psycho-physiological constructs to be modelled with imaging data. Particular emphasis will be given to music stimuli when studying high-order cognitive mechanisms, due to their ecological nature and quality to enable complex behavior compounded by discrete entities. I will also discuss how deep-behavioral phenotyping and individualized models applied to neuroimaging data can better account for the subject-specific organization of domain-general cognitive systems in the human brain. Finally, the accumulation of functional brain signatures brings the possibility to clarify relationships among tasks and create a univocal link between brain systems and mental functions through: (1) the development of ontologies proposing an organization of cognitive processes; and (2) brain-network taxonomies describing functional specialization. To this end, tools to improve commensurability in cognitive science are necessary, such as public repositories, ontology-based platforms and automated meta-analysis tools. I will thus discuss some brain-atlasing resources currently under development, and their applicability in cognitive as well as clinical neuroscience.
Mammalian Pineal Body Structure and Also Functions
FPGA Implementation of FIR Filter using Various Algorithms: A Retrospective
1. International Journal of Research in Computer Science
eISSN 2249-8265 Volume 4 Issue 2 (2014) pp. 19-24
www.ijorcs.org, A Unit of White Globe Publications
doi: 10.7815/ijorcs.42.2014.081
www.ijorcs.org
FPGA IMPLEMENTATION OF FIR FILTER USING
VARIOUS ALGORITHMS: A RETROSPECTIVE
Jinalkumari K. Dhobi1
, Dr. Y. B. Shukla2
, Dr. K.R.Bhatt3
1
P.G. Student, EC Dept., SVIT, Vasad
Email: jinal.dhobi@gmail.com
2
Assoc. Prof., EC Dept., SVIT, Vasad
Email: ybshukla2003@gmail.com
Assoc. Prof., EC Dept., SVIT, Vasad
Email: krbhattec@gmail.com
Abstract: This manuscript is a thorough study of
FPGA implementation of Finite Impulse response
(FIR) with low cost and high performance. The key
observation of this paper is an elaborate analysis
about hardware implementations of FIR filters using
different algorithm i.e., Distributed Arithmetic (DA),
DA-Offset Binary Coding (DA-OBC), Common Sub-
expression Elimination (CSE) and sum-of-power-of-
two (SOPOT) with less resources and without
affecting the performance of the original FIR Filter.
Keywords: DA, DA-OBC, CSE, SOPOT, FPGA
I. INTRODUCTION
A digital filter is a system that carry out
mathematical operation on a sampled of discrete time
signal to modify or alter the component of the signal in
time or frequency domain. It consist of an analog-to-
digital converter at front end, followed by a
microprocessor and some peripheral component i.e.,
memory to store data & filter coefficients. At the
backend side a digital-to-analog converter is used to
complete the output stage. For a real time applications,
an FPGA or ASIC or Specialized DSP with parallel
architecture is used instead of a general purpose
microprocessor. Digital filters can be implemented in
two ways, by convolution (FIR) and by recursion (IIR)
[1]. A FIR filter has a number of useful properties
compared to an IIR filter i.e. inherently stable, no
feedback require, designed to be linear phase. With
recent trend towards portable computing and wireless
communication systems, power consumption has been
an important design consideration [2] so the field
programmable gate array (FPGA) is an alternative
solution for realization of digital signal processing
task.
This paper is organized as follows: section II
introduced design method of the FIR filter, section III
describes the various algorithms to implement the FIR
filter on FPGA, Section IV discusses the Comparison
of algorithms and finally the conclusion is presented in
section V.
II. DESIGN METHODS
FIR filters are used where exact linear phase
response is required. It is non-recursive filter, consists
of two parts one is Approximation problem and second
one is Realization problem. The steps of
approximation are, first take the Ideal frequency
response after that choose the Class of filter & Quality
of approximation and finally select the Method to find
the filter transfer function. The realization part select
the structure to implement the transfer function. There
are mainly three well-known methods for designing
FIR filter namely the window method, Frequency
sampling technique and Optimal filter design method.
Among these three methods, window method is simple
and efficient way to design an FIR filter [3]. In this
method, first start with the ideal desired frequency
response 𝐻𝐻𝑑𝑑 �𝑒𝑒𝑗𝑗 𝑗𝑗
� of the specified filter then Compute
the inverse DTFT of 𝐻𝐻𝑑𝑑 �𝑒𝑒𝑗𝑗 𝑗𝑗
� i.e., ℎ𝑑𝑑 (𝑛𝑛) which is
infinite in duration after that Choose an appropriate
window function 𝑤𝑤(𝑛𝑛) and calculate the impulse
response ℎ(𝑛𝑛) of specified filter as ℎ(𝑛𝑛) =
ℎ𝑑𝑑 (𝑛𝑛) ∗ 𝑤𝑤(𝑛𝑛) to truncated at some point n=M-1. Once
ℎ(𝑛𝑛) is determined, it’s DTFT 𝐻𝐻�𝑒𝑒𝑗𝑗 𝑗𝑗
� and Z-
transform 𝐻𝐻(𝑧𝑧) can be calculated for any further
analysis. For truncation in third step of ℎ𝑑𝑑 (𝑛𝑛) to M-
terms, direct truncation method using rectangular
window 𝑤𝑤(𝑛𝑛) is multiplied with ℎ𝑑𝑑 (𝑛𝑛) which is
infinite in nature but rectangular window contain sharp
discontinuity which leads to Gibbs Phenomenon effect
[4]. In order to reduce the ripples, instead of sharp
discontinuity function, choose a window function
having taper and decays toward zero gradually [4].
Some of window [5] commonly used are as followed:
1. Bartlett Triangular window:
𝑤𝑤(𝑛𝑛) =
⎩
⎪
⎨
⎪
⎧
2(𝑛𝑛 + 1)
𝑁𝑁 + 1
, 𝑛𝑛 = 0 𝑡𝑡𝑡𝑡 (𝑁𝑁 − 1)/2
2 −
2(𝑛𝑛 + 1)
𝑁𝑁 + 1
, 𝑛𝑛 = (𝑁𝑁 − 1)/2 𝑡𝑡𝑡𝑡 (𝑁𝑁 − 1)
0 𝑂𝑂𝑂𝑂ℎ𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒
… . (1)
2. Generalized cosine windows:
2. 20 Jinalkumari K. Dhobi, Dr. Y. B. Shukla, Dr. K.R.Bhatt
www.ijorcs.org
(Rectangular, Hanning, Hamming and
Blackman)
𝑤𝑤(𝑛𝑛) = 𝑎𝑎 − 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 �
2𝑝𝑝(𝑛𝑛 + 1)
𝑁𝑁 + 1
� + 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐 �
4𝑝𝑝(𝑛𝑛 + 1)
𝑁𝑁 + 1
�
Where n = 0 to N-1
…. (2)
3. Kaiser window with parameter β:
𝑤𝑤(𝑛𝑛) =
𝐼𝐼0(𝛽𝛽�1 − �1 −
2(𝑛𝑛)
𝑁𝑁−1
�
2
𝐼𝐼0(𝛽𝛽)
Where n= 0 to N-1
…. (3)
𝑀𝑀 =
δ2 − 7.95
2.286∆ω
…. (4)
β=
⎩
⎨
⎧
0.1102(δ2 − 8.7), δ2 ≥ 50𝑑𝑑𝑑𝑑
0.5842(δ2 − 21)0.4
+ 0.07886(δ2 − 21),
21𝑑𝑑𝑑𝑑 < δ2 < 50𝑑𝑑𝑑𝑑
0, δ2 ≤ 21𝑑𝑑𝑑𝑑
.... (5)
In Rectangular window, due to the direct
truncation of ℎ𝑑𝑑 (𝑛𝑛) leads to the Gibbs phenomenon
effect which apparent itself as a fixed percentage
overshoot and ripple before and after an approximated
discontinuity in the frequency response due to the non-
uniform convergence of the Fourier series at the
discontinuity [5]. According to the simulation result
[5] obtained from FDAtool, the Bartlett window
reduced the overshoot in the designed filter but spreads
the transition region. The generalized cosine window,
Hanning, Hamming and Blackman is complicated but
provide a smooth truncation of ideal impulse response
and a frequency response. The best window method is
Kaiser Window because it has the shape parameter β
which depending on the filter taps M was used to
adjust the main lobe width and side lobe attenuation,
choosing M can produce a variety of transition band
and optimal stopband attenuation [6]. When the
transition band ∆ω(rad) and the stopband attenuation
δ2 = −20𝑙𝑙𝑙𝑙 𝑙𝑙10 𝛼𝛼2(𝑑𝑑𝑑𝑑) were given, the Kaiser FIR
filter taps M and the shape parameter β can be
obtained from equation (4) and (5) [6].
III. FPGA IMPLEMENTATION USING VARIOUS
ALGORITHMS
The application of digital filter are widespread and
include but are not limited to the Communication
System, Audio System, Instrumentation, Image-
Processing and enhancement, Speech synthesis. It is
nowadays convenient to consider computer programs
and digital hardware that can perform digital filtering
as two different implementations of digital filters,
namely, Software digital filters, and Hardware digital
filters. Software digital filters can be implemented in
terms of a high-level language, such as C++ or
MATLAB, on a personal computer or workstation or
by using a low-level language on a general-purpose
digital signal processing chip. Hardware digital filter
can be designed using a number of highly specialized
interconnected VLSI chips like DSP, ASIC and FPGA.
Software digital filter have no counterpart in the
analog world and therefore, for non-real-time
application they are the only choice. ASIC based
Implementation of FIR Filter provides little costlier
and long development time but gives high flexibility.
The realization of FIR filter based on FPGA received
extensive attention because it gives high flexibility,
high performance, low cost and shorter development
time [8]. The core of the FIR filter implementation is
multiplication and accumulation (MAC) operation.
The design method of MAC can be define using
various algorithm and techniques. One is general direct
MAC structure, which are expensive in hardware
because of logic complexity and area usage. The others
are Distributed Arithmetic (DA) [7], DA-Offset Binary
Coding (DA-OBC) [9], Common Subexpression
Elimination (CSE) [10] and Sum-of-power-of-two
(SOPOT) [11] which reduced the required number of
multiplier and adders.
A. Distributed arithmetic and DA-OBC
Distributed Arithmetic is a famous method, which
converts calculation of MAC to a serial of look up
table accesses and summation [8]. It was initially
proposed by Croisier in 1973 [7] and further developed
by Peled and Lui [8].The principle of DA algorithm is
as follows:
An FIR filter of N order is shown as Eq. (6)
𝑦𝑦(𝑛𝑛) = ∑ ℎ𝑘𝑘 𝑥𝑥𝑘𝑘(𝑛𝑛)𝑁𝑁−1
𝑘𝑘=0 …. (6)
Where ℎ𝑘𝑘the set of constant coefficient of the filter
is, 𝑦𝑦(𝑛𝑛) is the output data, 𝑥𝑥𝑘𝑘(𝑛𝑛) is the input data,
which can be expressed as Eq. (7) using m-bit 2’s
complementary binary number.
𝑥𝑥𝑘𝑘 = −𝑥𝑥𝑘𝑘,𝑚𝑚−1 + ∑ 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗
𝑚𝑚−1
𝑗𝑗=1 2−𝑗𝑗
…. (7)
Where 𝑥𝑥𝑘𝑘,𝑚𝑚−1 is the most significant bit of 𝑥𝑥𝑘𝑘, Eq.
(8) can be derived when 𝑥𝑥𝑘𝑘 of Eq. (7) is substitute into
Eq. (6).
𝑦𝑦(𝑛𝑛) = � ℎ𝑘𝑘[−𝑥𝑥𝑘𝑘,𝑚𝑚−1 + � 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗
𝑚𝑚−1
𝑗𝑗 =1
2−𝑗𝑗
]
𝑁𝑁−1
𝑘𝑘=0
= � � ℎ𝑘𝑘
𝑚𝑚−1
𝑗𝑗 =1
𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 2−𝑗𝑗
−
𝑁𝑁−1
𝑘𝑘=0
� ℎ𝑘𝑘 𝑥𝑥𝑘𝑘,𝑚𝑚−1
𝑁𝑁−1
𝑘𝑘=0
3. FPGA Implementation of Fir Filter using Various Algorithms: A Retrospective 21
www.ijorcs.org
= � � ℎ𝑘𝑘
𝑁𝑁−1
𝑘𝑘=0
𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 2−𝑗𝑗
−
𝑚𝑚−1
𝑗𝑗=1
� ℎ𝑘𝑘 𝑥𝑥𝑘𝑘,𝑚𝑚−1
𝑁𝑁−1
𝑘𝑘=0
…. (8)
In Eq. (8) the calculation result of
∑ ℎ𝑘𝑘
𝑁𝑁−1
𝑘𝑘=0 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 have 2𝑁𝑁
kinds of different results
because of the value of 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 is 0 or 1. All the
possible results of ∑ ℎ𝑘𝑘
𝑁𝑁−1
𝑘𝑘=0 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 are constructed
in advance and stored into one LUT. The contents of
LUT can be fetch by using 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 obtain from shift
register unit as a LUT address signal. So the value of
𝑦𝑦(𝑛𝑛) calculated by shifting and accumulating
operation.
Table 1: LUT contents of DA for 4-tap FIR filter
Address signal (𝑏𝑏3 𝑏𝑏2 𝑏𝑏1 𝑏𝑏0) LUT content
0000 0
0001 ℎ0
0010 ℎ1
0011 ℎ1 + ℎ0
0100 ℎ2
0101 ℎ2 + ℎ0
0110 ℎ2 + ℎ1
0111 ℎ2 + ℎ1 + ℎ0
1000 ℎ3
1001 ℎ3 + ℎ0
1010 ℎ3 + ℎ1
1011 ℎ3 + ℎ1 + ℎ0
1100 ℎ3 + ℎ2
1101 ℎ3 + ℎ2 + ℎ0
1110 ℎ3 + ℎ2 + ℎ1
1111 ℎ3 + ℎ2 + ℎ1 + ℎ0
Hence, DA algorithm reduced the logic resources
by converting complex MAC operation to a simple
look-up table access and summations. The main
disadvantage of DA algorithm is the size of LUT is
large and also capacity of LUT will exponentially
increase with the order of the filter. Bo Hong, et al [9]
proposed a new algorithm which can reduced the
capacity of LUT by half through the use of offset
binary coding. The principle of DA-OBC algorithm is
as follows [12]:
𝑥𝑥𝑘𝑘 can also be expressed as Eq. (9)
𝑥𝑥𝑘𝑘 =
1
2
[𝑥𝑥𝑘𝑘 − (−𝑥𝑥𝑘𝑘)]
=
1
2
�−�𝑥𝑥𝑘𝑘,𝑚𝑚−1 − 𝑥𝑥𝑘𝑘,𝑚𝑚−1�����������
+ � [�𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗 − 𝑥𝑥𝑘𝑘,𝑚𝑚−1−𝑗𝑗������������2−𝑗𝑗
𝑚𝑚−1
𝑗𝑗=1
− 2−(𝑚𝑚−1)
]
…. (9)
They define 𝑑𝑑𝑘𝑘,𝑗𝑗 as follows, the value of 𝑑𝑑𝑘𝑘,𝑗𝑗 is -1 or +1.
𝑑𝑑𝑘𝑘,𝑗𝑗 = �
�𝑥𝑥𝑘𝑘,𝑗𝑗 − 𝑥𝑥𝑘𝑘,𝑗𝑗������, 𝑗𝑗 ≠ 𝑚𝑚 − 1
−�𝑥𝑥𝑘𝑘,𝑚𝑚−1 − 𝑥𝑥𝑘𝑘,𝑚𝑚−1����������, 𝑗𝑗 = 𝑚𝑚 − 1
…. (10)
Eq. (9) can be simplified as Eq. (11).
𝑥𝑥𝑘𝑘 =
1
2
[� 𝑑𝑑𝑘𝑘,𝑚𝑚−1−𝑗𝑗 2−𝑗𝑗
− 2−(𝑚𝑚−1)
]
𝑚𝑚−1
𝑗𝑗=0
…. (11)
Put Eq. (11) in to Eq. (6), and get
= � ��
1
2
ℎ𝑘𝑘
𝑁𝑁−1
𝑘𝑘=0
𝑑𝑑𝑘𝑘,𝑚𝑚−1−𝑗𝑗 � 2−𝑗𝑗
−
𝑚𝑚−1
𝑗𝑗 =0
(
1
2
� ℎ𝑗𝑗
𝑁𝑁−1
𝑗𝑗 =0
)2−𝑚𝑚−1
…. (12)
For convenience,
𝐷𝐷𝑗𝑗 = �
1
2
ℎ𝑘𝑘
𝑁𝑁−1
𝑘𝑘=0
𝑑𝑑𝑘𝑘,𝑚𝑚−1−𝑗𝑗 , 𝐷𝐷𝑒𝑒𝑒𝑒 = −
1
2
� ℎ𝑗𝑗
𝑁𝑁−1
𝑗𝑗=0
…. (13)
The value of 𝐷𝐷𝑗𝑗 have 2𝑁𝑁
kinds of different result
which can be pre-computed and stored in a LUT and
the LUT can be reduced by half [9] because the
contents of LUT which are stored in addresses, are 1’s
complement of each other is in same magnitude with
the reverse sign.
Table 2: LUT contents of DA-OBC for 4-tap FIR filter
Address
𝑥𝑥0𝑗𝑗 = 0
𝑥𝑥1𝑗𝑗 𝑥𝑥2𝑗𝑗 𝑥𝑥3𝑗𝑗
LUT
Contents
Address
𝑥𝑥0𝑗𝑗 = 1
𝑥𝑥1𝑗𝑗 𝑥𝑥2𝑗𝑗 𝑥𝑥3𝑗𝑗
LUT
Contents
000
−
ℎ0 + ℎ1 + ℎ2 + ℎ
2
111 ℎ0 + ℎ1 + ℎ2 + ℎ3
2
001
−
ℎ0 + ℎ1 + ℎ2 − ℎ
2
110 ℎ0 + ℎ1 + ℎ2 − ℎ3
2
010
−
ℎ0 + ℎ1 − ℎ2 + ℎ
2
101 ℎ0 + ℎ1 − ℎ2 + ℎ3
2
011
−
ℎ0 + ℎ1 − ℎ2 − ℎ
2
100 ℎ0 + ℎ1 − ℎ2 − ℎ3
2
100
−
ℎ0 − ℎ1 + ℎ2 + ℎ
2
011 ℎ0 − ℎ1 + ℎ2 + ℎ3
2
101
−
ℎ0 − ℎ1 + ℎ2 − ℎ
2
010 ℎ0 − ℎ1 + ℎ2 − ℎ3
2
110
−
ℎ0 − ℎ1 − ℎ2 + ℎ
2
001 ℎ0 − ℎ1 − ℎ2 + ℎ3
2
111
−
ℎ0 − ℎ1 − ℎ2 − ℎ
2
000 ℎ0 − ℎ1 − ℎ2 − ℎ3
2
4. 22 Jinalkumari K. Dhobi, Dr. Y. B. Shukla, Dr. K.R.Bhatt
www.ijorcs.org
B. Common Subexpression Elimination (CSE)
M. Thenmozhi, et al [10] proposed an algorithm
which reduce the complexity is Common
subexpression elimination (CSE). In this algorithm, the
coefficient is based on canonical signed digit (CSD),
which minimize the number of adder/subtractor used
in each coefficient multiplier. The aim of CSE
algorithm is to identify multiple event of identical bit
patterns present in coefficients to remove the
redundant multiplications which results in considerable
reduction of adders as well as the complexity of FIR
filter compared to the conventional implementation.
This algorithm using binary representation of
coefficients for the implementation of higher order FIR
filter with less number of adder than CSD based CSE
algorithm. The Binary CSE (BCSE) algorithm
technique focuses on reducing redundant computations
in coefficient multipliers by reusing the most common
binary bit patterns (BCSs) presents in coefficients [13].
In n-bit binary number, the number of BCSs is2𝑛𝑛
−
(𝑛𝑛 + 1).
For example: A 3 bit binary representation can
form four BCSs.
[0 1 1] = 𝑥𝑥2 = 2−1
𝑥𝑥 + 2−2
𝑥𝑥
[1 0 1] = 𝑥𝑥3 = 𝑥𝑥 + 2−2
𝑥𝑥
[1 1 0] = 𝑥𝑥4 = 𝑥𝑥 + 2−1
𝑥𝑥
[1 1 1] = 𝑥𝑥5 = 𝑥𝑥 + 2−1
𝑥𝑥 + 2−2
𝑥𝑥
Where x is the input signal. The other BCSs such
as [0 0 1], [0 1 0] and [1 1 0] do not required any
adder for implementation because they have only one
nonzero bit. From above four BCSs they conclude that
𝑥𝑥2 can be obtained by right shift operation without
using any extra adders and also 𝑥𝑥5 can be obtained
from 𝑥𝑥4 using an adder.
C. Sum-of-power-of-two (SOPOT)
Catalin Damian, et al [11] proposed a high speed
and low area architecture for the implementation of
FIR filter without any multiplication block.
Figure 1: Direct FIR filter
Figure 2. describe the Architecture unit of FIR
filter with SOPOT type coefficient. In this algorithm
the coefficient values are integer’s power-of-two or
sum-of- power-of-two (SOPOT) with two or three
terms and the multipliers can be replaced by shifters.
In [15] and [16], FIR architectures presented based on
theory of SOPOT of two terms. Because of error
occurred in two terms the approximation of filter’s
coefficient is extended the algorithm to SOPOT with
three terms.
Figure 2. Architecture unit of FIR filter with SOPOT type
coefficient
𝐻𝐻[𝑗𝑗] = ∑ 𝑎𝑎𝑖𝑖,𝑗𝑗 . 2𝑏𝑏𝑖𝑖,𝑗𝑗2
𝑖𝑖=0 …. (13)
Where 𝑎𝑎𝑖𝑖,𝑗𝑗 = {−1,1} and𝑏𝑏𝑖𝑖,𝑗𝑗 = {−𝑡𝑡, … ,0, … , 𝑢𝑢}; t
and u determine the word length dynamic range of
each filter coefficient. Larger the numbers t and u will
gives the closer approximation to its original number.
Computational algorithm: The Computational
algorithm is shown in figure 3. The algorithm consist
of two repetitive structure; one by i is to calculate
a[i,j] and b[i,j] for the f[j] co-efficient.
Figure 3: SOPOT 𝑎𝑎𝑖𝑖,𝑘𝑘 and 𝑏𝑏𝑖𝑖,𝑘𝑘 terms calculation algorithm
5. FPGA Implementation of Fir Filter using Various Algorithms: A Retrospective 23
www.ijorcs.org
Table 3: Example of Two and Three SOPOT
Integer Two SOPOT Three SOPOT
13 23
+ 22
=12 (8%) 23
+ 22
+ 20
=13
(0%)
25 24
+ 23
=24 (4%) 24
+ 23
+ 20
=25
(0%)
67 26
+ 21
=66 (2%) 26
+ 21
+ 20
=67
(0%)
IV. COMPARISION OF ALGORITHMS BASED ON
SURVEY
DA algorithm reduces the complexity of FIR filter
by converting MAC operation to serial of look up
table. CSE algorithm reduces the adder by just finding
the multiple event and SOPOT is converting
coefficient into power of two format and eliminate the
complete Multiplication block. Among the three
algorithm DA is easy to implement at the cost of
storage resources.
V. CONCLUSION
The realization structure of FIR filter consists of a
MAC operation which is made up of multipliers and
adders. DA algorithm, it completely eliminate the
multiplication block by converting complicated MAC
operation to look-up table access and summation at the
cost of increasing storage resource where DA-OBC
based architecture will decreases the LUT size by half
and make operation speed faster. In CSE algorithm, It
eliminate the multipliers and adders by identifying the
multiple event that have an identical bit pattern and
SOPOT algorithm diminished the complexity of
working task by completely abolishing the
multiplication block by only adders and shifter. So
According to our survey, DA structure is easy to
implement on FPGA because of pre-calculated results
are already stored in LUTs and in FPGA it is easy to
design but the main drawback of this algorithm is that,
it uses an extra resources. Where the SOPOT is used
for low power and low area application as it uses
shift/add multiplexer based multiplier. The CSE
algorithm is used to find and eliminate most common
event among filter co-efficient which results in power
and area saving by reducing multiplier with a small
number of adders while implemented in FIR filters.
VI. REFERENCES
[1] Steven W. Smith, “The Scientist and Engineer’s Guide
to Digital Signal Processing”. California Technical
Publishing San Diego, California, Second Edition 1999.
[2] Wang, Wei, Swamy, M.N.S., Ahmad, M.O., "Low
power FIR filter FPGA implementation based on
distributed arithmetic and residue number
system" Circuits and Systems, 2001. MWSCAS 2001.
Proceedings of the 44th IEEE 2001 Midwest
Symposium on, vol.1, no., pp.102, 105 vol.1, 2001. doi:
10.1109/MWSCAS.2001.986125
[3] Saurabh Singh Rajput, Dr.S.S.Bhadauria,
“Implementation of Fir Filter Using Efficient Window
Function and Its Application in Filtering a Speech
Signal” International Journal of Electronics and
Mechanical Controls, Volume 1 Issue 1 November
2012.
[4] Sen M. Kuo, Bob. H. Lee and Wenshun Tian, “Real-
Time Digital Signal Processing Implementations and
Applications” John Wiley & Sons, Ltd, England,
Second Edition 2006.
[5] Sonika Gupta, Aman Panghal, “Performance Analysis
of FIR Filter Design by Using Rectangular, Hanning
and Hamming Windows Method,” International
Journal of Advanced Research in Computer Science
and Software Engineering, Volume 2, Issue 6, June
2012.
[6] Gao Jinding, Hou Yubao, Su Long, "Design and FPGA
Implementation of Linear FIR Low-pass Filter Based
on Kaiser Window Function", International Conference
on Intelligent Computation Technology and Automation
(ICICTA), vol.2, no., pp.496-498, 28-29 March 2011.
doi: 10.1109/ICICTA.2011.408
[7] Croisier, D.J.Esteban, M.E.Levilion, V.Rizo, "Digital
Filter for PCM Encoded Signals" U.S.Patent, No.3, 777,
130, 1973.
[8] A. Peled and B. Liu, “A new hardware realization of
digital filters” IEEE Transactions on A.S.S.P., vol.
ASSP-22, pp. 456–462, December 1974.
[9] Bo Hong, Haibin Yin, Xiumin Wang, Ying Xiao,
"Implementation of FIR filter on FPGA using DA-OBC
algorithm", 2nd International Conference on
Information Science and Engineering (ICISE), vol., no.,
pp.3761,3764, 4-6 Dec. 2010.
[10] M. Thenmozhi, N. Kirthika, "Analysis of Efficient
Architectures for FIR filters using Common
Subexpression Elimination Algorithm,” International
Journal of Scientific & Technology Research, Volume
1, Issue 4, May 2012.
[11] Damian, C. Lunca, E., "A low area FIR filter for FPGA
implementation", 34th International Conference on
Telecommunications and Signal Processing (TSP),
pp.521-524, 18-20 Aug. 2011. doi: 10.1109/TSP.
2011.6043675
[12] Heejong Yoo, David V.anderson, "Hardware-efficient
distributed arithmetic architecture for high-order digital
filters" in proc. IEEE International conference on
Acoustics, speech, and signal processing
(ICASSP’05),vol.5, pp.125-128 2005. doi:
10.1109/ICASSP.2005.1416256
[13] Mahesh, R. Vinod, A.P., "A New Common
Subexpression Elimination Algorithm for Realizing
Low-Complexity Higher Order Digital Filters", IEEE
Transactions on Computer-Aided Design of Integrated
Circuits and Systems , vol.27, no.2, pp.217,229, Feb.
2008. doi: 10.1109/TCAD.2007.907064
[14] John G. Proakis., Dimitris G. Manokalis, “Digital
Signal Processing Principle algorithms and
6. 24 Jinalkumari K. Dhobi, Dr. Y. B. Shukla, Dr. K.R.Bhatt
www.ijorcs.org
applications” PHI publication, New Jersey, Third
Edition 2004.
[15] Catalin Damian, Cristian Zet, Cristian Fosalau, Mihai
Cretu, “Real, Reactive and Apparent Power Computing
Using FPGA and PWM Intermediary Conversion” XX
IMEKO TC4, Florence, Italy, Sept. 2008.
[16] K. S. Yeung, S. C. Chan, “Multiplier-Less Digital
Filters Using Programmable Sum-Of-Power-Of-Two
(Sopot) Coefficients”, IEEE International Conference
on Field Programmable Technology, pp.78 – 84, Dec.
2002. doi: 10.1109/FPT.2002.1188667
How to cite
Jinalkumari K. Dhobi, Dr. Y. B. Shukla, Dr. K.R.Bhatt, “FPGA Implementation of Fir Filter using Various
Algorithms: A Retrospective”. International Journal of Research in Computer Science, 4 (2): pp. 19-24, March
2014. doi: 10.7815/ijorcs.42.2014.081