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

Andres Ceron

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

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

Computer networks · 4

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 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding and estimation
0.112009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009
Physical-layer communications › channel coding
hybrid ARQ
0.112009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009
Physical-layer communications › modulation › coded modulation
bit-interleaved coded modulation
0.012009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009
Physical-layer communications › modulation › phase-shift keying
BPSK
0.012009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009
Physical-layer communications › signal detection
iterative detection and decoding
0.012009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009
Physical-layer communications
modulation
0.012009
Mapping Rearrangement for HARQ Based on Low-Order Modulation · IEEE Trans. Commun. 2009

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

multi-dimensional modulation · 0.1iterative detection-decoding · 0.1
YearPublicationVenuePosition
2009 Mapping Rearrangement for HARQ Based on Low-Order Modulation
abstract
In this paper we consider hybrid automatic repeat request transmission based on binary phase shift keying modulation. Our objective is to improve the performance of the retransmissions, keeping at the same time the complexity and the performance of the first transmission unaltered. We conclude that the so-called mapping rearrangement (MR) may considerably improve the performance if multi-dimensional modulation is applied. We evaluate the theoretical limits of bit-interleaved coded modulation with MR, verify the functioning of the practical coding scheme, and propose to improve the performance via iterative detection-decoding (BICM-ID) which brings considerable gains. In particular, for high coding rates, a 4 dB SNR gain over transmission without MR may be achieved.
Leszek Szczecinski, Andres Ceron, Rodolfo Feick
IEEE Trans. Commun.2
2009 Space shift keying modulation for MIMO channels
abstract
In this paper, we present space shift keying (SSK) as a new modulation scheme, which is based on spatial modulation (SM) concepts. Fading is exploited for multiple-input multiple-output(MIMO) channels to provide better performance over conventional amplitude/phase modulation (APM) techniques. In SSK, it is the antenna index used during transmission that relays information, rather than the transmitted symbols themselves. This absence of symbol information eliminates the transceiver elements necessary for APM transmission and detection (such as coherent detectors). As well, the simplicity involved in modulation reduces the detection complexity compared to that of SM, while achieving almost identical performance gains. Throughout the paper, we illustrate SSK's strength by studying its interaction with the fading channel. We obtain tight upper bounds on bit error probability, and discuss SSK's performance under some non-ideal channel conditions (estimation error and spatial correlation). Analytical and simulation results show performance gains over APM systems (3 dB at a bit error rate of 10-5), making SSK an interesting candidate for future wireless applications. We then extend SSK concepts to incorporate channel coding, where in particular, we consider a bit interleaved coded modulation (BICM) system using iterative decoding for both convolutional and turbo codes. Capacity results are derived, and improvements over APM are illustrated (up to 1 bits/s/Hz), with performance gains of up to 5 dB.
Jeyadeepan Jeganathan, Ali Ghrayeb, Leszek Szczecinski, Andres Ceron
IEEE Trans. Wirel. Commun.4
2008 Mapping Rearrangement for HARQ Based on BPSK
abstract
In this paper we consider hybrid automatic repeat request transmission based on binary phase shift keying modulation. Our objective is to improve the performance of the retransmissions, keeping at the same time the complexity and the performance of the first transmission unaltered. We conclude that the so-called mapping rearrangement (MR) may considerably improve the performance if multidimensional modulation is applied. We evaluate the theoretical limits of bit-interleaved coded modulation with MR, verify the functioning of the practical coding scheme, and propose to improve the performance via iterative detection-decoding (BICM-ID) which brings considerable gains. In particular, for high coding rates, a 4 dB SNR gain over transmission without MR may be achieved.
Leszek Szczecinski, Andres Ceron, Rodolfo Feick
GLOBECOM2
2007 BICM in Hybrid ARQ with Mapping Rearrangement: Capacity and Performance of Practical Schemes
abstract
Hybrid ARQ with packet combining for high-order modulations (such as 16-QAM) may be significantly enhanced if the bits-to-symbols mappings are appropriately changed throughout the transmissions. In this paper, we analyze the relationship between such mapping rearrangement (or mapping diversity) and channel coding. We calculate the capacity of the popular bit-interleaved coded modulation (BICM) to draw qualitative and approximate quantitative conclusions that are valid for strong codes approaching the capacity limits. We conclude that the choice/design of the appropriate mapping depends on the targeted spectral efficiency and we demonstrate that certain forms of mapping rearrangement may be counterproductive. We also show that iterative demapping may be successfully applied to significantly reduce the gap between the BICM and coded modulations capacities. The analysis presented is illustrated with the results obtained when the mapping rearrangement is combined with practical turbo codes.
Leszek Szczecinski, Fatou-Kiné Diop, Mustapha Benjillali, Andres Ceron, Rodolfo Feick
GLOBECOM4