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

Van-Su Pham

dblp:75/5768 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Computer networks · 1

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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › channel coding › decoding algorithms
maximum-likelihood decoding
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications
MIMO
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › signal detection
MIMO detection
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › MIMO › space-time coding › space-time block codes
quasi-orthogonal space-time block codes
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005
Physical-layer communications › MIMO › space-time coding
space-time block codes
0.112005
Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code · IEEE Trans. Commun. 2005

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

QR decomposition · 0.1
YearPublicationVenuePosition
2009 A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
Signal Process.2
2007 Efficient Algorithm for Blind Detection of Orthogonal Space-Time Block Codes
abstract
This letter proposes an efficient decoder for signal detection in orthogonal space-time block coded systems employing phase-shift keying modulation without channel state information at the receiver. The proposed decoder consists of a sphere decoder and a QRD-based decoder. Simulation results show that the proposed decoder enables the system to trade off performance improvement against complexity
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
IEEE Signal Process. Lett.2
2006 Low Complexity Maximum-likelihood Decoder for VBLAST-STBC scheme in MIMO Wireless Communication Systems
abstract
In this work, we propose a low-complexity maximum-likelihood decoding approach based on QR decomposition (QRD) for signal detection in VBLAST-STBC systems, which employ less receive antennas than transmit antennas. With the example illustration of (6,3) system using rate 3/4 STBC for three transmit antennas, computer simulations are implemented to verify the performance and complexity of the proposed decoder
Van-Su Pham, Minh-Tuan Le, Linh Mai, Gi-Wan Yoon
VTC Spring1
2005 Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code
abstract
This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder. The proposed algorithm enables the QSTBC to achieve ML performance with significant reduction in computational load for any high-level modulation scheme.
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gi-Wan Yoon
IEEE Trans. Commun.2