检索结果-内蒙古大学图书馆

Sparse detection with orthogonal matching pursuit in multiuser uplink quadrature spatial modulation MIMO system

IET COMMUNICATIONS 2019年第20期13卷 3472-3478页

作者： Adnan, Saifullah Fu, Yuli Junejo, Naveed Ur Rehman Chen, Zhen Esmaiel, Hamada South China Univ Technol Sch Elect & Informat Engn Guangzhou Guangdong Peoples R China Xiamen Univ Sch Informat Sci & Engn Minist Educ Key Lab Underwater Acoust Commun & Marine Informa Xiamen Peoples R China Aswan Univ Fac Engn Elect Engn Dept Aswan 81542 Egypt

Quadrature spatial modulation (QSM) is one of the most prevalent transmission techniques for future wireless mobile network due to its high spectral efficiency (SE) and low complexity. However, it is restrictive to downlink of the cellular network deployments. Therefore, this paper proposes QSM for the multiuser uplink data transmission that increases the SE of the network by deploying multiple antennas at the mobile user with only two radio frequency (RF) chains. Maximum likelihood (ML) decoder is used to detect the received signal and attains the optimal detection performance but it is impractical because of its high computational complexity. Consequently, this paper proposes compressed sensing (CS) based orthogonal matching pursuit (OMP) detection as it has a suboptimal performance with a low computational complexity which can be a practical solution in the high-density uplink multiuser network. However, conventional OMP algorithm has a low estimation performance due to multiuser interference which corrupt channel matrix. Thus, this work design an equalizer that mitigates the multiuser interference and improve the detection performance by orthonormalizing the columns of channel matrix. Simulation analysis confirm that the proposed QSM technique based on CS detector outperforms the conventional schemes in terms of SE and bit error rate (BER).

关键词： MIMO communication maximum likelihood detection mobile radio computational complexity antenna arrays modulation cellular radio compressed sensing time-frequency analysis iterative methods transmitting antennas data communication matrix algebra interference suppression equalisers sparse detection multiuser uplink quadrature spatial modulation MIMO system future wireless mobile network high spectral efficiency QSM application downlink transmission cellular network deployments multiple antennas mobile user radio frequency chains spatial modulation techniques maximum likelihood decoder optimal detection performance uplink MU detection orthogonal matching pursuit detection OMP complex ML decoder low computational complexity high-density uplink MU network low estimation performance QSM technique uplink MU communication transmission techniques computational complexity transmitter antennas MU interference mitigation base station RF chains multiuser uplink data transmission received signal detection compressed sensing OMP detection suboptimal performance channel matrix equaliser design CS detector system bit error rate simulation analysis

来源：评论

学校读者我要写书评

暂无评论

Sparse and robust SVM classifier for large scale classification

引用

APPLIED INTELLIGENCE 2023年第16期53卷 19647-19671页

作者： Wang, Huajun Shao, Yuanhai Changsha Univ Sci & Technol Dept Math & Stat Changsha Peoples R China Hainan Univ Sch Management Haikou Peoples R China

Support vector machine (SVM) has drawn wide attention in various fields, such as image classification, pattern recognition and disease diagnosis and so on. Nevertheless, it requires much memory and runs very slow in large-scale datasets setting. To reduce computational cost and the required storage, we first design a new sparse and robust SVM model according to our construct truncated smoothly clipped absolute deviation (SCAD) loss and then establish its first-order necessary and sufficient optimality conditions though newly defined proximal stationary point. Following the idea of the proximal stationary point, we define the L-ts support vectors of L-ts-SVM and then show that the L-ts support vectors are a small portion of the whole training set, which is convenient for us to introduce a novel working set in each step. We next present a new alternating direction method of multipliers with working set (L-ts-ADMM) to deal with L-ts-SVM, which proves that the proposed algorithm not only converges to a local minimizer of L-ts-SVM but also possesses a relatively low computational complexity. Finally, the extensive numerical experiments demonstrate that the proposed algorithm enjoys better performance than nine leading state-of-the-art methods with regard to best classification accuracy, smallest number of support vectors and super fast computational speed in large-scale datasets setting.

关键词： Truncated SCAD loss Proximal operator Support vectors Working set low computational complexity

来源：评论

学校读者我要写书评

暂无评论

The algorithm and VLSI architecture of a high efficient motion estimation with adaptive search range for HEVC systems

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2019年第6期16卷 1943-1958页

作者： Liao, Tzu-Ting Shen, Chung-An Tseng, Yu-Hao Natl Taiwan Univ Sci & Technol Dept Elect & Comp Engn Taipei Taiwan

This paper presents a novel algorithm and VLSI architecture of motion estimation (ME) for high efficiency video coding systems. The proposed algorithm examines a much smaller set of search candidates and thus greatly reduces the computational complexity. Furthermore, in order to strike a balance between the quality of the Video and the efficiency of the system, this algorithm possesses the advantages that the number of search candidates is adaptive to the characteristic of the Video content. The simulation results show that, compared to the HM reference software, the proposed algorithm leads to a 96% reduction in search candidates with only 1.98% increment in average bitrate. Based on this algorithm, a hardware-efficient VLSI architecture of ME is designed and implemented with 90 nm technology. The experimental results show that, occupying the area complexity of 274.5 kGE, the presented design achieves 60 frames per second with resolution of 3840 x 2160 at the frequency of 201 MHz. The proposed ME system enhances the hardware efficiency by at least 50% compared to the prior works.

关键词： Motion estimation High efficiency video coding (HEVC) Adaptive search range low computational complexity Hardware efficiency

来源：评论

学校读者我要写书评

暂无评论

low-complexity LS Algorithm Using Coordinate Transformation

引用

Chinese Journal of Electronics 2017年第1期26卷 156-159页

作者： YAN Wen XIE Yizhuang ZHU Bocheng CHEN He MA Cuimei School of Information and Electronics Beijing Institute of Technology School of Electronics Engineering and Computer Science Peking University

To reduce the computational complexity, decrease hardware resource consumption, and make it practicable, we propose a novel coordinate transformation based low-complexity Least squares(LS) algorithm. The positive integral variable is set as a reference coordinate and coefficients are transformed to be constant. The fitting polynomial in the reference coordinate system can be easily realized with lower complexity. To achieve the fitting curve in the original coordinate system, coordinate transformation is needed. Compared with the conventional LS fitting, our implementation results show that the proposed LS fitting algorithm can greatly reduce hardware resources in the premise of meeting the precision requirements.

关键词： Least squares(LS) fitting Reference coordinate Coordinate transformation low computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast Radix-3 Algorithm for the Generalized Discrete Hartley Transform of Type II

引用

IEEE SIGNAL PROCESSING LETTERS 2012年第6期19卷 348-351页

作者： Shu, Huazhong Wu, Jiasong Yang, Chunfeng Senhadji, Lotfi Southeast Univ Lab Image Sci & Technol Sch Comp Sci & Engn Nanjing 210096 Jiangsu Peoples R China Ctr Rech Informat Biomed Sino Francais CRIBs Nanjing 210096 Jiangsu Peoples R China INSERM U1099 F-35000 Rennes France Univ Rennes 1 LTSI F-35000 Rennes France

We present a new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where N = 3(m), m >= 2. Then we apply this algorithm to the direct computation of length-N GDHT-II coefficients when given three adjacent length-N/3 GDHT-II coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length. The arithmetic operations can be saved from 19% to 29% for varying from 9 to 243 and from 17% to 29% for N = 3 x 2(m) varying from 12 to 384. Furthermore, the new approach can be easily implemented.

关键词： Fast radix-3 algorithm generalized discrete Hartley transform of type II low computational complexity

来源：评论

学校读者我要写书评

暂无评论

low-cost adaptive algorithm for noise subspace estimation

引用

ELECTRONICS LETTERS 2002年第12期38卷 609-611页

作者： Attallah, S Abed-Meraim, K Curtin Univ Technol Sch Elect & Comp Engn Perth WA 6845 Australia Telecom Paris TSI Dept Paris France

A new adaptive algorithm for noise subspace estimation and tracking that is based on Rayleigh's quotient is proposed. The algorithm has a number of interesting properties such as low computational complexity and good numerical stability. It can have many applications, in particular, in digital signal processing and communications.

关键词： digital signal processing adaptive algorithm noise subspace tracking noise Rayleigh quotient communications low-cost algorithm Signal processing and detection Signal processing theory adaptive estimation signal processing tracking noise subspace estimation numerical stability computational complexity low computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast Parameter Estimation for Polyphase P Codes Modulated Radar Signals

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2017年第10期E100A卷 2162-2166页

作者： Zhang, Qi Wang, Pei Zhu, Jun Tang, Bin Univ Elect Sci & Technol China West Hitech Zone Qingshuihe Campus 2006Xiyuan Ave Chengdu 611731 Sichuan Peoples R China

A fast parameter estimation method with a coarse estimation and a fine estimation for polyphase P coded signals is proposed. For a received signal with N sampling points, the proposed method has an improved performance when the signal-to-noise ratio (SNR) is larger than 2 dB and a lower computational complexity O (N log(s) N) compared with the latest time-frequency rate estimation method whose computational complexity is O (N-2).

关键词： radar signals polyphase P codes parameter estimation low computational complexity

来源：评论

学校读者我要写书评

暂无评论

The Complex Convolutional Neural Network for Adaptive Spatio-Temporal Broadband Beamforming

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第7期73卷 10778-10782页

作者： Wu, Xun Xue, Cong Zhang, Shurui Zhu, Hairui Han, Yubing Sheng, Weixing Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing 210094 Peoples R China

Broadband beamforming technology is an effective solution in millimeter-wave (mmWave) massive multiple-input-multiple-output (MIMO) systems to counteract severe path loss via beamforming gains. One classic approach to implementing adaptive broadband beamforming is through spatio-temporal structure. In this paper, a method based on the complex convolutional neural network (CCNN) is proposed, namely, broadband beamforming prediction complex-valued network (BBPCNet), which can solve the performance degradation problem of traditional broadband beamforming methods under circumstance of limited snapshots. The BBPCNet leverages the CCNN to maintain the inherent amplitude and phase relationships of the complex-valued signals received by the array. A significant advantage of the proposed method is the elimination of the need for covariance matrix inversion to produce beamforming weights, resulting in lower computational complexity. Numerical simulations demonstrate effectiveness and superiority of the proposed method.

关键词： Array signal processing Broadband communication Feature extraction Delays Covariance matrices Convolution Task analysis Massive MIMO spatio-temporal broadband beamforming complex convolutional neural network low computational complexity low snapshots

来源：评论

学校读者我要写书评

暂无评论

low complexity Message Passing Detection Algorithm for Large-Scale MIMO Systems

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2018年第5期7卷 708-711页

作者： Zeng, Jing Lin, Jun Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing 210008 Jiangsu Peoples R China

The original message passing detection (MPD) algorithm, which exploits channel hardening theory, achieves very good performance in large-scale multi-input multi-output (MIMO) systems. However, the complexity of the MPD algorithm grows rapidly when the number of users or the order of modulation increases, presenting a great implementation challenge for practical massive MIMO systems. In this letter, based on a novel approximate probability updating (APU) scheme, a low complexity MPD (LCMPD) algorithm is proposed. The developed APU scheme considers only the most reliable constellation point during the message passing process. Combined with a serial message updating schedule, no exponential operation or division is required in the LCMPD algorithm. Compared to the existing MPD algorithm, the overall computational complexity is reduced by 11.2 to 29.4 times under various antenna configurations with almost no degradation in the bit error rate performance. Hence, the proposed algorithm is very suitable for efficient hardware implementation.

关键词： Large-scale MIMO systems message passing detector iterative detection low computational complexity

来源：评论

学校读者我要写书评

暂无评论

High-speed implementation of rate-distortion optimised quantisation for H.265/HEVC

引用

IET IMAGE PROCESSING 2015年第8期9卷 652-661页

作者： He, Jing Yang, Fuzheng Zhou, Yicong Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Univ Macau Dept Comp & Informat Sci Taipa Macau Peoples R China

Rate-distortion optimised quantisation (RDOQ) is generally utilised in video coding for achieving higher coding efficiency. To determine the optimal quantised level for each transform coefficient, it requires considerable complexity in practice to calculate rate-distortion (RD) costs from multiple candidates of quantised levels. This study proposes a fast RDOQ algorithm with low computational complexity for the latest video coding standard, the high-efficiency video coding. Instead of calculating the RD costs from two candidates of quantised levels separately, their RD cost differences were derived. A bit-rate estimation method is then used to accurately calculate the length of coding bits in the RD cost function, avoiding the high-computation-cost process of context-adaptive binary arithmetic coding. Experimental results show that, with a negligible degradation of coding performance, the proposed algorithm is faster than RDOQ by 74.6% in average.

关键词： video coding quantisation (signal) H.265/HEVC high-speed implementation rate distortion optimised quantisation rate distortion cost differences RDOQ algorithm low computational complexity video coding standard bit rate estimation method rate distortion function

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：