scholarly journals Channel equalization using watermark as a training sequence

2011 ◽  
Vol 9 ◽  
pp. 179-185
Author(s):  
M. K. Samee ◽  
J. Götze

Abstract. In this paper blind equalization algorithms based on digital watermarking are presented. Training sequence is sent along with the data in the form of watermark. Robust CDMA based watermarking algorithm is used to watermark the data. Watermark, which is spread over the data, does not consume extra bandwidth. So with the help of extracted watermark channel can be equalized just by using simple mean square algorithm. Two algorithms for equalization are proposed in this paper. In algorithm I the receiver does not require to know training sequence in advance. Using algorithm II, the sender does not require to send training sequence either, and data can still be equalized using simple LMS algorithm at low computational complexity.

Author(s):  
Zhiyong Liu ◽  
Zhoumei Tan ◽  
Fan Bai

AbstractTo improve the transmission efficiency and facilitate the realization of the scheme, an adaptive modulation (AM) scheme based on the steady-state mean square error (SMSE) of blind equalization is proposed. In this scheme, the blind equalization is adopted and no training sequence is required. The adaptive modulation is implemented based on the SMSE of blind equalization. The channel state information doesn’t need to be assumed to know. To better realize the adjustment of modulation mode, the polynomial fitting is used to revise the estimated SNR based on the SMSE. In addition, we also adopted the adjustable tap-length blind equalization detector to obtain the SMSE, which can adaptively adjust the tap-length according to the specific underwater channel profile, and thus achieve better SMSE performance. Simulation results validate the feasibility of the proposed approaches. Simulation results also show the advantages of the proposed scheme against existing counterparts.


2021 ◽  
Vol 11 (12) ◽  
pp. 5723
Author(s):  
Chundong Xu ◽  
Qinglin Li ◽  
Dongwen Ying

In this paper, we develop a modified adaptive combination strategy for the distributed estimation problem over diffusion networks. We still consider the online adaptive combiners estimation problem from the perspective of minimum variance unbiased estimation. In contrast with the classic adaptive combination strategy which exploits orthogonal projection technology, we formulate a non-constrained mean-square deviation (MSD) cost function by introducing Lagrange multipliers. Based on the Karush–Kuhn–Tucker (KKT) conditions, we derive the fixed-point iteration scheme of adaptive combiners. Illustrative simulations validate the improved transient and steady-state performance of the diffusion least-mean-square LMS algorithm incorporated with the proposed adaptive combination strategy.


2020 ◽  
Vol 11 (1) ◽  
pp. 344
Author(s):  
Pedro Ramos Lorente ◽  
Raúl Martín Ferrer ◽  
Fernando Arranz Martínez ◽  
Guillermo Palacios-Navarro

In the field of active noise control (ANC), a popular method is the modified filtered-x LMS algorithm. However, it has two drawbacks: its computational complexity higher than that of the conventional FxLMS, and its convergence rate that could still be improved. Therefore, we propose an adaptive strategy which aims at speeding up the convergence rate of an ANC system dealing with periodic disturbances. This algorithm consists in combining the organization of the filter weights in a hierarchy of subfilters of shorter length and their sequential partial updates (PU). Our contribution is threefold: (1) we provide the theoretical basis of the existence of a frequency-dependent parameter, called gain in step-size. (2) The theoretical upper bound of the step-size is compared with the limit obtained from simulations. (3) Additional experiments show that this strategy results in a fast algorithm with a computational complexity close to that of the conventional FxLMS.


Sign in / Sign up

Export Citation Format

Share Document