LF SIGNAL PROCESSING FOR INTELLECTUAL SOFTWARE SIMULATORS WITH USING LINEAR FILTERS AND DISCRETE TIME

10.12737/6681 ◽  
2014 ◽  
Vol 7 (3) ◽  
pp. 45-47 ◽  
Author(s):  
Табаков ◽  
Yu. Tabakov ◽  
Лавлинский ◽  
V. Lavlinskiy ◽  
Бибиков ◽  
...  
Keyword(s):  
Signal Processing ◽  
Discrete Time ◽  
Linear Filters ◽  
Intellectual Software

Developed models and algorithms for the analysis and processing of LF signals on the basis of a linear discrete-time filter that minimize various interference and noise in the LF signal

Discrete-time signal processing

2017 ◽  
pp. 1-45
Author(s):  
Alexander D. Poularikas ◽  
Zayed M. Ramadan
Keyword(s):  
Signal Processing ◽  
Discrete Time ◽  
Time Signal

scholarly journals Combination of HP and LP filters for narrow band antialiasing filter

2021 ◽  
Vol 72 (4) ◽  
pp. 283-286
Author(s):  
Bohumil Brtník
Keyword(s):  
Signal Processing ◽  
Discrete Time ◽  
Operational Amplifier ◽  
Narrow Band ◽  
Time Signal ◽  
Spice Simulation ◽  
Output Resistance ◽  
High Frequencies ◽  
Filter Structure ◽  
Reconstruction Filter

Abstract The discrete time signal processing requires an anti-aliasing filter at the input and a reconstruction filter at output. Some filters of biquads structure are characterized by a decreasing of the attenuation at high frequencies, caused by the final value of the output resistance of the operational amplifier. In this paper we discuss a design of combined BP filter without mentioned decrease. The proposed filter structure was verified by SPICE simulation.

scholarly journals Border Handling for 2D Transpose Filter Structures on an FPGA

2018 ◽  
Vol 4 (12) ◽  
pp. 138 ◽  
Author(s):  
Donald Bailey ◽  
Anoop Ambikumar
Keyword(s):  
Signal Processing ◽  
Digital Signal Processing ◽  
Digital Signal ◽  
Linear Filters ◽  
Filter Structure ◽  
Direct Form ◽  
Two Stages ◽  
Filter Structures ◽  
Zero Extension

It is sometimes desirable to implement filters using a transpose-form filter structure. However, managing image borders is generally considered more complex than it is with the more commonly used direct-form structure. This paper explores border handling for transpose-form filters, and proposes two novel mechanisms: transformation coalescing, and combination chain modification. For linear filters, coefficient coalescing can effectively exploit the digital signal processing blocks, resulting in the smallest resources requirements. Combination chain modification requires similar resources to direct-form border handling. It is demonstrated that the combination chain multiplexing can be split into two stages, consisting of a combination network followed by the transpose-form combination chain. The resulting transpose-form border handling networks are of similar complexity to the direct-form networks, enabling the transpose-form filter structure to be used where required. The transpose form is also significantly faster, being automatically pipelined by the filter structure. Of the border extension methods, zero-extension requires the least resources.

Sign in / Sign up

Export Citation Format

Share Document