检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LIN DengSheng XIAO Ming LI ShaoQian
机构地区:[1]National Key Lab. of Science and Technology on Communications, University of Electronic Science and Technology of China [2]ACCESS Linnaeus Center, School of Electrical Engineering, Royal Institute of Technology (KTH)
出 处:《Science China(Information Sciences)》2013年第2期11-20,共10页中国科学(信息科学)(英文版)
基 金:supported by Key Laboratory of Universal Wireless Communications (Beijing University of Posts and Telecommunications), Ministry of Education, China;supported in part by National Basic Research Program of China (973 Program) (Grant No. 2013CB329001);National Science and Technology Major Projects of China (Grant No. 2010ZX03003-004-01);Sino-Sweden Cooperative Program by MOST in China and VINNOVA in Sweden
摘 要:We propose a packet combining scheme of using cross-packet coding. With the coding scheme, one redundant packet can be used to ensure the error-correction of multiple source packets. Thus, the proposed scheme can increase the code rate. Moreover, the proposed coding scheme has also advantages of decoding complexity, reducing undetectable errors (by the proposed low-complexity decoder) and flexibility (applicable to channels with and without feedback). Theoretical analysis under the proposed low-complexity decoding algorithm is given to maximize the code rate by optimizing the number of source packets. Finally, we give numerical results to demonstrate the advantages of the proposed scheme in terms of code rates compared to the traditional packet combining without coding or ARQ (automatic repeat-request) techniques.We propose a packet combining scheme of using cross-packet coding. With the coding scheme, one redundant packet can be used to ensure the error-correction of multiple source packets. Thus, the proposed scheme can increase the code rate. Moreover, the proposed coding scheme has also advantages of decoding complexity, reducing undetectable errors (by the proposed low-complexity decoder) and flexibility (applicable to channels with and without feedback). Theoretical analysis under the proposed low-complexity decoding algorithm is given to maximize the code rate by optimizing the number of source packets. Finally, we give numerical results to demonstrate the advantages of the proposed scheme in terms of code rates compared to the traditional packet combining without coding or ARQ (automatic repeat-request) techniques.
关 键 词:packet combining CODING ARQ FEEDBACK error correction
分 类 号:TN911.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3