期刊文献+

双单播网络编码的构造方法 被引量:1

Construction method of double unicast network coding
下载PDF
导出
摘要 为在双单播网络中运用网络编码技术进行数据传输,提出了一种双单播网络编码的构造方法。所提方法在源点实施预编码策略,采用随机线性网络编码方法并结合多目标优化进化算法来设计各信道的局部编码向量;在宿点运用矩阵零空间的基向量来消除部分信息干扰,再运用二级预编码策略来控制源点的发送速率,从而能够解码。所提方法不仅能确定双单播网络编码的近似可达信息率区域,还能为可达信息率区域中的每一向量构造可行的传输方案。理论推导与仿真计算表明了所提方法的有效性。 In order to use network coding technology for data transmission in double unicast network,a construction method of double unicast network coding was proposed.The pre-coding strategy was implemented at each source node,the random linear network coding combined to the multi-objective optimization evolutionary algorithm was adopted to design the local coding vector of each channel.At the each sink node,the base vector of zero space of matrix was used to eliminate some information interference,and then the two-level pre-coding strategy was used to control the transmission rate at source.Thus,each sink node could be decoded successfully.With the proposed method,the approximate reachable information rate region of double unicast network coding could be determined and the transmission scheme for each vector in the reachable information rate region could be designed.Theoretical derivation and simulation calculation show the effectiveness of the proposed method.
作者 蒲保兴 莫智懿 PU Baoxing;MO Zhiyi(School of Data Science and Software Engineering,Wuzhou University,Wuzhou 543002,China)
出处 《通信学报》 EI CSCD 北大核心 2020年第9期92-103,共12页 Journal on Communications
基金 广西创新驱动发展专项基金资助项目(No.AA18118036)。
关键词 双单播网络编码 随机线性网络编码 可达信息率区域 源点预编码策略 矩阵的零空间 double unicast network coding random linear network coding reachable information rate region pre-coding strategy of source node zero space of matrix
  • 相关文献

参考文献3

二级参考文献51

  • 1罗武庭.DJ—2可变矩形电子束曝光机的DMA驱动程序[J].LSI制造与测试,1989,10(4):20-26. 被引量:373
  • 2王兵山.离散数学[M].长沙:国防科技大学出版社,2004.263-281.
  • 3Ahlswede R,Cai N,Li S Y R,et al. Network information flow[J]. IEEE Trans. on Information Theory, 2000, 46(4) :1204- 1216.
  • 4Li S Y R,Yeung R W,Cai N. Linear network coding[J]. IEEE Trans. on Information Theory,2003,49(2) : 371-381.
  • 5Chou P A, Wu Y, Jain K. Practical network coding[C]// Allerton Conference on Communication , Control and Computing, 2003:473 - 482.
  • 6Jaggi S, Sanders P, Chou A, et al. Polynomial time algorithms for multicast network code construction[J]. IEEE Trans. on Information Theroy, 2006:51(6) : 1973 - 1982.
  • 7Ho T, Medard M,Koetter R, et al. A random linear network coding approach to multicast[J]. IEEE Trans. on Information Theory, 2006,52(10) :4413 - 4430.
  • 8Langberg M, Sprintson A, Bruck J. The encoding complexity of network coding[J]. IEEE Trans. on Information Theory, 2006,52(6) :2386 - 2397.
  • 9Kim M, Ahn C W, Medard M, et al. On minimizing network coding resources: an evolutionary approach [ C] // Procedure on Network Coding ,2006.
  • 10Minkyu K, Medard M, Aggarwal V, et al. Evolutionary approaches to minimizing network coding resources[C]//26th IEEE International Conference on Computer Communications, 2007:1991 - 1999.

共引文献9

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部