A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://core.ac.uk/download/pdf/9550502.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Institute of Electrical and Electronics Engineers (IEEE)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ra4txhbrwnbwzk3lwinyjovpbe" style="color: black;">IEEE Transactions on Wireless Communications</a>
Adaptive interference mitigation requires significant resources due to recursive processing. Specific to satellite systems, interference mitigation by employing adaptive beamforming at the gateway or at the satellite both have associated problems. While ground based beamforming reduces the satellite payload complexity, it results in added feeder link bandwidth requirements, higher gateway complexity and suffers from feeder link channel degradations. On the other hand, employing adaptive<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/twc.2012.083112.110130">doi:10.1109/twc.2012.083112.110130</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zdbxzza3dng6lapnvrpie3pip4">fatcat:zdbxzza3dng6lapnvrpie3pip4</a> </span>
more »... ing onboard the satellite gives more flexibility in case of variation in traffic dynamics and also for changing of beam patterns. However, these advantages come at the cost of additional complexity at the satellite. In pursuit of retaining the benefits of onboard beamforming and to reduce the complexity associated with adaptive processing, we here propose a novel semi-adaptive beamformer for a Hybrid Terrestrial-Satellite Mobile System. The proposed algorithm is a dual form of beamforming that enables adaptive and non-adaptive processing to coexist via a robust gradient based switching mechanism. We present a detailed complexity analysis of the proposed algorithm and derive bounds associated with its power requirements. In the scenarios studied, results show that the proposed algorithm consumes up to 98% less filter computing power as compared to full-adaptive case without compromising on system performance.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926060901/https://core.ac.uk/download/pdf/9550502.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/cf/cccfd274431720b2229ff21d05d673664f095121.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/twc.2012.083112.110130"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>