Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marcio G. Siqueira

dblp:84/1979 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
1 paper
Accessibility and assistive technology · 100%
Artificial intelligence
1 paper
Speech recognition and synthesis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Accessibility and assistive technology › deaf and hard of hearing technology
hearing aids
0.012000
Steady-state analysis of continuous adaptation in acoustic feedback reduction systems for hearing-aids · IEEE Trans. Speech Audio Process. 2000
Natural language and speech › Speech recognition and synthesis
adaptive filtering
0.012000
Steady-state analysis of continuous adaptation in acoustic feedback reduction systems for hearing-aids · IEEE Trans. Speech Audio Process. 2000
Natural language and speech › Speech recognition and synthesis
audio and music processing
0.012000
Steady-state analysis of continuous adaptation in acoustic feedback reduction systems for hearing-aids · IEEE Trans. Speech Audio Process. 2000

Methods — techniques the papers use, named apart from their topics

steady-state convergence analysis · 0.1LMS adaptive filtering · 0.1
YearPublicationVenuePosition
2000 Steady-state analysis of continuous adaptation in acoustic feedback reduction systems for hearing-aids
abstract
Acoustic feedback is a problem in hearing aids that contain a substantial amount of gain, hearing aids that are used in conjunction with vented or open molds, and in-the-ear hearing aids. Acoustic feedback is both annoying and reduces the maximum usable gain of hearing-aid devices. This paper studies analytically the steady-state convergence behavior of LMS-based adaptive algorithms when used in continuous adaptation to reduce acoustic feedback. A bias is found in the adaptive filter's estimate of the hearing-aid acoustic feedback path. Methods for reducing this bias and producing an improved estimate of the acoustic feedback path are analyzed and compared. It is shown that by the use of a delay in the forward or cancellation paths of the hearing aid plant, and for representative feedback paths, it is possible to reduce this bias by more than 15 dB.
Marcio G. Siqueira, Abeer Alwan
IEEE Trans. Speech Audio Process.1
1999 Bias analysis in continuous adaptation systems for hearing aids
abstract
This paper studies analytically the steady-state convergence behavior of adaptive algorithms that approximate the Wiener solution when operating in continuous adaptation to reduce acoustic feedback in hearing aids. A bias is found in the adaptive filter's estimate of the hearing-aid feedback path when the input signal is not white. Delays in the forward and cancellation paths are shown to reduce the magnitude of the bias. Equations for the bias transfer function are obtained. A discussion about properties of the bias when delays are placed in the forward and cancellation paths follows.
Marcio G. Siqueira, Abeer Alwan
ICASSP1
1995 Analysis of the QR-RLS algorithm for colored-input signals
abstract
The recursive least squares (RLS) algorithms for FIR adaptive filtering are particularly attractive due to their fast convergence, especially for correlated input signals. A detailed analysis of the QR-RLS algorithm in finite and infinite precision implementations is presented, emphasizing the case where the input signal samples are correlated. The expressions for the mean square values of all internal variables in a steady state are first derived. These expressions are the key used to determine the dynamic range of the internal signals, and to derive the analytical expressions for the mean square values of the deviations in the output variables of the algorithm in finite wordlength implementations. Previous works address this problem considering the input signal a white noise, a situation not so often encountered in practice. The accuracy of all analytical results are verified through a number of computer simulations.
Paulo S. R. Diniz, Marcio G. Siqueira
ICASSP2
1995 Finite Precision Analysis of the Fast QRD-RLS Lattice Algorithm
Marcio G. Siqueira, Abeer Alwan, Paulo S. R. Diniz
ISCAS1
1994 New adaptive-filtering techniques applied to speech echo cancellation
abstract
Developing high-quality echo cancelers is an important area of research and is becoming increasingly so with the wide use of hands-free telephones. Although LS algorithms have a faster convergence rate than the more widely-used LMS algorithms, the LS algorithms have not been popular in echo cancelers either because of their bad numerical properties and/or because of large complexity overhead. The authors investigate the performance of a fast RLS algorithm (FQRD-RLS) in the context of speech echo cancellation. The FQRD algorithm is not computationally complex and appears to possess good numerical properties. The computer simulations involve both direct and subband-filtering implementations. The results indicate that the FQRD-RLS is a powerful option for speech echo cancellation.>
Marcio G. Siqueira, Abeer Alwan
ICASSP (2)1
1994 Infinite Precision Analysis of the Fast QR Decomposition RLS Algorithm
abstract
This work develops relations for the mean squared value of internal variables in the fast QRD-RLS. The objective is to derive relations based on known characteristics of input signals that predict the behavior of the internal quantities of the algorithm. It is shown that the fast and conventional QRD-RLS algorithms have some variables in common, and thus previous results of the infinite precision analysis of the conventional algorithm remain valid for the fast version. Conditions for avoiding over flow in fixed-point implementations are presented. Simulation results are also shown.>
Marcio G. Siqueira, Paulo S. R. Diniz, Abeer Alwan
ISCAS1
1993 Infinite precision analysis of the QR-recursive least squares algorithm
Marcio G. Siqueira, Paulo S. R. Diniz
ISCAS1