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

Efficient implementation of error-feedback LSL algorithm

ELECTRONICS LETTERS 1999年第16期35卷 1308-1309页

作者： Miranda, MD Gerken, M da Silva, MTM Univ Sao Paulo Escola Politecn Dept Elect Engn BR-05508900 Sao Paulo Brazil

An error feedback LSL algorithm is presented which has a reduced computational complexity and makes use of both a priori and a posteriori prediction errors. A simple numerical convention is proposed to assure numerical stability for poor persistent excitation. Simulation results illustrate that divisions can be implemented with reduced wordlength without leading to a significant decrease in the overall accuracy even in floating-point implementations. This fact allows the use of lookup tables for implementing divisions. Moreover, the proposed algorithm has an inherent parallelism that can be advantageously exploited for fast implementations.

关键词： least squares approximations table lookup error-feedback LSL algorithm Digital signal processing Interpolation and function approximation (numerical analysis) Signal processing theory errors filtering theory feedback echo suppression numerical stability parallel algorithms lookup tables prediction errors signal processing acoustic echo cancellation least squares lattice algorithm computational complexity reduction Filtering methods in signal processing real-time adaptive filtering Parallel programming and algorithm theory adaptive filters fast implementations wordlength reduction computational complexity

来源：评论

学校读者我要写书评

暂无评论

Femtocell base station clustering and logistic smooth transition autoregressive-based predicted signal-to-interference-plus-noise ratio for performance improvement of two-tier macro/femtocell networks

引用

IET SIGNAL PROCESSING 2016年第1期10卷 1-11页

作者： Lotfollahzadeh, Tahereh Kabiri, Sepideh Kalbkhani, Hashem Shayesteh, Mahrokh G. Urmia Univ Dept Elect Engn Orumiyeh Iran Sharif Univ Technol Wireless Res Lab ACRI Dept Elect Engn Tehran Iran

The aim of this study is to improve the performance of two-tier macro/femtocell networks using a power control approach. In wireless networks, power control plays an important role in improving a number of performance parameters such as co-channel interference and outage probability reduction, throughput increasing, and power saving. This study explores the evolution of centralised power control algorithm based on femtocell base station (FBS) clustering and predicted signal-to-interference-plus-noise ratio (SINR) of users. To reduce the computational complexity of centralised algorithm, dense deployed femtocells are considered in different clusters. In this case, femtocells inside one cluster make considerable interference to each other, while the interferences from femtocells of other clusters are negligible. Moreover, because of the non-linearity of SINR samples, non-linear logistic smooth transition autoregressive (LSTAR) model is used to model the SINR data, and then the next SINR samples are predicted from the previous samples. According to the clustered FBSs and predicted SINR, the proposed power control scheme is applied to femtocell network in the downlink. The results demonstrate that the introduced method improves the outage probability and throughput and outperforms previous methods significantly.

关键词： femtocellular radio pattern clustering autoregressive processes radiofrequency interference power control telecommunication power management centralised control computational complexity probability telecommunication network reliability femtocell base station clustering nonlinear logistic smooth transition autoregressive-based predicted signal-to-interference-plus-noise ratio two-tier macrocell network wireless networks centralised power control algorithm evolution FBS clustering SINR computational complexity reduction outage probability improvement two-tier femtocell network

来源：评论

学校读者我要写书评

暂无评论

New perspectives for the intelligent rolling stock classification in railways: an artificial neural networks-based approach

引用

JOURNAL OF THE BRAZILIAN SOCIETY OF MECHANICAL SCIENCES AND ENGINEERING 2024年第4期46卷 1-20页

作者： Dias, Ualison R. F. e Pinto, Arthur C. Vargas Monteiro, Henrique L. M. de Aguiar, Eduardo Pestana Univ Fed Juiz de Fora Grad Program Elect Engn Rua Jose Lourenco Kelmer BR-36036900 Juiz De Fora MG Brazil Univ Fed Lavras Inst Sci Technol & Innovat Ave Antonio Carlos Pinheiro Alcantara855-Jardim M BR-37950000 Sao Sebastiao Paraiso MG Brazil Univ Fed Juiz de Fora Dept Mech Engn Rua Jose Lourenco Kelmer BR-36036900 Juiz De Fora MG Brazil

In railway operations, several factors must be analyzed, such as operation cost, maintenance stops, failures, and others. One of these important topics is the analysis of the Hot Box and Hot Wheel due to the failure of these components. It can compromise the entire operation, resulting in serious accidents, such as train derailments. Thus, the use of a method that is able to classify a failure is essential for accident prevention. The innovative use of Multilayer Perceptron combined with Set-Membership for the Hot Box and Hot Wheels binary classification problem enhances failure prediction and contributes to accident prevention. Unlike the reported models in the literature, Set-Membership Multilayer Perceptron excels in learning from the nonlinear and intricate patterns of this data set. In addition, as aforementioned, its ability to update representations and patterns with new data avoids frequent retraining, ensuring a more efficient and adaptable solution. Besides that, the proposed model presents a better performance in terms of Accuracy and other metrics compared to other literature works. To validate the performance, we compare twelve models applied in eight data sets, seven of which are benchmarks, and one is composed of Hot Box and Hot Wheels problems.

关键词： Adaptive algorithms Artificial neural networks computational complexity reduction Set-membership Multilayer perceptron

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of cell edge users with fractional coordinated fair scheduling

引用

IET COMMUNICATIONS 2014年第13期8卷 2315-2321页

作者： Abiri, Majid Mehrjoo, Mehri Univ Sistan & Baluchestan Dept Telecommun Engn Zahedan *** Iran

In this study, the authors propose a fractional coordinated fair scheduling (FCFS) scheme for improving the performance of cell edge users in long term evolution (LTE-advanced) networks. To enhance the network spectral efficiency and reduce co-channel interference, they extend the inter-cell interference coordination technique for multi-sector cells. The sectors are coordinated in the sense that they are allowed to transmit simultaneously, if the neighbouring sectors co-channel interference is less than a threshold value. Accordingly, a coordinated scheduling scheme is proposed to transmit to a fraction of users, located in cell edges, with good channel conditions. The proposed scheme maintains fairness among the users using alpha-fair criterion. Furthermore, to reduce the computational complexity of the scheduling scheme, they propose a heuristic algorithm based on choosing an appropriate subset of users for scheduling computations. Performance evaluation of FCFS shows that the cell edge users' throughput improves because of the spectral efficiency enhancement and interference reduction. Moreover, FCFS achieves a higher fairness index with respect to a non-coordinated fair scheme.

关键词： cellular radio Long Term Evolution interference suppression cochannel interference cell edge users FCFS scheme fractional coordinated fair scheduling scheme performance improvement LTE-advanced networks network spectral efficiency cochannel interference reduction intercell interference coordination technique multisector cells threshold value cell edges channel conditions alpha-fair criterion computational complexity reduction heuristic algorithm spectral efficiency enhancement fairness index

来源：评论

学校读者我要写书评

暂无评论

Ant-colony algorithm with interference cancellation for cooperative transmission

引用

IET SIGNAL PROCESSING 2016年第6期10卷 603-610页

作者： Ab Ghani, Hadhrami Hamzah, Mohd Hazmi Syahali, Syabeela Aziz, Nor Hidayati Abdul Multimedia Univ Fac Engn & Technol Bukit Beruang 75450 Melaka Malaysia

Despite the large bandwidth available for all users in high-speed wireless networks, resources allocation and user scheduling remain essential to combat interference, increase throughput and reduce complexity. As the number of users increases, the computational complexity tends to increase significantly. The trade-off between the complexity reduction and capacity improvement is the challenge. Hence a unique ant-colony optimisation method is implemented with successive interference cancellation to reduce complexity and provide higher capacity to more users. The incurred complexity is at least 50% less than other schemes. The average mean square error achieved is around 4 dB smaller than that of the existing scheme.

关键词： ant colony optimisation interference suppression cooperative communication radio networks resource allocation telecommunication scheduling communication complexity radiofrequency interference mean square error methods cooperative transmission wireless network resource allocation user scheduling computational complexity reduction ant-colony optimisation method successive interference cancellation mean square error method

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving biometric-based remote authentication with secure processing unit on untrusted server

引用

IET BIOMETRICS 2019年第1期8卷 79-91页

作者： Thi Ai Thao Nguyen Tran Khanh Dang Ho Chi Minh City Univ Technol VNUHCM Fac Comp Sci & Engn Ho Chi Minh City Vietnam

Biometric-based authentication systems offer undeniable benefits to users. However, biometric features are vulnerable to attacks, especially those happening over transmission network or at the stored biometric templates. In this work, we propose a novel biometric-based remote authentication framework to deal with malicious attacks over the transmission channel and at the untrusted server. More concretely, the proposed framework is not only resistant against attacks on the network but also protects biometric templates stored in the untrusted server's database, thanks to the combination of fuzzy commitment protocol and non-invertible transformation techniques. The notable feature as compared to previous biometric based remote authentication framework is its ability to defend the sensitive data against different kinds of insider attacks. The server's administrator is incapable of utilizing information saved in its database to impersonate the clients and deceive the whole system because secure computing in the server is guaranteed by employing a secure coprocessor embedded in the server. In addition, the system performance is maintained with the support of random orthonormal project, which reduces computational complexity while preserving its accuracy.

关键词： coprocessors data privacy computational complexity message authentication authorisation fuzzy set theory cryptographic protocols network servers computer network security insider attacks secure computing secure processing unit untrusted server biometric-based authentication systems biometric features transmission network stored biometric templates novel biometric-based remote authentication framework malicious attacks transmission channel noninvertible transformation techniques untrusted server database fuzzy commitment protocol technique noninvertible transformation technique computational complexity reduction secure coprocessor privacy preserving biometric-based remote authentication

来源：评论

学校读者我要写书评

暂无评论

Zero coefficient-aware fast butterfly-based inverse discrete cosine transform algorithm

引用

IET IMAGE PROCESSING 2016年第2期10卷 89-100页

作者： Park, Sang-hyo Choi, Kiho Jang, Euee S. Hanyang Univ Digital Media Lab Seoul 133791 South Korea

The latest video coding standards, including Moving Picture Experts Group-4 (MPEG-4) advanced video coding (AVC)/H.264 and high-efficiency video coding (HEVC), use a discrete cosine transform (DCT) process as the core for compression efficiency, sacrificing the computational complexity at decoder. There have been a number of attempts to reduce the complexity of inverse DCT (IDCT). Butterfly-based factorisation remains the most commonly used method for such a reduction. In this study, the authors propose a zero (Z) coefficient-aware fast butterfly-based IDCT algorithm for video decoding. They focus on a reduction in the computational complexity of the butterfly-based 8 x 8 IDCT by removing the unnecessary computations of one-dimensional (1D) IDCT kernels, and adaptively applying IDCT kernels based on the number of non-Z DCT coefficients to speed-up 1D data. Their experimental results show that the average operation numbers using the proposed IDCT is approximately half that for the 8 x 8 IDCT implemented in the MPEG-4 AVC/H.264 and HEVC reference software. The improved computational complexity of the proposed method is demonstrated by measuring the running time, which requires only one-half of the IDCT time using the reference software.

关键词： video coding inverse transforms discrete cosine transforms data compression computational complexity zero coefficient-aware fast butterfly-based IDCT algorithm inverse discrete cosine transform algorithm Moving Picture Experts Group-4 advanced video coding MPEG-4 H.264 high-efficiency video coding HEVC reference software inverse DCT algorithm compression efficiency computational complexity reduction butterfly-based factorisation 1D IDCT kernels non Z DCT coefficients

来源：评论

学校读者我要写书评

暂无评论

Variational message passing-based localisation algorithm with Taylor expansion for wireless sensor networks

引用

IET COMMUNICATIONS 2016年第17期10卷 2396-2401页

作者： Cui, Jianhua Wang, Zhongyong Zhang, Chuanzong Zhu, Zhengyu Sun, Peng Natl Digital Switching Syst Engn & Technol Res Ct Zhengzhou Peoples R China Luoyang Normal Univ Sch Phys & Elect Informat Luoyang Peoples R China Zhengzhou Univ Sch Informat Engn Zhengzhou Peoples R China Aalborg Univ Dept Elect Syst Aalborg Denmark

For localisation algorithms of wireless sensor networks (WSNs), the communication overhead and the computational complexity are two main bottlenecks that should be considered beside the positioning accuracy. In this study, the authors focus on cooperative localisation in WSNs and propose a low-complexity distributed cooperative localisation algorithm by employing variational message passing (VMP) on factor graphs. In order to decrease the communication overhead, Gaussian parametric message representation is adopted. With regard to the non-Gaussian messages caused by the non-linear ranging model, they approximate them to Gaussian messages by exploiting second-order Taylor expansion to reduce the computational complexity. Simulation results show that the proposed algorithm performs quite similar to sum-product algorithm over a wireless network and Gaussian VMP algorithm based on minimising Kullback-Leibler divergence with lower computational complexity.

关键词： wireless sensor networks cooperative communication graph theory series (mathematics) computational complexity minimisation approximation theory inference mechanisms telecommunication computing variational message passing-based localisation algorithm second-order Taylor expansion wireless sensor networks WSN communication overhead computational complexity reduction low-complexity distributed cooperative localisation algorithm factor graphs Gaussian parametric message representation nonlinear ranging model sum-product algorithm Gaussian VMP algorithm Kullback-Leibler divergence minimisation

来源：评论

学校读者我要写书评

暂无评论

Modelling correlation degree between two adjacent signalised intersections for dynamic subarea partition

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2013年第1期7卷 28-35页

作者： Bie, Yiming Wang, Dianhai Qu, Xiaobo Harbin Inst Technol Sch Transportat Sci & Engn Harbin 150091 Heilongjiang Peoples R China Zhejiang Univ Dept Civil Engn & Architecture Hangzhou 310058 Zhejiang Peoples R China Griffith Univ Griffith Sch Engn Nathan Qld 4222 Australia

Correlation degree between adjacent signalised intersections is considered as the most important component in subarea partition algorithm. In this study, contributing factors for subarea partition are selected by taking into consideration the differences with respect to cycle lengths, link length and path flow between upstream and downstream coordinated phases. Their impacts on performance index of subarea partition are further studied using numerical experiments. The study then proceeds to propose a correlation degree index (CI) as an alternative for the performance index in order to reduce the computational complexity. The relationship between CI and the contributing factors is established to predict the correlation degree. Finally, the model is validated using field survey data.

关键词： computational complexity correlation methods performance index road traffic control correlation degree modelling adjacent signalised intersections dynamic subarea partition algorithm cycle lengths link length path flow upstream coordinated phases downstream coordinated phases performance index correlation degree index CI computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Adaptive low-complexity motion estimation algorithm for high efficiency video coding encoder

引用

IET IMAGE PROCESSING 2016年第6期10卷 438-447页

作者： Medhat, Ahmed Shalaby, Ahmed Sayed, Mohammed Sharaf Elsabrouty, Maha Mehdipour, Farhad E JUST ECE Dept Alexandria Egypt Zagazig Univ ECE Dept Zagazig Egypt Kyushu Univ E JUST Ctr Fukuoka 812 Japan WaioMio Ltd Auckland New Zealand

High quality videos became an essential requirement in recent applications. High efficiency video coding (HEVC) standard provides an efficient solution for high quality videos at lower bit rates. On the other hand, HEVC comes with much higher computational cost. In particular, motion estimation (ME) in HEVC, consumes the largest amount of computations. Therefore, fast ME algorithms and hardware accelerators are proposed in order to speed-up integer ME in HEVC. This study presents a fast centre search algorithm (FCSA) and an adaptive search window algorithm (ASWA) for integer pixel ME in HEVC. In addition, centre adaptive search algorithm, a combination of the two proposed algorithms FCSA and ASWA, is proposed in order to achieve the best performance. Experimental results show notable speed-up in terms of encoding time and bit rate saving with tolerable peak signal-to-noise ratio (PSNR) quality degradation. The proposed fast search algorithms reduce the computational complexity of the HEVC encoder by 57%. This improvement is accompanied with a modest average PSNR loss of 0.014 dB and an increase by 0.6385% in terms of bit rate when compared with related works.

关键词： image resolution search problems computational complexity video coding motion estimation adaptive low-complexity motion estimation algorithm high efficiency video coding encoder HEVC standard bit rate saving computational cost fast ME algorithms fast centre search algorithm FCSA adaptive search window algorithm ASWA centre adaptive search algorithm encoding time peak signal-to-noise ratio quality degradation computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：