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

Yiqun Pan

dblp:140/2363 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
1 paper
Information theory · 62% Coding theory · 38%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › modulation
probabilistic shaping
1.012026
Low-Complexity Probability Shaping Scheme Based on Energy-Tier Template Insertion · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
concatenated codes
0.312026
Low-Complexity Probability Shaping Scheme Based on Energy-Tier Template Insertion · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
forward error correction
0.312026
Low-Complexity Probability Shaping Scheme Based on Energy-Tier Template Insertion · IEEE Trans. Commun. 2026

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

template-based shaping · 1.0bit insertion/deletion · 1.0
YearPublicationVenuePosition
2026 Low-Complexity Probability Shaping Scheme Based on Energy-Tier Template Insertion
abstract
In this paper, we propose the energy-tier template insertion shaping (ETTIS) probabilistic shaping algorithm, which performs shaping and deshaping through preset templates and simple bit insertion/deletion operations, thereby significantly reducing the algorithmic complexity. The ETTIS algorithm effectively mitigates the Hamming distance shrinkage problem commonly observed in traditional probabilistic shaping algorithms and exhibits excellent compatibility, allowing seamless integration with standard forward error correction coding and interleaving algorithms. Moreover, the ETTIS framework utilizes predefined symbol components in the shaping templates to implicitly introduce pilot symbols, enabling real-time estimation of channel gain and noise variance without additional bandwidth overhead.. Experimental and simulation results show that, at the same bit rate, the proposed scheme achieves 0.4–0.6 dB performance gains under 16-quadrature amplitude modulation (QAM) and 64-QAM modulation formats, respectively. Compared with other state-ofthe- art algorithms, ETTIS attains comparable performance while maintaining significantly lower complexity. During decoding, the absolute deviation of the estimated noise bit error rate remains below 0.75%. These features make ETTIS a promising solution for high-throughput and cost-sensitive optical interconnect systems.
Yiqun Pan, Qinghua Tian, Xiangjun Xin 0001, Haipeng Yao, Feng Tian 0015
IEEE Trans. Commun.1
2020 High-Resolution Optical and SAR Image Registration Using Local Self-Similar Descriptor Based on Edge Feature
abstract
Due to different imaging mechanisms, the registration of optical and Synthetic Aperture Radar (SAR) image is a very challenging task. Many optical and SAR registration methods have been proposed. But most of them are for low-to-medium resolution images, and less for high-resolution images. Therefore, this paper proposes a high-resolution optical and SAR image registration method using local self-similar descriptor based on edge feature. Firstly, a Gauss-Gamma bi-windows algorithm is used to extract the edge intensity maps of the images respectively. Its function is to eliminate the non-linear gray-scale difference between SAR and optical images, and also to avoid the interference of isolated speckle noise on feature point extraction. Then, local self-similar descriptor is extracted on the edge intensity map, and descriptor matching is performed using Euclidean distance. Finally, the fast sample consensus algorithm is used to eliminate mismatched point pairs. The experimental results can effectively resist speckle noise and radiation differences, and obtain pixel-level registration accuracy.
Yiqun Pan, Ling Tong 0001, Yuxia Li, Fanghong Xiao
IGARSS1