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

VLSI Architectures of Approximate Arithmetic Units Applied to Parallel Sensors Calibration

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2024年第3期71卷 1000-1013页

作者： da Rosa, Morgana Macedo Azevedo da Costa, Patricia Ucker Leleu da Costa, Eduardo Antonio Cesar Soares, Rafael I. Bampi, Sergio Univ Fed Pelotas UFPel Programade Posgrad Comp PPGC BR-96010770 Pelotas Brazil Univ Fed Rio Grande do Sul UFRGS PGMICRO BR-90010150 Porto Alegre Brazil Univ Catolica Pelotas UCPel Engn Elet & Comp MEEC BR-96015560 Pelotas Brazil

Approximate computing maximizes area and energysavings for a trade-off between quality and efficiency. Approx-imate arithmetic operators have emerged as an efficientalternative to design low-power VLSI circuits. This paper inves-tigates the design of approximate arithmetic operator unitsused in the calibration procedure for radio astronomy lightsensors - the so-called StEFCal (statistically efficient and fastcalibration) method. The StEFCal algorithm comprises arith-metic operations like a divider, square-accumulate (SAC), andmultiply-accumulate (MAC) units. The StEFCal circuit of thiswork explores the following arithmetic operators: i) two approx-imate squarer units from the literature, i.e., radix-4 (AxRSU) andSquASH, ii) two approximate iterative-based Newton-Raphson(NR) and Goldschmidt (GLD) dividers, iii) one approximateparallel prefix adder (AxPPA), and iv) a new approximateradix-4 multiplier (AxRMU), proposed in this work, exploredin the StEFCal multiply-accumulate circuit design. The AxRSUutilizes the parametersK1 andK2 to represent the number ofexact encoders for squarer- and conventional-partial products,respectively, subsequently replaced with approximate *** same principle applies to AxRMU, where the parameterKindicates the number of exact encoders for conventional-partialproducts, subsequently exchanged with approximate *** demonstrate the efficiency of StEFCal using the approximatearithmetic operators from the Pareto-optimal front that expressesthe area- and power-quality trade-off. The results show that usingthe AxRSU withK1=4 andK2=6, AxRMU, and AxPPA withK=16 and NR with one iteration has an MSE equal to 89.98dBand offers up to 158xenergy-savings compared to the exactStEFCal, and up to 25xmore energy-savings and 3.33xarea-savings compared with our previous work, 440xenergy-savingscompared to the accurate state-of-the-art, and 258xcomparedwith the approximate state-of-the-art.

关键词： Adders Calibration Approximation algorithms Arithmetic Radio astronomy Very large scale integration signal processing algorithms VLSI StEFCal AxRSU AxRMU AxPPA SquASH Newton-Raphson Goldschmidt

来源：评论

学校读者我要写书评

暂无评论

ICASSP 2023 Acoustic Echo Cancellation Challenge

IEEE OPEN JOURNAL OF SIGNAL PROCESSING

引用

IEEE OPEN JOURNAL OF signal processing 2024年 5卷 675-685页

作者： Cutler, Ross Saabas, Ando Parnamaa, Tanel Purin, Marju Indenbom, Evgenii Ristea, Nicolae-Catalin Guzvin, Jegor Gamper, Hannes Braun, Sebastian Aichner, Robert Microsoft Corp Redmond WA 98052 USA

The ICASSP 2023 Acoustic Echo Cancellation Challenge is intended to stimulate research in acoustic echo cancellation (AEC), which is an important area of speech enhancement and is still a top issue in audio communication. This is the fourth AEC challenge and it is enhanced by adding a second track for personalized acoustic echo cancellation, reducing the algorithmic + buffering latency to 20 ms, as well as including a full-band version of AECMOS (Purin et al., 2020). We open source two large datasets to train AEC models under both single talk and double talk scenarios. These datasets consist of recordings from more than 10,000 real audio devices and human speakers in real environments, as well as a synthetic dataset. We open source an online subjective test framework and provide an objective metric for researchers to quickly test their results. The winners of this challenge were selected based on the average mean opinion score (MOS) achieved across all scenarios and the word accuracy (WAcc) rate.

关键词： Measurement signal processing algorithms Speech enhancement Echo cancellers Acoustics Training Recording Acoustic echo cancellation deep learning speech enhancement speech quality assessment subjective test

来源：评论

学校读者我要写书评

暂无评论

Low Cost Variable Step-Size LMS With Maximum Similarity to the Affine Projection Algorithm

IEEE OPEN JOURNAL OF SIGNAL PROCESSING

引用

IEEE OPEN JOURNAL OF signal processing 2024年 5卷 82-91页

作者： Ferrer, Miguel De Diego, Maria Gonzalez, Alberto Univ Politecn Valencia UPV Inst Telecommun & Multimedia Applicat iTEAM Valencia 46022 Spain

The LMS algorithm is widely employed in adaptive systems due to its robustness, simplicity, and reasonable performance. However, it is well known that this algorithm suffers from a slow convergence speed when dealing with colored reference signals. Numerous variants and alternative algorithms have been proposed to address this issue, though all of them entail an increase in computational cost. Among the proposed alternatives, the affine projection algorithm stands out. This algorithm has the peculiarity of starting from $N$ data vectors of the reference signal. It transforms these vectors into as many data vectors suitably normalized in energy and mutually orthogonal. In this work, we propose a version of the LMS algorithm that, similar to the affine projection algorithm, starts from $N$ data vectors of the reference signal but corrects them by using only a scalar factor that functions as a convergence step. Our goal is to align the behavior of this algorithm with the behavior of the affine projection algorithm without significantly increasing the computational cost of the LMS.

关键词： signal processing algorithms Convergence Projection algorithms Computational efficiency Approximation algorithms Costs Robustness Adaptive filters affine projection algorithm variable step-size

来源：评论

学校读者我要写书评

暂无评论

Binaural Multichannel Blind Speaker Separation With a Causal Low-Latency and Low-Complexity Approach

IEEE OPEN JOURNAL OF SIGNAL PROCESSING

引用

IEEE OPEN JOURNAL OF signal processing 2024年 5卷 238-247页

作者： Westhausen, Nils L. Meyer, Bernd T. Carl Von Ossietzky Univ Oldenburg Commun Acoust D-26129 Oldenburg Germany Cluster Excellence Hearing4All D-26129 Oldenburg Germany

In this article, we introduce a causal low-latency low-complexity approach for binaural multichannel blind speaker separation in noisy reverberant conditions. The model, referred to as Group Communication Binaural Filter and Sum Network (GCBFSnet) predicts complex filters for filter-and-sum beamforming in the time-frequency domain. We apply Group Communication (GC), i.e., latent model variables are split into groups and processed with a shared sequence model with the aim of reducing the complexity of a simple model only containing one convolutional and one recurrent module. With GC we are able to reduce the size of the model by up to 83% and the complexity up to 73% compared to the model without GC, while mostly retaining performance. Even for the smallest model configuration, GCBFSnet matches the performance of a low-complexity TasNet baseline in most metrics despite the larger size and higher number of required operations of the baseline.

关键词： Complexity theory Low latency communication Speech enhancement Convolution signal processing algorithms Microphones MIMO communication Binaural low-latency multi-channel real-time speaker-separation

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Model for CS-Based signal Recovery for IRS-Assisted Near-Field THz MIMO System

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY

引用

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY 2024年 5卷 1326-1335页

作者： Sharma, Vaishali Keshari, Prakhar Sharma, Sanjeev Deka, Kuntal Krejcar, Ondrej Bhatia, Vimal Indian Inst Technol Indore Dept Elect Engn Indore 453552 India Indian Inst Technol BHU Varanasi Dept Elect Engn Varanasi 221005 India Indian Inst Technol Guwahati Dept Elect & Elect Engn Gauhati 781039 India Skoda Auto Univ Mlada Boleslav 29301 Czech Republic Univ Teknol Malaysia Malaysia Japan Int Inst Technol Skudai 81310 Malaysia Soochow Univ Sch Elect & Informat Engn Suzhou 215006 Jiangsu Peoples R China

Terahertz (THz) communication is a cutting-edge technology for the sixth-generation (6G) networks, offering vast bandwidths and data rates up to terabits per second, significantly advancing vehicular connectivity and services. However, THz signals are impacted by attenuation, path loss, and beam misalignment. Furthermore, the requisite high Nyquist sampling rates for THz systems increase the computational and system complexity of the receiver. A promising solution to navigate these obstacles involves the use of intelligent reflecting surfaces (IRS)-enhanced multiple-input multiple-output (MIMO) technology, which steers THz wave propagation. However, the substantial dimensions associated with IRS and MIMO extend the near-field, particularly at THz frequencies, as indicated by the Rayleigh distance and suffer from beam squint. To reduce system complexity and reduce sampling to sub-Nyquist rate, we propose a novel receiver design for an IRS-assisted near-field MIMO THz system that employs low-complexity compressed sensing. This method introduces an IRS signal-matched (IRSSM) measurement matrix with beam squint for capturing the transmitted signal at a sub-Nyquist rate, taking advantage of the sparsity in the signal and THz channels, and signal recovery using the deep learning (DL) model. Simulation results for symbol error rate (SER) and normalized mean square error (NMSE) performance indicate that the proposed DL-based receiver outperforms conventional recovery algorithms based on orthogonal matching pursuit (OMP) CS-recovery and dictionary-shrinkage estimation (DSE).

关键词： Terahertz communications Receivers Terahertz radiation Channel estimation Array signal processing Symbols signal processing algorithms THz band symbol detection compressed sensing MIMO DNN near-field beam squint

来源：评论

学校读者我要写书评

暂无评论

With signal processing Support, Prosthetics Are Becoming Safer, More Natural, and Increasingly Sensitive

引用

IEEE signal processing MAGAZINE 2021年第4期38卷 8-11页

作者： Edwards, John Technol Gilbert Gilbert AZ 85234 USA

Ongoing prosthetics research is leading to systems that adapt to users rather than forcing users to accommodate the prosthesis Market research and consulting firm Precedence Research forecasts that the prosthetics market will reach approximately US$13.2 billion by 2027, expanding at a compound annual growth rate of 4.8% from 2020 to 2027. A new generation of breakthrough technologies is helping to propel the growth of the prosthetics market. Significant progress is being made in multiple areas, including usability, safety, performance, and control. signal processing is playing a major role in all of these key areas.

关键词： Prosthetics Biomdical equipment Medical devices Market research Sensor systems Machine learning algorithms signal processing algorithms Tactile sensors Medical robotics Perturbation methods

来源：评论

学校读者我要写书评

暂无评论

Winograd for NTT: A Case Study on Higher-Radix and Low-Latency Implementation of NTT for Post Quantum Cryptography on FPGA

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2024年第12期71卷 6396-6409页

作者： Mandal, Suraj Roy, Debapriya Basu Indian Inst Technol Kanpur Dept Comp Sci & Engn Kanpur 208016 India

Number Theoretic Transform (NTT) plays an important role in efficiently implementing lattice-based cryptographic algorithms like CRYSTALS-Kyber, Dilithium, and FALCON. Existing implementations of NTT for these algorithms are mostly based on radix-2 or radix-4 realization of Cooley-Tukey and Gentleman-Sande architectures. In this work, we explore an alternative method of performing NTT known as Winograd's NTT that requires fewer number of modular multipliers than the conventional Coole-Tukey/Gentleman-Sande for higher radix NTT. We have proposed three different low-latency implementations of Winograd's NTT, applicable to CRYSTALS-Dilithium, FALCON, and CRYSTALS-Kyber, respectively. Our first implementation of Winograd NTT focuses on radix- 16 NTT multiplication unit for polynomials of length 256 and can be directly used for CRYSTALS-Dilithium. The NTT of CRYSTALS-Dilithium is also benefited from our proposed K-RED modular multiplication. Our radix-16-based Winograd outperforms existing Cooley-Tukey/Gentleman-Sande based NTT multipliers of CRYSTALS-Dilithium. Our second implementation of NTT is based on radix- 8 Winograd structure with a novel modular multiplication method that targets polynomials of length 512 and can be directly applied for FALCON. For CRYSTALS-Kyber, we have designed a radix-16 Winograd Butterfly Unit (BFU) that can be configured as two parallel radix-8 Winograd BFUs during mixed-radix computation. To the best of our knowledge, this is the first work that applied the Winograd technique for NTT multiplication for post-quantum secure lattice-based cryptographic algorithms.

关键词： Polynomials Logic gates signal processing algorithms Pulse width modulation Low latency communication Memory management Adders Pipelines Homomorphic encryption Field programmable gate arrays Number theoretic transformation (NTT) CRYSTALS-Dilithium FALCON CRYSTALS-Kyber Winograd

来源：评论

学校读者我要写书评

暂无评论

Frequency Domain Low Complexity Chase Reed-Solomon Decoding Under Blind Recognition Prior Conditions

引用

IEEE signal processing LETTERS 2025年 32卷 2080-2083页

作者： Chang, Yanyan Zhang, Wei Wu, Zhuolun Liu, Yanyan Tianjin Univ Sci & Technol Coll Elect Informat & Automat Tianjin 300457 Peoples R China Tianjin Univ Sch Microelect Tianjin 300072 Peoples R China Nankai Univ Coll Elect Informat & Opt Engn Tianjin 300071 Peoples R China

In non-cooperative communication systems, recognition and decoding are two key technologies that determine whether the receiving terminal can correctly decipher the information. To better utilize the prior information by recognition and improve the decoding performance, a novel frequency domain-low complexity chase (F-LCC) Reed-Solomon (RS) decoding scheme is proposed. Firstly, the relationship between recognition and decoding is analyzed, and the erroneous codewords to be decoded can be selected by analyzing the spectrogram obtained from recognition;Then, the eta-dynamically adjustable multiplicity assignment (eta-DAMA) algorithm is proposed by analyzing the channel soft information, where eta is the number of the most unreliable code positions. Wherein, the number of test vectors 2(eta) is modeled as a function of code length and bit error rate (BER), which solves the problem of traditional decoding algorithms relying on empirical values to determine eta. Simulations verify the frame error rate (FER) of the proposed F-LCC for decoding RS(255,239) with different signal-to-noise ratios (SNRs). The results show that the proposed F-LCC decoding scheme can achieve a gain of 0.3 dB and 0.15 dB compared with the decoding performance of the existing time domain-LCC (T-LCC) decoding scheme when eta=3 and eta=5, respectively.

关键词： Decoding Random access memory Polynomials signal processing algorithms Vectors Codes Complexity theory Bit error rate Time-domain analysis Encoding Recognition frequency domain decoding low-complexity chase (LCC) decoding Reed-Solomon (RS) multiplicity assignment

来源：评论

学校读者我要写书评

暂无评论

Body Motion Segmentation via Multilayer Graph processing for Wearable Sensor signals

IEEE OPEN JOURNAL OF SIGNAL PROCESSING

引用

IEEE OPEN JOURNAL OF signal processing 2024年 5卷 934-947页

作者： Deng, Qinwen Zhang, Songyang Ding, Zhi Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA Univ Louisiana Lafayette Dept Elect & Comp Engn Lafayette LA 70504 USA

Human body motion segmentation plays a major role in many applications, ranging from computer vision to robotics. Among a variety of algorithms, graph-based approaches have demonstrated exciting potential in motion analysis owing to their power to capture the underlying correlations among joints. However, most existing works focus on simpler single-layer geometric structures, whereas multi-layer spatial-temporal graph structure can provide more informative results. To provide an interpretable analysis on multilayer spatial-temporal structures, we revisit the emerging field of multilayer graph signal processing (M-GSP), and propose novel approaches based on M-GSP to human motion segmentation. Specifically, we model the spatial-temporal relationships via multilayer graphs (MLG) and introduce M-GSP spectrum analysis for feature extraction. We present two different M-GSP based algorithms for unsupervised segmentation in the MLG spectrum and vertex domains, respectively. Our experimental results demonstrate the robustness and effectiveness of our proposed methods.

关键词： Motion segmentation Computer vision Clustering algorithms signal processing algorithms signal processing Nonhomogeneous media Image segmentation multilayer graph signal processing unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Defect Location Analysis of CFRP Plates Based on Morphological Filtering Technique

引用

IEEE ACCESS 2025年 13卷 91065-91069页

作者： Peng, Yanlai Wu, Zhenyu Cheng, Xiaoying Shi, Lin Zhejiang Sci Tech Univ Natl Fac Mech Engn & Automat Hangzhou 310018 Peoples R China Zhejiang Sci Tech Univ Sch Sci Hangzhou 310018 Peoples R China

Carbon fiber reinforced polymers (CFRP) have become an essentials structural material in advanced manufacturing sectors, including new-energy vehicles and precision equipment, owing to their superior strength-to-weight ratio, exceptional fatigue resistance, and lightweight characteristics. However, CFRP components are prone to developing surface defects, such as microcracks, interlinear delamination, and porosity, during both manufacturing processes and their service life. These millimeter-scale imperfections can reduce structural integrity by up to 60%, potentially leading to catastrophic failures in safety-critical applications. Current nondestructive evaluation methods face challenges in reliably distinguishing genuine defects from surface texture artifacts while maintaining operational efficiency. In this study, we propose a novel defect localization method for CFRP plates using an advanced morphological filtering technique. The proposed approach employs opening and closing operations to effectively separate genuine defects from noise artifacts. A subsequent defec-region decision model was established to accurately identify and localize the damage features. The experimental results demonstrate that the method achieves rapid and precise localization of surface defects on CFRP plates, significantly enhancing detection accuracy and efficiency. This method not only overcomes the limitations of traditional inspection techniques but also provides a robust solution for real-time quality assessment in industrial applications.

关键词： Filtering Carbon Accuracy Filtering algorithms Location awareness Image edge detection Erosion Fault diagnosis Surface morphology signal processing algorithms CFRP defect localization morphological filtering structural elements

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：