Norman Charles Beaulieu

Norman Charles Beaulieu

Auto-generated profile, based on publicly available information

Norman Charles Beaulieu

School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 November 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
NZNan Zhao
Nan Zhao
WWWei Wang
Wei Wang
JWJingjing Wang
Jingjing Wang
Yunfei ChenYunfei Chen
Yunfei Chen
Yun LinYun Lin
Yun Lin
NBNorman C. Beaulieu
Norman C. Beaulieu

2 October 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JZJie Zeng
Jie Zeng
TLTiejun Lv
Tiejun Lv
Ren Ping LiuRen Ping Liu
Ren Ping Liu
XSXin Su
Xin Su
Yingjie Jay GuoYingjie Jay Guo
Yingjie Jay Guo
NBNorman C. Beaulieu
Norman C. Beaulieu
It is challenging to satisfy the critical requirements of ultra-reliable and low latency communications (URLLC) in the Internet of things (IoT) under severe channel fading. The emerging massive multi-user multiple-input and multiple-output (MU-MIMO) concept is applied in IoT networks under shadow fading, enabling URLLC with pilot-assisted channel estimation (PACE) and zero-forcing (ZF) detection. Assuming users are uniformly and randomly deployed under log-normal shadow fading, the probability density function (pdf) of post-processing signal-to-noise ratios (SNRs) is derived for the uplink (UL) of massive MU-MIMO with perfect channel state information (CSI) and imperfect CSI obtained by PACE. Then, finite blocklength (FBL) information theory is utilized to derive the error probability of accessing users with a given latency, thereby evaluating the reliability of massive MU-MIMO for short-packet transmissions. Further, the length of pilots to minimize the error probability can be decided by the golden section search method (GSSM), which can converge rapidly. Numerical results verify that massive MU-MIMO can support a large number of UL URLLC users even when users are randomly deployed under shadow fading.

12 April 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SWShaoyang Wang
Shaoyang Wang
TLTiejun Lv
Tiejun Lv
WNWei Ni
Wei Ni
NBNorman C. Beaulieu
Norman C. Beaulieu
Yingjie Jay GuoYingjie Jay Guo
Yingjie Jay Guo
This paper presents a novel and effective deep reinforcement learning (DRL)-based approach to addressing joint resource management (JRM) in a practical multi-carrier non-orthogonal multiple access (MC-NOMA) system, where hardware sensitivity and imperfect successive interference cancellation (SIC) are considered. We first formulate the JRM problem to maximize the weighted-sum system throughput. Then, the JRM problem is decoupled into two iterative subtasks: subcarrier assignment (SA, including user grouping) and power allocation (PA). Each subtask is a sequential decision process. Invoking a deep deterministic policy gradient algorithm, our proposed DRL-based JRM (DRL-JRM) approach jointly performs the two subtasks, where the optimization objective and constraints of the subtasks are addressed by a new joint reward and internal reward mechanism. A multi-agent structure and a convolutional neural network are adopted to reduce the complexity of the PA subtask. We also tailor the neural network structure for the stability and convergence of DRL-JRM. Corroborated by extensive experiments, the proposed DRL-JRM scheme is superior to existing alternatives in terms of system throughput and resistance to interference, especially in the presence of many users and strong inter-cell interference. DRL-JRM can flexibly meet individual service requirements of users.

12 June 2017 in IEEE Systems Journal
Verified
Journal Article
Closed access
FZFuhui Zhou
Fuhui Zhou
NBNorman C. Beaulieu
Norman C. Beaulieu
Julian ChengJulian Cheng
Julian Cheng
ZCZheng Chu
Zheng Chu
YWYuhao Wang
Yuhao Wang
Fairness among different users and energy utilization are key issues in the future communication network design. Robust max-min fairness resource allocation in sensing-based wideband cognitive radio with simultaneous wireless information and power transfer is studied when spectrum sensing and channel state information are imperfect. A worst-case throughput is maximized by jointly optimizing the sensing time, transmit power, and subchannel allocation under the worst-case channel state information error model, subject to constraints on energy harvesting, interference power, and transmit power. Two operation paradigms for cognitive radio are considered, namely, opportunistic spectrum access and sensing-based spectrum sharing. The formulated robust max-min fairness resource allocation problems are mixed-integer and nonconvex programming with infinite inequality constraints. An efficient one-dimensional search algorithm is designed based on the proposed transmit power and subchannel allocation scheme. Simulation results show that the secondary user under sensing-based spectrum sharing can obtain a performance gain compared with that under opportunistic spectrum access at the cost of implementation complexity. Design tradeoffs are identified and discussed.

7 June 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
XZXuewei Zhang
Xuewei Zhang
TLTiejun Lv
Tiejun Lv
WNWei Ni
Wei Ni
JCJohn M. Cioffi
John M. Cioffi
NBNorman C. Beaulieu
Norman C. Beaulieu
Yingjie Jay GuoYingjie Jay Guo
Yingjie Jay Guo
By suppressing repeated content deliveries, wireless caching has the potential to substantially improve the energy efficiency (EE) of the fifth generation (5G) communication networks. In this paper, we propose two novel energy-efficient caching schemes in heterogeneous networks, namely, scalable video coding (SVC)-based fractional caching and SVC-based random caching, which can provide on-demand video services with different perceptual qualities. We derive the expressions for successful transmission probabilities and ergodic service rates. Based on the derivations and the established power consumption models, the EE maximization problems are formulated for the two proposed caching schemes. By taking logarithmic approximations of the l0-norm, the problems are efficiently solved by the standard gradient projection method. Numerical results validate the theoretical analysis and demonstrate the superiority of our proposed caching schemes, compared to three benchmark strategies.

26 September 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JZJie Zeng
Jie Zeng
TLTiejun Lv
Tiejun Lv
WNWei Ni
Wei Ni
Ren Ping LiuRen Ping Liu
Ren Ping Liu
NBNorman C. Beaulieu
Norman C. Beaulieu
Yingjie Jay GuoYingjie Jay Guo
Yingjie Jay Guo
Single-input multiple-output non-orthogonal multiple access (SIMO-NOMA) is a promising technology for the uplink (UL) of the Internet of things (IoT). A rate splitting scheme to guarantee max-min fairness (MMF) of SIMO-NOMA is studied. First, the achievable data rate of the minimum mean square error successive interference cancellation (MMSE-SIC) detection is formulated. An upper bound for the minimum data rate of UL users is derived, and it is proved that the upper bound can be achieved by rate splitting with MMSE-SIC detection. Then, an exhaustive-search rate splitting algorithm to maximize the minimum data rate is designed. The existence of a lower bound for the minimum data rate with two-layer SIMO-NOMA is proved. A low-complexity two-layer rate splitting algorithm is designed with suitable detection order to exceed the lower bound. Numerical results verify that rate splitting SIMO-NOMA has higher minimum data rate and lower transmission latency than single-input multiple-output orthogonal multiple access (SIMO-OMA) and un-layered SIMO-NOMA.