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

Kangli Zhang

dblp:167/2250 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2017
0000-0002-3889-9117ORCID · corroborated

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorApplied, 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.

Computer networks
1 paper
Physical-layer communications · 70% Routing and switching · 30%

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

TopicWeightPapersLastEvidence papers
Routing and switching › packet forwarding › forwarding protocol
decode-and-forward relaying
0.312017
A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems · IEEE Trans. Commun. 2017
Physical-layer communications › signal detection
joint detection
0.312017
A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems · IEEE Trans. Commun. 2017
Physical-layer communications
MIMO
0.312017
A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems · IEEE Trans. Commun. 2017
Physical-layer communications › diversity combining
diversity order analysis
0.112017
A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems · IEEE Trans. Commun. 2017

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

symbol error probability bound · 0.3maximum likelihood detection · 0.3diversity analysis · 0.3
YearPublicationVenuePosition
2017 Efficient detection methods for amplify-and-forward relay-aided device-to-device systems with full-rate space-time block code
abstract
Relay-aided device-to-device (D2D) communication is a promising technology for the next-generation cellular network. We study the transmission schemes for an amplify-and-forward relay-aided D2D system which has multiple antennas. To circumvent the prohibitive complexity problem of traditional maximum likelihood (ML) detection for full-rate space-time block code (FSTBC) transmission, two low-complexity detection methods are proposed, i.e., the detection methods with the ML-combining (MLC) algorithm and the joint conditional ML (JCML) detector. Particularly, the method with the JCML detector reduces detection delay at the cost of more storage and performs well with parallel implementation. Simulation results indicate that the proposed detection methods achieve a symbol error probability similar to that of the traditional ML detector for FSTBC transmission but with less complexity, and the performance of FSTBC transmission is significantly better than that of spatial multiplexing transmission. Diversity analysis for the proposed detection methods is also demonstrated by simulations.
Kangli Zhang, Fanglin Gu
Frontiers Inf. Technol. Electron. Eng.1
2017 A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems
abstract
Jointly detecting the signals from the source and relay in a spatial multiplexing (SM) multiple-input multiple-output (MIMO) relaying system improves the transmit reliability significantly. However, the existing joint detection schemes for SM MIMO relaying systems, which achieve full diversity, such as the near maximum likelihood (ML) decoder, suffer from high complexity. In this paper, we propose a weighted combining (WC) algorithm, which is applied before the detector in the SM MIMO decode-and-forward relaying system. The proposed algorithm merges the received signal vectors from the source and relay into a combined signal without expanding their dimension, and formulates an equivalent MIMO channel matrix for the combined signal, resulting in a lower complexity for the subsequent detection. We analyze the performance of the proposed WC algorithm with ML detection in terms of the diversity order and computational complexity. An approximate upper bound on the symbol error probability (SEP) for the proposed algorithm is also derived. Simulation results show that in symmetric networks, the proposed WC algorithm achieves substantially lower complexity, while maintaining an SEP performance similar to that of the benchmark NML decoder. The consistency of the derived upper bound on the SEP is also verified by simulations.
Kangli Zhang, Jian Wang 0007, Jiaxin Yang 0001, Benoît Champagne 0001, Fanglin Gu, Jibo Wei
IEEE Trans. Commun.1
2016 A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems
abstract
Jointly detecting signals from the source and relay in a multi-input multi-output (MIMO) relaying system can achieve lower symbol error probability (SEP) and higher diversity order. In the literature, the best detector for spatial multiplexing decode-and-forward (DF) MIMO relaying systems is the near maximum likelihood (NML) decoder. However, both NML decoder and its variation are computationally intensive, especially when high-order modulations and multiple data streams are adopted. In order to develop a more efficient detection scheme, we propose a weighted combining (WC) algorithm which is applied before the final detector. The proposed algorithm merges the signal vectors from the source and relay without expanding their dimension and formulates an equivalent MIMO channel matrix for the combined signal, resulting in a much lower complexity for the subsequent detection. Simulation results show that by using the proposed WC algorithm with the ML detector, the same diversity gain as that of the more complex NML detection scheme can be achieved. In particular, in a symmetric network topology, the performance of the proposed WC algorithm is comparable to that of NML.
Kangli Zhang, Jian Wang 0007, Jiaxin Yang 0001, Benoît Champagne 0001, Jibo Wei
VTC Fall1
2016 A Mixed-Decimation MDF Architecture for Radix-2k Parallel FFT
abstract
This paper presents a mixed-decimation multipath delay feedback (M2 DF) approach for the radix-2kfast Fourier transform. We employ the principle of folding transformation to derive the proposed architecture, which activates the idle period of arithmetic modules in multipath delay feedback (MDF) architectures by integrating the decimation-in-time operations into the decimation-in-frequency-operated computing units. Furthermore, we compare the proposed design with other efficient schemes, namely, the MDF and the multipath delay commutator (MDC) scheme theoretically and experimentally. Relying on the obtained expressions and statistics, it can be concluded that the M2DF design serves as an efficient alternative to the MDF scheme, since it achieves improved efficiency in the utilization of arithmetic resources without deteriorating the superiorities of feedback structures. In addition, the recommended design performs better in memory requirement and computing delay compared with the MDC approach.
Jian Wang 0007, Chun-lin Xiong, Kangli Zhang, Jibo Wei
IEEE Trans. Very Large Scale Integr. Syst.3