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

2010 IEEE International Symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Vipiana, F. Vecchi, G. Ist Super Mario Boella ISMB Antenna & EMC Lab LACE Via Pier Carlo Boggio 61 I-10138 Turin Italy Politecn Torino Antenna & EMC Lab LACE I-10129 Turin Italy

ISBN: (纸本)9781424449682

We have proposed an algorithm able to identify open and closed parts of a generic geometry. This information is essential to apply different integral equation formulations to different parts of the structure: the EFIE to open parts and the CFIE to the closed ones. The application of the CFIE is necessary to avoid internal resonances of the structure, but this formulation can not be applied simply to the whole structure if open parts are present. The computational complexity of the proposed Open-Closed Grouping algorithm is Nlog(N), and the simulation time and required memory are very low.

关键词： closed surface combined field integral equation complex geometry computational complexity computational complexity computational electromagnetics computational geometry electric field integral equation generic geometry integral equations internal resonance low complexity algorithm open surface open-closed grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

A low-complexity ECG Feature Extraction algorithm for Mobile Healthcare Applications

引用

IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS 2013年第2期17卷 459-469页

作者： Mazomenos, Evangelos B. Biswas, Dwaipayan Acharyya, Amit Chen, Taihai Maharatna, Koushik Rosengarten, James Morgan, John Curzen, Nick Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England Indian Inst Technol Hyderabad Dept Elect Engn Hyderabad 502205 Andhra Pradesh India Southampton Univ Hosp NHS Trust Southampton SO16 6YD Hants England Univ Southampton Southampton SO17 1BJ Hants England

This paper introduces a low-complexity algorithm for the extraction of the fiducial points from the electrocardiogram (ECG). The application area we consider is that of remote cardiovascular monitoring, where continuous sensing and processing takes place in low-power, computationally constrained devices, thus the power consumption and complexity of the processing algorithms should remain at a minimum level. Under this context, we choose to employ the discrete wavelet transform (DWT) with the Haar function being the mother wavelet, as our principal analysis method. From the modulus-maxima analysis on the DWT coefficients, an approximation of the ECG fiducial points is extracted. These initial findings are complimented with a refinement stage, based on the time-domain morphological properties of the ECG, which alleviates the decreased temporal resolution of the DWT. The resulting algorithm is a hybrid scheme of time-and frequency-domain signal processing. Feature extraction results from 27 ECG signals from QTDB were tested against manual annotations and used to compare our approach against the state-of-the art ECG delineators. In addition, 450 signals from the 15-lead PTBDB are used to evaluate the obtained performance against the CSE tolerance limits. Our findings indicate that all but one CSE limits are satisfied. This level of performance combined with a complexity analysis, where the upper bound of the proposed algorithm, in terms of arithmetic operations, is calculated as 2.423N + 214 additions and 1.093N + 12 multiplications for N <= 861 or 2.553N + 102 additions and 1.093N + 10 multiplications for N > 861 (N being the number of input samples), reveals that the proposed method achieves an ideal tradeoff between computational complexity and performance, a key requirement in remote cardiovascular disease monitoring systems.

关键词： Discrete wavelet transform (DWT) electrocardiogram (ECG) feature extraction low complexity algorithm mobile healthcare

来源：评论

学校读者我要写书评

暂无评论

Motion estimation algorithm with low complexity for video compression

引用

ELECTRONICS LETTERS 2000年第18期36卷 1533-1535页

作者： Kang, HS Hyundai Elect Co Ltd Adv Tech Lab Mobile Telecom Terminal R&D CtrSeocho Ku Seoul 137070 South Korea

The author presents a new motion estimation method which reduces the computational complexity in video compression. This is achieved by skipping the motion estimation operation for macro-blocks, where it is determined... 详细信息

关键词： motion estimation Image and video coding data compression computational complexity reduction Computational complexity low complexity algorithm Video signal processing video compression video coding computational complexity motion estimation algorithm

来源：评论

学校读者我要写书评

暂无评论

low-complexity Robust Transmission algorithm for IRS-Enhanced Cognitive Satellite-Aerial Networks

Low-complexity Robust Transmission Algorithm for IRS-Enhance...

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Zhao, Bai Lin, Min Xiao, Shengjie Cheng, Ming Wang, Jun-Bo Cheng, Julian Nanjing Univ Posts & Telecommun Coll Commun & Informat Engn Nanjing Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China Univ British Columbia Sch Engn Kelowna BC Canada

ISBN: (纸本)9781538674628

This paper proposes a downlink transmission scheme for intelligent reflecting surface (IRS) enhanced cognitive-satellite-aerial-network to support massive access of Internet-of-Things devices (IoTDs). By sharing the same frequency band with satellite network, the aerial network offers services for IoTDs having line-of-sight links through space division multiple access, and for IoTDs locating in blocked area via IRS-enhanced non-orthogonal multiple access. Assuming that only the imperfect channel state information is available, we formulate a transmit power minimization problem subject to the probabilistic constraints of the quality-of-service requirements for IoTDs, the co-channel interference power limitation, and unit-modulus requirement for IRS. To tackle this mathematically intractable problem, we propose a generalized zero-forcing based low-complexity robust transmission algorithm, integrating the second-order Taylor expansion and Bernstein-type inequality, to obtain a satisfactory performance while reducing the computational load. Finally, simulation results validate the effectiveness and superiority of the proposed robust algorithms compared to existing algorithms.

关键词： Cognitive-satellite-aerial-network Intelligent reflecting surface Non-orthogonal multiple access Robust beamforming low complexity algorithm

来源：评论

学校读者我要写书评

暂无评论

Improving image encoding quality with a low-complexity DCT approximation using 14 additions

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2023年第3期20卷 58页

作者： Mefoued, Abdelkader Kouadria, Nasreddine Harize, Saliha Doghmane, Noureddine Badji Mokhtar Annaba Univ Fac Technol Elect Dept Lab Automat & Signals Annaba LASA Annaba 23000 Angola

The quality of images is crucial in image and video compression, especially for resource-constrained systems that prioritize simplicity. To achieve fast and low-energy compression, such systems aim to strike a balance between image quality and computational complexity. While various Discrete Cosine Transform (DCT) approximations have been proposed, only two approximations with 14 additions are currently available. This paper presents a novel 8-point DCT approximation that improves image quality compared to the previous 14-addition transformations. Additionally, a pruned version is derived and shown to be efficient. The proposed approximation achieves an average quality gain of up to 1 dB while maintaining a similar computational structure to the previous transformations, resulting in comparable energy consumption. Therefore, this solution provides a compelling option for resource-constrained systems seeking efficient image compression while preserving high image quality.

关键词： DCT approximation low complexity algorithm low power consumption Image compression

来源：评论

学校读者我要写书评

暂无评论

low-complexity Decoding for Non-Binary LDPC Codes in High Order Fields

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第5期58卷 1365-1375页

作者： Voicila, Adrian Declercq, David Verdier, Francois Fossorier, Marc Urard, Pascal Univ Cergy Pontoise CNRS ETIS ENSEA F-95000 Cergy Pontoise France STMicroelectronics Crolles France

In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts the memory problem of the non-binary LDPC decoders, together with a significant complexity reduction per decoding iteration. The key feature of our decoder is to truncate the vector messages of the decoder to a limited number n(m). of values in order to reduce the memory requirements. Using the truncated messages, we propose an efficient implementation of the EMS decoder which reduces the order of complexity to O(n(m) log(2) n(m)). This complexity starts to be reasonable enough to compete with binary decoders. The performance of the low complexity algorithm with proper compensation is quite good with respect to the important complexity reduction, which is shown both with a simulated density evolution approach and actual simulations.

关键词： Iterative decoding non-binary LDPC codes low complexity algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid radio resource allocation and interference coordination for type 1a-relayed long term evolution uplink

引用

IET COMMUNICATIONS 2014年第11期8卷 1928-1937页

作者： Ahmed, Irfan Mohamed, Amr Taif Univ Coll Comp & Informat Technol At Taif 21974 Saudi Arabia Qatar Univ Coll Comp Sci & Engn Doha 2173 Qatar

Relay technology has been included in long term evolution (LTE) cellular system through 3GPP Release 10. Relay-based LTE cellular system is one of the most promising technologies to enhance the throughput and coverage of access network. Deployment of relays in a cell opens many issues of frequency/time domain radio resource allocation and frequency planning. In this study, the authors consider the uplink of LTE relay-assisted network and formulate the joint scheduling and intra-cell interference mitigation as a non-linear optimisation problem. They take into account the projection of the gradient of user's utility function over the user's rate vector based on Lagrangian method. They propose a novel transformation of scheduling problem into combinatorial Knapsack optimisation to convert the optimisation problem into binary integer non-linear program. Finally, they present an alternate solution through a low complexity algorithm to allocate resources based on group of resource blocks, whereas considering the contiguity constraint. Simulation results show that the proposed scheme is near optimal with a much lower complexity order.

关键词： resource allocation interference suppression relay networks (telecommunication) Long Term Evolution cellular radio 3G mobile communication radio access networks frequency-domain analysis time-domain analysis nonlinear programming integer programming vectors hybrid radio resource allocation interference coordination 1a-relayed long term evaluation uplink LTE cellular system 3GPP Release 10 access network frequency planning frequency domain time domain relay-assisted network intracell interference mitigation user utility function user rate vector Lagrangian method scheduling problem combinatorial Knapsack optimisation binary integer nonlinear program low complexity algorithm resource blocks contiguity constraint

来源：评论

学校读者我要写书评

暂无评论

Analytical method for optimum non-negative integer bit allocation

引用

IET SIGNAL PROCESSING 2016年第8期10卷 936-946页

作者： Hatam, Mahdi Masnadi-Shirazi, Mohammad Ali Firouzabad Inst Higher Educ Dept Elect Engn Firouzabad Iran Shiraz Univ Sch Elect & Comp Engn Dept Commun & Elect Shiraz Iran

The optimum bit allocation (OBA) problem was first investigated by Huang and Schultheiss in 1963. They solved the problem allowing the bits to be signed real numbers. Later, different algorithms were proposed for OBA problem when the bits were constrained to be integer and non-negative. In 2006, Farber and Zeger proposed new algorithms for solving optimum integer bit allocation (OIBA) and optimum non-negative integer bit allocation (ONIBA). None of the existing algorithms for OIBA and ONIBA problems end with an analytical solution. In this study, a new analytical solution is proposed for OIBA and ONIBA problems based on a novel analytical optimisation approach. At first, a closed form solution is derived for Lagrange unconstraint problem. Then, by removing the Lagrange multiplier, an analytical solution is obtained for OIBA and ONIBA problems. Using the selection and bisection algorithms, a low complexity algorithm is proposed for searching in a group of discrete functions which can reduce the computational complexity of the analytical solution. The complexity of computing the analytical solution is O(k) which is much lower than the complexity of existing ONIBA algorithms.

关键词： video coding data compression computational complexity optimisation optimum nonnegative integer bit allocation problem ONIBA problem OIBA problem OBA problem optimum bit allocation problem optimum integer bit allocation problem analytical optimisation approach Lagrange unconstraint problem Lagrange multiplier removal selection and bisection algorithm low complexity algorithm discrete function computational complexity reduction video frame compression

来源：评论

学校读者我要写书评

暂无评论

Fast structural similarity index algorithm

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2011年第4期6卷 281-287页

作者： Chen, Ming-Jun Bovik, Alan C. Univ Texas Austin LIVE Austin TX 78712 USA

The development of real-time image and video quality assessment algorithms is an important direction on which little research has focused. Towards this end, we present a design of real-time implementable full-reference image/video quality algorithms that are based on the Structural SIMilarity (SSIM) index and multi-scale SSIM (MS-SSIM) index. The proposed algorithms, which modify SSIM/MS-SSIM to achieve speed of execution, were tested on the LIVE Image Quality Database and LIVE Video Quality Database. The experimental results show that the performance of the new, fast algorithms is commensurate with that of SSIM and MS-SSIM, but with much lower computational complexity. Indeed, the proposed Fast MS-SSIM algorithm is 10 times faster (lower complexity) than the MS-SSIM algorithm, while the proposed Fast SSIM is 2.68 times faster than SSIM without parallel computing optimization.

关键词： Real time Video quality assessment SSIM Image quality assessment low complexity algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid Precoding for Physical Layer Multicasting

引用

IEEE COMMUNICATIONS LETTERS 2016年第2期20卷 228-231页

作者： Dai, Mingbo Clerckx, Bruno Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England Korea Univ Sch Elect Engn Seoul South Korea

This work investigates the problem of downlink transmit precoding for physical layer multicasting with a limited number of radio-frequency (RF) chains. To tackle the RF hardware constraint, we consider a hybrid precoder that is partitioned into a high-dimensional RF precoder and a low-dimensional baseband precoder. Considering a total transmit power constraint over the RF chains, the goal is to maximize the minimum (maxmin) received signal-to-noise ratio (SNR) among all users. We propose a low complexity algorithm to compute the RF precoder that achieves near-optimal max-min performance. Moreover, we derive a simple condition under which the hybrid precoding driven by a limited number of RF chains incurs no loss of optimality with respect to the fully digital precoding case. Finally, numerical results validate the effectiveness of the proposed algorithm and theoretical findings.

关键词： Multicasting limited RF chains hybrid precoding low complexity algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：