Free Essay

Linear Block Codes

In: Computers and Technology

Submitted By amarsdd
Words 841
Pages 4
________________________________________________________________

LINEAR BLOCK CODES

A systematic (n,k) linear block code is a mapping from a k-dimensional message vector to an ndimensional codeword in such a way that part of the sequence generated coincides with the k message digits. The difference (n − k) represents the parity bits. A systematic linear block will have a [k × n] generator matrix [G] of the form G=[P IK ]

Then the code is given as C= D*G
Where D is the data word.

Another important matrix associated with block codes is the [(n − k) × n] parity check matrix, [H]. The parity check matrix is formed by starting with the identity matrix and appending the transpose of the nonidentity portion of [G]:

H=[IK PT ]

The parity check matrix has the property c[H]T = 0

That is, any errorless, received code word multiplied by the transpose of the parity check matrix, [H], yields a zero vector, or syndrome. If the received code word contains an error, the resulting vector will match the corresponding bit that caused the error. S= R[H]T=E H]T

Where S= error syndrome R= received codeword E=error

Algorithm:

1. Take generator matrix from the user.
2. Create the 4 bit data word, total of 16 data words, using two dimensional array in the matlab.
3. Then code word is generated utilizing the matrix multiplication formula for the code word.
4. Then Hamming distance is determined by the minimum of the number of ones among the individual code words.
5. Now to check for error, first we enter a received code word.
6. Now generate the error syndrome utilising the formula for S.
7. After that, the error location in the received code word is determined utilising the error syndrome and corrected at that location by subtraction with 1.

Matlab Program:

clc; clear all; % Input Generator Matrix g=input('Enter The Generator Matrix: ') disp ('G = ') disp ('The Order of Linear block Code for given Generator Matrix is:')
[k,n] = size(g) for i = 1:2^k for j = k:-1:1 if rem(i-1,2^(-j+k+1))>=2^(-j+k) u(i,j)=1; else u(i,j)=0; end end end u; disp('The Possible Codewords are :') c = rem(u*g,2) disp('The Minimum Hamming Distance dmin for given Block Code is= ') d_min = min(sum((c(2:2^k,:))')) % Code Word r = input('Enter the Received Code Word:') p = [g(:,n-k+2:n)]; h = [transpose(p),eye(n-k)]; disp('Hammimg Code') ht = transpose(h) disp(' Error Syndrome of a Given Codeword is :') s = rem(r*ht,2) for i = 1:1:size(ht) if(ht(i,1:3)==s) r(i) = 1-r(i); break; end end disp('The Error is in bit:') i disp('The Corrected Codeword is :') r Output:

Enter The Generator Matrix: [1 0 0 0 1 0 1;0 1 0 0 1 1 1;0 0 1 0 1 1 0;0 0 0 1 0 1 1]
[1 0 0 0 1 0 1;0 1 0 0 1 1 1;0 0 1 0 1 1 0;0 0 0 1 0 1 1]

g =

1 0 0 0 1 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 0 0 0 0 1 0 1 1

G =
The Order of Linear block Code for given Generator Matrix is:

k =

4

n =

7

The Possible Codewords are :

c =

0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 0 0 1 1 1 0 1 0 1 0 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 0 0 1 0 1 1 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1 0 1 0 0 1 1 1 0 1 1 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 0 1 1 1 1 0 1 0 0 1 1 1 1 1 1 1

The Minimum Hamming Distance dmin for given Block Code is=

d_min =

3

Enter the Received Code Word:[1 0 1 0 1 0 1]

r =

1 0 1 0 1 0 1

Hammimg Code

ht =

1 0 1 1 1 1 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1

Syndrome of a Given Codeword is :

s =

1 1 0

The Error is in bit:

i =

3

The Corrected Codeword is :

r =

1 0 0 0 1 0 1

Conclusion:

So using the MATLAB code reduces the complexity of matrix manipulations needed to perform common block coding functions such as: encoding or decoding a message, determining the error correcting capabilities of a code, finding the syndrome, and computing a decoding table. In addition, the inherent matrix manipulation capabilities of the standard MATLAB provide an invaluable tool to transpose and multiply matrices.

Similar Documents

Free Essay

Mimo

...MIMO Wireless Communication Daniel W. Bliss, Keith W. Forsythe, and Amanda M. Chan ■ Wireless communication using multiple-input multiple-output (MIMO) systems enables increased spectral efficiency for a given total transmit power. Increased capacity is achieved by introducing additional spatial channels that are exploited by using space-time coding. In this article, we survey the environmental factors that affect MIMO capacity. These factors include channel complexity, external interference, and channel estimation error. We discuss examples of space-time codes, including space-time low-density parity-check codes and spacetime turbo codes, and we investigate receiver approaches, including multichannel multiuser detection (MCMUD). The ‘multichannel’ term indicates that the receiver incorporates multiple antennas by using space-time-frequency adaptive processing. The article reports the experimental performance of these codes and receivers. M - multiple-output (MIMO) systems are a natural extension of developments in antenna array communication. While the advantages of multiple receive antennas, such as gain and spatial diversity, have been known and exploited for some time [1, 2, 3], the use of transmit diversity has only been investigated recently [4, 5]. The advantages of MIMO communication, which exploits the physical channel between many transmit and receive antennas, are currently receiving significant attention [6–9]. While the channel can be so nonstationary...

Words: 16967 - Pages: 68

Free Essay

On Block Security of Regenerating Codes at the Mbr Point for Distributed Storage Systems

...On Block Security of Regenerating Codes at the MBR Point for Distributed Storage Systems Son Hoang Dau∗ , Wentu Song† , Chau Yuen‡ Singapore University of Technology and Design, Singapore Emails: {∗ sonhoang dau, † wentu song, ‡ yuenchau}@sutd.edu.sg Abstract—A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code constructions that trade storage capacity for perfect security. In other words, by decreasing the amount of original data that it can store, the system can guarantee that the adversary, which eavesdrops up to a certain number of storage nodes, obtains no information (in Shannon’s sense) about the original data. In this work we introduce the concept of block security for DSS and investigate minimum bandwidth regenerating (MBR) codes that are block secure against adversaries of varied eavesdropping strengths. Such MBR codes guarantee that no information about any group of original data units up to a certain size is revealed, without sacrificing the storage capacity of the system. The size of such secure groups varies according to the number of nodes that the adversary can eavesdrop. We show that code constructions based on Cauchy matrices provide block security. The opposite conclusion is drawn for codes based on Vandermonde matrices. I. I NTRODUCTION A. Background In recent years, the demand...

Words: 4963 - Pages: 20

Free Essay

Coding Theory

...study of codes and their properties and their propensity to work with certain types of applications. There are four general types of coding that we as humans use. The four types are: line coding, error correction or channel coding, data compression, and lastly cryptographic coding. In relation to error detecting codes, there exist error-correcting codes. The purpose of this paper is to explain the different types of coding and go over hamming distance, perfect codes, generator matrices, parity check matrices, and hamming codes. We will also be giving examples of how coding theory could be applied in a real world application; and a brief history of coding theory. According to “Wolframmathworld” (2015) “Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. It makes use of classical and modern algebraic techniques involving finite fields, group theory, and polynomial algebra”(). Coding theory has roots in communication filed. Claude Shannon first published the “A Mathematical Theory of Communication” in the Bell System Technical Journal. It was a piece that featured encoding information transmitted by a send. The fundamentals of this work included probability, which he applied to his communication theory. This gave way to Shannon developing what later became known as information theory. Later, a binary code came to fruition, known as the Golay code. This...

Words: 1095 - Pages: 5

Premium Essay

Java R. P.

...Deterministic Execution of Java’s Primitive Bytecode Operations Fridtjof Siebert IPD, Universität Karlsruhe Am Fasanengarten 5 76128 Karlsruhe, Germany Andy WalterForschungszentrum Informatik (FZI) Haid- und Neu Straße 10-14 76131 Karlsruhe, Germany siebert@ira.uka.de anwalt@ira.uka.de This work was partially funded by the DFG program GRK 209-------- ABSTRACT For the application of Java in realtime and safety critical domains, an analysis of the worst-case execution times of primitive Java operations is necessary. All primitive operations must either execute in constant time or have a reasonable upper bound for their execution time. The difficulties that arise for a Java virtual machine and a Java compiler in this context will be presented here. This includes the implementation of Java’s class and interface model, class initialization, monitors and automatic memory management. A new Java virtual machine and compiler that solves these difficulties has been implemented and its performance has been analysed. Although incremental garbage collection techniques can help to reduce the likelihood for a blocking garbage collection pause, they can not guarantee it. It can still occur that the collector does not make sufficient progress and does not catch up with the application. Consequently, the system can fail or require long blocking pauses to recycle memory or defragment the heap. A deterministic implementation of Java must provide means to determine worst-case...

Words: 6709 - Pages: 27

Premium Essay

Memory Management

...MATHEMATICAL/COMPUTER SCIENCE MATRIC NO: SCI/13/14/0247 LEVEL: 300L COURSE TITLE: OPERATING SYSTEM 1 COURSE CODE: CMP 307 TOPIC: MEMORY MANAGEMENT DATE SUBMITTED: 15 – 02 – 2016 LECTURER IN CHARGE: DR ADESHINA MEMORY MANAGEMENT Memory management is the functionality of an operating system which handles or manages primary memory. Memory management keeps track of each and every memory location either it is allocated to some process or it is free. It checks how much memory is to be allocated to processes. It decides which process will get memory at what time. It tracks whenever some memory gets freed or unallocated and correspondingly it updates the status. Memory management provides protection by using two registers, a base register and a limit register. The base register holds the smallest legal physical memory address and the limit register specifies the size of the range. For example, if the base register holds 300000 and the limit register is 1209000, then the program can legally access all addresses from 300000 through 411999. Instructions and data to memory addresses can be done in following ways Compile time -- When it is known at compile time where the process will reside, compile time binding is used to generate the absolute code. Load time -- When it is not known at compile time where the process will reside in memory, then the compiler generates re-locatable code. Execution time -- If the process can be moved during its execution from one memory segment to...

Words: 2862 - Pages: 12

Premium Essay

Memory Management Paper

...that need to be met. First is relocation. When a source code program is translated into object code by a translator or interpreter or assembler, it does not know by itself where the code will be loaded when the program is run. It may actually occupy a different area of memory each time the program is run. A program can be swept in and out of memory; it may occupy different address locations at different times. This is because the translator cannot assign absolute physical addresses to instructions and data values in programs, but once the program is run, the CPU and OS must be able to reference those physical addresses. With relocation, the logical referenced addresses are converted to a physical address so that the code and values can be seen. Next is protection. Program access space includes process control information, program code, data segment and stack or heap space. The operating system must protect the address space of a process from that of another process. It must be able to block unauthorized access from these other processes. No process should be able to access kernel code or kernel space itself. This protection is provided by the hardware and not the operating system since this is something that needs to be done outside of the operating system. When the address space is stored contiguously, this protection is much easier since it can be seen as a linear sequence of addresses, but...

Words: 643 - Pages: 3

Free Essay

Test

...%LJ 2 QRWDWLRQ Big O notation (with a capital letter O, not a zero), also called Landau's symbol, is a symbolism used in complexity theory, computer science, and mathematics to describe the asymptotic behavior of functions. Basically, it tells you how fast a function grows or declines. Landau's symbol comes from the name of the German number theoretician Edmund Landau who invented the notation. The letter O is used because the rate of growth of a function is also called its order. For example, when analyzing some algorithm, one might find that the time (or the number of steps) it takes to complete a problem of size n is given by T(n) = 4 n2 - 2 n + 2. If we ignore constants (which makes sense because those depend on the particular hardware the program is run on) and slower growing terms, we could say "T(n) grows at the order of n2" and write:T(n) = O(n2). In mathematics, it is often important to get a handle on the error term of an approximation. For instance, people will write ex = 1 + x + x2 / 2 + O(x3) for x -> 0 to express the fact that the error is smaller in absolute value than some constant times x3 if x is close enough to 0. For the formal definition, suppose f(x) and g(x) are two functions defined on some subset of the real numbers. We write f(x) = O(g(x)) (or f(x) = O(g(x)) for x -> C such that |f(x)| to be more precise) if and only if there exist constants N and C |g(x)| for all x>N. Intuitively, this means that f does not grow faster...

Words: 2121 - Pages: 9

Premium Essay

Create

...mohamed@louisiana.edu walenste@ieee.org ‡ † Abstract: A design space is presented for metamorphic malware. Metamorphic malware is the class of malicious self-replicating programs that are able to transform their own code when replicating. The raison d'etre for metamorphism is to evade recognition by malware scanners; the transformations are meant to defeat analysis and decrease the number of constant patterns that may be used for recognition. Unlike prior treatments, the design space is organized according to the malware author's goals, options, and implications of design choice. The advantage of this design space structure is that it highlights forces acting on the malware author, which should help predict future developments in metamorphic engines and thus enable a proactive defence response from the community. In addition, the analysis provides effective nomenclature for classifying and comparing malware and scanners. Keywords: Metamorphic Malware, Virus Scanner. 1. Introduction Metamorphism is the ability of malware to transform its code. This ability was first introduced in viruses and was later used by worms, Trojans, and other malware. There now exist several metamorphic engines—programs that implement only the logic for transforming code—that can simply be linked to any program to make it metamorphic. Metamorphic malware can be classified into four broad groups defined by two parameters. First, metamorphic malware may be either closed-world or open-world. Closed-world...

Words: 5825 - Pages: 24

Free Essay

Organisation

...SRI SAI RAM ENGINEERIG COLLEGE, CHENNAI – 44. DEPARTMENT OF COMPUTER APPLICATIONS Subject Code: MC1701 Subject Name : Computer Networks 2 Mark Questions 1. Define Network. A network is a set of devices connected by physical media links. A network is recursively is a connection of two or more nodes by a physical link or two or more networks connected by one or more nodes. 2. What is a Link? At the lowest level, a network can consist of two or more computers directly connected by some physical medium such as coaxial cable or optical fiber. Such a physical medium is called as Link. 3. What is a node? A network can consist of two or more computers directly connected by some physical medium such as coaxial cable or optical fiber. Such a physical medium is called as Links and the computer it connects is called as Nodes. 4. What is a gateway or Router? A node that is connected to two or more networks is commonly called as router or Gateway. It generally forwards message from one network to another. 5. What is point-point link? If the physical links are limited to a pair of nodes it is said to be point-point link. 6. What is Multiple Access? If the physical links are shared by more than two nodes, it is said to be Multiple Access. 7. What are the advantages of Distributed Processing? a. Security/Encapsulation b. Distributed database c. Faster Problem solving d. Security through redundancy e. Collaborative Processing 8. What are the criteria necessary for...

Words: 2993 - Pages: 12

Premium Essay

Digital Fingerprinting

...DIGIT D TAL FIN NGERP PRINT TING A Proj report oject t Sub bmitted in the partial fulfilment of require t ement of the award of degree of f f BA ACHELOR OF TECHN NOLOGY IN ELE ECTRONICS AND COM CS MMUNICA TION ENGI GINEERING G ARJUN DEV A VGAN (B07 70279EC) CHALLA HIMANS SHU REDD (B070319 DY 9EC) NA ASREEN MOHSIN (B0 M 070495EC) SHYAM AS S SHISH (B07 70287EC) AJITH K G (B06007 79EC) Departm ment of El lectronics and Comm municatio Enginee on ering NATIONAL INIS STITUTE OF TECH HNOLOG CALICUT GY, Kozhikode, Kerala- 6736 K K 601, India Academic year 2010 0-2011 Department Of Electronics and Communication Engineering NATIONAL INSTITUTE OF TECHNOLOGY, CALICUT CERTIFICATE This is to certify that this project report entitled DIGITAL FINGERPRINTING is a bona fide record of the work done by final year students Arjun Devgan, Roll No. B070279EC, Challa Himanshu Reddy, Roll No. B070319EC, Nasreen Mohsin, Roll No. B070495EC, Shyam Ashish, Roll No. B070287EC and Ajith K G, Roll No. B060079EC, in partial fulfilment of the requirement of award of B. Tech. Degree in Electronics and Communication Engineering by the National Institute Of Technology, Calicut, during the academic year 2010-2011. Dr. Deepthi P.P Project Guide Department of Electronics and Communication Engineering N.I.T Calicut Dr. P. C. Subrahmaniam Head of the Department Department of Electronics and Communication Engineering N.I.T Calicut Date: April 29th, 2011 CONTENTS 1. 2. 3. 4. ABSTRACT ....

Words: 7883 - Pages: 32

Free Essay

Melp Final

...Style Guidelines for Final Year Project ReportsReal Time Implementation of Mixed Excitation Linear Predictive Vocoder Final Year Project Final Report A 4th Year StudentUmer Hamid 06-0063 Faraz Hussain 07-0597 Supervisor: Ms. Durdana Habib Real time optimized Implementation of the Mixed Excitation Linear Predictive Vocoder on the TMS320C6416 DSP [pic] Electrical Engineering Department National University of Computer and Emerging Sciences Islamabad Session 2009-2010 Abstract The purpose of our project is real-time implementation and optimization of a 2.4 Kbps mixed excitation linear prediction (MELP) speech-coding algorithm on a Texas instrument TMS320C64xx digital signal processor. The main emphases of the project is on efficient coding and optimization strategies in computationally intensive modules by exploiting fast L1/L2 memory architecture, 8-parallel data paths, enhanced direct memory access module and instruction set features of TMS320C6000 architecture. The implementation would be based on generic TMS320C6000 DSP series; the optimization techniques aimed are applicable to all types of DSP platforms. Lastly the enhanced DSP/BIOS features were used to implement a real time data handling technique to port the MELP vocoder for real time applications. Contents 1 Introduction 6 1.1 THE MELP SPEECH PRODUCTION MODEL 6 2 Development Process 29 2.1 DSP Architecture...

Words: 9574 - Pages: 39

Free Essay

Computer

...CONTENT Page No 1 2 3 4 5 6 7 8 9 10 Academic calendar Digital Communications Microprocessors and microcontrollers Digital Signal Processing Object Oriented Programming Through Java Managerial Economics And Financial Analysis Digital Signal Processing Lab Microprocessor & Microcontroller Lab Advanced English Communication Skills Lab Object Orient Programming Through Java Lab 2 3 48 85 129 186 217 219 222 224 ACADEMIC CALENDAR VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DEPARTMENT ACADEMIC CALENDAR B. Tech Academic Year 2013 - 2014 - II - Semester S.No Event Date th 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. Submission of abstracts of main project by IV years Faculty orientation program Commencement of Class work Spell for UNIT – I Instructions Fresher’s day Spell for UNIT – II Instructions Alumni meet VIGNAN TARANG Spell for Unit-III Instructions st nd Assignment -1/ Unit test-1 on I & II Units Submission of results & week students list to Dept Spell for Unit-IV Instructions University I-Mid-Exam- II & IV Year rd University I-Mid-Exam- III Year Spell for UNIT – V Instructions for II &IV years rd Spell for UNIT – V Instructions for III year LAB INTERNAL-1 Commencement of Special classes for Slow learners Spell for UNIT – VI Instructions for II &IV years rd Spell for UNIT – VI Instructions for III year Submission of Mini project title along with guide for III year Spell for Unit...

Words: 28702 - Pages: 115

Premium Essay

Css3, Html5

...Beta Edition CSS3, HTML5, and an introduction to the behavior Layer Daniel Deverell HTML Updated June 4, 2012 1 In this course you will come to know and understand basic HTML. The following HTML constructs will be used. Paragraph / Sentence

Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas.

Definition List
Definition list
Consectetur adipisicing elit, sed do eiusmod.
Lorem ipsum dolor sit amet
Consectetur elit, sed. Ut enim ad.
Standard List Navigation Headers

Lorem ipsum dolor sit amet

Lorem ipsum dolor sit amet
Lists Unordered List
  • Lorem ipsum dolor sit amet.
  • Aliquam tincidunt mauris eu risus.
  • Vestibulum auctor dapibus neque.
Ordered List
  1. Lorem ipsum dolor si.
  2. Aliquam tincidunt mauris eu risus.
  3. Vestibulum auctor dapibus neque.
2 Tables

Words: 12505 - Pages: 51

Free Essay

Computer Application and Microcontroller System Design for Light and Temperature Sensors Measurement Tool Module

...there is no application to show the characteristic of the sensor. To solve this problem, a computer based sensors measurement tool module needs to be made. The sensor gives the output such as analog value to the microcontroller. Microcontroller receives the output with Analog to Digital Converter (ADC), then microcontroller send the digital value to computer using serial communication. The application based on C# programming language is made as user interface to the user. To know the input of the sensor, simple linear regression, a type of numeric method, is used to calculate the input of the sensor and to make the linearity between the input and the output. The testing of the results in computer show that the error rate system is small. After the input and the output have been known, the graphic can be made to show the characteristic sensor to the user. Keywords: Analog to Digital Converter, Microcontroller, Serial Communication, C# programming language, Simple linear regression. ABSTRAK Modul praktikum untuk percobaan sensor di Laboratorium Elektronika Jurusan Teknik Elektro, Fakultas Teknik UNIKA Atma Jaya, Jakarta tidak terintegrasi dengan baik. Keluaran sensor tidak homogeny dan tidak ada aplikasi untuk...

Words: 2154 - Pages: 9

Premium Essay

Computer Science

...A REPORT ON INTELLIGENT HUMIDISTAT BY Rohan Mehta 2011B5A3376P Aditya Pillai 2011B3A3530P Shantanu Maharwal 2011B2A3700P Gaurav Dadhich 2011B3A8513P AT BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI A REPORT ON INTELLIGENT HUMIDISTAT BY Rohan Mehta 2011B5A3376P Aditya Pillai 2011B3A3530P Shantanu Maharwal 2011B2A3700P Gaurav Dadhich 2011B3A8513P Prepared in Partial fulfilment of the requirements of the course “Microprocessors and Interfacing” Course Number: EEE F241 AT BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI (April 2014) ACKNOWLEDGEMENT We would like to express our gratitude to all those who have helped us directly or indirectly to complete this report. Firstly, we would like to express our gratitude towards the Instructor-in-Charge (IC) of this course, Dr. K. R. Anupama (from Goa Campus) and Dr. Pawan Sharma (from Pilani Campus) for giving us this opportunity to work on such an interesting assignment. Their teachings and support during the program were greatly valuable to all of us. We would also like to thank our tutorial professors, viz., Dr. Rajiv Ranjan Singh, Mr. Tulsi Ram Sharma, for their excellent personal guidance, help and teachings throughout the project, and further. Last, but not the least, we would like to thank our Lab Instruction Mr. V. Balaji and his team of assistants for all the help and knowledge imparted to us related to the assembly language programming in the...

Words: 2608 - Pages: 11