Premium
Frequency memory based gradient descent bit flipping algorithm
Author(s) -
Asatani Jun,
Kawanishi Hiroaki,
Tokushige Hitoshi,
Katayama Kengo
Publication year - 2015
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22122
Subject(s) - local optimum , gradient descent , algorithm , decoding methods , point (geometry) , computer science , local search (optimization) , descent (aeronautics) , bit (key) , mathematical optimization , mathematics , artificial intelligence , engineering , geometry , computer security , artificial neural network , aerospace engineering
An escape method for the local optima of the gradient descent bit‐flipping (GDBF) algorithm for decoding low‐density parity‐check codes is proposed. In the GDBF algorithm, a search point is likely to be trapped in a local optimum, which causes performance degradation of the algorithm. To address this issue, we introduce a list to store the frequency of visits to each local optimum and devise a strategy to increase the distance of a search point from a local optimum with respect to the frequency. © 2015 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.