Xiaohua Fan
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
Research Subjects
Xiaohua Fan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Minglei Zhang
Department of Electrical and Computer Engineering, State Key Laboratory of Analog and Mixed-Signal VLSI, Institute of Microelectronics, Faculty of Science and Technology, University of Macau, Macau, China
4 shared publications - Jianhua Jiang
Smart sensing R&D center, Institute of microelectronics of Chinese academy of sciences, Beijing 100029, China
2 shared publications Qingsong Cai
Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China, and also with the School of Microelectronics, University of Chinese Academy of Sciences, Beijing 100049, China
2 shared publications- Shushan Qiao
Institute of Microelectronics, Chinese Academy of Sciences
2 shared publications Xiaoyun Jia
Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China, and also with the School of Microelectronics, University of Chinese Academy of Sciences, Beijing 100049, China
2 shared publications- Yi Zhan
Institute of Microelectronics of the Chinese Academy of Sciences
2 shared publications
Latest Publications
- Open Access
- 8 February 2022
- Published by MDPI AG in Information
- Vol. 13 (2) , 79
Audio Classification Algorithm for Hearing Aids Based on Robust Band Entropy Information
Audio classification algorithms for hearing aids require excellent classification accuracy. To achieve effective performance, we first present a novel supervised method, involving a spectral entropy-based magnitude feature with a random forest classifier (SEM-RF). A novel-feature SEM based on the similarity and stability of band signals is introduced to improve the classification accuracy of each audio environment. The random forest (RF) model is applied to perform the classification process. Subsequently, to resolve the problem of decreasing classification accuracy of the SEM-RF algorithm in mixed speech environments, an improved algorithm, ImSEM-RF, is proposed. The SEM features and corresponding phase features are fused on multiple time resolutions to form a robust multi-time resolution magnitude and phase (multi-MP) feature, which improves the stability of the feature with which the speech signal interferes. The RF model is improved using the linear discriminant analysis (LDA) method to form a linear discriminant analysis-random forest (LDA-RF) joint classification model, which performs model acceleration. Through experiments on hearing aid research data sets for acoustic environment recognition, the effectiveness of the SEM-RF algorithm was confirmed on a background audio signal dataset. The classification accuracy increased by approximately 7% compared with the background noise classification algorithm using an RF tree classifier. The validity of the ImSEM-RF algorithm in speech-interference environments was confirmed using the speech in the background audio signal dataset. Compared with the SEM-RF algorithm, the classification accuracy was improved by approximately 2%. The LDA-RF reduced the program’s running time by >80% with multi-MP features compared with RF.
- 8 February 2022
- Published by MDPI AG in Information
- Vol. 13 (2) , 79
Open AccessAudio Classification Algorithm for Hearing Aids Based on Robust Band Entropy Information
Audio classification algorithms for hearing aids require excellent classification accuracy. To achieve effective performance, we first present a novel supervised method, involving a spectral entropy-based magnitude feature with a random forest classifier (SEM-RF). A novel-feature SEM based on the similarity and stability of band signals is introduced to improve the classification accuracy of each audio environment. The random forest (RF) model is applied to perform the classification process. Subsequently, to resolve the problem of decreasing classification accuracy of the SEM-RF algorithm in mixed speech environments, an improved algorithm, ImSEM-RF, is proposed. The SEM features and corresponding phase features are fused on multiple time resolutions to form a robust multi-time resolution magnitude and phase (multi-MP) feature, which improves the stability of the feature with which the speech signal interferes. The RF model is improved using the linear discriminant analysis (LDA) method to form a linear discriminant analysis-random forest (LDA-RF) joint classification model, which performs model acceleration. Through experiments on hearing aid research data sets for acoustic environment recognition, the effectiveness of the SEM-RF algorithm was confirmed on a background audio signal dataset. The classification accuracy increased by approximately 7% compared with the background noise classification algorithm using an RF tree classifier. The validity of the ImSEM-RF algorithm in speech-interference environments was confirmed using the speech in the background audio signal dataset. Compared with the SEM-RF algorithm, the classification accuracy was improved by approximately 2%. The LDA-RF reduced the program’s running time by >80% with multi-MP features compared with RF.
- Open Access
- 4 February 2021
- Published by MDPI AG in Electronics
- Vol. 10 (4) , 380
An Efficient Codebook Search Algorithm for Line Spectrum Frequency (LSF) Vector Quantization in Speech Codec
A high-performance vector quantization (VQ) codebook search algorithm is proposed in this paper. VQ is an important data compression technique that has been widely applied to speech, image, and video compression. However, the process of the codebook search demands a high computational load. To solve this issue, a novel algorithm that consists of training and encoding procedures is proposed. In the training procedure, a training speech dataset was used to build the squared-error distortion look-up table for each subspace. In the encoding procedure, firstly, an input vector was quickly assigned to a search subspace. Secondly, the candidate code word group was obtained by employing the triangular inequality elimination (TIE) equation. Finally, a partial distortion elimination technique was employed to reduce the number of multiplications. The proposed method reduced the number of searches and computation load significantly, especially when the input vectors were uncorrelated. The experimental results show that the proposed algorithm provides a computational saving (CS) of up to 85% in the full search algorithm, up to 76% in the TIE algorithm, and up to 63% in the iterative TIE algorithm. Further, the proposed method provides CS and load reduction of up to 29–33% and 67–69%, respectively, over the BSS-ITIE algorithm.
- 4 February 2021
- Published by MDPI AG in Electronics
- Vol. 10 (4) , 380
Open AccessAn Efficient Codebook Search Algorithm for Line Spectrum Frequency (LSF) Vector Quantization in Speech Codec
A high-performance vector quantization (VQ) codebook search algorithm is proposed in this paper. VQ is an important data compression technique that has been widely applied to speech, image, and video compression. However, the process of the codebook search demands a high computational load. To solve this issue, a novel algorithm that consists of training and encoding procedures is proposed. In the training procedure, a training speech dataset was used to build the squared-error distortion look-up table for each subspace. In the encoding procedure, firstly, an input vector was quickly assigned to a search subspace. Secondly, the candidate code word group was obtained by employing the triangular inequality elimination (TIE) equation. Finally, a partial distortion elimination technique was employed to reduce the number of multiplications. The proposed method reduced the number of searches and computation load significantly, especially when the input vectors were uncorrelated. The experimental results show that the proposed algorithm provides a computational saving (CS) of up to 85% in the full search algorithm, up to 76% in the TIE algorithm, and up to 63% in the iterative TIE algorithm. Further, the proposed method provides CS and load reduction of up to 29–33% and 67–69%, respectively, over the BSS-ITIE algorithm.
- Open Access
- 26 February 2020
- Published by MDPI AG in Electronics
- Vol. 9 (3) , 387
Fast Computation of LSP Frequencies Using the Bairstow Method
Linear prediction is the kernel technology in speech processing. It has been widely applied in speech recognition, synthesis, and coding, and can efficiently and correctly represent the speech frequency spectrum with only a few parameters. Line Spectrum Pairs (LSPs) frequencies, as an alternative representation of Linear Predictive Coding (LPC), have the advantages of good quantization accuracy and low spectral sensitivity. However, computing the LSPs frequencies takes a long time. To address this issue, a fast computation algorithm, based on the Bairstow method for computing LSPs frequencies from linear prediction coefficients, is proposed in this paper. The algorithm process first transforms the symmetric and antisymmetric polynomial to general polynomial, then extracts the polynomial roots. Associated with the short-term stationary property of speech signal, an adaptive initial method is applied to reduce the average iteration numbers by 26%, as compared to the statics in the initial method, with a Perceptual Evaluation of Speech Quality (PESQ) score reaching 3.46. Experimental results show that the proposed method can extract the polynomial roots efficiently and accurately with significantly reduced computation complexity. Compared to previous works, the proposed method is 17 times faster than Tschirnhus Transform, and has a 22% PESQ improvement on the Birge-Vieta method with an almost comparable computation time.
- 26 February 2020
- Published by MDPI AG in Electronics
- Vol. 9 (3) , 387
Open AccessFast Computation of LSP Frequencies Using the Bairstow Method
Linear prediction is the kernel technology in speech processing. It has been widely applied in speech recognition, synthesis, and coding, and can efficiently and correctly represent the speech frequency spectrum with only a few parameters. Line Spectrum Pairs (LSPs) frequencies, as an alternative representation of Linear Predictive Coding (LPC), have the advantages of good quantization accuracy and low spectral sensitivity. However, computing the LSPs frequencies takes a long time. To address this issue, a fast computation algorithm, based on the Bairstow method for computing LSPs frequencies from linear prediction coefficients, is proposed in this paper. The algorithm process first transforms the symmetric and antisymmetric polynomial to general polynomial, then extracts the polynomial roots. Associated with the short-term stationary property of speech signal, an adaptive initial method is applied to reduce the average iteration numbers by 26%, as compared to the statics in the initial method, with a Perceptual Evaluation of Speech Quality (PESQ) score reaching 3.46. Experimental results show that the proposed method can extract the polynomial roots efficiently and accurately with significantly reduced computation complexity. Compared to previous works, the proposed method is 17 times faster than Tschirnhus Transform, and has a 22% PESQ improvement on the Birge-Vieta method with an almost comparable computation time.
- 8 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (3) , 909-919
A 1-MHz-Bandwidth Gm-C-Based Quadrature Bandpass Sigma-Delta Modulator Achieving −153.7-dBFS/Hz NSD With Background Calibration
This paper presents a fifth-order continuous-time Gm-C-based quadrature bandpass sigma-delta (Δ Σ) modulator for Internet-of-Things applications. In the presented Δ Σ modulator, a reconfigurable full-scale input amplitude assists the Δ Σ modulator, achieving a wide dynamic range (DR) and a low-noise floor. A following system-level supply voltage and temperature background tracking technique stabilizes the frequency response of the Gm-C-based quadrature bandpass Δ Σ modulator. Furthermore, the 1.5-bit feedback current DAC employs a PN-based semi-self-swapping logic to relax the matching requirement. The prototype Δ Σ modulator was fabricated in a 180-nm CMOS process with an active area of 0.28 mm². The Δ Σ modulator achieves a total DR of 93.7 dB with the reconfigurable full-scale input amplitude, resulting in a noise spectral density of -153.7 dBFS/Hz with a bandwidth of 1 MHz. The presented Δ Σ modulator consumes 2.0 mW with a power supply of 1.8 V and a sampling frequency of 32 MHz.
- 8 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (3) , 909-919
A 1-MHz-Bandwidth Gm-C-Based Quadrature Bandpass Sigma-Delta Modulator Achieving −153.7-dBFS/Hz NSD With Background Calibration
This paper presents a fifth-order continuous-time Gm-C-based quadrature bandpass sigma-delta (Δ Σ) modulator for Internet-of-Things applications. In the presented Δ Σ modulator, a reconfigurable full-scale input amplitude assists the Δ Σ modulator, achieving a wide dynamic range (DR) and a low-noise floor. A following system-level supply voltage and temperature background tracking technique stabilizes the frequency response of the Gm-C-based quadrature bandpass Δ Σ modulator. Furthermore, the 1.5-bit feedback current DAC employs a PN-based semi-self-swapping logic to relax the matching requirement. The prototype Δ Σ modulator was fabricated in a 180-nm CMOS process with an active area of 0.28 mm². The Δ Σ modulator achieves a total DR of 93.7 dB with the reconfigurable full-scale input amplitude, resulting in a noise spectral density of -153.7 dBFS/Hz with a bandwidth of 1 MHz. The presented Δ Σ modulator consumes 2.0 mW with a power supply of 1.8 V and a sampling frequency of 32 MHz.
- 2 May 2018
- Published by Springer Nature in Analog Integrated Circuits and Signal Processing
- Vol. 96 (1) , 175-182
A high-speed, high-linearity, and energy-efficient subranging single-side capacitor switching scheme for SAR ADCs
- 2 May 2018
- Published by Springer Nature in Analog Integrated Circuits and Signal Processing
- Vol. 96 (1) , 175-182
A high-speed, high-linearity, and energy-efficient subranging single-side capacitor switching scheme for SAR ADCs
- 1 December 2017
- Published by Springer Nature in Analog Integrated Circuits and Signal Processing
- Vol. 94 (1) , 19-26
A fast-settling charge-pump PLL with constant loop bandwidth
- 1 December 2017
- Published by Springer Nature in Analog Integrated Circuits and Signal Processing
- Vol. 94 (1) , 19-26
A fast-settling charge-pump PLL with constant loop bandwidth
- Open Access
- 1 May 2017
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 53 (11) , 708-709
Gain‐boosted dynamic amplifier for pipelined‐SAR ADCs
A high‐gain and high‐speed gain‐boosted dynamic amplifier for pipelined‐successive approximation register ADCs is presented. A cross‐coupling cascode topology is proposed to boost the gain of a single‐stage dynamic amplifier. The proposed dynamic amplifier achieves a voltage gain of 32 under a 1.2 V power supply in 130 nm CMOS technology. Sampling at 150 MS/s, the proposed dynamic amplifier consumes a total power of 0.22 mW.
- 1 May 2017
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 53 (11) , 708-709
Open AccessGain‐boosted dynamic amplifier for pipelined‐SAR ADCs
A high‐gain and high‐speed gain‐boosted dynamic amplifier for pipelined‐successive approximation register ADCs is presented. A cross‐coupling cascode topology is proposed to boost the gain of a single‐stage dynamic amplifier. The proposed dynamic amplifier achieves a voltage gain of 32 under a 1.2 V power supply in 130 nm CMOS technology. Sampling at 150 MS/s, the proposed dynamic amplifier consumes a total power of 0.22 mW.