论文标题
kronecker结构常数模量星座的排名一探测器
Rank-one Detector for Kronecker-Structured Constant Modulus Constellations
论文作者
论文摘要
为了与短数据块实现可靠的通信，我们为Kronecker结构的恒定模量信号提出了一种新颖的解码策略，该策略提供了低位误差比（BER），尤其是在每位低的能量与噪声功率频谱密度比（E_B/N_0）$中。编码器利用了这样一个事实，即任何M-PSK星座都可以分解为具有较低或相等阶PSK星座集的Kronecker产品。首先得出了两种类型的方案的结构。对于此类Kronecker结构化方案，提出了一种概念上简单的解码算法，称为Kronecker-Rod（rank-One检测器）。该解码器基于“张开”接收到的数据块的排名对一近似值，具有内置的噪声拒绝能力和比最先进的检测器更小的实现复杂性。与硬质和软viterbi解码的卷积代码相比，Kronecker-Rod在相同的光谱效率下的BER性能优于后者。
To achieve a reliable communication with short data blocks, we propose a novel decoding strategy for Kronecker-structured constant modulus signals that provides low bit error ratios (BERs) especially in the low energy per bit to noise power spectral density ratio $(E_b/N_0)$. The encoder exploits the fact that any M-PSK constellation can be factorized as Kronecker products of lower or equal order PSK constellation sets. A construction of two types of schemes is first derived. For such Kronecker-structured schemes, a conceptually simple decoding algorithm is proposed, referred to as Kronecker-RoD (rank-one detector). The decoder is based on a rank-one approximation of the "tensorized" received data block, has a built-in noise rejection capability and a smaller implementation complexity than state-of-the-art detectors. Compared with convolutional codes with hard and soft Viterbi decoding, Kronecker-RoD outperforms the latter in BER performance at same spectral efficiency.
