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

Gabriella Bosco

dblp:96/5206 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2006
0000-0003-3943-0991ORCID · verified

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

Computer networks · 5 · 5 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
2 papers
Coding theory · 100%
Computer networks
2 papers
Optical networks · 56% Physical-layer communications · 44%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
concatenated codes
0.122003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
A new algorithm for "hard" iterative decoding of concatenated codes · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › decoding
iterative decoding
0.122003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
A new algorithm for "hard" iterative decoding of concatenated codes · IEEE Trans. Commun. 2003
Optical networks
optical transmission
0.122003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate · IEEE Trans. Commun. 2001
Physical-layer communications
log likelihood ratio
0.012003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes
block codes
0.012003
A new algorithm for "hard" iterative decoding of concatenated codes · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › decoding › channel decoding
erasure decoding
0.012003
A new algorithm for "hard" iterative decoding of concatenated codes · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.012003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › block codes › product codes
turbo product codes
0.012003
Soft decoding in optical systems · IEEE Trans. Commun. 2003
Physical-layer communications › error probability analysis
bit error rate analysis
0.012001
A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate · IEEE Trans. Commun. 2001
Physical-layer communications › optical communication
direct detection
0.012001
A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate · IEEE Trans. Commun. 2001
Optical networks › optical transmission impairment
fiber nonlinearity
0.012001
A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate · IEEE Trans. Commun. 2001
Optical networks
optical receiver
0.012001
A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate · IEEE Trans. Commun. 2001

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

gaussian approximation · 0.1simulation · 0.0q-factor method · 0.0
YearPublicationVenuePosition
2006 Non-Binary Low Density Parity Check Codes for Satellite Communications
abstract
In this paper, we study a new class of Low Density Parity Check codes, designed for satellite communications, and achieving both high spectral efficiency and large coding gain. Given a constant-envelope 8-PSK constellation, a generic linear binary code does not lead to a geometrically uniform Euclidean-space code. Low Density Parity Check codes over Z_8, the group of integers modulo 8, are considered. When applied to 8-PSK, they generate geometrically uniform Euclidean space codes: distance profile and word error probability are the same for each transmitted codeword. These properties highly simplify both design and analysis. Some insights on code design, encoding, decoding, and simulated performance are provided.
Gabriella Bosco, Roberto Garello, Francesco Mininni, Marco Baldi, Franco Chiaraluce
ISCC1
2003 A new algorithm for "hard" iterative decoding of concatenated codes
abstract
A new hard iterative decoding algorithm to decode the serial concatenation of two block codes separated by an interleaver is presented. The new scheme is based on the use of erasures as a sort of extrinsic information to be exchanged between the two decoders. Extensive simulations highlight the coding gain of the new algorithm with respect to standard hard iterative decoding.
Gabriella Bosco, Guido Montorsi, Sergio Benedetto
IEEE Trans. Commun.1
2003 Soft decoding in optical systems
abstract
We consider the application of concatenated codes with interleaver and iterative decoding to optical communication systems. We show how to obtain the optimum log-likelihood ratio to be provided to the soft decoder in the optical channel environment, and compare the performance of a decoder using it with the one employing a Gaussian approximation of the optical channel. Simulation results refer to practical turbo-product codes, and encompass the effect of quantization on the log-likelihood ratio. The results show that the Gaussian assumption in computing the log-likelihood ratio for the optical channel leads to significant losses.
Gabriella Bosco, Guido Montorsi, Sergio Benedetto
IEEE Trans. Commun.1
2001 A novel analytical approach to the evaluation of the impact of fiber parametric gain on the bit error rate
abstract
We present in this paper a novel accurate method to analyze the performance of an optical link where the amplified spontaneous emission noise, enhanced by a fiber nonlinear phenomenon called parametric gain, is the limiting factor. Our method allows us to compute the exact error probability given a generic noise spectral density at the input of a direct detection optical receiver, using arbitrary optical and electrical filters. We compare our results with those predicted using the standard Gaussian technique (based on the Q factor), showing that this approximation may lead to significant errors. Our method is then used to evaluate the impact of parametric gain on a realistic long-haul multiwavelength link operating at 10 Gb/s, showing both the system limitation imposed by this phenomenon and the inaccuracy of the Q factor method.
Gabriella Bosco, Andrea Carena, Vittorio Curri, Roberto Gaudino, Pierluigi Poggiolini, Sergio Benedetto
IEEE Trans. Commun.1
2000 System Impact of Parametric Gain: A Novel Method for the BER Evaluation
abstract
A novel method to evaluate the bit error rate (BER) in optical links is described. It analyzes systems limited by amplified spontaneous emission (ASE) noise, enhanced by the non-linear parametric gain (PG) effect, and allows one to compute the exact error probability, given a generic optical noise spectral density at the input of a direct detection optical receiver. The method has been employed to evaluate the impact of PG on a 10 Gb/s per channel long-haul multi-wavelength system. It has also been used to show how the system performance evaluation based on the Q-factor Gaussian approximation may lead to erroneous BER evaluations.
Gabriella Bosco, Andrea Carena, Vittorio Curri, Roberto Gaudino, Pierluigi Poggiolini, Sergio Benedetto
ICC (2)1