On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

SERS decoding of micro gold shells moving in microfluidic systems

In this study, in situ surface‐enhanced Raman scattering (SERS) decoding was demonstrated in microfluidic chips using novel thin micro gold shells modified with Raman tags. The micro gold shells were fabricated using electroless gold plating on PMMA beads with diameter of 15 μm. These shells were sophisticatedly optimized to produce the maximum SERS intensity, which minimized the exposure time for quick and safe decoding. The shell surfaces produced well‐defined SERS spectra even at an extremely short exposure time, 1 ms, for a single micro gold shell combined with Raman tags such as 2‐naphthalenethiol and benzenethiol. The consecutive SERS spectra from a variety of combinations of Raman tags were successfully acquired from the micro gold shells moving in 25 μm deep and 75 μm wide channels on a glass microfluidic chip. The proposed functionalized micro gold shells exhibited the potential of an on‐chip microfluidic SERS decoding strategy for micro suspension array.     

Multiple decoding for polar-coded chase combining HARQ

The polar-coded hybrid automatic repeat request (HARQ) scheme with chase combining (CC) has very low complexity and is easy to combine with other techniques such as the coded-modulation and space–time coding, etc. However, the CC-HARQ scheme usually suffers from error and throughput performance degradation. A multiple decoding CC-HARQ (MDCC-HARQ) scheme is proposed in this paper by providing extra decoding chances when the joint decoding fails. Specifically, new LLR-sequences are constructed from the received signals, which can be utilized for the extra decoding attempts. Simulation results show that the proposed MDCC-HARQ scheme can achieve better error-performance and higher throughput efficiency, while requires less retransmission when compared with the CC-HARQ scheme.     

Enumerating and decoding perfect linear Lee codes

Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z _q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.      

基于Arduino的AIS数据分布式采集研究

为了解决船舶自动识别系统(Automatic Identification System, AIS)数据的分布式采集,使全球AIS消息报文接收、解码、封装、转发操作的安装成本更低、稳定性更好、安全性更高、维护工作量更小。通过采用以Arduino嵌入式平台为核心结合外围电子器件开发的网络解码器组成分布式采集网络,并采用C语言将合理的数据结构和算法直接在MCU上编程实现,来取代以x86架构和操作系统为基础的网络解码器。通过实验可以证明,采用Arduino技术的AIS网络解码器的解码效率能够满足AIS基站发送数据的速率要求,解码内容正确,能按照约定的网络传输格式转发消息内容,可应用于全球AIS数据的分布式采集中。该成果具有功耗更低、运行更稳定、成本更低廉等优点,对需要大量使用网络解码器来构建的AIS数据分布式采集网络具有重大现实意义。     

Uncoverings-by-bases for base-transitive permutation groups

An uncovering-by-bases for a group G acting on a finite set Ω is a set of bases for G such that any r-subset of Ω is disjoint from at least one base in , where r is a parameter dependent on G. They have applications in the decoding of permutation groups when used as error-correcting codes, and are closely related to covering designs. We give constructions for uncoverings-by-bases for many families of base-transitive group (i.e. groups which act transitively on their irredundant bases), including a general construction which works for any base-transitive group with base size 2, and some more specific constructions for other groups. In particular, those for the groups GL (3,q) and AGL (2,q) make use of the theory of finite fields. We also describe how the concept of uncovering-by-bases can be generalised to matroid theory, with only minor modifications, and give an example of this.     

Feng–Rao decoding of primary codes

We show that the Feng–Rao bound for dual codes and a similar bound by Andersen and Geil (2008) [1] for primary codes are consequences of each other. This implies that the Feng–Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are able to decode efficiently a large class of codes for which no non-trivial decoding algorithm was previously known. Among those are important families of multivariate polynomial codes. Matsumoto and Miura (2000) [30] (see also Beelen and Høholdt, 2008 [3]) derived from the Feng–Rao bound a bound for primary one-point algebraic geometric codes and showed how to decode up to what is guaranteed by their bound. The exposition in Matsumoto and Miura (2000) [30] requires the use of differentials which was not needed in Andersen and Geil (2008) [1]. Nevertheless we demonstrate a very strong connection between Matsumoto and Miuraʼs bound and Andersen and Geilʼs bound when applied to primary one-point algebraic geometric codes.     

微机实现光学全息编码和译码的一种新方法

本文通过对光学全息信息编码过程的分析,用计算机实现了光学全息信息编码译码过程,对数据、文字、图片等信息进行了编码和译码;方便地实现了光学全息编码保密性强的特点,免去了光学全息编译码所需的制作全息图的实验设备。     

Novel memory efficient LDPC decoders for beyond 5G

Beyond-5G wireless networks are expected to gain a excellent trade-off among computational accuracy, latency, and efficient use of available resources. This poses a significant challenge to the channel decoder. In this paper, a novel memory efficient algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed with a view to reduce the implementation complexity and hardware resources. The algorithm, called Check Node Self-Update (CNSU) algorithm, is based on layered normalized min-sum (LNMS) decoding algorithm while utilizing iteration parallel techniques to integrate both Variable Nodes (VNs) message and A-Posterior Probability(APP) message into the Check Nodes (CNs) message, which eliminates memories of both the VNs message and the APP message as well as updating module of APP message in CNs unit. Based on the proposed CNSU algorithm, design of partially parallel decoder architecture and serial simulations followed by implementation on the Stratix II EP2S180 FPGA are presented. The results show that the proposed algorithm and implementation bring a significant gain in efficient using of available resources, include reducing hardware memory resources and chip area while keeping the benefit of bit-error-rate (BER) performance and speeding up of convergence with LNMS, which are beneficial to apply in Beyond-5G wireless networks.     

基于DMD的哈达玛变换成像光谱仪中交错编码像素点的研究

近年来在哈达玛变换成像光谱仪研究领域中最重要的技术革新在于数字微镜器件在这种光谱仪中的应用,但同时也带来了一些相应的技术问题需要克服。详细的描述和分析了由于数字微镜器件在哈达玛变换光谱仪中的应用导致的编码图像上的部分像素点出现的一种交错编码现象;这种特殊的像素点,编码过程不符合哈达玛变换,在光谱复原过程中需要特殊处理。针对这种交错编码像素点,提出了一种标识方法和解码方法。实验中,向光谱仪中导入一束激光并充满整个视场,在编码的激光图像中确定交错编码像素点的位置。然后变换编码模板上哈达玛编码码道的空间位置,采集两组针对目标的编码图像,通过观察编码图像上一个像素点的灰度值组成的列向量中非零常量与零元素的个数,可以分辨它是否是一个交错编码像素点。其中一组编码图像上交错编码像素点光谱曲线可以通过对另一组编码图像上相应位置的像素点进行哈达玛反变换得到。实线结果证明了这一方法的可行性。