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

Kar-Peo Yar

dblp:91/1913 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2011
0000-0002-2572-3585ORCID · verified

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

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

Theoretical computer science
1 paper
Coding theory · 100%
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
Coding theory › error-correcting codes › error probability analysis
bit-error probability
0.112008
Performance of RS coded M-ary modulation with and without symbol overlapping · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes
concatenated codes
0.112008
Performance of RS coded M-ary modulation with and without symbol overlapping · IEEE Trans. Commun. 2008
Coding theory › error-correcting codes
reed-solomon codes
0.112008
Performance of RS coded M-ary modulation with and without symbol overlapping · IEEE Trans. Commun. 2008
Physical-layer communications › modulation
m-ary modulation
0.012008
Performance of RS coded M-ary modulation with and without symbol overlapping · IEEE Trans. Commun. 2008

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

markov chain analysis · 0.2
YearPublicationVenuePosition
2011 Dynamic spectrum sharing for two-layer cellular networks
abstract
Deploying femtocells faces a major challenge of causing downlink interference to the existing macrocell. This paper proposes an intelligent spectrum sharing mechanism for a two-layer cellular network, which comprises macrocells and femtocells. Because users are scheduled to access the spectrum in time-domain according to their channel conditions, the usage of spectrum is predictable by tracing the channel conditions. Therefore, the femtocell can be managed, in time-domain, to reconfigure the antenna radiation pattern in order to suppress the interference to closely-located macrocell users who are expecting to access the spectrum. Simulation results show that user throughput at the macrocell edge can be boosted by 83%, compared to deploying femtocells with fixed omni-directional antennas.
Rong-Terng Juang, Kar-Peo Yar, Pangan Ting, Hsin-Piao Lin, Ding-Bing Lin
PIMRC2
2011 Performance enhancement of OFDM systems based on signal spreading
abstract
Frequency-selective fading and inter-carrier-interference (ICI) are two fundamental issues that should be dealt with before adopting orthogonal frequency division multiplexing (OFDM). Instead of using complex designs for exploiting frequency diversity and cancelling ICI, this paper explores how spreading signal, on either frequency-domain or time-domain, can improve the performance of OFDM systems. Based on the carrier interferometry technique, information symbols are spread over all the OFDM subcarriers to pursue frequency diversity. Then a packet retransmission scheme, which can be seem as spreading signal in time-domain, is proposed to suppress ICI. Numerical simulations show that frequency diversity can be pursued by spreading information symbols in OFDM subcarrier domain and that ICI can be suppressed by spreading packets in time domain. As a result, an enhanced OFDM system with low complexity signal spreading can be delivered.
Rong-Terng Juang, Kar-Peo Yar, Kun-Yi Lin, Ding-Bing Lin, Pangan Ting, Hsin-Piao Lin
WiMob2
2011 Decentralized multiuser beamforming for cellular communication systems
abstract
This paper explores multiuser downlink beamforming in a distributed manner, where each user locally and sequentially optimizes its own beamforming phase and amplitude according to some performance measures. For phase optimization, the complex non-convex optimization problem is reformulated into a convex one. Given the optimal phase, the amplitude is pursued through the method of Lagrange multiplier. Our numerical simulations demonstrate that the proposed algorithm matches the conventional centralized two-user zero-forcing beamforming performance in terms of bit error rate. Meanwhile, our method utilizes 50% less feedback as compared to the conventional one. As a result, a low complexity distributed multiuser beamforming is delivered.
Rong-Terng Juang, Kar-Peo Yar, Kun-Yi Lin, Pangan Ting
WiMob2
2010 Cutoff Rate Analysis of Amplify-and-Forward Relay System
abstract
We derive in this paper the bit error probability and cutoff rate of an Amplify-and-Forward (AF) relay system operating in Rayleigh fast fading. In our model, we consider the relay thermal noise to be non-negligible and derive a closed form expression to approximate the bit error probability. Our approximated closed form expression matches well with simulation result. Using Chernoff bound, we upper bound its pairwise error probability and we also derive the cutoff rate of the AF relay system.
Kar-Peo Yar, Sumei Sun, Paul K. M. Ho
VTC Fall1
2008 Performance of RS coded M-ary modulation with and without symbol overlapping
abstract
In this paper, we present analytical bit error probability results for M-ary modulation concatenated with Reed Solomon (RS) codes. The analysis of bit error probability is nontrivial as the number of bits per symbol for the RS codes may not be an integer multiple of the number of bits per symbol for a modulation symbol. We propose a Markov chain technique which allows analytical evaluation of the bit error probability for such cases. The performance of RS coding with coherent biorthogonal, coherent/non-coherent orthogonal modulation over an additive white Gaussian noise (AWGN) channel is evaluated. Simulation of the bit error probability of RS code concatenated with a Nordstrom Robinson (NR) code as an inner code is performed and compared with the case of biorthogonal modulation. From the results, we notice that a stronger inner code gives better bit error probability. In addition, the throughput of the coded system with biorthogonal modulation over an AWGN channel is discussed. For a Rayleigh flat fading and block fading channel, we analyze the bit error probability of RS codes concatenated with biorthogonal modulation. From the result, we notice that a stronger outer code gives a better bit error probability for the case of Rayleigh flat fading channel.
Kar-Peo Yar, Do-Sik Yoo, Wayne E. Stark
IEEE Trans. Commun.1