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

Xin Zhang 0004

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

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

Computer networks · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.112006
Loading for parallel binary channels · IEEE Trans. Commun. 2006
Information theory › communication channels › channel models
parallel channel
0.112006
Loading for parallel binary channels · IEEE Trans. Commun. 2006
Information theory › communication channels › channel models › binary-input channel
binary channel
0.012006
Loading for parallel binary channels · IEEE Trans. Commun. 2006
Information theory › channel capacity › memoryless channels
z-channel
0.012006
Loading for parallel binary channels · IEEE Trans. Commun. 2006

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

water-filling · 0.1
YearPublicationVenuePosition
2009 High performance cooperative transmission protocols based on multiuser detection and network coding
abstract
Cooperative transmission is an emerging communication technique that takes advantage of the broadcast nature of wireless channels. However, due to low spectral efficiency and the requirement of orthogonal channels, its potential for use in future wireless networks is limited. In this paper, by making use of multiuser detection (MUD) and network coding, cooperative transmission protocols with high spectral efficiency, diversity order, and coding gain are developed. Compared with the traditional cooperative transmission protocols with singleuser detection, in which the diversity gain is only for one source user, the proposed MUD cooperative transmission protocols have the merit that the improvement of one user's link can also benefit the other users. In addition, using MUD at the relay provides an environment in which network coding can be employed. The coding gain and high diversity order can be obtained by fully utilizing the link between the relay and the destination. From the analysis and simulation results, it is seen that the proposed protocols achieve higher diversity gain, better asymptotic efficiency, and lower bit error rate, compared to traditional MUD schemes and to existing cooperative transmission protocols. From the simulation results, the performance of the proposed scheme is near optimal as the performance gap is 0.12dB for average bit error rate (BER) 10-6and 1.04dB for average BER 10-3, compared to two performance upper bounds.
H. Vincent Poor, Xin Zhang 0004, Zhu Han 0001
IEEE Trans. Wirel. Commun.2
2007 Cooperative Transmission Protocols with High Spectral Efficiency and High Diversity Order Using Multiuser Detection and Network Coding
abstract
Cooperative transmission is an emerging communication technique that takes advantages of the broadcast nature of wireless channels. However, due to low spectral efficiency and the requirement of orthogonal channels, its potential for use in future wireless networks is limited. In this paper, by making use of multiuser detection (MUD) and network coding, cooperative transmission protocols with high spectral efficiency, diversity order, and coding gain are developed. Compared with the traditional cooperative transmission protocols with single-user detection, in which the diversity gain is only for one source user, the proposed MUD cooperative transmission protocols have the merits that the improvement of one user's link can also benefit the other users. In addition, using MUD at the relay provides an environment in which network coding can be employed. The coding gain and high diversity order can be obtained by fully utilizing the link between the relay and the destination. From the analysis and simulation results, it is seen that the proposed protocols achieve higher diversity gain, better asymptotic efficiency, and lower bit error rate, compared to traditional MUD and to existing cooperative transmission protocols.
Zhu Han 0001, Xin Zhang 0004, H. Vincent Poor
ICC2
2006 A particle filter for tracking two closely spaced objects using monopulse radar channel signals
abstract
For the case of a single resolved target, monopulse-based radar sub-beam angle and sub-bin range measurements carry errors that are approximately Gaussian with known covariances, and hence, a tracker that uses them can be Kalman based. However, the errors accruing from extracting measurements for multiple unresolved targets are not Gaussian. We therefore submit that to track such targets, it is worth the effort to apply a nonlinear (non-Kalman) filter. Specifically, in this letter, we propose a particle filter that operates directly on the monopulse sum/difference data for two unresolved targets. Significant performance improvements are seen versus a scheme in which signal processing (measurement extraction from the monopulse data) and tracking (target state estimation from the extracted measurements) are separated.
Atef Isaac, Xin Zhang 0004, Peter Willett 0001, Yaakov Bar-Shalom
IEEE Signal Process. Lett.2
2006 Loading for parallel binary channels
abstract
We develop optimal probability loading for parallel binary channels, subject to a constraint on the total probability of sending ones. The distinctions from the waterfilling power loading for parallel Gaussian channels, particularly the latter's "dropping" of poor-quality channels, are highlighted. The only binary-input binary-output channel that is never dropped is the Z-channel.
Xin Zhang 0004, Shengli Zhou 0001, Peter Willett 0001
IEEE Trans. Commun.1