Harnessing Interference in Cooperative Communication Networks, Ph.D. Dissertation Sharif University of Technology ; Nasiri-Kenari, Masoumeh (Supervisor)
Abstract
The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference towards achieving higher network throughput. Here, instead of recovering single messages, the relays attempt to reliably decode (compute) and pass an integer linear combination of the transmitted messages, referred to as an equation, to the destination. By receiving sufficient equations,the destination can solve the linear equation system to recover the desired messages.Two main challenges of the CMF methods are the computational complexity and the rank failure problem at the destination. In this thesis, to decrease the implementation as well as the computational complexity of the...
Cataloging briefHarnessing Interference in Cooperative Communication Networks, Ph.D. Dissertation Sharif University of Technology ; Nasiri-Kenari, Masoumeh (Supervisor)
Abstract
The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference towards achieving higher network throughput. Here, instead of recovering single messages, the relays attempt to reliably decode (compute) and pass an integer linear combination of the transmitted messages, referred to as an equation, to the destination. By receiving sufficient equations,the destination can solve the linear equation system to recover the desired messages.Two main challenges of the CMF methods are the computational complexity and the rank failure problem at the destination. In this thesis, to decrease the implementation as well as the computational complexity of the...
Find in contentBookmark
|
|