Ping Sun
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
Ping Sun has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Chongxi Feng
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
1 shared publication- Jianfei Yang
Nanyang Technological University, Singapore
1 shared publication - Jie Yan
College of Systems Engineering, National University of Defense Technology,Changsha,China
1 shared publication Liming Yang
1 shared publication- Preetha Phillips
School of Natural Sciences and Mathematics, Shepherd University, Shepherdstown, WV 25443, USA
1 shared publication - Shuihua Wang
Department of Biosciences and Bioinformatics, Suzhou Municipal Key Lab AI4Health, School of Science, Xi’an Jiaotong-Liverpool University, Suzhou, China
1 shared publication
Latest Publications
- 1 January 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 236
Low-rank supervised and semi-supervised multi-metric learning for classification
- 1 January 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 236
Low-rank supervised and semi-supervised multi-metric learning for classification
- 11 March 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 151 (1-4) , 1-48
A Comprehensive Survey on Fractional Fourier Transform
The Fractional Fourier transform (FRFT) is a relatively novel linear transforms that is a generalization of conventional Fourier transform (FT). FRFT can transform a particular signal to a unified time-frequency domain. In this survey, we try to pres
- 11 March 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 151 (1-4) , 1-48
A Comprehensive Survey on Fractional Fourier Transform
The Fractional Fourier transform (FRFT) is a relatively novel linear transforms that is a generalization of conventional Fourier transform (FT). FRFT can transform a particular signal to a unified time-frequency domain. In this survey, we try to pres
- 1 January 1991
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (1) , 1-3
An effective simplifying scheme for Viterbi decoder
A Viterbi decoding algorithm with a scarce-state transition-type circuit configuration, namely the probability selecting states (PSS) mode decoder, is presented. The algorithm has reduced complexity compared to a conventional Viterbi decoder. It is shown that this method has three advantages over the general Viterbi algorithm: it is suitable to the quick look-in code, it applies the optimum decoding in a PSS-type decoder, and it makes full use of the likelihood concentration property. The bit-error-rate (BER) performance of a r=1/2, k=7 (147,135) code and PSS-type Viterbi decoder approximates the optimum performance of the standard Viterbi decoder and reduces the hardware of the conventional Viterbi decoder to about half
- 1 January 1991
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (1) , 1-3
An effective simplifying scheme for Viterbi decoder
A Viterbi decoding algorithm with a scarce-state transition-type circuit configuration, namely the probability selecting states (PSS) mode decoder, is presented. The algorithm has reduced complexity compared to a conventional Viterbi decoder. It is shown that this method has three advantages over the general Viterbi algorithm: it is suitable to the quick look-in code, it applies the optimum decoding in a PSS-type decoder, and it makes full use of the likelihood concentration property. The bit-error-rate (BER) performance of a r=1/2, k=7 (147,135) code and PSS-type Viterbi decoder approximates the optimum performance of the standard Viterbi decoder and reduces the hardware of the conventional Viterbi decoder to about half