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

Ambighairajah Yasotharan

dblp:35/6930 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

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

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › error probability analysis
bit error rate analysis
0.112005
Lower bound on the BER of a pre- and postequalized vector communication system · IEEE Trans. Commun. 2005
Physical-layer communications
MIMO
0.112005
Lower bound on the BER of a pre- and postequalized vector communication system · IEEE Trans. Commun. 2005
Coding theory › error-correcting codes
coded modulation
0.112005
Lower bound on the BER of a pre- and postequalized vector communication system · IEEE Trans. Commun. 2005
Coding theory › error-correcting codes › code construction
coset coding
0.112005
Lower bound on the BER of a pre- and postequalized vector communication system · IEEE Trans. Commun. 2005

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

zero-forcing equalization · 0.1minimum weighted average noise variance · 0.1
YearPublicationVenuePosition
2015 Robust Beamforming with Sidelobe Suppression for Impulsive Signals
abstract
Beamforming is a fundamental technique in array signal processing. Many existing approaches are based on second-order statistics. However, their performance degrades significantly due to outliers in the received signal. In this letter, we propose an outlier-resistant beamformer design criterion based on minimizing the expectation of the modulus of the array output with an${\ell _1}$-regularization term being added for sidelobe suppression. By using the${\ell _1}$-modulus of complex numbers instead of the standard modulus, the resulting optimization problem can be efficiently solved by a simple iterative algorithm or linear programming. Simulation results in the presence of impulsive signals are provided to demonstrate its robustness and accuracy compared to existing techniques.
Xue Jiang 0001, Ambighairajah Yasotharan, Thia Kirubarajan
IEEE Signal Process. Lett.2
2005 Lower bound on the BER of a pre- and postequalized vector communication system
abstract
This paper is concerned with communication over a multiple-input multiple-output channel. In the first reference, a lower bound on the bit-error rate of a pre- and postequalized communication system was derived for uniform bit loading. Here, we extend the lower bound to nonuniform bit loading. The lower bound applies to communication systems for which: 1) the cascade of the pre-equalizer, (noise-free) channel, and postequalizer is a diagonal matrix (a generalized zero-forcing condition satisfied by many designs in the literature); and 2) the encoding/modulation (decoding/demodulation) is done independently over the dimensions of the pre-equalizer input (postequalizer output). The lower bound is stated as a function of the bit loading, channel, and transmitter power only, and applies to uncoded, as well as coset-coded, systems. Toward deriving the lower bound, we minimize a weighted average of the noise variances at the postequalizer output.
Ambighairajah Yasotharan
IEEE Trans. Commun.1