Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtim...Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.展开更多
Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memorie...Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memories, the combined Viterbi detector scheme is proposed to improve raw biterror rate performance by mitigating the occurrence of a twobit reversing error event in an estimated codeword for the balanced code. The effectiveness of the detection scheme is verified for different data quantizations using Monte Carlo simulations. Key words holographic data storage - balanced code - modulation code - Viterbi algorithm - path metric CLC number TN 911. 21 Foundation item: Supported by National 973 Research Program of China (G1999033006)Biography: Chen Duan-rong (1960-), male, Lecturer, Ph. D candidate, research direction: coding and signal processing for the recording channel of holographic data storage.展开更多
The authors extend the notion of statistical structure from Riemannian geometry to the general framework of path spaces endowed with a nonlinear connection and a generalized metric.Two particular cases of statistical ...The authors extend the notion of statistical structure from Riemannian geometry to the general framework of path spaces endowed with a nonlinear connection and a generalized metric.Two particular cases of statistical data are defined.The existence and uniqueness of a nonlinear connection corresponding to these classes is proved.Two Koszul tensors are introduced in accordance with the Riemannian approach.As applications,the authors treat the Finslerian (α,β)-metrics and the Beil metrics used in relativity and field theories while the support Riemannian metric is the Fisher-Rao metric of a statistical model.展开更多
This article is an addendum to the 2001 paper [1] which investigated an approach to hierarchical clustering based on the level sets of a density function induced on data points in a d-dimensional feature space. We ref...This article is an addendum to the 2001 paper [1] which investigated an approach to hierarchical clustering based on the level sets of a density function induced on data points in a d-dimensional feature space. We refer to this as the “level-sets approach” to hierarchical clustering. The density functions considered in [1] were those formed as the sum of identical radial basis functions centered at the data points, each radial basis function assumed to be continuous, monotone decreasing, convex on every ray, and rising to positive infinity at its center point. Such a framework can be investigated with respect to both the Euclidean (L2) and Manhattan (L1) metrics. The addendum here puts forth some observations and questions about the level-sets approach that go beyond those in [1]. In particular, we detail and ask the following questions. How does the level-sets approach compare with other related approaches? How is the resulting hierarchical clustering affected by the choice of radial basis function? What are the structural properties of a function formed as the sum of radial basis functions? Can the levels-sets approach be theoretically validated? Is there an efficient algorithm to implement the level-sets approach?展开更多
由于低功耗有损网络(low power and lossy networks,LLN)中的单路径路由协议在网络拓扑的构建过程中存在不能较好地均衡节点能耗速率和延长网络寿命等问题,提出一种基于负载均衡的单路径LLN路由协议(load balance-based single path rou...由于低功耗有损网络(low power and lossy networks,LLN)中的单路径路由协议在网络拓扑的构建过程中存在不能较好地均衡节点能耗速率和延长网络寿命等问题,提出一种基于负载均衡的单路径LLN路由协议(load balance-based single path routing protocol for LLN,LB-RPL)。在选择备选父节点的过程中对无线链路质量、节点剩余能量和节点缓存占用率依次进行考量;在计算路由度量的过程中综合考虑多种路由判据,避免单一路由判据对网络性能造成的影响;依据整条路径上的数据传输代价选择节点的最优父节点。理论分析和仿真结果表明,相对于现有单路径LLN路由协议,LB-RPL能够有效均衡节点能耗、延长网络寿命并提高路由可靠性。展开更多
为了提高物理层下行控制信道(Physical Downlink control channel PDCCH)极化码译码的吞吐率,降低复杂度,减少第五代无线通信终端的设计面积,本文提出了一种适用于半导体芯片设计的极化码译码算法.鉴于PDCCH携带的控制信息需要盲解的特...为了提高物理层下行控制信道(Physical Downlink control channel PDCCH)极化码译码的吞吐率,降低复杂度,减少第五代无线通信终端的设计面积,本文提出了一种适用于半导体芯片设计的极化码译码算法.鉴于PDCCH携带的控制信息需要盲解的特性,本文采用分布式循环冗余校验辅助串行抵消表的方法研究了PDCCH的Polar译码过程.通过路径排序和分布式CRC校验比特早停功能,对路径进行优化选择,简化了Polar译码的复杂度;提出并行模块组的改进译码方法减小了芯片设计面积.仿真结果表明该方法不仅降低了复杂度,而且保证了译码性能.展开更多
基金supported in part by the National Key Research and Development Program of China under Grant 2018YFB1802303in part by the Zhejiang Provincial Natural Science Foundation of China under Grant LQ20F010010。
文摘Recently,a generalized successive cancellation list(SCL)decoder implemented with shiftedpruning(SP)scheme,namely the SCL-SP-ωdecoder,is presented for polar codes,which is able to shift the pruning window at mostωtimes during each SCL re-decoding attempt to prevent the correct path from being eliminated.The candidate positions for applying the SP scheme are selected by a shifting metric based on the probability that the elimination occurs.However,the number of exponential/logarithm operations involved in the SCL-SP-ωdecoder grows linearly with the number of information bits and list size,which leads to high computational complexity.In this paper,we present a detailed analysis of the SCL-SP-ωdecoder in terms of the decoding performance and complexity,which unveils that the choice of the shifting metric is essential for improving the decoding performance and reducing the re-decoding attempts simultaneously.Then,we introduce a simplified metric derived from the path metric(PM)domain,and a custom-tailored deep learning(DL)network is further designed to enhance the efficiency of the proposed simplified metric.The proposed metrics are both free of transcendental functions and hence,are more hardware-friendly than the existing metrics.Simulation results show that the proposed DL-aided metric provides the best error correction performance as comparison with the state of the art.
基金SupportedbyNational973ResearchProgramofChi na (G1 9990 330 0 6)
文摘Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memories, the combined Viterbi detector scheme is proposed to improve raw biterror rate performance by mitigating the occurrence of a twobit reversing error event in an estimated codeword for the balanced code. The effectiveness of the detection scheme is verified for different data quantizations using Monte Carlo simulations. Key words holographic data storage - balanced code - modulation code - Viterbi algorithm - path metric CLC number TN 911. 21 Foundation item: Supported by National 973 Research Program of China (G1999033006)Biography: Chen Duan-rong (1960-), male, Lecturer, Ph. D candidate, research direction: coding and signal processing for the recording channel of holographic data storage.
基金Project supported by the Romanian National Authority for Scientific Research,CNCS UEFISCDI(No.PN-II-ID-PCE-2012-4-0131)
文摘The authors extend the notion of statistical structure from Riemannian geometry to the general framework of path spaces endowed with a nonlinear connection and a generalized metric.Two particular cases of statistical data are defined.The existence and uniqueness of a nonlinear connection corresponding to these classes is proved.Two Koszul tensors are introduced in accordance with the Riemannian approach.As applications,the authors treat the Finslerian (α,β)-metrics and the Beil metrics used in relativity and field theories while the support Riemannian metric is the Fisher-Rao metric of a statistical model.
文摘This article is an addendum to the 2001 paper [1] which investigated an approach to hierarchical clustering based on the level sets of a density function induced on data points in a d-dimensional feature space. We refer to this as the “level-sets approach” to hierarchical clustering. The density functions considered in [1] were those formed as the sum of identical radial basis functions centered at the data points, each radial basis function assumed to be continuous, monotone decreasing, convex on every ray, and rising to positive infinity at its center point. Such a framework can be investigated with respect to both the Euclidean (L2) and Manhattan (L1) metrics. The addendum here puts forth some observations and questions about the level-sets approach that go beyond those in [1]. In particular, we detail and ask the following questions. How does the level-sets approach compare with other related approaches? How is the resulting hierarchical clustering affected by the choice of radial basis function? What are the structural properties of a function formed as the sum of radial basis functions? Can the levels-sets approach be theoretically validated? Is there an efficient algorithm to implement the level-sets approach?
文摘由于低功耗有损网络(low power and lossy networks,LLN)中的单路径路由协议在网络拓扑的构建过程中存在不能较好地均衡节点能耗速率和延长网络寿命等问题,提出一种基于负载均衡的单路径LLN路由协议(load balance-based single path routing protocol for LLN,LB-RPL)。在选择备选父节点的过程中对无线链路质量、节点剩余能量和节点缓存占用率依次进行考量;在计算路由度量的过程中综合考虑多种路由判据,避免单一路由判据对网络性能造成的影响;依据整条路径上的数据传输代价选择节点的最优父节点。理论分析和仿真结果表明,相对于现有单路径LLN路由协议,LB-RPL能够有效均衡节点能耗、延长网络寿命并提高路由可靠性。
文摘为了提高物理层下行控制信道(Physical Downlink control channel PDCCH)极化码译码的吞吐率,降低复杂度,减少第五代无线通信终端的设计面积,本文提出了一种适用于半导体芯片设计的极化码译码算法.鉴于PDCCH携带的控制信息需要盲解的特性,本文采用分布式循环冗余校验辅助串行抵消表的方法研究了PDCCH的Polar译码过程.通过路径排序和分布式CRC校验比特早停功能,对路径进行优化选择,简化了Polar译码的复杂度;提出并行模块组的改进译码方法减小了芯片设计面积.仿真结果表明该方法不仅降低了复杂度,而且保证了译码性能.
