Please use this identifier to cite or link to this item: http://localhost:80/xmlui/handle/123456789/1839
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShoaib, Bilal-
dc.contributor.authorQureshi, Ijaz Mansoor-
dc.contributor.authorIhsanulhaq-
dc.contributor.authorShafqatullah-
dc.date.accessioned2019-11-29T04:59:39Z-
dc.date.available2019-11-29T04:59:39Z-
dc.date.issued2014-01-01-
dc.identifier.issn23 030502-
dc.identifier.urihttp://142.54.178.187:9060/xmlui/handle/123456789/1839-
dc.description.abstractA method of modifying the architecture of fractional least mean square (FLMS) algorithm is presented to work with nonlinear time series prediction. Here we incorporate an adjustable gain parameter in the weight adaptation equation of the original FLMS algorithm and absorb the gamma function in the fractional step size parameter. This approach provides an interesting achievement in the performance of the filter in terms of handling the nonlinear problems with less computational burden by avoiding the evaluation of complex gamma function. We call this new algorithm as the modified fractional least mean square (MFLMS) algorithm. The predictive performance for the nonlinear Mackey glass chaotic time series is observed and evaluated using the classical LMS, FLMS, kernel LMS, and proposed MFLMS adaptive filters. The simulation results for the time series with and without noise confirm the superiority and improvement in the prediction capability of the proposed MFLMS predictor over its counterparts.en_US
dc.language.isoen_USen_US
dc.publisherInstitue of physicsen_US
dc.subjectNatural Scienceen_US
dc.subjectleast mean squareen_US
dc.subjectalgorithmen_US
dc.subjectchaoticen_US
dc.subjectnonstationary timeen_US
dc.subjectseries predictionen_US
dc.titleA modified fractional least mean square algorithm for chaotic and nonstationary time series predictionen_US
dc.typeArticleen_US
Appears in Collections:Journals

Files in This Item:
File Description SizeFormat 
pdf.htm139 BHTMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.