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

Yingxian Zhang

dblp:132/8047 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0001-7373-7511ORCID · corroborated

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

Computer networks · 4 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes
concatenated codes
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes › decoding
iterative decoding
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes › concatenated codes
parallel concatenation
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016
Coding theory › channel coding
polar codes
0.212016
Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes · IEEE Trans. Commun. 2016

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

simulation · 0.2minimum distance estimation · 0.2interleaver optimization · 0.2
YearPublicationVenuePosition
2025 A Multimodal Medical Image Fusion Method Incorporating an Adaptive Attention Mechanism
abstract
Multimodal medical image fusion technology provides more comprehensive and accurate image support for clinical diagnosis and treatment by integrating complementary information from different imaging modalities. Aiming at the problem that existing methods are still insufficient in detail feature extraction and inter-modal information fusion, this paper proposes a multimodal medical image fusion method combined with an adaptive attention mechanism. First, we design the Grouped Receptive Field Attentional Convolution (GRFAConv) to solve the problem of insufficient detail feature extraction capability. With the multi-head receptive field adaptive weighting strategy of grouped convolution, the range and weight of the receptive field of the convolution kernel can be adaptively adjusted according to the different demands of local and global features of the image to improve the effect of detail retention. Second, for the problem of information fusion between different modalities, we introduce an improved CBAM attention module in the feature fusion process, which adaptively selects and enhances the features in the key regions through the channel attention and spatial attention mechanisms, which greatly improves the clarity of the fused image details and the accuracy of the information expression in the key regions. Furthermore, experimental results on several medical image datasets show that the algorithm proposed in this paper can generate relatively high-quality fused images. It not only enriches the detailed features of the image, but also achieves significant advantages in several evaluation metrics.
Yingxian Zhang, Hu Liang, Hai Zhong
CSCWD1
2021 Using an Equivalence-Based Approach to Derive 2-D Spectrum of BiSAR Data and Implementation Into an RDA Processor
abstract
An equivalent range equation with a monostatic equivalent component and a bistatic synthetic aperture radar (BiSAR) compensation component was proposed. There were five monostatic equivalent parameters (MEPs) in the both components. With the MEPs, a BiSAR range equation can be expressed in a form similar to the monostatic SAR (MoSAR) expression. Then, by using the range equation and the principle of stationary phase (POSP), we analytically derive the 2-D spectrum of a point target, and this 2-D spectrum is implemented into the range Doppler algorithm (RDA) that processes the translational invariant (TI) BiSAR data. In our RDA, spatially variant range cell migration (RCM) correction and azimuth compression (AC), both of which are related to the spatially variant MEPs, are required to focus all targets in the whole scene of different range cells. Simulations under a wide range of imaging parameters are conducted to assess the equivalent range equation and the 2-D spectrums. Satisfactory results are obtained. In addition, traditional methods for motion compensation can be directly applied to our equivalent range equation. Finally, the RDA is evaluated through the analysis of acquired raw BiSAR data. Well-focused images are obtained. Therefore, the proposed equivalent range equation, derived 2-D spectrum, and RDA have been validated for forming imagery using raw BiSAR data.
Yachao Li 0001, Yingxian Zhang, Shasha Mao
IEEE Trans. Geosci. Remote. Sens.6
2019 Rateless transmission of polar codes with information unequal error protection
abstract
In this study, a rateless transmission scheme with information unequal error protection (UEP) is proposed by using polar codes. The proposed scheme is suitable for transmissions in time‐varying channels, as well as pursues UEP goal of information with different reliability requirements. Firstly, the authors design rateless transmission for an unknown channel via extending polarisation matrix and importance‐based puncturing. In particular, an algorithm ensuring full coding gain for UEP performance is proposed on the basis of rateless transmission. Moreover, in consideration of combining flexible successive cancellation list (SCL) decoding with UEP, they further present a size‐adapted SCL decoding scheme with reduced complexity. Numerical simulation shows that their proposed rateless scheme based on polar codes could achieve good UEP performance with low complexity in unknown channels.
Hao Liang 0004, Aijun Liu 0001, Yingxian Zhang, Fengyi Cheng
IET Commun.3
2017 Secure transmission over the wiretap channel using polar codes and artificial noise
abstract
In this study, the authors propose a secure transmission scheme using polar codes and artificial noise (AN) for the wiretap system without assuming the channel quality advantage of main channel over wiretap channel. They first derive lower and upper bounds on the symmetric capacity of the polarised bit‐channels , which depend on the signal‐to‐noise ratio of each use of physical channel. According to the bounds, they prove existence of the bit‐channels that are beneficial to the signal reception of the main channels but hostile to the wiretap channel, and a method based on injecting the AN at the transmitter is introduced to achieve those bit‐channels. Through theoretical analysis, the security of the proposed AN method is proven. Thereafter, they elaborate two AN power allocation schemes denoted by AN‐PA‐I and AN‐PA‐II for each use of physical channel. The former proves the existence of the minimum AN power to achieve the secrecy rate that is equal to the capacity of the main channel, referred to as the maximum secrecy rate, and the latter introduces how to obtain it with an optimisation method. Numerical results show that both the two schemes can achieve the maximum secrecy rate.
Yingxian Zhang, Zhen Yang 0001, Aijun Liu 0001, YuLong Zou
IET Commun.1
2016 Practical Design and Decoding of Parallel Concatenated Structure for Systematic Polar Codes
abstract
In this paper, a parallel concatenated structure is proposed to improve the performance of polar codes in finite length in which multiblocks systematic polar codes (SPC) and recursive systematic convolutional codes (RSC) are combined. We first design a weighted iterative decoding algorithm for the proposed structure such that better bit error rate performance can be obtained. Then, a deliberated interleaver is optimized for the new scheme. Thereafter, we introduce a strategy to estimate the minimum distance of the concatenation codeword, where an asymptotic performance and convergence behavior analysis are elaborated. Finally, the error performance of the proposed scheme is evaluated via simulations. The results show that our scheme almost outperforms all the existed concatenation ones using polar codes, making the codes more practical.
Qingshuang Zhang, Aijun Liu 0001, Yingxian Zhang, Xiaohu Liang
IEEE Trans. Commun.3
2013 Reduced-complexity superbaud timing recovery for PAM-based multi-h CPM receivers
abstract
Continuous phase modulation (CPM) is a widely used modulation scheme in communication systems. However, difficulties arise with the design of CPM receivers, due to the nonlinear nature of CPM. One popular solution to this problem is to linearize CPM with pulse amplitude modulation (PAM) representation. In this paper, a reduced-complexity superbaud timing recovery method is proposed for PAM-based multi-h CPM receivers. The proposed method is non-data-aided, feedforward, and suitable for M-ary, multi-h CPM in general. The novelties of the proposed method are twofold. On one hand, the proposed method is reduced-complexity for PAM-based receivers, because it shares the same match filters with the PAM-based detectors. On the other hand, it is shown that the proposed method is able to outperform the existing method with some modulation schemes. Therefore, the proposed method provides an important synchronization component for PAM-based multi-h CPM receivers.
Aijun Liu 0001, Yingxian Zhang, Heng Wang 0011
WCNC3