Maria D. Miranda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maria D. Miranda has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Magno T. M. Silva
Electronic Systems Engineering Department, Escola Politcnica, University of So Paulo, So Paulo, Brazil
13 shared publications Joao Mendes Filho
Escola Politécnica, University of São Paulo, São Paulo, SP, Brazil
5 shared publications- Flávio Renê Miranda Pavan
Univ Sao Paulo, Escola Politecn, Sao Paulo, Brazil
4 shared publications - Vitor Heloiz Nascimento
Department of Electronic Systems Engineering, University of São Paulo, São Paulo, Brazil
4 shared publications - Ricardo Suyama
Federal University of ABC, Santo Andr, So Paulo, Brazil
2 shared publications Aline Neves
1 shared publication
Latest Publications
- 1 October 2019
- Published by Elsevier in Signal Processing
- Vol. 163, 153-165
Performance analysis of the multiuser Shalvi-Weinstein algorithm
- 1 October 2019
- Published by Elsevier in Signal Processing
- Vol. 163, 153-165
Performance analysis of the multiuser Shalvi-Weinstein algorithm
- Open Access
- 1 January 2018
- Published by Sociedad Brasileira de Telecomunicacoes in Journal of Communication and Information Systems
- Vol. 33 (1) , 146-157
On the Darmois-Skitovich Theorem and Spatial Independence in Blind Source Separation
In many signal processing applications, one may come across the need to individually recover unobserved signals which are also combined in an unknown manner. This problem is widely known as blind source separation (BSS). One of the most prominent set of BSS techniques, known as independent component analysis (ICA), owes much of its development and theoretical understanding to the Darmois-Skitovich theorem. Although this theorem is implicitly used in BSS to establish source separability conditions in ICA, little emphasis is given in the literature to its derivation and to the interpretation of its consequences. The goal of this paper is to revisit, in a more intuitive manner, the Darmois-Skitovich theorem and its derivation in the BSS context.
- 1 January 2018
- Published by Sociedad Brasileira de Telecomunicacoes in Journal of Communication and Information Systems
- Vol. 33 (1) , 146-157
Open AccessOn the Darmois-Skitovich Theorem and Spatial Independence in Blind Source Separation
In many signal processing applications, one may come across the need to individually recover unobserved signals which are also combined in an unknown manner. This problem is widely known as blind source separation (BSS). One of the most prominent set of BSS techniques, known as independent component analysis (ICA), owes much of its development and theoretical understanding to the Darmois-Skitovich theorem. Although this theorem is implicitly used in BSS to establish source separability conditions in ICA, little emphasis is given in the literature to its derivation and to the interpretation of its consequences. The goal of this paper is to revisit, in a more intuitive manner, the Darmois-Skitovich theorem and its derivation in the BSS context.
- 1 January 2018
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 355 (1) , 596-624
A numerically robust blind equalization scheme applied to MIMO communication systems
- 1 January 2018
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 355 (1) , 596-624
A numerically robust blind equalization scheme applied to MIMO communication systems
- 19 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Avoiding divergence in the constant modulus algorithm for blind equalization of MIMO systems
The multiuser constant modulus algorithm (MU-CMA) can be employed for blind equalization of multiple-input multiple-output (MIMO) communication systems. Due to the multi-modality of the constant modulus cost function, some adverse situations can cause inconsistency in the nonlinear estimates, which in turn can lead the algorithm to diverge. In order to avoid divergence, we propose a dual-mode multiuser algorithm, which works as a normalized multimodulus version of MU-CMA in the first mode, and rejects nonlinear estimates in the second mode. We present a deterministic stability analysis of the proposed algorithm and confirm its good performance by means of numerical simulations.
- 19 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Avoiding divergence in the constant modulus algorithm for blind equalization of MIMO systems
The multiuser constant modulus algorithm (MU-CMA) can be employed for blind equalization of multiple-input multiple-output (MIMO) communication systems. Due to the multi-modality of the constant modulus cost function, some adverse situations can cause inconsistency in the nonlinear estimates, which in turn can lead the algorithm to diverge. In order to avoid divergence, we propose a dual-mode multiuser algorithm, which works as a normalized multimodulus version of MU-CMA in the first mode, and rejects nonlinear estimates in the second mode. We present a deterministic stability analysis of the proposed algorithm and confirm its good performance by means of numerical simulations.
- 1 August 2015
- Published by Elsevier in Neural Networks
- Vol. 68, 89-95
The transfer function of neuron spike
- 1 August 2015
- Published by Elsevier in Neural Networks
- Vol. 68, 89-95
The transfer function of neuron spike
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4512-4516
A regional multimodulus algorithm for blind image deconvolution
We propose an efficient scheme for blind image restoration that takes advantage of recent advances in blind algorithms used for equalization of communication channels. It is based on a blind adaptive algorithm that interprets images with more than two grayscale levels as images with only two grayscale levels. In order to take a greater advantage of the adaptive scheme, we also propose some changes in the implementation of the algorithm. The performance of our proposal is illustrated by means of simulations, where we show its advantages with respect to an existing image deconvolution scheme based on the two-dimension constant modulus algorithm.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4512-4516
A regional multimodulus algorithm for blind image deconvolution
We propose an efficient scheme for blind image restoration that takes advantage of recent advances in blind algorithms used for equalization of communication channels. It is based on a blind adaptive algorithm that interprets images with more than two grayscale levels as images with only two grayscale levels. In order to take a greater advantage of the adaptive scheme, we also propose some changes in the implementation of the algorithm. The performance of our proposal is illustrated by means of simulations, where we show its advantages with respect to an existing image deconvolution scheme based on the two-dimension constant modulus algorithm.
- 1 November 2012
- Published by Elsevier in Signal Processing
- Vol. 92 (11) , 2643-2656
A regional multimodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis
- 1 November 2012
- Published by Elsevier in Signal Processing
- Vol. 92 (11) , 2643-2656
A regional multimodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Accelerating the convergence of a decision-based algorithm for blind equalization of QAM signals
Recently, we proposed a decision-based algorithm for blind equalization that performs similarly to a supervised algorithm in steady-state, independently of the QAM order. Using this algorithm, the usual switching to the decision-directed mode may be avoided. Additionally, a low-cost scheme based on the neighborhood of the estimated symbol was used to improve its convergence rate. In this paper, we interpret this scheme from a probability density function fitting perspective. When the uncertainty on the estimated symbol is high, simulations show that the neighborhood plays an important role for speeding up the convergence. On the other hand, to ensure a low mean-square error, the neighborhood must be disregarded in steady-state.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Accelerating the convergence of a decision-based algorithm for blind equalization of QAM signals
Recently, we proposed a decision-based algorithm for blind equalization that performs similarly to a supervised algorithm in steady-state, independently of the QAM order. Using this algorithm, the usual switching to the decision-directed mode may be avoided. Additionally, a low-cost scheme based on the neighborhood of the estimated symbol was used to improve its convergence rate. In this paper, we interpret this scheme from a probability density function fitting perspective. When the uncertainty on the estimated symbol is high, simulations show that the neighborhood plays an important role for speeding up the convergence. On the other hand, to ensure a low mean-square error, the neighborhood must be disregarded in steady-state.
- 4 May 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 8068
The use of least squares lattice algorithm in the parameterization and sorting of action potentials signals
The understanding of neuronal function under the action of a certain stimulus can be facilitated using techniques to distinguish the potential action from different neurons. Thus, from simultaneous recording of multiple neurons one can determine the firing patterns of each of them. Usually these techniques are implemented in three stages. From raw electrical potentials recorded using an intracranial electrode, spikes are detected, then parameterized and finally sorted, attributing every single spike observed to a particular neuron. Recently, it was proposed an on-line sorting method based on the noise level. Nevertheless, sorting is done directly based on the raw samples. In this paper we introduce an alternative way using the modified Least Squares algorithm based on the priori error with error feedback to parameterize the raw signals before classification. Preliminary simulations results show that using parameters provides performance near to results where the sorting is done directly based on the raw samples.
- 4 May 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 8068
The use of least squares lattice algorithm in the parameterization and sorting of action potentials signals
The understanding of neuronal function under the action of a certain stimulus can be facilitated using techniques to distinguish the potential action from different neurons. Thus, from simultaneous recording of multiple neurons one can determine the firing patterns of each of them. Usually these techniques are implemented in three stages. From raw electrical potentials recorded using an intracranial electrode, spikes are detected, then parameterized and finally sorted, attributing every single spike observed to a particular neuron. Recently, it was proposed an on-line sorting method based on the noise level. Nevertheless, sorting is done directly based on the raw samples. In this paper we introduce an alternative way using the modified Least Squares algorithm based on the priori error with error feedback to parameterize the raw signals before classification. Preliminary simulations results show that using parameters provides performance near to results where the sorting is done directly based on the raw samples.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 3388-3391
A family of algorithms for blind equalization of QAM signals
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which generally provides a relatively low misadjustment. Besides presenting strategies to speed up their convergences, we provide sufficient conditions for the stability of the symbol-based decision algorithm, which is an extension of the decision-directed algorithm. Their behaviors are illustrated through simulation results.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 3388-3391
A family of algorithms for blind equalization of QAM signals
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which generally provides a relatively low misadjustment. Besides presenting strategies to speed up their convergences, we provide sufficient conditions for the stability of the symbol-based decision algorithm, which is an extension of the decision-directed algorithm. Their behaviors are illustrated through simulation results.