Pith. sign in

REVIEW

Rank-one Detector for Kronecker-Structured Constant Modulus Constellations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.02743 v2 pith:S5FLCWQV submitted 2020-01-08 eess.SP

Rank-one Detector for Kronecker-Structured Constant Modulus Constellations

classification eess.SP
keywords decodingkronecker-structuredrank-oneconstantconstellationdatadetectorkronecker-rod
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.