Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing | Zendy

Tao Tian | Zendy; Chris Jones | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing

Author(s) -

Tao Tian,

Chris Jones

Publication year - 2005

Publication title -

eurasip journal on wireless communications and networking

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.461

H-Index - 64

eISSN - 1687-1499

pISSN - 1687-1472

DOI - 10.1155/wcn.2005.789

Subject(s) - puncturing , low density parity check code , bipartite graph , computer science , parity bit , tanner graph , algorithm , complete bipartite graph , word error rate , parity (physics) , graph , theoretical computer science , error floor , decoding methods , telecommunications , speech recognition , physics , particle physics

This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC) codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppression of error floors are also included in the construction methodology.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research