In this paper, a new class of recursive hybrid filtering structures is proposed for impulsive noise removal;the so-called recursive myriad-mean (RMyM) filters. More precisely, the output of the RMyM filter can be thou...
详细信息
In this paper, a new class of recursive hybrid filtering structures is proposed for impulsive noise removal;the so-called recursive myriad-mean (RMyM) filters. More precisely, the output of the RMyM filter can be thought of as the sum of two independent weighted M-filters: the nonlinear weighted myriad acting on a subset of input samples and the linear weighted mean acting on a subset of filter's previous outputs. The uncoupled structure of the proposed filters takes into account the benefits of both weighted M-estimators: the robustness against impulsive noise of the myriad operator and the desired spectral response induced by the linear feedback. Least mean absolute (LMA) based adaptive algorithms are developed for designing these filtering structures under the equation error formulation framework. The results of extensive simulations are shown to evaluate both the behavior of the adaptive algorithms as well as the performance of the proposed recursive filters against impulsive noise. Additionally, taking into account the uncoupled structure of the proposed recursive filters, a decision feedback equalizer (DFE) based on the RMyM filter is proposed, where its performance is compared to those yielded by various conventional DFE structures, under different conditions of impulsive noise. (C) 2017 Elsevier B.V. All rights reserved.
It is known that Turbo Product Codes (TPC) can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits (LRBs) are chosen empirically to keep the size of the test patterns (sequences) relati...
详细信息
ISBN:
(纸本)9781634392785
It is known that Turbo Product Codes (TPC) can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits (LRBs) are chosen empirically to keep the size of the test patterns (sequences) relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder's LRBs adapt to the external parameter of the decoder like signal SNR level, a novel adaptive algorithm for TPC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of multiplicity order of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance returned from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.03dB coding loss but the average complexity of the proposed algorithm is about 45% less compared with Pyndiah's iterative decoding algorithm using the fixed LRBs parameter.
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm co...
详细信息
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.
Artificial bee colony (ABC) algorithm is a novel biological-inspired optimization algorithm, which has many advantages compared with other optimization algorithm, such as less control parameters, great global optimiza...
详细信息
Artificial bee colony (ABC) algorithm is a novel biological-inspired optimization algorithm, which has many advantages compared with other optimization algorithm, such as less control parameters, great global optimization ability and easy to carry out. It has proven to be more effective than some evolutionary algorithms (EAs), particle swarm optimization (PSO) and differential evolution (DE) when testing on both benchmark functions and real issues. ABC, however, its solution search equation is poor at exploitation. For overcoming this insufficiency, two new solution search equations are proposed in this paper. They apply random solutions to take the place of the current solution as base vector in order to get more useful information. Exploitation is further improved on the basis of enhancing exploration by utilizing the information of the current best solution. In addition, the information of objective function value is introduced, which makes it possible to adjust the step-size adaptively. Owing to their respective characteristics, the new solution search equations are combined to construct an adaptive algorithm called MTABC. The methods our proposed balance the exploration and exploitation of ABC without forcing severe extra overhead in respect of function evaluations. The performance of the MTABC algorithm is extensively judged on a set of 20 basic functions and a set of 10 shifted or rotated functions, and is compared favorably with other improved ABCs and several state-of-the-art algorithms. The experimental results show that the proposed algorithm has a higher convergence speed and better search ability for almost all functions. (C) 2017 Elsevier B.V. All rights reserved.
Motivated by applications in genome sequencing, Grebinski andKucherov (Discret Appl Math 88: 147-165, 1998) studied the graph learning problem which is to identify a hidden graph drawn from a given class of graphs wit...
详细信息
Motivated by applications in genome sequencing, Grebinski andKucherov (Discret Appl Math 88: 147-165, 1998) studied the graph learning problem which is to identify a hidden graph drawn from a given class of graphs with vertex set {1, 2,..., n} by edge-detecting queries. Each query tells whether a set of vertices induces any edge of the hidden graph or not. For the class of all hypergraphs whose edges have size at most r, Chodoriwsky and Moura (Theor Comput Sci 592: 1-8, 2015) provided an adaptive algorithm that learns the class in O(m(r) log n) queries if the hidden graph has m edges. In this paper, we provide an adaptive algorithm that learns the class of all r-uniform hypergraphs in mr log n + (6e)(r)m(r+1/2) queries if the hidden graph has m edges.
A complete autonomous system consisting of a beam-steerable hemispherical square-loop antenna (HSLA) controlled by a Raspberry Pi is presented for optimizing the throughput in a scattered and a poor signal-to-noise ra...
详细信息
A complete autonomous system consisting of a beam-steerable hemispherical square-loop antenna (HSLA) controlled by a Raspberry Pi is presented for optimizing the throughput in a scattered and a poor signal-to-noise ratio environment. Four different indoor communication configurations at various distances were analyzed in the presence of interferences. In three configurations, HSLA performance was also compared to that of a standard monopole antenna link. It was found that HSLA can offer up to 1450% higher throughput and can withstand much higher interference levels before the system breaks. In terms of quality, this means sustaining compressed high-definition communications. In effect, it improves the system throughput for the test 2.4 GHz (802.11b/g/n) WiFi band. The uniqueness about the system is that it only uses single antenna for both sensing and communication. The algorithm works at application layer that controls the RF switch and antenna patterns at physical layer. Thus, the entire middle protocol layers are untouched. The system can easily be retrofitted to the existing nonadaptive communication systems.
This paper proposes a partial transmit sequences (PTS)based PAPR reduction method and a phase factor estimation method without side information for OFDM systems with QPSK and 16QAM modulation. In the transmitter, an i...
详细信息
This paper proposes a partial transmit sequences (PTS)based PAPR reduction method and a phase factor estimation method without side information for OFDM systems with QPSK and 16QAM modulation. In the transmitter, an iterative algorithm that minimizes the p-norm of a transmitted signal determines phase factors to reduce PAPR. Unlike conventional methods, the phase factors are allowed to take continuous values in a limited range. In the receiver, the phase factor is blindly estimated by evaluating the phase differences between the equalizer's output and its closest constellation points. Simulation results show that the proposed PAPR reduction method is more computationally efficient than the conventional PTS. Moreover, the combined use of the two proposed methods achieves a satisfactory tradeoff between PAPR and BER by limiting the phase factors properly.
The electromagnetic wave propagation in the chiral medium is governed by Maxwell's equations together with the Drude-Born-Fedorov (constitutive) equations. The problem is simplified to a two-dimensional scattering ...
详细信息
The electromagnetic wave propagation in the chiral medium is governed by Maxwell's equations together with the Drude-Born-Fedorov (constitutive) equations. The problem is simplified to a two-dimensional scattering problem, and is formulated in a bounded domain by introducing two pairs of transparent boundary conditions. An a posteriori error estimate associated with the truncation of the nonlocal boundary operators is established. Based on the a posteriori error control, a finite element adaptive strategy is presented for computing the diffraction problem. The truncation parameter is determined through sharp a posteriori error estimate. Numerical experiments are included to illustrate the robustness and effectiveness of our error estimate and the proposed adaptive algorithm.
The bulk of research in the field of precision guided airdrop systems has focused on improving landing accuracy in the presence of atmospheric winds that can exceed vehicle airspeed. One important challenge of parafoi...
详细信息
The bulk of research in the field of precision guided airdrop systems has focused on improving landing accuracy in the presence of atmospheric winds that can exceed vehicle airspeed. One important challenge of parafoil systems is their highly uncertain flight dynamic behavior and control response, which can result from canopy degradation or an offnominal inflation event. This significantly impacts the ability to reach the target and can often lead to very large miss distances. This work addresses guided airdrop system model uncertainty with a novel combined direct and indirect adaptive control strategy to quickly characterize vehicle dynamics and lateral control sensitivity in flight. Extensive simulation and experimental flight testing indicate that the proposed adaptive algorithm is capable of high-accuracy landing in a large variety of degraded conditions, including unknown nonlinear changes in control sensitivity as well as control reversals. In comparison, current industry standard algorithms experience over an order of magnitude decrease in accuracy when tested under identical scenarios.
Freehand three-dimensional (3D) ultrasound imaging is an attractive research area because it is capable of providing large field of view and high in-plane resolution image to allow better illustration of complex anato...
详细信息
Freehand three-dimensional (3D) ultrasound imaging is an attractive research area because it is capable of providing large field of view and high in-plane resolution image to allow better illustration of complex anatomy structures. However, reconstructed image is corrupted with speckle noise and artifacts in the conventional reconstructed volume data. In this paper, we propose a simple but effective adaptive kernel regression method for volume reconstruction from freehand swept B-scan images. By creating a linear model for estimating the homogeneous region of the B-scan image and learning the parameters of the model with a supervised learning method, the statistical characteristic of speckle can be well recovered. With the learned linear model of speckle, we can easily estimate the homogenous region and reconstruct image with speckle reduction and edge preservation via the adaptive turning of the smoothing parameters of the kernel regression. Our algorithm lends itself to parallel processing, and yields a 288 x speedup on a graphics processing unit (GPU). Experiments on the simulated data, ultrasonic abdominal phantom and in-vivo liver of human subject and comparisons with some classical and recent algorithms are used to demonstrate its improvements in both volume reconstruction accuracy and efficiency. (C) 2017 The Authors. Published by Elsevier B.V.
暂无评论