.png){kind=icon}
.png){kind=icon}
Return
Wireless Channel Induced Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2927698.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we present a new wireless channel induced coding (WiCiC) scheme over the binary field in order to eliminate the performance loss which occurs due to not taking the channel conditions into account while determining network code coefficients. We utilize the composite channel-state matrix composed of source-to-relay and relay-to-destination channel-state matrices, as a result of the transition from the tripartite graph model to the bipartite graph model of the network. Through the use of this composite channel-state matrix, the encoding problem can be handled as a maximum flow problem owing to the max-flow min-cut theorem. The proposed WiCiC scheme has a lower decoding complexity and decoding delay compared with the benchmark studies while achieving the optimum decoding failure performance and providing user fairness. Extensive simulation results are presented to make reasonable inferences about the decoding performance of the WiCiC scheme.
Keywords:
Encoding
Decoding
Relays
Wireless communication
Network topology
Complexity theory
Delays
Max-flow min-cut
network coding
outage probability
random network coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W