default search action
Digital Signal Processing, Volume 97
Volume 97, February 2020
- Yunfei Fang, Shengqi Zhu, Hongyan Wang, Cao Zeng:
DOA estimation via ULA with mutual coupling in the presence of non-uniform noise. - Kwang Myung Jeon, Hong Kook Kim:
Sparsity-based phase spectrum compensation for single-channel speech source separation. - Christophe Kervazo, Jérôme Bobin, Cécile Chenot, Florent Sureau:
Use of PALM for ℓ1 sparse matrix factorization: Difficulty and rationalization of a two-step approach. - Chengmao Wu, Xiaoqiang Yang:
Robust credibilistic fuzzy local information clustering with spatial information constraints. - Fuyu Tao, Tong Wang, Jianxin Wu, Xuefang Lin:
A novel KA-STAP method based on Mahalanobis distance metric learning. - Zheran Shang, Kai Huo, Weijian Liu, Yang Sun, Yongliang Wang:
Knowledge-aided covariance estimate via geometric mean for adaptive detection. - Kai Wang, Lin Zhang, He Wen, Li Xu:
A sliding-window DFT based algorithm for parameter estimation of multi-frequency signal. - Avik Santra, Alexander Rudolf Ganis, Jan Mietzner, Volker Ziegler:
Ambiguity function and imaging performance of coded FMCW waveforms with fast 4D receiver processing in MIMO radar. - Chengzhao Shan, Yongkui Ma, Honglin Zhao, Jun Shi:
Time modulated array sideband suppression for joint radar-communications system based on the differential evolution algorithm. - Ciro André Pitz, Eduardo Luiz Ortiz Batista, Rui Seara, Dennis R. Morgan:
A novel approach for beamforming based on adaptive combinations of vector projections. - Jichen Yang, Rohan Kumar Das:
Long-term high frequency features for synthetic speech detection. - Abdul Basit, Wen-Qin Wang, Shaddrack Yaw Nusenu:
Adaptive transmit array sidelobe control using FDA-MIMO for tracking in joint radar-communications.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.