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

Alice Yen-Chi Peng

dblp:12/4096 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 3 · 3 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 · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection
MIMO detection
0.112006
Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes · IEEE Trans. Commun. 2006
Physical-layer communications › MIMO › space-time coding › space-time block codes
quasi-orthogonal space-time block codes
0.112006
Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes · IEEE Trans. Commun. 2006
Physical-layer communications › MIMO › space-time coding
space-time block codes
0.112006
Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes · IEEE Trans. Commun. 2006
Physical-layer communications › signal detection › MIMO detection
sphere decoding
0.112006
Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes · IEEE Trans. Commun. 2006

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

maximum likelihood detection · 0.1euclidean norm decomposition · 0.1
YearPublicationVenuePosition
2009 On error analysis and distributed phase steering for wireless network coding over fading channels
abstract
Network coding notions promise significant gains in wireless networks' throughput and quality of service. Future systems employing such paradigms are known to be also highly scalable and resilient to node failure and churn rates. We propose a simple framework where a single relay listens to two nodes transmitting simultaneously over the same band in the presence of Nakagami-m fading. For this multiple-access channel (MAC), we derive in closed-form the exact bit error rate of antipodal signaling with maximum-likelihood detection. As the MAC is the bottleneck in error of the overall system, this provides a good performance measure of the aggregate architecture. Using the new error expressions derived, we then propose a simple closed-loop cooperation strategy where via a ternary feedback from the relay node, significant gains in signal to noise ratio at the relay can be achieved. Our novel error analysis method is applicable to a number of other systems such as the vertical Bell labs spacetime (V-BLAST) scheme and synchronous multi-user systems.
Alice Yen-Chi Peng, Shahram Yousefi, Il-Min Kim 0001
IEEE Trans. Wirel. Commun.1
2008 On Phase Precoding and Feedback Design for ML-Detected V-BLAST Systems
abstract
The maximum-likelihood (ML)-detected vertical bell-labs layered space-time (V-BLAST) architecture over a Nakagami-m fading channel is considered. This fading model encompasses many fading scenarios as special cases (e.g., Rayleigh). The ML detection of BLAST systems waives the requirement of not having smaller number of receive antennas than transmit antennas: a primary limitation using other sub-optimal linear processing receivers. Using exact BER expressions, a two-by-one antipodal V-BLAST system is optimized by phase precoding requiring only a single bit of feedback from the receiver. Numerical results demonstrate that the proposed single-bit feedback scheme improves the BER performance dramatically.
Alice Yen-Chi Peng, Shahram Yousefi, Il-Min Kim 0001
ICCCN1
2006 Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes
abstract
Space-time codes can be decoded by the sphere decoding (SD) algorithm to reduce the complexity and retain maximum-likelihood (ML) performance. In this letter, the ML metric of quasi-orthogonal space-time block codes is written into two independent Euclidean norms, thus SD can be applied to each function independently. The new scheme reduces the complexity by at least 85% for systems with four or more transmit antennas, compared with the conventional SD algorithm.
Alice Yen-Chi Peng, Il-Min Kim 0001, Shahram Yousefi
IEEE Trans. Commun.1