Presentation 2014-05-16
A Necessary Condition for Universally Achieving the Capacity with Spatially-Coupled Hsu-Anastasopoulos Fountain Codes
Yuki IGARASHI, Kenta KASAI, Kohichi SAKANIWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report, we deal with fountain coding scheme in which a sender sends infinitely long coded bits until receivers successfully complete decoding. A fountain code is called universal if for arbitrary C∈(0,1), the code achieve any binary-input memoryless symmetric channels of capacity C. We give a necessary condition that a spatially-coupled Hsu-Anastasopoulos fountain code is universal. We numerically observe that the most efficiently decodable spatially-coupled HA fountain code satisfying the necessary condition achieves the capacity of the binary symmetric channels and binary-input additive white Gaussian noise channels by density evolution.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) spatially-coupled codes / LDPC codes / fountain codes / universal
Paper # IT2014-9
Date of Issue

Conference Information
Committee IT
Conference Date 2014/5/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Necessary Condition for Universally Achieving the Capacity with Spatially-Coupled Hsu-Anastasopoulos Fountain Codes
Sub Title (in English)
Keyword(1) spatially-coupled codes
Keyword(2) LDPC codes
Keyword(3) fountain codes
Keyword(4) universal
1st Author's Name Yuki IGARASHI
1st Author's Affiliation Dept. of Communications and Computer Engineering, Tokyo Institute of Technology()
2nd Author's Name Kenta KASAI
2nd Author's Affiliation Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
3rd Author's Name Kohichi SAKANIWA
3rd Author's Affiliation Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
Date 2014-05-16
Paper # IT2014-9
Volume (vol) vol.114
Number (no) 34
Page pp.pp.-
#Pages 6
Date of Issue