Pith. sign in

REVIEW

Interleaver Design for Turbo Codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0207209 v1 pith:GZE3WS6T submitted 2002-07-23 math.CO cs.ITmath.IT

H.R. Sadjadpour , N.J.A. Sloane , M. Salehi , G. Nebe This is my paper · ORCID
classification math.COcs.ITmath.IT
keywords interleaverdesignturbocodesblockcodecriterialength
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The performance of a Turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits. This paper describes a new interleaver design for Turbo codes with short block length based on these two criteria. A deterministic interleaver suitable for Turbo codes is also described. Simulation results compare the new interleaver design to different existing interleavers.

Discussion (0). Continue with ORCID to comment.

Pith tools