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

Jilong Han

dblp:157/3238 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Computer networks · 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.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.612022
Multiuser Detection for Time-Frequency-Packed Systems · IEEE Trans. Commun. 2022
Physical-layer communications › signal detection
multiuser detection
0.612022
Multiuser Detection for Time-Frequency-Packed Systems · IEEE Trans. Commun. 2022
Information theory › channel capacity
spectral efficiency
0.212022
Multiuser Detection for Time-Frequency-Packed Systems · IEEE Trans. Commun. 2022

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

sum-product algorithm · 1.1multiuser channel shortener · 1.1factor graph · 1.1
YearPublicationVenuePosition
2022 Multiuser Detection for Time-Frequency-Packed Systems
abstract
We consider time-frequency-packed systems in an additive white Gaussian noise scenario. With respect to systems employing time packing, thus introducing intentional intersymbol interference only, a further improvement of the spectral efficiency is obtained by packing the adjacent carriers closer in frequency. The adoption of a multiuser detector can allow coping with the resulting intentional intercarrier interference. The optimal detector for time-frequency-packed systems has a complexity that increases exponentially with the number of interferers in both time and frequency dimensions and thus becomes unmanageable. We propose a suboptimal receiver, which is derived by using the framework based on factor graphs and the sum-product algorithm, with a complexity that is linear in the number of adjacent carriers and takes also advantage of a multi-user channel shortener to further reduce the complexity. We assess the performance by means of computer simulations and show that, when compared with other suboptimal receivers available in the literature and with the optimal detector, the proposed receiver results very promising in terms of trade-off between performance and computational complexity.
Giulio Colavolpe, Tommaso Foggi, Amina Piemontese, Alessandro Ugolini, Jilong Han
IEEE Trans. Commun.6