Finite Field Multiple Access
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912417523433472 |
|---|---|
| author | Yu, Qi-yue Li, Jiang-xuan Lin, Shu |
| author_facet | Yu, Qi-yue Li, Jiang-xuan Lin, Shu |
| contents | In the past several decades, various techniques have been developed and used for multiple-access (MA) communications. With the new applications for 6G, it is desirable to find new resources, physical or virtual, to confront the fast development of MA communication systems. For binary source transmission, this paper introduces the concept of element-pair (EP), and the Cartesian product of $J$ distinct EPs can form an EP code. EPs are treated as virtual resources in finite fields to distinguish users. This approach allows for the reordering of channel encoding and multiplexing modules, allowing superimposed signals to function as codewords decodable by a channel code, thereby effectively addressing the finite blocklength (FBL) challenge in multiuser transmissions. We present methods for constructing symbol-wise EP codes with the unique sum-pattern mapping (USPM) property using finite fields. Based on the orthogonal EP code constructed over GF($2^m$), we develop a time-division mode of finite-field multiple-access (FFMA) systems over a Gaussian multiple-access channel (GMAC), including both sparse-form and diagonal-form structures. Based on the diagonal-form (DF) structure, we introduce a specific configuration referred to as polarization-adjusted DF-FFMA, which achieves both power gain and coding gain across the entire blocklength. The proposed FFMA is then applied to network layer and forms network FFMA systems for pure digital networks. Simulation results demonstrate that, compared to popular complex-field MA systems, the proposed FFMA systems can offer superior error performance in a GMAC. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_14086 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Finite Field Multiple Access Yu, Qi-yue Li, Jiang-xuan Lin, Shu Information Theory In the past several decades, various techniques have been developed and used for multiple-access (MA) communications. With the new applications for 6G, it is desirable to find new resources, physical or virtual, to confront the fast development of MA communication systems. For binary source transmission, this paper introduces the concept of element-pair (EP), and the Cartesian product of $J$ distinct EPs can form an EP code. EPs are treated as virtual resources in finite fields to distinguish users. This approach allows for the reordering of channel encoding and multiplexing modules, allowing superimposed signals to function as codewords decodable by a channel code, thereby effectively addressing the finite blocklength (FBL) challenge in multiuser transmissions. We present methods for constructing symbol-wise EP codes with the unique sum-pattern mapping (USPM) property using finite fields. Based on the orthogonal EP code constructed over GF($2^m$), we develop a time-division mode of finite-field multiple-access (FFMA) systems over a Gaussian multiple-access channel (GMAC), including both sparse-form and diagonal-form structures. Based on the diagonal-form (DF) structure, we introduce a specific configuration referred to as polarization-adjusted DF-FFMA, which achieves both power gain and coding gain across the entire blocklength. The proposed FFMA is then applied to network layer and forms network FFMA systems for pure digital networks. Simulation results demonstrate that, compared to popular complex-field MA systems, the proposed FFMA systems can offer superior error performance in a GMAC. |
| title | Finite Field Multiple Access |
| topic | Information Theory |
| url | https://arxiv.org/abs/2303.14086 |