The Generation of (n, n(n-1), n-1) Permutation Group Codes for Communication Systems

被引:5
|
作者
Peng, Li [1 ,2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Hubei, Peoples R China
[2] Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China
基金
美国国家科学基金会;
关键词
Error correction codes; permutation group codes; generalized finite state machine; n-ary shift register; stabilizer subgroup; CONSTRUCTIONS; MODULATION;
D O I
10.1109/TCOMM.2019.2902149
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper concerns the construction and hardware execution of (n, n(n-1), n-1) permutation group codes (PGCs) for communication systems. Cyclic shift techniques acting on a permutation, including cyclic shift operators and their compound functions (CFs), are defined and demonstrated, then compared to other tools such as cyclic subgroups and n-dimension cyclic shift registers. A generalized finite state machine is established that can enumerate n! permutations based on complete CFs. This is a hardware-oriented algorithm that is capable of being significantly faster than all existing algorithms which we can find up to now. After this, the ideal structural features for an ordered set of n! permutations are discussed and the multiset features of (n, n(n-1), n-1)-PGCs in this ordered set are pinpointed. A simpler way of generating (n, n(n-1), n-1)-PGCs is then developed using cyclic shift techniques, where the code length n is a prime. This outperforms existing approaches using composite operation and affine transform on module-n operation. The simulation experiments in AWGN channel show that the performance on codeword error rates (WER) and signal-noise ratio (SNR) becomes better as the code length increases and the best SNR performance achieves -0.8 dB at 10(-5) WER for code length n=11.
引用
收藏
页码:4535 / 4549
页数:15
相关论文
共 50 条
  • [1] (n, n(n-1), n-1) Permutation group codes
    Peng, Li
    [J]. ELECTRONICS LETTERS, 2016, 52 (09) : 706 - 707
  • [2] A TFSK Transceiver Combining (n, n(n-1), n-1) Permutation Group Codes with MFSK
    Peng, Li
    Li, Gaofeng
    Liang, Kun
    Zhou, Bo
    [J]. 2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 61 - 65
  • [3] (n, n(n-1), n-1) Permutation codes based on packing and Mendelsohn designs
    Peng, Li
    [J]. ELECTRONICS LETTERS, 2016, 52 (23) : 1916 - 1918
  • [4] Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes
    Peng, Li
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 286 - 291
  • [5] A lower bound on permutation codes of distance n-1
    Bereg, Sergey
    Dukes, Peter J.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (01) : 63 - 72
  • [6] Equivalences Induced by (n,1), (n,n-1) and (n,k) - Equivalences (1 < k < n-1)
    Chalamani, Sonja B.
    Seweryn-Kuzmanovska, Marzanna J.
    Kotevska, Elena T.
    [J]. 2023 58TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATION, COMMUNICATION AND ENERGY SYSTEMS AND TECHNOLOGIES, ICEST, 2023, : 345 - 348
  • [7] N VS N-1
    KNAPP, TR
    [J]. AMERICAN EDUCATIONAL RESEARCH JOURNAL, 1970, 7 (04) : 625 - 626
  • [8] Impacts of the "zero" homologous series, 01(n-1)n and 02(n-1)n
    Yamauchi, H
    Karppinen, M
    [J]. PHYSICA C, 2000, 335 (1-4): : 273 - 278
  • [9] On (n, n-1) Punctured Convolutional Codes and Their Trellis Modules
    Katsiotis, Alexandros
    Kalouptsidis, Nicholas
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (05) : 1213 - 1217
  • [10] On (n, n-1) convolutional codes with low trellis complexity
    Tang, HH
    Lin, MC
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (01) : 37 - 47