101 |
Latch-based decimation FIR filters /Khan, Muhammad Ali. January 1900 (has links)
Thesis (M.App.Sc.) - Carleton University, 2006. / Includes bibliographical references (p. 102-105). Also available in electronic format on the Internet.
|
102 |
Parallel implementation of a fast third-order volterra digital filter /Kwan, Wai Ming Hercule, January 1998 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 95-102). Available also in a digital version from Dissertation Abstracts.
|
103 |
Design of a reusable distributed arithmetic filter and its application to the affine projection algorithmLo, Haw-Jing. January 2009 (has links)
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Anderson, Dr. David V.; Committee Member: Hasler, Dr. Paul E.; Committee Member: Mooney, Dr. Vincent J.; Committee Member: Taylor, Dr. David G.; Committee Member: Vuduc, Dr. Richard.
|
104 |
Incorporating robustness into fuzzy logic and mixture decomposition for image enhancement and segementation /Choi, Youngsik, January 1996 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1996. / Typescript. Vita. Includes bibliographical references (leaves 96-103). Also available on the Internet.
|
105 |
Incorporating robustness into fuzzy logic and mixture decomposition for image enhancement and segementationChoi, Youngsik, January 1996 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1996. / Typescript. Vita. Includes bibliographical references (leaves 96-103). Also available on the Internet.
|
106 |
An integrated-circuit piano tuner for the equal-tempered keyboard employing a tuneable fixed-coefficient digital filterHagee, Michael William. January 1969 (has links) (PDF)
Thesis (M.S. in E.E.)--Naval Postgraduate School, 1969. / Thesis advisor: James S. Demetry. Bibliography: p. 90-94. Also available in print.
|
107 |
Estimation and control with quantized measurementsJanuary 1970 (has links)
[by] Renwick E. Curry. / Bibliography: p. 120-122.
|
108 |
Linear estimation of boundary value stochastic processes : Part II--1-D smoothing problemsJanuary 1982 (has links)
by Milton B. Adams,Alan S. Willsky, Bernard C. Levy. / "November, 1982." / Includes bibliographical references. / National Science Foundation Grant ECS-8012668
|
109 |
Morphological filter mean-absolute-error representation theorems and their application to optimal morphological filter design /Loce, Robert P. January 1993 (has links)
Thesis (Ph. D.)--Rochester Institute of Technology, 1993. / Typescript. Includes bibliographical references (leaves 156-169).
|
110 |
[en] A GENERAL FORMULATION ON SENSITIVITY ANALYSIS OF DIGITAL LINEAR FILTERS MODELED BY STATE VARIABLES / [pt] FORMULAÇÃO GERAL DA TEORIA DE SENSIBILIDADE DE FILTROS DIGITAIS LINEARES E INVARIANTESFATIMA NELSIZEUMA SOMBRA DE MEDEIROS 27 December 2006 (has links)
[pt] Este trabalho apresenta uma formulação geral da teoria de
sensibilidade de filtros digitais lineares e invariantes
no tempo, representados por variáveis de estado nas formas
canônicas Diagonal e Jordan, com relação aos seus
coeficientes quantizados devido ao tamanho finito da
palavra. É estabelecida uma estrutura única que permite a
análise de sensibilidade com respeito aos vários
parâmetros do modelo de estado. São estudados sistemas
compostos por cascatas de blocos e feita a análise de
sensibilidade, considerando que há presença de elementos
quantizados de blocos. É feita a análise de complexidade
computacional das formulações estudadas. / [en] This work presents a general formulation on sensitivity
analysis of digital linear filters modeled by state
variables in canonical forms (Diagonal and Jordan), with
respect to its coeficients which are aproximated due to
the finite size of the word. We studied systems of
cascated blocks which present quantization in its
coefficients. It is established one block structure that
permits the sensitivity analysis with respect to all the
parameters of the state model. At last, the expressions
complexity computational is calculated.
|
Page generated in 0.0747 seconds