Premium Essay

Nt1330 Unit 3.1 Problem Analysis

Submitted By
Words 910
Pages 4
PROBLEM FORMULATION
3.1 Problem Statement
Low density parity check codes are forward error correcting codes. The LDPC block codes are inefficient, since a new code must be hypothesized each time a change in frame size is desired. A number of algorithms with varying complexity and performance have been proposed for LDPC decoding. But achieving a balanced trade-off between decoding performance and implementation complexity still remains a potential problem. LDPC decoding algorithms operates by making either hard decision or soft decision on the message received from the noisy channel [20].
3.1.1 Sum product Algorithm
The sum product algorithm for LDPC decoding is a soft decision message passing algorithm. In case of soft decision based algorithms, the input data to the decoder is the channel probabilities, represented in logarithmic ratio which is known as log-likelihood ratio (LLR). This algorithm requires LLR for variable node operations to make decoding decisions. The LLRs are transferred over to the variable nodes (V), this variable node carry out the sum operation on the input LLRs as in equation (1) and computed messages are passed along the connected edges to the check nodes (C).
SPA Variable node operation:
V_i=〖LLR〗_n+∑_(j≠i)▒C_j (1)
Where n=1,2,. . . .number of variable nodes i, j=1,2,. . …show more content…
In this project in order to achieve trade-off between the decoder performance and implementation complexity the message passing algorithm is proposed it is also called as belief propagation algorithm. MPA is reliable compared with other decoding algorithms; it has a complexity only linearly proportional to the check node degree. The check node operation of the MPA consists of a simple parity check operation requiring XOR logic only, as shown in equation

Similar Documents

Premium Essay

Test

...30 Lab Hours) Prerequisite(s) and/or Corequisite(s): Prerequisite: NT2580 Introduction to Information Security or equivalent Course Description: This course examines security implementations for a variety of Windows platforms and applications. Areas of study include analysis of the security architecture of Windows systems. Students will identify and examine security risks and apply tools and methods to address security issues in the Windows environment. Windows Security Syllabus Where Does This Course Belong? This course is required for the Bachelor of Science in Information Systems Security program. This program covers the following core areas:    Foundational Courses Technical Courses BSISS Project The following diagram demonstrates how this course fits in the program:    IS4799 NT2799 IS4670 ISC Capstone Project Capstone ProjectCybercrime Forensics NSA    NT2580 NT2670  Introduction to  Information Security IS4680 IS4560 NT2580 NT2670 Email and Web Services Hacking and Introduction to  Security Auditing for Compliance Countermeasures Information Security Email and Web Services      NT1230 NT1330 Client-Server Client-Server  Networking I Networking II  IS3230 IS3350 NT1230 NT1330  Issues Client-Server Client-Server  SecurityContext in Legal Access Security Networking I Networking II   NT1110  NT1210 Structure and Introduction to  ComputerLogic Networking    IS3120 IS3110 NT1210 Network  Risk Management in Introduction to General Education...

Words: 2305 - Pages: 10