Wang Bingrui, Xie Zhaopeng, Zhang Xingang
Henan Engineering Research Center of Service and Guarantee for Intelligent Emergency, Nanyang Normal University, Nanyang, Henan, China.
The School of Advanced Manufacturing, Fuzhou University, Jinjiang, Fujian, China.
PeerJ Comput Sci. 2024 Feb 21;10:e1883. doi: 10.7717/peerj-cs.1883. eCollection 2024.
Spectral shaping codes are modulation codes widely used in communication and data storage systems. This research enhances the algorithms employed in constructing spectral shaping codes for hardware implementation. We present a parallel scrambling calculation with a time complexity of (1). Second, in the minimum accumulated signal power (MASP) module, the sine-cosine accumulation needs to be determined by remainder with time complexity (). We offer reduced MASP computations for short bit-width data, ROM storage, and addition pipelines. It can remove the remainder operation, reducing accumulated complexity to (1). In addition, we present a search algorithm to generate segmented lines to replace the square operations in the MASP module. By employing the search algorithm and shift operations, we can reduce the complexity of the square from () to (1). The implementation results reveal that the original and proposed MASPs yield nearly identical spectrum nulls. The encoder-decoder of the spectral shaping codes with proposed approaches consumes just 6% of the hardware resources when carried out with a Spartan6 XC6SLX25.
频谱整形码是广泛应用于通信和数据存储系统的调制码。本研究改进了用于硬件实现的频谱整形码构建算法。我们提出了一种时间复杂度为(1)的并行加扰计算。其次，在最小累积信号功率(MASP)模块中，正弦-余弦累积需要通过余数来确定，时间复杂度为()。我们为短比特宽度数据、ROM存储和加法流水线提供了减少的MASP计算。它可以消除余数运算，将累积复杂度降低到(1)。此外，我们提出了一种搜索算法来生成分段线，以取代MASP模块中的平方运算。通过使用搜索算法和移位操作，我们可以将平方的复杂度从()降低到(1)。实现结果表明，原始的和提出的MASP产生几乎相同的频谱零点。当使用Spartan6 XC6SLX25进行时，采用所提出方法的频谱整形码的编码器-解码器仅消耗6%的硬件资源。
