-
81
Improved QRD-M Detection Algorithm for Generalized Spatial Modulation Scheme
Published 2017-01-01“…It will lead to imperfect detection performance with relatively high computational complexity by directly applying the original QR-decomposition with M algorithm (QRD-M) to the GSM scheme. …”
Get full text
Article -
82
Fast Mode Decision for 3D-HEVC Depth Intracoding
Published 2014-01-01“…Experimental results show that the proposed algorithm can significantly reduce computational complexity of 3D-HEVC depth intracoding while maintaining coding efficiency.…”
Get full text
Article -
83
Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes
Published 2025-01-01“…Users can select the method that best suits their needs — whether prioritizing computational complexity or accuracy — by referring to our map.…”
Get full text
Article -
84
Deep Learning–Based Prediction of Freezing of Gait in Parkinson's Disease With the Ensemble Channel Selection Approach
Published 2025-01-01“…Conclusion The reduced computational complexity enables real‐time monitoring. Our approach demonstrates substantial improvements in classification results compared to traditional deep learning methods.…”
Get full text
Article -
85
A Network Traffic Prediction Model Based on Layered Training Graph Convolutional Network
Published 2025-01-01“…The conventional model that extracts space-correlated features of traffic flow have the problem of high computational complexity and long training time which limits the model’s application on rapid routing deployment. …”
Get full text
Article -
86
Practically Efficient Blind Speech Separation Using Frequency Band Selection Based on Magnitude Squared Coherence and a Small Dodecahedral Microphone Array
Published 2012-01-01“…The estimated reduction in the computational complexity is 90% with a 68% reduction in the number of frequency bands. …”
Get full text
Article -
87
Novel direct sequence spread spectrum communication method
Published 2023-12-01“…In response to the problem of limited performance and low spectral efficiency in complex multipath environments of traditional direct sequence spread spectrum communication, a cyclic prefix (CP) block transmission structure spread spectrum system with a time-frequency hybrid direct sequence spread spectrum receiver structure was proposed.The system adopted maximum ratio combination (MRC) in the frequency domain to achieve equalization and de-spreading processes simultaneously, while achieving optimal reception performance and omitting the IFFT process to reduce computational complexity significantly.On this basis, it was proposed to replace the m-sequence with the constant amplitude zero auto correlation (CAZAC) sequence as the spread spectrum sequence, which significantly improved the system performance without increasing computational complexity.Finally, a high-speed spread spectrum communication method based on cyclic code shift keying (CCSK) was proposed to solve the problems of low spectrum utilization efficiency and limited transmission rate in traditional direct sequence spread spectrum.By utilizing the property of Fourier transform time-domain cyclic shift, a low implementation complexity CCSK decoding method was designed, which reduced the multiplication number required for CCSK de-spreading by O(N<sup>2</sup>) reduced to O (Nlog N), greatly reducing resource consume.The simulation results show that compared to existing direct sequence spread spectrum methods, the proposed method achieves approximately 3 dB gain in both Gaussian and complex multipath channel environments.…”
Get full text
Article -
88
Reconstruction of Optical Coherence Tomography Images from Wavelength Space Using Deep Learning
Published 2024-12-01“…Furthermore, we illustrate the computational complexity reduction by harnessing the power of DL models. …”
Get full text
Article -
89
A Novel Method for DOA and Time Delay Joint Estimation in Multipath OFDM Environment
Published 2020-01-01“…Furthermore, methods proposed in this paper have much less computational complexity and better estimation performance compared with the multidimensional spectral peak search methods.…”
Get full text
Article -
90
Sparse Regularization With Reverse Sorted Sum of Squares via an Unrolled Difference-of-Convex Approach
Published 2025-01-01“…These include developing an algorithm grounded in theory, not heuristics, reducing computational complexity, enabling the automatic determination of numerous parameters, and ensuring the number of iterations remains feasible. …”
Get full text
Article -
91
PAPR Reduction Using Fireworks Search Optimization Algorithm in MIMO-OFDM Systems
Published 2018-01-01“…In this paper, a reduced computational complexity PTS scheme is proposed, based on a novel swarm intelligence algorithm, called fireworks algorithm (FWA). …”
Get full text
Article -
92
A modified algorithm of 'forward-backward' solving the identification of automata Markov models
Published 2018-09-01“…The estimates of the computational complexity of the proposed identification algorithms have been calculated. …”
Get full text
Article -
93
Ways to improve the accuracy of the harmonic method for simulating two-dimensional signals
Published 2024-04-01“…Weaknesses are revealed, such as insufficient accuracy and high computational complexity, which are characteristic of spectral simulation methods in general, including the harmonic method. …”
Get full text
Article -
94
XTNSR: Xception-based transformer network for single image super resolution
Published 2025-01-01“…The model processes grid-like image patches effectively and reduces computational complexity by integrating a Patch Embedding layer. …”
Get full text
Article -
95
Edge and texture aware image denoising using median noise residue U-net with hand-crafted features
Published 2025-01-01“…In addition, the model was found to be less expensive, with low computational complexity.…”
Get full text
Article -
96
Semidefinite relaxation detector for higher-order modulated multiple-antenna systems
Published 2007-01-01“…A semidefinite relaxation detector of 64-QAM signals was proposed,which is derived from rank relaxation and Lagrange bidual programming respectively.Computational complexity analyses and simulation results demonstrate the detector can make a good tradeoff between complexity and performance.…”
Get full text
Article -
97
GS-LinYOLOv10: A drone-based model for real-time construction site safety monitoring
Published 2025-05-01“…These innovations reduce computational complexity while significantly improving detection accuracy. …”
Get full text
Article -
98
Resource Allocation in D2D-Enabled 5G Networks Using Multiagent Reinforcement Learning
Published 2024-01-01“…Staggered training improves agent performance and minimizes computational complexity by training agents one at a time in a sequential manner. …”
Get full text
Article -
99
Vehicle-to-Vehicle Communication Channel Estimator Based on Gate Recurrent Unit
Published 2025-01-01“…At the same time, the computational complexity of the algorithm has been reduced to some extent, allowing the estimator to complete the channel estimation faster. …”
Get full text
Article -
100
DLiGRU-X: Efficient X-Vector-Based Embeddings for Small-Footprint Keyword Spotting System
Published 2025-01-01“…The DLiGRU-X model enhances temporal feature extraction with a LiGRU and reduces computational complexity through dilated convolution techniques. …”
Get full text
Article