%0 Journal Article
%T Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes<br>中短长度LT码的展开图构造方法
%A Gong Mao-kang
%A <br>龚茂康
%J 电子与信息学报
%D 2009
%I 
%X This paper proposes one construction method for short and moderate-length Luby Transform (LT) codes by unfolding Tanner graphs from every output node as root. For each output node, when the stopping criterion is satisfied, one uncovered input node or one input node on the deepest layer is randomly selected and connected to the root. Two parameters, the unfolding depth threshold and the maximal unfolding depth, are adjusted to control the girth of short cycles and make the range of random selection as large as possible. Simulation shows the performance improvements of the proposed algorithms are obvious compared with the random graph method for short and moderate length LT code.
%K Channel coding
%K Luby Transform (LT) codes
%K Tanner Graph (TG)<br>信道编码
%K LT
%K 码
%K Tanner图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=CC151E42C7CF691E5AB40D6396567F15&yid=DE12191FBD62783C&vid=4AD960B5AD2D111A&iid=E158A972A605785F&sid=745C7FAEA69986C7&eid=68BCD01D0D745EB3&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=2&reference_num=13