-
641
Uncoordinated multiuser/MIMO channel estimation using superimposed training
Published 2014-07-01“…Compared to the existing ST schemes, the new proposed scheme has more flexible training sequences, better channel mean square error (NCMSE) and BER performance at low SNR, but retains a lower computation complexity. Simulation results corroborate the effectiveness of the new scheme.…”
Get full text
Article -
642
Two Symbol Expansion Methods and Their Application to Reversible Data Hiding
Published 2025-01-01“…The performance of the proposed simple method is comparable to or better than that of more advanced methods that rely on computationally complex prediction techniques.…”
Get full text
Article -
643
Channel-space endogenous anti-jamming method based on multi-reconfigurable intelligent surface
Published 2023-10-01“…In view of the concern that the traditional anti-jamming method based on jamming recognition is challenging to defend against both the unknown and the intelligent jamming attacks, a dynamic, heterogeneous, and redundant channel-space anti-jamming technique was proposed by adopting multiple reconfigurable intelligent surface (RIS), which facilitated the exploitation of channels’ resources for combating with the unknown jamming attacks.To elaborate, a channel-space endogenous anti-jamming method was proposed by leveraging the optimization of both the RIS’ coefficients and the multiple RIS’ on-off status.Firstly, after decoupling the tightly coupled variables, the optimal closed-form solutions of transmit precoder, RIS’ coefficients, and receive decoder could be derived under the alternative optimization framework.Then, the greedy algorithm was adopted to optimize the multiple RIS’ on-off status for obtaining better anti-jamming communications, and the convergence and the computation complexity of the proposed method was analyzed.Theoretical analysis and simulation results show that the proposed method can effectively defend against the uncertain jamming attacks.…”
Get full text
Article -
644
Direction Finding Using Multiple Sum and Difference Patterns in 4D Antenna Arrays
Published 2014-01-01“…The proposed direction-finding system covers a large field-of-view of up to ±60° and simultaneously maintains the advantages of monopulse systems, such as high angle precision and low computation complexity. Theoretical analysis and experimental results validate the effectiveness of the proposed system.…”
Get full text
Article -
645
The Research on Improved Companding Transformation for Reducing PAPR in Underwater Acoustic OFDM Communication System
Published 2016-01-01“…However the companding transformation has far less computation complexity than SLM or PTS technologies and can improve the BER performance compared to the amplitude limiting technique simultaneously. …”
Get full text
Article -
646
Optimization Based High-Speed Railway Train Rescheduling with Speed Restriction
Published 2014-01-01“…There are three prominent features of the framework, such as realized interaction with dispatchers, emphasized passengers’ satisfaction, and reduced computation complexity with a bilayer modeling approach. The proposed rescheduling model is simulated on the busiest part of Beijing to Shanghai high-speed railway in China. …”
Get full text
Article -
647
Multi-version consolidation method for block-level backup data
Published 2011-01-01“…Historical version backup data query efficiency was dependent on the version chain length in a multi-version backup data storage system.A novel block-level backup data multi-version consolidation method was presented for this problem.Any version of a historical full system snapshot could be generated within the incremental backup data version sequence.Theoretical analysis showed that it could increase the target snapshot version query efficiency significantly in the version chain.A variable-length block version merging algorithm was presented to decrease the computing complex-ity in the process of snapshot version merging,according to the block-level backup data distribution features.Finally,the concrete applications and performance analysis for block-level version consolidation method was also introduced.The simulated experiments results expose that the version consolidation method can eliminate redundant version of backup data with the same version chain length,and it can increase full system recovery efficiency than traditional methods sig-nificantly.…”
Get full text
Article -
648
Efficient Model Predictive Algorithms for Tracking of Periodic Signals
Published 2012-01-01“…The decomposition allows these two subproblems of very different computational complexities to be solved in parallel with different sampling rates. …”
Get full text
Article -
649
A Simplified Finite Control Set Model Predictive Control for T-Type Three-Level Power Conversion System Based on LCL Filter
Published 2021-01-01“…In order to overcome these issues, this paper proposes a simplified FCSMPC algorithm to reduce the computation complexity. Furthermore, full-dimensional state observers are adopted and implemented to estimate the instantaneous values of grid-side current and capacitor voltage for purpose of removing unnecessary electrical sensors. …”
Get full text
Article -
650
Multiobjective Synthesis of Linear Arrays by Using an Improved Genetic Algorithm
Published 2019-01-01“…To reduce the computation complexity, the repeat calculation of the fitness function in each generation is replaced by a precomputed discrete cosine transform matrix. …”
Get full text
Article -
651
Combination of MLFMA and ACA to Accelerate Computation of Scattering from Underground Targets
Published 2019-01-01“…Multilevel fast multipole algorithm (MLFMA) is used to decrease the computation complexity and memory cost. However, the octree used in MLFMA is not applied for rough surfaces and targets together; both the surface and target need to construct octree separately. …”
Get full text
Article -
652
Jointing sparse recovery estimation algorithm of underwater acoustic channels with long time delay spread
Published 2016-02-01“…At the same time, a large time delay spread posed significant difficulties such as large channel order and the corresponding huge computation complexity. Compressed sensing (CS)channel estimation algorithm offered a solution to this problem by exploiting the sparsity of channel to improve the estimation performance. …”
Get full text
Article -
653
Memristor-based feature learning for pattern classification
Published 2025-01-01“…However, since biological organs may operate differently from semiconductor devices, deep models usually require dedicated hardware and are computation-complex. High energy consumption has made deep model growth unsustainable. …”
Get full text
Article -
654
Efficient Iris Recognition Based on Optimal Subfeature Selection and Weighted Subregion Fusion
Published 2014-01-01“…The experimental results, on three public and renowned iris databases (CASIA-V3 Interval, Lamp, andMMU-V1), demonstrate that our proposed methods outperform some of the existing methods in terms of correct recognition rate, equal error rate, and computation complexity.…”
Get full text
Article -
655
Bi-GRU Enhanced Cost-Effective Memory-Aware End-to-End Learning for Geometric Constellation Shaping in Optical Coherent Communications
Published 2024-01-01“…Additionally, compared with the bi-directional long short-term memory (bi-LSTM) based GCS, the proposed bi-GRU scheme has lower computation complexity with similar system performance.…”
Get full text
Article -
656
Tone reservation technique combined with active constellation extension for PAPR reduction of OFDM signal
Published 2016-03-01“…To overcome the drawbacks of existing tone reservation(TR) techniques,an efficient TR algorithm combined with active constellation extension (ACE-TR) was proposed for reducing the peak-to-average power ratio (PAPR) of or-thogonal frequency division multiplexing (OFDM) signal.By means of a specially designed iterative procedure and a joint optimization approach for PAPR and bit-error-rate (BER) performances,ACE-TR was able to obtain both an im-proved BER and minimized out-of-band interference while reducing the PAPR effectively.A comprehensive theoretical analysis was presented,and some important results including the bounds of achievable PAPR gain,BER bound,and maximum iteration number were derived.Specifically,by adaptively adjusting the iterative parameters in the optimization approach,more trade-off flexibility between PAPR reduction and BER performance can be offered to satisfy various de-sign requirements.Simulations demonstrate that ACE-TR can dramatically decrease the number of required it ions to reach the desired PAPR with low computation complexity.In addition,the transmitted OFDM symbols using the pro-posed ACE-TR have less in-band distortion and lower out-of-band spectral regrowth than traditional TR algorithms.…”
Get full text
Article -
657
Frequency Resource Sharing and Allocation Scheme Based on Coalition Formation Game in Hybrid D2D-Cellular Network
Published 2015-01-01“…Compared with the exhaustive search, our algorithm has much lower computer complexity. In addition, we prove that stability and convergence of the proposed algorithm using the concept of a defection function. …”
Get full text
Article -
658
FloorLoc-SL: Floor Localization System with Fingerprint Self-Learning Mechanism
Published 2015-11-01“…This algorithm is low computation complexity, which can be operated on any mobile phones. …”
Get full text
Article -
659
-
660
A Novel Sparse Array for Localization of Mixed Near-Field and Far-Field Sources
Published 2021-01-01“…The largest consecutive lags and composition method of ESNA are also given, under a given number of sensors.Our algorithm has moderate computation complexity, which provides a higher resolution and improves the parameters’ estimation accuracy. …”
Get full text
Article