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

Kemin Zhou

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

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

Theory of computation · 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 › MIMO › space-time modulation
differential space-time modulation
0.112006
A new family of unitary space-time codes with a fast parallel sphere decoder algorithm · IEEE Trans. Inf. Theory 2006
Physical-layer communications › signal detection
MIMO detection
0.112006
A new family of unitary space-time codes with a fast parallel sphere decoder algorithm · IEEE Trans. Inf. Theory 2006
Physical-layer communications › MIMO
space-time coding
0.112006
A new family of unitary space-time codes with a fast parallel sphere decoder algorithm · IEEE Trans. Inf. Theory 2006
Physical-layer communications › signal detection › MIMO detection
sphere decoding
0.112006
A new family of unitary space-time codes with a fast parallel sphere decoder algorithm · IEEE Trans. Inf. Theory 2006
Physical-layer communications › MIMO › space-time coding
unitary space-time codes
0.112006
A new family of unitary space-time codes with a fast parallel sphere decoder algorithm · IEEE Trans. Inf. Theory 2006

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

gradient-based optimization · 0.1constellation optimization · 0.1
YearPublicationVenuePosition
2006 A new family of unitary space-time codes with a fast parallel sphere decoder algorithm
abstract
In this paper, we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown fading coefficients. Extensive simulations show that the new codes have significantly better performance than existing codes. We have compared the performance of our codes with differential detection schemes using orthogonal design, Cayley differential codes, fixed-point-free group codes, and product of groups and for the same bit-error rate, our codes allow smaller signal-to-noise ratio (SNR) by as much as 10 dB. The design of the new codes is accomplished in a systematic way through the optimization of a performance index that closely describes the bit-error rate as a function of the SNR. The new performance index is computationally simple and we have derived analytical expressions for its gradient with respect to constellation parameters. Decoding of the proposed constellations is reduced to a set of one-dimensional closest point problems that we solve using parallel sphere decoder algorithms. This decoding strategy can also improve efficiency of existing codes.
Xinjia Chen, Kemin Zhou, Jorge L. Aravena
IEEE Trans. Inf. Theory2