A Low-Latency Precoding Strategy for In-Band Full-Duplex MIMO Relay Systems

被引:2
作者
Malayter, Jacqueline R. [1 ]
Love, David J. [1 ]
机构
[1] Purdue Univ, Elmore Family Sch Elect & Comp Engn, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
MIMO; full-duplex; URLLC; relaying; short packets; wireless backhaul; BLOCK-FADING CHANNELS; WIRELESS COMMUNICATION; LIMITED FEEDBACK; ACHIEVABLE RATES; CODING RATE; CAPACITY; 5G; ACCESS;
D O I
10.1109/TWC.2023.3292985
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Ultra-reliable low-latency communication (URLLC) and machine-to-machine (M2M) relaying are increasingly important. In-band full-duplex (IBFD) communication is desirable for low-latency communication because it can theoretically double the capacity of half-duplex (HD) communication, but is limited by self-interference (SI) in which the IBFD transmitter injects interference into its received signal due to large transmit and receive power differences. There are many methods to mitigate SI in IBFD, but we focus on multiple-input multiple-output (MIMO) precoding to spatially null SI, while also being careful to limit communication latency. Unlike works aiming to compute the highest achievable rate in IBFD relays with an essentially fixed precoder, we propose a strategy allowing the precoder to change on a per channel use basis to avoid rate bottlenecks at each hop. Our strategy generalizes to multiple relays. We frame finding the sequence of precoders to relay packets through $N$ IBFD MIMO relays with the lowest communication latency as a shortest path problem. Specifically, we design a quantized covariance precoder codebook at each transmitter based on limiting the maximal SI power each precoder produces. Then, an iterative algorithm is used to optimize the selection of precoders over channel uses to relay packets in the fewest channel uses possible.
引用
收藏
页码:1899 / 1912
页数:14
相关论文
共 37 条
  • [1] THE THEORY OF DYNAMIC PROGRAMMING
    BELLMAN, R
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1954, 60 (06) : 503 - 515
  • [2] MIMO capacity with interference
    Blum, RS
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2003, 21 (05) : 793 - 801
  • [3] Massive Machine-Type Communications in 5G: Physical and MAC-Layer Solutions
    Bockelmann, Carsten
    Pratas, Nuno
    Nikopour, Hosein
    Au, Kelvin
    Svensson, Tommy
    Stefanovic, Cedomir
    Popovski, Petar
    Dekorsy, Armin
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (09) : 59 - +
  • [4] Collins A, 2014, IEEE INT SYMP INFO, P2524, DOI 10.1109/ISIT.2014.6875289
  • [5] CVX: MATLAB, 2020, CVX Research
  • [6] Full-Duplex MIMO Relaying: Achievable Rates Under Limited Dynamic Range
    Day, Brian P.
    Margetts, Adam R.
    Bliss, Daniel W.
    Schniter, Philip
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2012, 30 (08) : 1541 - 1553
  • [7] Full-Duplex Bidirectional MIMO: Achievable Rates Under Limited Dynamic Range
    Day, Brian P.
    Margetts, Adam R.
    Bliss, Daniel W.
    Schniter, Philip
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) : 3702 - 3713
  • [8] Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets
    Durisi, Giuseppe
    Koch, Tobias
    Popovski, Petar
    [J]. PROCEEDINGS OF THE IEEE, 2016, 104 (09) : 1711 - 1726
  • [9] Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels
    Durisi, Giuseppe
    Koch, Tobias
    Ostman, Johan
    Polyanskiy, Yury
    Yang, Wei
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (02) : 618 - 629
  • [10] Graph implementations for nonsmooth convex programs
    Stanford University, United States
    [J]. Lect. Notes Control Inf. Sci., 2008, (95-110): : 95 - 110