Adaptive Bit Loading With Reduced Computational Time and Complexity for Multicarrier Wireless Communications
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Aerospace and Electronic Systems"
DOI: 10.1109/taes.2019.2946505
Abstract: This correspondence presents an efficient bit loading technique that enables reduction of the time and computational complexity requirements for mobile wireless multicarrier communications, while satisfying certain bit-error-rate constraints. The complexity reduction is achieved by exploiting… read more here.
Keywords: computational time; time complexity; bit loading; complexity ... See more keywords
Time Complexity of In-Memory Matrix-Vector Multiplication
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Circuits and Systems II: Express Briefs"
DOI: 10.1109/tcsii.2021.3068764
Abstract: Matrix-vector multiplication (MVM) is the core operation of many important algorithms. Crosspoint resistive memory array enables naturally calculating MVM in one operation, thus representing a highly promising computing accelerator for various applications. To evaluate computing… read more here.
Keywords: tex math; inline formula; time complexity;
Time Complexity of In-Memory Solution of Linear Systems
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Electron Devices"
DOI: 10.1109/ted.2020.2992435
Abstract: In-memory computing (IMC) with cross-point resistive memory arrays has been shown to accelerate data-centric computations, such as the training and inference of deep neural networks, due to the high parallelism endowed by physical rules in… read more here.
Keywords: tex math; memory; time complexity; linear systems ... See more keywords
A Novel Normalized-Cut Solver with Nearest Neighbor Hierarchical Initialization.
Sign Up to like & getrecommendations! Published in 2023 at "IEEE transactions on pattern analysis and machine intelligence"
DOI: 10.1109/tpami.2023.3279394
Abstract: Normalized-Cut (N-Cut) is a famous model of spectral clustering. The traditional N-Cut solvers are two-stage: 1) calculating the continuous spectral embedding of normalized Laplacian matrix; 2) discretization via K-means or spectral rotation. However, this paradigm… read more here.
Keywords: normalized cut; cut; cut solver; initialization ... See more keywords