Spatially-Coupled Serially Concatenated Codes with Periodic Convolutional Permutors
(2021) IEEE International Symposium on Topics in Coding (ISTC), 2021 p.1-5- Abstract
- Spatially-coupled serially concatenated codes (SC-SCCS) are a class of turbo-like codes constructed by interconnecting a sequence of SCCS using a set of block permutors. At short block lengths, however, the bit-error-rate (BER) performance of SC-SCCS constructed by independent block permutors exhibits a high error floor. In this paper, we propose an alternative method for constructing SC-SCCS to mitigate this problem. Particularly, we use a family of periodically time-varying blockwise convolutional permutors with flexible block length. We derive these convolutional permutors from a block permutor of an optimized spread by applying an unwrapping procedure. We prove that for any chosen block length, the unwrapping procedure preserves the... (More)
- Spatially-coupled serially concatenated codes (SC-SCCS) are a class of turbo-like codes constructed by interconnecting a sequence of SCCS using a set of block permutors. At short block lengths, however, the bit-error-rate (BER) performance of SC-SCCS constructed by independent block permutors exhibits a high error floor. In this paper, we propose an alternative method for constructing SC-SCCS to mitigate this problem. Particularly, we use a family of periodically time-varying blockwise convolutional permutors with flexible block length. We derive these convolutional permutors from a block permutor of an optimized spread by applying an unwrapping procedure. We prove that for any chosen block length, the unwrapping procedure preserves the spread of the original block permutor. We further present an efficient implementation method for the blockwise convolutional permutor that derives the permutation indices directly from those of the underlying block permutor. Considering both S-random permutors and quadratic permutation polynomial (QPP) permutors, we perform BER simulations for SC-SCCS with decoding latencies 4096 and 16384. Numerical results show that SC-SCCS based on the proposed convolutional permutors have no visible error floor, which is especially notable at short block lengths. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/370a6ce6-3d69-429a-b329-2ef9fb86daa5
- author
- Farooq, Muhammad Umar LU ; Amat, Alexandre Graell I and Lentmaier, Michael LU
- organization
- publishing date
- 2021
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 2021 11th International Symposium on Topics in Coding (ISTC)
- pages
- 1 - 5
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Topics in Coding (ISTC), 2021
- conference location
- Montreal, Canada
- conference dates
- 2021-08-30 - 2021-09-03
- external identifiers
-
- scopus:85123434429
- ISBN
- 978-1-6654-0943-8
- 978-1-6654-0944-5
- DOI
- 10.1109/ISTC49272.2021.9594196
- language
- English
- LU publication?
- yes
- id
- 370a6ce6-3d69-429a-b329-2ef9fb86daa5
- date added to LUP
- 2021-11-23 15:38:32
- date last changed
- 2024-09-13 10:22:32
@inproceedings{370a6ce6-3d69-429a-b329-2ef9fb86daa5, abstract = {{Spatially-coupled serially concatenated codes (SC-SCCS) are a class of turbo-like codes constructed by interconnecting a sequence of SCCS using a set of block permutors. At short block lengths, however, the bit-error-rate (BER) performance of SC-SCCS constructed by independent block permutors exhibits a high error floor. In this paper, we propose an alternative method for constructing SC-SCCS to mitigate this problem. Particularly, we use a family of periodically time-varying blockwise convolutional permutors with flexible block length. We derive these convolutional permutors from a block permutor of an optimized spread by applying an unwrapping procedure. We prove that for any chosen block length, the unwrapping procedure preserves the spread of the original block permutor. We further present an efficient implementation method for the blockwise convolutional permutor that derives the permutation indices directly from those of the underlying block permutor. Considering both S-random permutors and quadratic permutation polynomial (QPP) permutors, we perform BER simulations for SC-SCCS with decoding latencies 4096 and 16384. Numerical results show that SC-SCCS based on the proposed convolutional permutors have no visible error floor, which is especially notable at short block lengths.}}, author = {{Farooq, Muhammad Umar and Amat, Alexandre Graell I and Lentmaier, Michael}}, booktitle = {{2021 11th International Symposium on Topics in Coding (ISTC)}}, isbn = {{978-1-6654-0943-8}}, language = {{eng}}, pages = {{1--5}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Spatially-Coupled Serially Concatenated Codes with Periodic Convolutional Permutors}}, url = {{http://dx.doi.org/10.1109/ISTC49272.2021.9594196}}, doi = {{10.1109/ISTC49272.2021.9594196}}, year = {{2021}}, }