A bipartite matching based user grouping method for grouped OFDM-IDMA systems

Author(s):  
Xiaotian Zhou ◽  
Liuqing Yang ◽  
Dongfeng Yuan
Author(s):  
Ngo Tan Vu Khanh

The skyrocketing growth in the number of Internet of Things (IoT) devices will certainly pose a huge traffic demand for fifth-generation (5G) wireless networks and beyond. In-band full-duplex (IBFD), which is theoretically expected to double the spectral efficiency of a half-duplex (HD) wireless channel and to connect more devices, has been considered as a promising technology to accelerate the development of IoT. To exploit the full potential of IBFD, the key challenge is how to handle network interference (including self-interference, co-channel interference and multiuser interference) more effectively. In this paper, we propose a simple yet efficient user grouping method, where a base station (BS) serves strong downlink users and weak uplink users and vice versa in different frequency bands, mitigating severe network interference. We aim to maximize a minimum rate among all users subject to bandwidth and power constraints, which is formulated as a highly nonconvex optimization problem. By leveraging inner approximation framework, we develop a very efficient iterative algorithm to solve this problem, which guarantees at least a local optimal solution. Numerical results are provided to show not only the benefit of using full-duplex raido at BS, but also the advantage of the proposed user grouping method.


Electronics ◽  
2020 ◽  
Vol 9 (12) ◽  
pp. 2182
Author(s):  
Ngo Tan Vu Khanh ◽  
Van Dinh Nguyen

The skyrocketing growth in the number of Internet of Things (IoT) devices has posed a huge traffic demand for fifth-generation (5G) wireless networks and beyond. In-band full-duplex (IBFD), which is theoretically expected to double the spectral efficiency of a half-duplex wireless channel and connect more devices, has been considered as a promising technology in order to accelerate the development of IoT. In order to exploit the full potential of IBFD, the key challenge is how to handle network interference (including self-interference, co-channel interference, and multiuser interference) more effectively. In this paper, we propose a simple yet efficient user grouping method, where a base station (BS) serves strong downlink users and weak uplink users and vice versa in different frequency bands, mitigating severe network interference. First, we aim to maximize a minimum rate among all of the users subject to bandwidth and power constraints, which is formulated as a nonconvex optimization problem. By leveraging the inner approximation framework, we develop a very efficient iterative algorithm for solving this problem, which guarantees at least a local optimal solution. The proposed iterative algorithm solves a simple convex program at each iteration, which can be further cast to a conic quadratic program. We then formulate the optimization problem of sum throughput maximization, which can be solved by the proposed algorithm after some slight modifications. Extensive numerical results are provided to show not only the benefit of using full-duplex radio at BS, but also the advantage of the proposed user grouping method.


2013 ◽  
Vol 12 (10) ◽  
pp. 5248-5257 ◽  
Author(s):  
Xiaotian Zhou ◽  
Liuqing Yang ◽  
Dongfeng Yuan

Author(s):  
Fengqian Guo ◽  
Hancheng Lu ◽  
Xiaoda Jiang ◽  
Ming Zhang ◽  
Jun Wu ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 2894
Author(s):  
Minh-Quan Dao ◽  
Vincent Frémont

Multi-Object Tracking (MOT) is an integral part of any autonomous driving pipelines because it produces trajectories of other moving objects in the scene and predicts their future motion. Thanks to the recent advances in 3D object detection enabled by deep learning, track-by-detection has become the dominant paradigm in 3D MOT. In this paradigm, a MOT system is essentially made of an object detector and a data association algorithm which establishes track-to-detection correspondence. While 3D object detection has been actively researched, association algorithms for 3D MOT has settled at bipartite matching formulated as a Linear Assignment Problem (LAP) and solved by the Hungarian algorithm. In this paper, we adapt a two-stage data association method which was successfully applied to image-based tracking to the 3D setting, thus providing an alternative for data association for 3D MOT. Our method outperforms the baseline using one-stage bipartite matching for data association by achieving 0.587 Average Multi-Object Tracking Accuracy (AMOTA) in NuScenes validation set and 0.365 AMOTA (at level 2) in Waymo test set.


Sign in / Sign up

Export Citation Format

Share Document