Open Access
Subscription Access
Open Access
Subscription Access
A Fast Algorithm for Computing BER of Convolutional Codes Encoder Using PSO
Subscribe/Renew Journal
Today the use of digital cell phones, the internet, and CD and DVD players is ubiquitous. In all of these cases, digitally represented data is either transmitted from one place to another or retrieved from a storage device when needed. For the proper functioning of these systems the transmitted or retrieved data must be sufficiently error free. This can be accomplished efficiently by using channel efficiently coding techniques. One such channel coding technique for achieving reliable data transmission or retrieval is to use convolutional codes. In convolutional coding input bits are stored in the fixed length shift register and they are com combined with the help of mod-2 adders. The output of convolutional code depends upon the connection of shift registers with mod-2 adder. Particle swarm optimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality (called particles). In this paper present the best convolutional encoder structure (connection of shift registers with output with the help of mod-2 adder)for code rate1/4 by using PSO.
Keywords
Convolutional Code, PSO, Mod-2 Adder, Shift Register.
Subscription
Login to verify subscription
User
Font Size
Information
Abstract Views: 339
PDF Views: 1