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

Ken Gracie

dblp:79/10798 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Computer networks · 2Applied, interdisciplinary, general and emerging computing · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.112007
Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications · Proc. IEEE 2007
Coding theory › channel coding
turbo codes
0.112007
Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications · Proc. IEEE 2007
Coding theory › error-correcting codes › concatenated codes
turbo-like codes
0.112007
Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications · Proc. IEEE 2007
Physical-layer communications
channel coding
0.012007
Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications · Proc. IEEE 2007
Physical-layer communications › channel coding › error control coding
forward error correction
0.012007
Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications · Proc. IEEE 2007

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

viterbi algorithm · 0.1iterative decoding · 0.1
YearPublicationVenuePosition
2012 On the error-rate performance of 4-state turbo codes with puncture-constrained DRP interleavers
abstract
It has often been demonstrated that conventional 4-state turbo codes do not perform well in either the waterfall or error-rate flare regions due to poor inherent convergence and distance properties, especially for highly-punctured codes. This paper shows that the opposite can be true when carefully chosen data and parity puncture masks are used with matching puncture-constrained dithered relative prime (DRP) interleavers. With an interleaver length of K=223(8-meg), it is shown that waterfalls within 0.1 dB of capacity are possible for code rates R≥2/3. Waterfall performance can also be traded for improved distance to achieve very low error-rate flares. With an interleaver length of K=214= 16384, R=8/9, and 50% data puncturing, a packet error rate of 10-6was achieved within 0.57 dB of the corresponding binary sphere packing bound without using a cleanup code.
Stewart Crozier, Ken Gracie
ICC2
2011 Rate-Compatible Turbo Codes Designed with Puncture-Constrained DRP Interleavers
abstract
Rate-compatible turbo codes are designed using dithered relative prime (DRP) interleavers with data puncturing. DRP interleavers are simple to implement and memory-efficient. Their repetitive structure facilitates finding interleaver parameters that provide excellent performance at both high and low error rates. With puncture-constrained DRP interleavers, the data and parity puncture patterns can be matched to the interleaver, thereby maintaining excellent performance for very high code rates. This makes them ideally suited to rate- compatible coding applications. Excellent waterfall and error-flare performance is demonstrated for rate-compatible turbo codes with code rates ranging from 1/3 to 8/9.
Stewart Crozier, Ken Gracie
GLOBECOM2
2007 Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications
abstract
For decades, the de facto standard for forward error correction was a convolutional code decoded with the Viterbi algorithm, often concatenated with another code (e.g., a Reed-Solomon code). But since the introduction of turbo codes in 1993, much more powerful codes referred to collectively as turbo and turbo-like codes have eclipsed classical methods. These powerful error-correcting techniques achieve excellent error-rate performance that can closely approach Shannon's channel capacity limit. The lure of these large coding gains has resulted in their incorporation into a widening array of telecommunications standards and systems. This paper will briefly characterize turbo and turbo-like codes, examine their implications for physical layer system design, and discuss standards and systems where they are being used. The emphasis will be on telecommunications applications, particularly wireless, though others are mentioned. Some thoughts on the use of turbo and turbo-like codes in the future will also be given.
Ken Gracie, Marie-Hélène Hamon
Proc. IEEE1