Maximizing the Rate of IRS-Assisted Downlink NOMA Systems by Xinying Li, Haixia Wei, Haiyan Huang, Cuiran Li, Lijun Zhang

“…As for a multiuser scenario, the alternating optimization (AO) algorithm is raised based on transmit beamforming and reflection phase shift matrix to settle relevant issues and mitigate computational complexity. The simulation results suggest that the algorithm described in this paper can significantly increase the signal’s achievable rate compared to the nondeployed IRS and IRS random phase-shifting schemes.…”
Get full text

Uplink assisted downlink channel estimation method of extra-large scale MIMO-OTFS system by Xumin PU, Kaiyuan DENG, Qianbin CHEN

“…A low complexity downlink channel estimation method for high-speed mobile scenarios was proposed for the extra-large scale multiple-input multiple-output (MIMO) orthogonal time-frequency space (OTFS) system.Different from the existing studies, the proposed method considers the significant spatial non-stationary characteristics of extra-large scale MIMO-OTFS system.Based on the visible path region, an enhanced sparse orthogonal matching pursuit (OMP) algorithm with low complexity was proposed, uplink-assisted downlink channel estimation was achieved using the mapping relationship between the uplink and downlink channels in the frequency-division duplex (FDD) mode.Simulation results show that the proposed uplink-assisted downlink channel estimation method can accurately represent the non-stationary of the system, and achieve significant improvement in the channel estimation performance while reducing the computational complexity , and still perform well in high-mobility IoT scenarios.…”
Get full text

LDPC code reconstruction based on algorithm of finding low weight code-words by Pei-dong YU, Hua PENG, Ke-xian GONG, Ze-liang CHEN

“…LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices.Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory.Under noise-free conditions,drawbacks of the existing method,including limited applicable range and large quantity of required data,have been overcame.Under noisy conditions,the proposed method has higher robustness against noise and relatively low complexity,compared to existing methods.For QC-LDPC codes,the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices.…”
Get full text

On-board Multi-User Detection Algorithm Based on Conditional Neural Process by Yilun LIU, Liang JIN, Jiali LI, Lidong ZHU

“…With the characteristics of all-terrain, all-weather and seamless coverage, satellite communications have become a potentially important part of 6G.An important prerequisite for achieving satellite intelligence is that the satellite have on-board processing capabilities.Multi-user detection (MUD) is a classic method of suppressing multiple access interference (MAI) in wireless communication, such as MMSE, Gaussian processregression (GPR) and other algorithms.Due to the inverse matrix required in the detection process, the algorithm complexity is usually cubic, and it is diff cult to directly apply to satellite platforms because of its limited processing capabilities.The conditional neural process combined the characteristics of the low complexity of the neural network and the data-eff cient of the Gaussian process.The neural network was used to parameterized the Gaussian process to avoided the inversion of the matrix, thereby reduced the computational complexity.The application of conditional neural process in MUD was studied.The simulation results showed that, while reduced complexity, conditional neural process also greatly improved the performance of bit error rate (BER).…”
Get full text

Sparse Array Angle Estimation Using Reduced-Dimension ESPRIT-MUSIC in MIMO Radar by Chaozhu Zhang, Yucai Pang

“…However, the proposed algorithm has high computational complexity due to the requirement of two-dimension search. …”
Get full text

Primary-user behavior based joint routing and channel allocation algorithm in cognitive radio networks by Jing LIU, Pin-yi REN, Shao-li XUE, Chao ZHANG

“…To resolve the unstable routing problem due to the variation of spectrum availability caused by primary users’ behaviors in cognitive radio networks (CRN),a primary-user behavior based joint routing and channel allocation (PUB-JRCA) algorithm was proposed.The PUC-JRCA algorithm characterized the primary-user behavior by using the call-based model.According to the route discovery mechanism in the dynamic source routing protocol,the destination node selected the route which received the least impact from primary-user behaviors after receiving a number of route requests.Then,the destination sent back the route reply packet (RREP) along the selected route,and the channel allocation was performed when the RREP passed each node on this route.Theoretic analyses prove that the expected available transmission time for the packet delivery is inversely proportional to the probability that PU is active.Moreover,the computational complexity of the proposed algorithm is proportional to the number of nodes in the CRN.Simulation results show that the proposed algorithm has higher packet delivery ratio and lower average packet delay than the Gymkhana routing scheme.…”
Get full text

Companding transform technique combined with iterative filtering for reducing PAPR of OFDM signals by Chao YANG, Yong WANG, Jian-hua GE

“…Considering the drawbacks of the traditional companding transforms，an efficient companding scheme combined with iterative filtering was proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals.By introducing a joint optimization approach for PAPR and bit error rate (BER) performances along with remaining an unchanged average output power level，the scheme could achieve significant reduction in PAPR as well as an improved BER simultaneously.Moreover，by adaptively adjusting the transform parameters in the iterative process，more design flexibility in companding form and lower out-of-band radiation could also be given to satisfy various system requirements.The proposed scheme had a simple functional form and less computational complexity.The theoretical results regarding the transform gain and impact of companding distortion were derived.Simulation results show that this scheme can substantially offer better overall performances in terms of PAPR reduction，BER performance and bandwidth efficiency.…”
Get full text

Side Information Generation for Distributed Video Coding Using Spatiotemporal Joint Bilinear Upsampling by Wenhui Liu, Krishna Rao Vijayanagar, Joohee Kim

“…Simulation results show that the proposed method improves the quality of side information significantly while keeping low computational complexity.…”
Get full text

ID-based server-aided verification signature scheme with strong unforgeability by Xiao-dong YANG, Miao-miao YANG, Guo-juan GAO, Ya-nan LI, Xiao-yong LU, Cai-fen WANG

“…Most identity-based signature schemes in the standard model are existentially unforgeable,which cannot prevent adversaries from forging valid signatures on messages that have previously been signed.However,signature verification algorithms of ID-based signature schemes in the standard model require expensive bilinear pairing operations.In order to overcome the shortcomings of the existing ID-based signature schemes such as strong security assumption and high computation cost，a strongly unforgeable ID-based server-aided verification signature scheme was presented.This scheme was proven to be secure under collusion attacks,adaptive chosen identity and message attacks in the standard model.Analysis results show that the proposed scheme effectively reduces computation cost of pairing operation,and it greatly reduces computational complexity of signature verification algorithm.The proposed scheme is more efficient than the existing ID-based signature schemes.…”
Get full text

Real-Time Resource Allocation Algorithm for the Quasi-Two-Dimensional Mobile Delay/Disrupt Tolerant Networking by Ying Wang, Yonghui Zhang

“…However, schemes based on neural network and genetic algorithms are of computational complexity that is not applied to real-time applications. …”
Get full text

Simple variable tap‐length algorithm for high‐noise environment by Ying Wei, Zhibin Yan

“…Only at a slight cost of computational complexity, the proposed algorithm can achieve both small steady‐state fluctuation and fast‐convergence rate of the tap‐length under a high stochastic Gaussian noise condition (signal‐to‐noise ratio = 0 dB) or a deterministic impulsive noise condition.…”
Get full text

Effects of Quintessence Dark Energy on the Action Growth and Butterfly Velocity by Hossein Ghaffarnejad, Mohammad Farsam, Emad Yaraie

“…In this work we are about to investigate the effects of quintessence dark energy on evolution of the computational complexity relating to the AdS/CFT correspondence. …”
Get full text

Joint Power Allocation at the Base Station and the Relay for Untrusted Relay Cooperation OFDMA Network by Weiheng Jiang, Wenjiang Feng

“…In addition, the convergence and computational complexity of the proposed algorithms are analyzed. …”
Get full text

Direction of Arrival Estimation Accuracy Enhancement via Using Displacement Invariance Technique by Youssef Fayad, Caiyun Wang, Qunsheng Cao, Alaa El-Din Sayed Hafez

“…It is worth mentioning that the subspace approach has been employed into ESPRIT and DIT methods to reduce the computational complexity and the model’s nonlinearity effect. …”
Get full text

GazeNet: A lightweight multitask sclera feature extractor by Matej Vitek, Vitomir Štruc, Peter Peer

“…The proposed GazeNet network has a computational complexity below 1 GFLOP, making it appropriate for less capable devices like smartphones and head-mounted displays. …”
Get full text

Modified SIFT Descriptors for Face Recognition under Different Emotions by Nirvair Neeru, Lakhwinder Kaur

“…Second, the computational complexity of SIFT in descriptor calculation is reduced by subtracting average from each descriptor instead of normalization. …”
Get full text

Multi-user joint RIS channel estimation based on ADMM by ZHU Luhu, WANG Anding

“…Addressing the challenges of high pilot overhead and computational complexity in traditional channel estimation methods for millimeter-wave communication systems aided by reconfigurable intelligent surfaces (RIS), a novel channel estimation algorithm based on the alternating direction method of multipliers (ADMM) for multi-user joint scenarios was proposed. …”
Get full text

Minimizing Sensor Failures in Wireless Rechargeable Sensor Networks With Obstacles Through Fresnel Diffraction Model by Kun Wang, Zhejun Shen

“…Then we design the spatial and time discretization methods, whose approximate ratios are precisely determined to reduce the computational complexity of the charging optimization problem. …”
Get full text

Search-Free Angle, Range, and Velocity Estimation for Monostatic FDA-MIMO by Zihang Ding, Junwei Xie, Jiaang Ge

“…To overcome the problem of the high computational complexity associated with the searching estimation algorithms, the parallel factor (PARAFAC) decomposition is introduced to estimate the space-time steering vector. …”
Get full text

A Labeled Multi-Bernoulli Filter Based on Maximum Likelihood Recursive Updating by Yuhan Song, Han Shen-Tu, Junhao Lin, Yizhen Wei, Yunfei Guo

“…However, when tracking multiple targets in dense clutters, the computational complexity of the traditional labeled multi-Bernoulli filter will increase exponentially. …”
Get full text