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

Feiyan Tian

dblp:255/0962 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
2since 2021 · last 2024
0000-0001-8242-2802ORCID · corroborated

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

Computer networks · 3 · 3 first-author · 2 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.

Computer networks
1 paper
Cellular and mobile networks · 56% Wireless networking · 44%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
6g
0.812024
Exploiting Matrix Information Geometry for Integrated Decoding of Massive Uncoupled Unsourced Random Access · IEEE Trans. Commun. 2024
Wireless networking › random access
unsourced random access
0.812024
Exploiting Matrix Information Geometry for Integrated Decoding of Massive Uncoupled Unsourced Random Access · IEEE Trans. Commun. 2024
Coding theory › error-correcting codes
decoding
0.812024
Exploiting Matrix Information Geometry for Integrated Decoding of Massive Uncoupled Unsourced Random Access · IEEE Trans. Commun. 2024

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

simulation · 1.5matrix information geometry · 1.5
YearPublicationVenuePosition
2024 Exploiting Matrix Information Geometry for Integrated Decoding of Massive Uncoupled Unsourced Random Access
abstract
In this paper, we explore an efficient uncoupled unsourced random access (UURA) scheme for 6G massive communication. UURA is a typical framework of unsourced random access that addresses the problems of codeword detection and message stitching, without the use of check bits. Firstly, we establish a framework for UURA, allowing for immediate decoding of sub-messages upon arrival. Thus, the processing delay is effectively reduced due to the decreasing waiting time. Next, we propose an integrated decoding algorithm for sub-messages by leveraging matrix information geometry (MIG) theory. Specifically, MIG is applied to measure the feature similarities of codewords belonging to the same user equipment, and thus sub-message can be stitched once it is received. This enables the timely recovery of a portion of the original message by simultaneously detecting and stitching codewords within the current sub-slot. Furthermore, we analyze the performance of the proposed integrated decoding-based UURA scheme in terms of computational complexity and convergence rate. Finally, we present extensive simulation results to validate the effectiveness of the proposed scheme in 6G wireless networks.
Feiyan Tian, Xiaoming Chen 0001, Chongwen Huang, Zhaoyang Zhang 0001
IEEE Trans. Commun.1
2022 Massive Unsourced Random Access Over Rician Fading Channels: Design, Analysis, and Optimization
abstract
In this article, we investigate an unsourced random access scheme for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks with sporadic data traffic. First, we establish a general framework for massive unsourced random access based on a two-layer signal coding, i.e., an outer code and an inner code. In particular, considering Rician fading in the scenario of mMTC, we design a novel codeword activity detection algorithm for the inner code of unsourced random access based on the distribution of received signals by exploiting the maximum-likelihood (ML) method. Then, we analyze the performance of the proposed codeword activity detection algorithm exploiting Fisher Information Matrix, which facilitates the derivative of the approximated distribution of the estimation error of the codeword activity vector when the number of base station (BS) antennas is sufficiently large. Furthermore, for the outer code, we propose an optimization algorithm to allocate the lengths of message bits and parity check bits, so as to strike a balance between the error probability and the complexity required for outer decoding. Finally, extensive simulation results validate the effectiveness of the proposed detection algorithm and the optimized length allocation scheme compared with an existing detection algorithm and a fixed-length allocation scheme.
Feiyan Tian, Xiaoming Chen 0001, Lei Liu 0005, Derrick Wing Kwan Ng
IEEE Internet Things J.1
2020 Energy-Efficient Design for Massive Access in B5G Cellular Internet of Things
abstract
In this paper, we investigate an energy-efficient grant-free random access protocol for beyond fifth-generation (B5G) cellular internet of things (IoT) with sporadic traffic. A design framework, including device activity information (DAI) and channel state information (CSI) acquisition and uplink data transmission, is first provided to support massive access over limited radio spectrum. Then, considering the low-power requirement of IoT devices, we propose a robust massive access scheme by jointly optimizing pilot transmit power, data transmit power and receive vector at the base station (BS) for maximizing the energy efficiency in the presence of channel uncertainty. Finally, extensive simulation results validate the effectiveness and robustness of the proposed scheme.
Feiyan Tian, Xiaoming Chen 0001
WCNC1
2019 Multiple-antenna techniques in nonorthogonal multiple access: a review
abstract
As a promising physical layer technique, nonorthogonal multiple access (NOMA) can admit multiple users over the same space-time resource block, and thus improve the spectral efficiency and increase the number of access users. Specifically, NOMA provides a feasible solution to massive Internet of Things (IoT) in 5G and beyond-5G wireless networks over a limited radio spectrum. However, severe co-channel interference and high implementation complexity hinder its application in practical systems. To solve these problems, multiple-antenna techniques have been widely used in NOMA systems by exploiting the benefits of spatial degrees of freedom. This study provides a comprehensive review of various multiple-antenna techniques in NOMA systems, with an emphasis on spatial interference cancellation and complexity reduction. In particular, we provide a detailed investigation on multiple-antenna techniques in two-user, multiuser, massive connectivity, and heterogeneous NOMA systems. Finally, future research directions and challenges are identified.
Feiyan Tian, Xiaoming Chen 0001
Frontiers Inf. Technol. Electron. Eng.1