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

Ömer F. Açikel

dblp:25/6730 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

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

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

Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011999
Punctured turbo-codes for BPSK/QPSK channels · IEEE Trans. Commun. 1999
Physical-layer communications › channel coding › error control coding › concatenated codes
turbo codes
0.011999
Punctured turbo-codes for BPSK/QPSK channels · IEEE Trans. Commun. 1999
Physical-layer communications › channel coding › error control coding
code design
0.011999
Punctured turbo-codes for BPSK/QPSK channels · IEEE Trans. Commun. 1999

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

interleaver design · 0.0generator polynomial selection · 0.0computer simulation · 0.0
YearPublicationVenuePosition
2000 Punctured High Rate SCCCs BPSK/QPSK Channels
abstract
We discuss a procedure for designing high rate serial concatenated convolutional codes (SCCCs) via puncturing for BPSK/QPSK channels. Rate 3/4, 7/8, and 15/16 SCCCs are considered with constituent encoder memory size m up to 4. We have also analytically found that the error rate floors for the designed codes are much lower than those of the PCCCs for the rates of interest.
Ömer F. Açikel, William E. Ryan
ICC (1)1
1999 Punctured turbo-codes for BPSK/QPSK channels
abstract
We discuss a procedure for designing high-rate turbo-codes via puncturing, with applications to BPSK/QPSK channels. Rates in the form k/(k+1), 2/spl les/k/spl les/16, are considered for constituent encoders with memory sizes m=3 and 4. The algorithm includes the selection of constituent encoder generator polynomials, puncture patterns, and interleavers with the goal of maximizing the minimum codeword weight for weight-two and weight-three inputs. The performance of the proposed codes are found via computer simulation and are observed in each case to be less than 0.9 dB (m=3), and 0.75 dB (m=4), from their respective channel capacity limits at a bit-error rate of 10/sup -5/. We consider two applications of punctured turbo-codes.
Ömer F. Açikel, William E. Ryan
IEEE Trans. Commun.1
1998 High rate turbo codes for BPSK/QPSK channels
abstract
We discuss a procedure for the design of high rate turbo codes via puncturing, with applications to BPSK/QPSK channels. Rates in the form k/(k+1), 2/spl les/k/spl les/16, are considered for constituent encoders with memory size m=4. The algorithm includes the selection of constituent encoder generator polynomials, puncture patterns, and interleavers with the goal of maximizing the minimum codeword weight for weight-two and weight-three inputs. The bit error rate (BER) performance of the proposed codes are found via computer simulation and are observed in each case to be about 0.7 dB from their respective channel capacity limits at a BER of 10/sup -5/.
Ömer F. Açikel, William E. Ryan
ICC1