Compute-Forward Multiple Access (CFMA): Practical Implementations SCIE SCOPUS
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sula, Erixhen | - |
dc.contributor.author | Zhu, Jingge | - |
dc.contributor.author | Pastore, Adriano | - |
dc.contributor.author | Lim, Sung Hoon | - |
dc.contributor.author | Gastpar, Michael | - |
dc.date.accessioned | 2020-04-16T08:15:25Z | - |
dc.date.available | 2020-04-16T08:15:25Z | - |
dc.date.created | 2020-02-04 | - |
dc.date.issued | 2019-02 | - |
dc.identifier.issn | 0090-6778 | - |
dc.identifier.uri | https://sciwatch.kiost.ac.kr/handle/2020.kiost/691 | - |
dc.description.abstract | We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute-forward multiple access which achieves the capacity of the multiple access channel using a sequential decoder. We illustrate this strategy with off-the-shelf LDPC codes. In the first stage of decoding, the receiver first recovers a linear combination of the transmitted codewords using the sum-product algorithm (SPA). In the second stage, by using the recovered sum-of-codewords as side information, the receiver recovers one of the two codewords using a modified SPA, ultimately recovering both codewords. The main benefit of recovering the sum-of-codewords instead of the codeword itself is that it allows to attain points on the dominant face of the multiple access channel capacity without the need of rate-splitting or time sharing while maintaining a low complexity in the order of a standard point-to-point decoder. This property is also shown to be crucial for some applications, e.g., interference channels. For all the simulations with single-layer binary codes, our proposed practical strategy is shown to be within 1.7 dB of the theoretical limits, without explicit optimization on the off-the-self LDPC codes. | - |
dc.description.uri | 1 | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | INTERFERENCE | - |
dc.subject | CHANNEL | - |
dc.subject | REGION | - |
dc.subject | DESIGN | - |
dc.subject | CODES | - |
dc.title | Compute-Forward Multiple Access (CFMA): Practical Implementations | - |
dc.type | Article | - |
dc.citation.endPage | 1147 | - |
dc.citation.startPage | 1133 | - |
dc.citation.title | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.volume | 67 | - |
dc.citation.number | 2 | - |
dc.contributor.alternativeName | 임성훈 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMMUNICATIONS, v.67, no.2, pp.1133 - 1147 | - |
dc.identifier.doi | 10.1109/TCOMM.2018.2874240 | - |
dc.identifier.scopusid | 2-s2.0-85054543828 | - |
dc.identifier.wosid | 000458804400019 | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.subject.keywordPlus | INTERFERENCE | - |
dc.subject.keywordPlus | CHANNEL | - |
dc.subject.keywordPlus | REGION | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordPlus | CODES | - |
dc.subject.keywordAuthor | Compute-forward multiple access (CFMA) | - |
dc.subject.keywordAuthor | multiple access channel | - |
dc.subject.keywordAuthor | low density parity check codes (LDPC) | - |
dc.subject.keywordAuthor | sequential decoding | - |
dc.subject.keywordAuthor | sum-product algorithm | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |