Reweighted lp Constraint LMS-Based Adaptive Sparse Channel Estimation for Cooperative Communication System
Institution of Engineering and Technology
MetadataDangos cofnod eitem llawn
This paper studies the issue of sparsity adaptive channel reconstruction in time-varying cooperative communication networks through the amplify-and-forward transmission scheme. A new sparsity adaptive system identification method is proposed, namely reweighted 𝒍𝒑 norm (𝟎 < 𝒑 < 𝟏) penalized least mean square（LMS）algorithm. The main idea of the algorithm is to add a 𝒍𝒑 norm penalty of sparsity into the cost function of the LMS algorithm. By doing so, the weight factor becomes a balance parameter of the associated 𝒍𝒑 norm adaptive sparse system identification. Subsequently, the steady state of the coefficient misalignment vector is derived theoretically, with a performance upper bounds provided which serve as a sufficient condition for the LMS channel estimation of the precise reweighted 𝒍𝒑 norm. With the upper bounds, we prove that the 𝒍𝒑 (𝟎 < 𝒑 < 𝟏 ) norm sparsity inducing cost function is superior to the reweighted 𝒍𝟏 norm. An optimal selection of 𝒑 for the 𝒍𝒑 norm problem is studied to recover various 𝒅 sparse channel vectors. Several experiments verify that the simulation results agree well with the theoretical analysis, and thus demonstrate that the proposed algorithm has a better convergence speed and better steady state behavior than other LMS algorithms.
Zhang, A., Liu, P., Ning, B. and Zhou, Q. (2019) 'Reweighted lp Constraint LMS-Based Adaptive Sparse Channel Estimation for Cooperative Communication System'. DOI: 10.1049/iet-com.2018.6186.
Dynodwr Gwrthrych Digidol (DOI)https://doi.org/10.1049/iet-com.2018.6186
Article published in IET Communications on 12 November 2019 (online), available at: https://doi.org/10.1049/iet-com.2018.6186.
Cardiff Metropolitan University (Grant ID: Cardiff Metropolian (Internal))
Yn dangos eitemau sy’n perthyn drwy deitl, awdur, pwnc a chrynodeb.
“Breaking and Entering”: Evaluation of Various Decryption Techniques to Decipher a Polyalphabetic Substitution Cipher. Brown, Ryan, James (Cardiff Metropolitan University, 2017-04)The dissertation research is based upon both cryptology (the study of cryptosystems in encryption and decryption) and analysing machine learning algorithms. Combining these two studies helped in both understanding cryptosystems ...
Laksari, Hafsa (Cardiff Metropolitan University, 2018-07)This research has been conducted to gain an insight into the world of computational tools that map genomes. Mapping genomes to the correct reference genomes, allows professionals to give an accurate diagnostic of any ...
Hewage, Chaminda; Jayal, Ambikesh; Jenkins, Glenn; Brown, Ryan J. (TU Wien, 2018-12-01)This paper examines the use of machine learning algorithms to model polyalphabetic ciphers for decryption. The focus of this research is to train and evaluate different machine learning algorithms to model the polyalphabetic ...