In this paper, we have developed several concepts such as the tree concept, short cycle concept and group shuffling of a propagation to decrypt low-density parity-check (LDPC) codes. Thus, proposed an algorithm based on where probability occurrence takes exponential form factor appearance belief propagation-group shuffled (EFAP-GSBP). This is used for wireless communication applications by prov...

Shuffled Frog Leaping Algorithm (SFLA) is one of the most widespread algorithms. It was developed by Eusuff and Lansey in 2006. SFLA a population-based metaheuristic algorithm that combines benefits memetics with particle swarm optimization. has been used various areas, especially engineering problems due to its implementation easiness limited variables. Many improvements have made alleviate dr...

A switching signal for a switched system is said to be shuffled if all modes of the are activated infinitely often. In this paper, we develop tools analyze stability properties discrete-time linear systems driven by signals. We introduce new notion joint spectral radius (SJSR), which intuitively measures how much state contracts each time shuffles (i.e. have been activated). show relates associ...