VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notes
5 likes2,689 views
This document provides information and formulas related to information theory and coding. It discusses important cyclic codes like Reed-Solomon codes and convolution codes. For convolution codes, it provides the generator matrix formulas in the time and transform domains, showing how the output of the encoder is calculated from the input and generator matrix. It also gives the formulas for calculating the output polynomials from the input polynomial and generator polynomials in the transform domain approach.
1 of 68
Downloaded 70 times
![ Number of rows in [G] =L (one input)
Number of rows in [G] =2L (two inputs)
Number of columns in [G]= n(L+M)
The output of the encoder is given by
[C] = [d][G]
Transform domain approach
The output polynomials for the j(j=1,2,3…) adders are given by
𝑪𝒋
(x)= d(x) 𝒈𝒋
(x) for j=1, 2, 3….
The output of the encoder is given by
C(X) = 𝑪(𝟏)
(𝑿 𝒏
) +X 𝑪(𝟐)
(𝑿 𝒏
) + 𝑿 𝟐
𝑪(𝟑)
(𝑿 𝒏
) +……………+𝑿 𝒏−𝟏
𝑪(𝒏)
(𝑿 𝒏
)](https://image.slidesharecdn.com/module5-171119064827/85/VTU-CBCS-E-C-5th-sem-Information-theory-and-coding-15EC54-Module-5-notes-3-320.jpg)
Recommended
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -4 notesJayanth Dwijesh H P This document provides information and formulas related to error control coding and binary cyclic codes. It begins with defining the code vector, message vector, parity check matrix, and generator matrix for error control coding. It then provides the parameters and capabilities for single error correcting Hamming codes. Finally, it presents formulas for non-systematic and systematic cyclic codes, including defining the remainder polynomial, parity check polynomial, and code vector formulations.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -1notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -1notesJayanth Dwijesh H P This document provides formulas and concepts related to information theory and coding. It defines key information theory terms like self-information, entropy, information rate, bits, Hartley's, nats, extremal entropy, source efficiency, and source redundancy. Formulas are given for calculating each of these terms. The document also provides formulas for calculating the average information content of symbols from different states. Finally, it lists some basic log properties that are important in information theory calculations.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -3 notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -3 notesJayanth Dwijesh H P This document contains formulas and definitions related to information theory and coding. It defines key terms such as entropy, joint entropy, equivocation, mutual information, and channel capacity. Formulas are provided for calculating the entropy of input and output symbols, joint entropy, equivocation, mutual information, channel capacity, source efficiency, channel efficiency, and channel redundancy. The document serves as a reference for these important information theory concepts and the mathematical formulas used to quantify them.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-1 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-1 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-1-190103062447-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-1 notes(15...Jayanth Dwijesh H P This document provides formulas and concepts related to information theory and coding. It defines key information theory terms like self-information, entropy, information rate, bits, Hartley's, nats, extremal entropy, source efficiency, and source redundancy. Formulas are given for calculating each of these terms. The document also provides formulas for calculating the average information content of symbols from different states. Finally, it lists some basic log properties that are important in information theory calculations.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-5-190103071115-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-5 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication
Engineering / Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code: 15EC54 & 17EC54
Module-5
Some Important Cyclic Codes: Golay Codes, BCH Codes (Section 8.4 – Article 5 of Text 3).
Convolution Codes: Convolution Encoder, Time domain approach, Transform domain approach, Code Tree, Trellis and State Diagram, The Viterbi Algorithm) (Section 8.5 – Articles 1,2 and 3, 8.6- Article 1 of Text 3).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-2 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-2 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-2-190103070127-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-2 notes(15...Jayanth Dwijesh H P This document contains formulas and definitions related to information theory and source coding. It defines key terms like entropy, average length, source/code efficiency, and redundancy. It also provides formulas to calculate these metrics for sources with different probabilities, and extended sources. Formulas are given for encoding sources using Huffman coding in ternary and quaternary systems.
R18 b.tech 3 2 ece syllabus
R18 b.tech 3 2 ece syllabusVenkata Rajitha M The document provides the syllabus for the third year second semester of the B.Tech ECE program at JNTU Hyderabad. It includes details of 9 courses that are part of the semester. The courses cover topics like Antennas and Propagation, Digital Signal Processing, VLSI Design, and Object Oriented Programming through Java. The syllabus provides course objectives, outcomes and unit-wise topics for each course. It also lists the textbooks and references for further reading. The summary provides an overview of the key courses and topics covered in the semester without including unnecessary details.
3.Frequency Domain Representation of Signals and Systems
3.Frequency Domain Representation of Signals and SystemsINDIAN NAVY This document provides an overview of frequency domain representation of signals and systems. It defines key concepts such as the Fourier transform, which converts a signal from the time domain to the frequency domain. The frequency spectrum shows the distribution of frequencies within a signal. Periodic signals can be represented using Fourier series, while aperiodic signals use the Fourier transform. Properties of the Fourier transform such as linearity, time shifting, and the convolution theorem are also covered.
Convolutional codes
Convolutional codesAbdullaziz Tagawy A second important technique in error-control coding is that of convolutional coding . In this type of coding the encoder output is not in block form, but is in the form of an encoded
sequence generated from an input information sequence.
convolutional encoding is designed so that its decoding can be performed in some structured and simplified way. One of the design assumptions that simplifies decoding
is linearity of the code. For this reason, linear convolutional codes are preferred. The source alphabet is taken from a finite field or Galois field GF(q).
Convolution coding is a popular error-correcting coding method used in digital communications.
The convolution operation encodes some redundant information into the transmitted signal, thereby improving the data capacity of the channel.
Convolution Encoding with Viterbi decoding is a powerful FEC technique that is particularly suited to a channel in which the transmitted signal is corrupted mainly by AWGN.
It is simple and has good performance with low implementation cost.
Verilog VHDL code Decoder and Encoder
Verilog VHDL code Decoder and EncoderBharti Airtel Ltd. This document summarizes an experiment that implemented 2:4, 3:8 decoders and an 8:3 encoder using Verilog. It provides the Verilog code for each implementation and includes RTL simulation output waveforms. The aim was to model the decoders and encoder using dataflow and behavioral modeling. The experiment was conducted using Xilinx ISE 9.2i software by student SHYAMVEER SINGH with roll number B-54.
Finite word length effects
Finite word length effectsPeriyanayagiS 1) The document discusses finite word length effects in digital filters. It covers fixed point and floating point number representations, different number systems including binary, decimal, octal and hexadecimal.
2) It describes various number representation techniques for digital systems including fixed point representation, floating point representation, and block floating point representation. Fixed point representation uses a fixed binary point position while floating point representation allows the binary point to vary.
3) It also discusses signed number representations including sign-magnitude, one's complement, and two's complement forms. Arithmetic operations like addition, subtraction and multiplication are covered for fixed point numbers along with issues like overflow.
Arithmetic Coding
Arithmetic Codinganithabalaprabhu The document provides an overview of digital media basics including digitization, compression, representation, and standards. It discusses signal digitization through pulse code modulation and sampling. It also covers quantization, digitization examples, and lossless versus lossy compression. Specific compression techniques covered include transform coding, variable rate coding, predictive coding, and entropy coding like Huffman coding. The document also discusses psychoacoustic modeling and perceptual coding. It provides examples of speech, audio, image and video compression standards and techniques.
7 convolutional codes
7 convolutional codesVarun Raj This document discusses convolutional codes. It defines basic concepts like constraint length and generator polynomials that define convolutional codes. It describes representations of convolutional codes using state diagrams and trellis diagrams. It also discusses decoding convolutional codes using the Viterbi algorithm, which finds the most likely path through the trellis. The document concludes by discussing properties of convolutional codes like free distance, which is the minimum Hamming distance between codewords.
Systems and their properties
Systems and their propertiesPrarthan P The document discusses systems and their properties. It defines a system as a meaningful interconnection of components that transforms input signals to produce outputs. A system has inputs, outputs, and internal signals. Key properties of systems include memory, causality, time-invariance, linearity, stability, and invertibility. Systems can be used to process signals by modifying or extracting specific information from them.
Hamming code system
Hamming code systemDILSHAD AHMAD This document describes the Hamming code system. It introduces Hamming codes, which can detect up to two-bit errors or correct one-bit errors. It discusses different types of errors, the Hamming bound condition, and how to implement Hamming codes by calculating parity bits using a generator matrix and decoding received codewords using a parity check matrix to detect and correct errors through syndrome decoding. The document also includes a MATLAB source code example to simulate the encoding, transmission over an AWGN channel, and decoding of Hamming codes to calculate the bit error rate.
A Nutshell On Convolutional Codes (Representations)
A Nutshell On Convolutional Codes (Representations)alka swara *An introduction to convolutional codes
*An introduction to convolutional encoder
Convolutional codes representations and explanation with examples
*Generator representation
*State diagram
*Tree diagram
*Trellis diagram
*Advantages of Convolutional codes
Multiple Classifier Systems
Multiple Classifier SystemsFarzad Vasheghani Farahani This presentation is about Multiple Classifier System (Ensemble of Classifiers). At first tell about the general idea of decision making, then address reasons and rationales of using Multiple Classifier System, after that concentrate on designing Multiple Classifier System: 1.Create an Ensemble 2.Combining Classifiers.
Core programming in c
Core programming in cRahul Pandit This C program takes in an integer from the user and converts it to its binary equivalent. It uses bitwise operators like right shift and AND to extract each bit and check if it is 1 or 0. A loop shifts the number by 31, 30, 29 ... 1, 0 bits and ANDs it with 1 each time to extract the bits, printing 1 for each bit that is 1 and 0 for each bit that is 0, effectively converting the decimal number to its 32-bit binary representation.
Basics of Digital Filters
Basics of Digital Filtersop205 3F3 – Digital Signal Processing (DSP), January 2009, lecture slides 4, Dr Elena Punskaya, Cambridge University Engineering Department
Convolution codes and turbo codes
Convolution codes and turbo codesManish Srivastava Convolution codes and turbo codes are error-correcting codes used to reliably transmit digital data over noisy communication channels. Convolution codes work by convolving the sequence of information bits according to some rule, spreading the bits along the coded sequence. Turbo codes achieve better error correction than convolution codes through the parallel concatenation of convolutional encoders separated by an interleaver, along with iterative decoding. The Viterbi algorithm is typically used to decode convolution codes by finding the most probable state sequence, while turbo codes use two decoders and feedback to iteratively improve the decoding of each encoded sequence.
Id3,c4.5 algorithim
Id3,c4.5 algorithimAbdelfattah Al Zaqqa ID3, C4.5 :used to generate a decision tree developed by Ross Quinlan typically used in the machine learning and natural language processing domains, overview about these algorithms with illustrated examples
Delta Modulation & Adaptive Delta M.pptx
Delta Modulation & Adaptive Delta M.pptxrubini Rubini This document provides an overview of several waveform coding and representation techniques, including PCM, DM, ADM, and DPCM. PCM converts an analog signal into a digital binary sequence by sampling, quantizing, and encoding the signal. DM and ADM transmit only one bit per sample and adapt the step size used for quantization. DPCM uses prediction to transmit only the difference between the predicted and actual signal values, requiring fewer bits.
Turbo Codes
Turbo Codesvasanth_mtech Turbo codes provide reliable communication at high data rates by combining concepts from block and convolutional codes. They use two convolutional encoders separated by an interleaver, producing redundant parity bits. During iterative decoding, probabilistic information from the first decoder is used as a priori information for the second decoder, and vice versa, improving the estimates of the transmitted bits at each iteration. Turbo codes achieve performance close to the theoretical channel capacity limit with low error rates. They have applications in deep space communications, mobile wireless systems, and other areas requiring high reliability transmission.
DSP_2018_FOEHU - Lec 03 - Discrete-Time Signals and Systems
DSP_2018_FOEHU - Lec 03 - Discrete-Time Signals and SystemsAmr E. Mohamed The document discusses discrete-time signals and systems. It defines discrete-time signals as sequences represented by x[n] and discusses important sequences like the unit sample, unit step, and periodic sequences. It then defines discrete-time systems as devices that take a discrete-time signal x(n) as input and produce another discrete-time signal y(n) as output. The document classifies systems as static vs. dynamic, time-invariant vs. time-varying, linear vs. nonlinear, and causal vs. noncausal. It provides examples to illustrate each classification.
Huffman and Arithmetic coding - Performance analysis
Huffman and Arithmetic coding - Performance analysisRamakant Soni Huffman coding and arithmetic coding are analyzed for complexity.
Huffman coding assigns variable length codes to symbols based on probability and has O(N2) complexity. Arithmetic coding encodes the entire message as a fraction between 0 and 1 by dividing intervals based on symbol probability and has better O(N log n) complexity. Arithmetic coding compresses data more efficiently with fewer bits per symbol and has lower complexity than Huffman coding asymptotically.
Convolution Codes
Convolution CodesPratishtha Ram The document discusses convolution codes. It defines convolution codes as having three parameters (n, k, m) where n is the number of output bits, k is the number of input bits, and m is the number of memory registers. Convolutional codes add redundancy to protect data sent over noisy channels and are characterized by their constraint length L, which represents the number of bits in the encoder memory affecting output. The document provides an example of a (2,1,4) convolutional code and illustrates its operation through input sequences, state diagrams, tree diagrams, and trellis diagrams. It also describes methods for decoding convolution codes including sequential decoding using the Fano algorithm and maximum likelihood decoding using the Viterbi algorithm.
Error detection and correction codes
Error detection and correction codesGargiKhanna1 Dr. Gargi Khanna discusses error detection and correction codes such as parity codes and Hamming codes. Parity codes add an extra bit to allow detection of errors in transmitted data by checking if the total number of 1s is even or odd. Block parity codes apply this to blocks of data with row and column parity. Hamming codes can detect single and double bit errors using additional parity bits placed in specific bit locations. This allows identification and correction of single bit errors during data transmission.
Arithmetic coding
Arithmetic coding09lavee This document provides an introduction to arithmetic coding, a data compression technique. It begins with an abstract, introduction, and overview of arithmetic coding and how it differs from other entropy encoding techniques like Huffman coding. It then goes into more detail about the basic concepts, motivation, and methods behind arithmetic coding over multiple chapters. It discusses how arithmetic coding encodes data by creating a code that represents a fraction in the unit interval [0,1] and recursively partitions this interval based on the input symbols. The document provides examples to illustrate how arithmetic coding works and generates unique tags for symbol sequences.
Chapter 03 cyclic codes
Chapter 03 cyclic codesManoj Krishna Yadavalli Cyclic codes have an algebraic structure that allows them to be specified concisely using a single generator polynomial. A cyclic code C of length n is a set of codewords that is generated by a polynomial g(x) that divides x^n - 1. Every cyclic code C can be expressed as 〈g(x)〉, where g(x) is the unique monic generator polynomial of smallest degree. The dimension of C is n - degree(g(x)). A generator matrix for C can be constructed by using the coefficients of g(x).
More Related Content
What's hot (20)
Convolutional codes
Convolutional codesAbdullaziz Tagawy A second important technique in error-control coding is that of convolutional coding . In this type of coding the encoder output is not in block form, but is in the form of an encoded
sequence generated from an input information sequence.
convolutional encoding is designed so that its decoding can be performed in some structured and simplified way. One of the design assumptions that simplifies decoding
is linearity of the code. For this reason, linear convolutional codes are preferred. The source alphabet is taken from a finite field or Galois field GF(q).
Convolution coding is a popular error-correcting coding method used in digital communications.
The convolution operation encodes some redundant information into the transmitted signal, thereby improving the data capacity of the channel.
Convolution Encoding with Viterbi decoding is a powerful FEC technique that is particularly suited to a channel in which the transmitted signal is corrupted mainly by AWGN.
It is simple and has good performance with low implementation cost.
Verilog VHDL code Decoder and Encoder
Verilog VHDL code Decoder and EncoderBharti Airtel Ltd. This document summarizes an experiment that implemented 2:4, 3:8 decoders and an 8:3 encoder using Verilog. It provides the Verilog code for each implementation and includes RTL simulation output waveforms. The aim was to model the decoders and encoder using dataflow and behavioral modeling. The experiment was conducted using Xilinx ISE 9.2i software by student SHYAMVEER SINGH with roll number B-54.
Finite word length effects
Finite word length effectsPeriyanayagiS 1) The document discusses finite word length effects in digital filters. It covers fixed point and floating point number representations, different number systems including binary, decimal, octal and hexadecimal.
2) It describes various number representation techniques for digital systems including fixed point representation, floating point representation, and block floating point representation. Fixed point representation uses a fixed binary point position while floating point representation allows the binary point to vary.
3) It also discusses signed number representations including sign-magnitude, one's complement, and two's complement forms. Arithmetic operations like addition, subtraction and multiplication are covered for fixed point numbers along with issues like overflow.
Arithmetic Coding
Arithmetic Codinganithabalaprabhu The document provides an overview of digital media basics including digitization, compression, representation, and standards. It discusses signal digitization through pulse code modulation and sampling. It also covers quantization, digitization examples, and lossless versus lossy compression. Specific compression techniques covered include transform coding, variable rate coding, predictive coding, and entropy coding like Huffman coding. The document also discusses psychoacoustic modeling and perceptual coding. It provides examples of speech, audio, image and video compression standards and techniques.
7 convolutional codes
7 convolutional codesVarun Raj This document discusses convolutional codes. It defines basic concepts like constraint length and generator polynomials that define convolutional codes. It describes representations of convolutional codes using state diagrams and trellis diagrams. It also discusses decoding convolutional codes using the Viterbi algorithm, which finds the most likely path through the trellis. The document concludes by discussing properties of convolutional codes like free distance, which is the minimum Hamming distance between codewords.
Systems and their properties
Systems and their propertiesPrarthan P The document discusses systems and their properties. It defines a system as a meaningful interconnection of components that transforms input signals to produce outputs. A system has inputs, outputs, and internal signals. Key properties of systems include memory, causality, time-invariance, linearity, stability, and invertibility. Systems can be used to process signals by modifying or extracting specific information from them.
Hamming code system
Hamming code systemDILSHAD AHMAD This document describes the Hamming code system. It introduces Hamming codes, which can detect up to two-bit errors or correct one-bit errors. It discusses different types of errors, the Hamming bound condition, and how to implement Hamming codes by calculating parity bits using a generator matrix and decoding received codewords using a parity check matrix to detect and correct errors through syndrome decoding. The document also includes a MATLAB source code example to simulate the encoding, transmission over an AWGN channel, and decoding of Hamming codes to calculate the bit error rate.
A Nutshell On Convolutional Codes (Representations)
A Nutshell On Convolutional Codes (Representations)alka swara *An introduction to convolutional codes
*An introduction to convolutional encoder
Convolutional codes representations and explanation with examples
*Generator representation
*State diagram
*Tree diagram
*Trellis diagram
*Advantages of Convolutional codes
Multiple Classifier Systems
Multiple Classifier SystemsFarzad Vasheghani Farahani This presentation is about Multiple Classifier System (Ensemble of Classifiers). At first tell about the general idea of decision making, then address reasons and rationales of using Multiple Classifier System, after that concentrate on designing Multiple Classifier System: 1.Create an Ensemble 2.Combining Classifiers.
Core programming in c
Core programming in cRahul Pandit This C program takes in an integer from the user and converts it to its binary equivalent. It uses bitwise operators like right shift and AND to extract each bit and check if it is 1 or 0. A loop shifts the number by 31, 30, 29 ... 1, 0 bits and ANDs it with 1 each time to extract the bits, printing 1 for each bit that is 1 and 0 for each bit that is 0, effectively converting the decimal number to its 32-bit binary representation.
Basics of Digital Filters
Basics of Digital Filtersop205 3F3 – Digital Signal Processing (DSP), January 2009, lecture slides 4, Dr Elena Punskaya, Cambridge University Engineering Department
Convolution codes and turbo codes
Convolution codes and turbo codesManish Srivastava Convolution codes and turbo codes are error-correcting codes used to reliably transmit digital data over noisy communication channels. Convolution codes work by convolving the sequence of information bits according to some rule, spreading the bits along the coded sequence. Turbo codes achieve better error correction than convolution codes through the parallel concatenation of convolutional encoders separated by an interleaver, along with iterative decoding. The Viterbi algorithm is typically used to decode convolution codes by finding the most probable state sequence, while turbo codes use two decoders and feedback to iteratively improve the decoding of each encoded sequence.
Id3,c4.5 algorithim
Id3,c4.5 algorithimAbdelfattah Al Zaqqa ID3, C4.5 :used to generate a decision tree developed by Ross Quinlan typically used in the machine learning and natural language processing domains, overview about these algorithms with illustrated examples
Delta Modulation & Adaptive Delta M.pptx
Delta Modulation & Adaptive Delta M.pptxrubini Rubini This document provides an overview of several waveform coding and representation techniques, including PCM, DM, ADM, and DPCM. PCM converts an analog signal into a digital binary sequence by sampling, quantizing, and encoding the signal. DM and ADM transmit only one bit per sample and adapt the step size used for quantization. DPCM uses prediction to transmit only the difference between the predicted and actual signal values, requiring fewer bits.
Turbo Codes
Turbo Codesvasanth_mtech Turbo codes provide reliable communication at high data rates by combining concepts from block and convolutional codes. They use two convolutional encoders separated by an interleaver, producing redundant parity bits. During iterative decoding, probabilistic information from the first decoder is used as a priori information for the second decoder, and vice versa, improving the estimates of the transmitted bits at each iteration. Turbo codes achieve performance close to the theoretical channel capacity limit with low error rates. They have applications in deep space communications, mobile wireless systems, and other areas requiring high reliability transmission.
DSP_2018_FOEHU - Lec 03 - Discrete-Time Signals and Systems
DSP_2018_FOEHU - Lec 03 - Discrete-Time Signals and SystemsAmr E. Mohamed The document discusses discrete-time signals and systems. It defines discrete-time signals as sequences represented by x[n] and discusses important sequences like the unit sample, unit step, and periodic sequences. It then defines discrete-time systems as devices that take a discrete-time signal x(n) as input and produce another discrete-time signal y(n) as output. The document classifies systems as static vs. dynamic, time-invariant vs. time-varying, linear vs. nonlinear, and causal vs. noncausal. It provides examples to illustrate each classification.
Huffman and Arithmetic coding - Performance analysis
Huffman and Arithmetic coding - Performance analysisRamakant Soni Huffman coding and arithmetic coding are analyzed for complexity.
Huffman coding assigns variable length codes to symbols based on probability and has O(N2) complexity. Arithmetic coding encodes the entire message as a fraction between 0 and 1 by dividing intervals based on symbol probability and has better O(N log n) complexity. Arithmetic coding compresses data more efficiently with fewer bits per symbol and has lower complexity than Huffman coding asymptotically.
Convolution Codes
Convolution CodesPratishtha Ram The document discusses convolution codes. It defines convolution codes as having three parameters (n, k, m) where n is the number of output bits, k is the number of input bits, and m is the number of memory registers. Convolutional codes add redundancy to protect data sent over noisy channels and are characterized by their constraint length L, which represents the number of bits in the encoder memory affecting output. The document provides an example of a (2,1,4) convolutional code and illustrates its operation through input sequences, state diagrams, tree diagrams, and trellis diagrams. It also describes methods for decoding convolution codes including sequential decoding using the Fano algorithm and maximum likelihood decoding using the Viterbi algorithm.
Error detection and correction codes
Error detection and correction codesGargiKhanna1 Dr. Gargi Khanna discusses error detection and correction codes such as parity codes and Hamming codes. Parity codes add an extra bit to allow detection of errors in transmitted data by checking if the total number of 1s is even or odd. Block parity codes apply this to blocks of data with row and column parity. Hamming codes can detect single and double bit errors using additional parity bits placed in specific bit locations. This allows identification and correction of single bit errors during data transmission.
Arithmetic coding
Arithmetic coding09lavee This document provides an introduction to arithmetic coding, a data compression technique. It begins with an abstract, introduction, and overview of arithmetic coding and how it differs from other entropy encoding techniques like Huffman coding. It then goes into more detail about the basic concepts, motivation, and methods behind arithmetic coding over multiple chapters. It discusses how arithmetic coding encodes data by creating a code that represents a fraction in the unit interval [0,1] and recursively partitions this interval based on the input symbols. The document provides examples to illustrate how arithmetic coding works and generates unique tags for symbol sequences.
Similar to VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notes (20)
Chapter 03 cyclic codes
Chapter 03 cyclic codesManoj Krishna Yadavalli Cyclic codes have an algebraic structure that allows them to be specified concisely using a single generator polynomial. A cyclic code C of length n is a set of codewords that is generated by a polynomial g(x) that divides x^n - 1. Every cyclic code C can be expressed as 〈g(x)〉, where g(x) is the unique monic generator polynomial of smallest degree. The dimension of C is n - degree(g(x)). A generator matrix for C can be constructed by using the coefficients of g(x).
Information & Communication System --Syndrome.pptx
Information & Communication System --Syndrome.pptxlogeswarisaravanan Syndrome in Information & Communication System
Paper computer
Paper computerbikram ... The document provides instructions for a written test for admission to the Tata Institute of Fundamental Research. It describes that the test will have three parts, with Part A being common to both Computer Science and Systems Science streams. Part B will cover topics specific to Computer Science, while Part C will cover topics specific to Systems Science. Sample topics and questions are provided for each stream. The test will be three hours, multiple choice, and involve negative marking for incorrect answers. Calculators will not be permitted.
Paper computer
Paper computerbikram ... The document provides instructions for a written test for admission to the Tata Institute of Fundamental Research. It describes that the test will have three parts, with Part A being common to both Computer Science and Systems Science streams. Part B will cover topics specific to Computer Science, while Part C will cover topics specific to Systems Science. Sample topics and questions are provided for each stream. The test will be three hours, multiple choice, and involve negative marking for incorrect answers. Calculators will not be permitted.
Understanding Reed-Solomon code
Understanding Reed-Solomon code继顺(Jeffrey) 王 Understanding the math of Reed-Solomon code (based on FEC code RS(544,514) used in IEEE 200/400GBASE-R)
DIGITAL SYSTEM DESIGN 
DIGITAL SYSTEM DESIGN Prakash Rao The document outlines the syllabus for a course on digital system design taught by Dr. R. Prakash Rao. The syllabus covers topics like Boolean algebra, logic gates, combinational logic systems, sequential logic systems, and binary codes. It also discusses digital representation of signals, error detection and correction codes, and Boolean algebra manipulation.
Bch and reed solomon codes generation in frequency domain
Bch and reed solomon codes generation in frequency domainMadhumita Tamhane Digital signal processing is permeated with application of Fourier Transforms. When time variable is continuous, study of real-valued or complex valued signals rely heavily on Fourier transforms. Fourier Transforms also exist on the vector space of n-tuples over the Galois field GF(q) for many values of n, i.e. code-words. Cyclic codes can be defined as codes whose code-words have certain specific spectral components equal to zero. Conjugacy constraints provide an analogous condition for a finite field. BCH and Reed Solomon codes can be easily generated in frequency domain based on conjugacy constraints.
DIGITAL COMMUNICATION: ENCODING AND DECODING OF CYCLIC CODE 
DIGITAL COMMUNICATION: ENCODING AND DECODING OF CYCLIC CODE ShivangiSingh241 Cyclic codes are a type of linear code where any cyclic shift of a codeword is also a codeword. This allows for efficient encoding and decoding using shift registers.
Encoding of cyclic codes can be done by dividing the message polynomial by the generator polynomial, with the remainder becoming the parity bits. Encoding circuits use shift registers with feedback to efficiently perform this division. Decoding uses the syndrome, which is computed by shifting the received word into a syndrome register. A decoder then attempts to match the syndrome to an error pattern, correcting errors one symbol at a time by shifting the syndrome and received word simultaneously.
Cyclic code non systematic
Cyclic code non systematicNihal Gupta 1) Cyclic codes are a type of linear block code that have two properties: linearity and cyclic shifting.
2) An example code is analyzed to determine if it meets the criteria of a cyclic code.
3) Cyclic codes can be systematic or non-systematic, and code words in a non-systematic cyclic code can be represented as polynomials related to a generator polynomial.
unit 5 (1).pptx
unit 5 (1).pptxHimansuShekharPradha1 Convolutional codes are a type of error correcting code where each coded output block depends not only on the corresponding input block but also on previous input blocks. The encoder contains shift registers and logic gates. Convolutional codes are characterized by parameters k (input bits), n (output bits), and m (memory order). The distance properties and performance of convolutional codes depends on the constraint length L, which is a function of k and m. Convolutional codes can be represented using trees, trellises, state diagrams or polynomials to describe the encoding process.
Review paper on Reed Solomon (204,188) Decoder for Digital Video Broadcasting...
Review paper on Reed Solomon (204,188) Decoder for Digital Video Broadcasting...IRJET Journal This document discusses a review paper on a (204,188) Reed Solomon decoder used for digital video broadcasting terrestrial applications. It provides an overview of Reed Solomon codes, how they are used for error correction, and their applications in areas like data storage and digital video broadcasting. It then describes the encoding and decoding process for a (204,188) Reed Solomon code in detail, including how the encoder works, syndrome calculation, error location and evaluation, and Chien search decoding. Digital video broadcasting standards that use concatenated Reed Solomon codes for error protection are also discussed.
Digital Communication Exam Help
Digital Communication Exam HelpLive Exam Helper This document provides information about convolutional codes over the finite field F4 and their binary images. It includes problems analyzing the properties of these codes, including:
- Showing that a convolutional code C over F4 is linear
- Deriving the generator polynomials for C
- Analyzing the trellis structure and properties of C
- Computing metrics like the free distance for C and its binary images
- Comparing the performance of the binary image codes to optimal rate codes
The document contains detailed solutions to each problem analyzing various aspects of the convolutional codes over F4 and their binary images.
A new approach in specifying the inverse quadratic matrix in modulo-2 for con...
A new approach in specifying the inverse quadratic matrix in modulo-2 for con...Anax Fotopoulos The document discusses a new approach for specifying the inverse quadratic matrix in modulo-2 for information channels. It describes modeling communication systems using state space equations from digital control theory. It discusses concepts like controllability and observability of systems using rank tests on controllability and observability tables. It also covers concepts from information theory like groups, cyclic groups, and rings as they relate to channel encoding.
Encoder for (7,3) cyclic code using matlab
Encoder for (7,3) cyclic code using matlabSneheshDutta This document provides an overview of cyclic codes including:
- What cyclic codes are and their properties of error detection and correction.
- The method of generating cyclic codes by multiplying message polynomials by a generator polynomial.
- How to systematically encode cyclic codes in three steps.
- The encoding and decoding circuits including Meggitt decoder.
- An example of a (7,3) cyclic code implemented in Matlab showing the encoding, corruption with errors, and decoding.
- How cyclic codes can detect errors through syndrome computation and lookup tables.
- Applications of cyclic codes in message identification.
Mtc ssample05
Mtc ssample05bikram ... The document describes a test for candidates applying for an M.Tech. in Computer Science. [The test consists of two parts - an objective test in the morning and a short answer test in the afternoon. The short answer test has two groups - Group A covers analytical ability and mathematics at the B.Sc. level, while Group B covers additional topics in mathematics, statistics, physics, computer science, or engineering depending on the candidate's choice.] The document provides sample questions testing concepts in mathematics including algebra, calculus, number theory, and logic.
Mtc ssample05
Mtc ssample05bikram ... The document provides information about a test for candidates applying for an M.Tech in Computer Science. It describes:
1) The test will have two parts - a morning objective test (Test MIII) and an afternoon short answer test (Test CS).
2) The CS test booklet will have two groups - Group A covering analytical ability and mathematics at the B.Sc. pass level, and Group B covering advanced topics in mathematics, statistics, physics, computer science, and engineering at the B.Sc. Hons. and B.Tech. levels.
3) Sample questions are provided for both Group A (mathematical reasoning and basic concepts) and Group B (advanced topics in real analysis
cyclic_code.pdf
cyclic_code.pdfrahelbirhanu1 Ifthecomponentsofan n-tuple v =( v0,v1,...,vn−1)are cyclicallyshifted i placestotheright,theresultant n-tuple wouldbe
v(i) =( vn−i,vn−i+1,...,vn−1,v0,v1,...,vn−i−1). • Cyclicallyshifting v i placestotherightisequivalentto cyclicallyshifting v n−i placestotheleft. • An(n,k)linearcode C iscalleda cycliccode ifeverycyclicshift ofacodevectorin C isalsoacodevectorin C. • Codepolynomial v(x)ofthecodevector v isdefinedas v(x)=v0 + v1x +···+ vn−1xn−1. • v(i)(x)=xiv(x)modxn +1 .
CHAPTER 02 - Linear codes.ppt
CHAPTER 02 - Linear codes.pptdlakmlkfma Linear codes are special sets of words of a fixed length over an alphabet where the words can be treated as vectors. Linear codes have important properties including a concise description, nice mathematical properties, and efficient encoding and decoding. A linear code is a subset of the vector space of all possible words where the sum of any two codewords is also a codeword, and where codewords can be multiplied by field elements and remain codewords. Examples of properties of linear codes include that their minimum distance is equal to the smallest weight of a non-zero codeword, and that they have a unique encoding for each message using a generator matrix.
CHAPTER 02 - Linear codes.ppt
CHAPTER 02 - Linear codes.pptdlakmlkfma Linear codes are special sets of words of a fixed length over an alphabet where the words can be treated as vectors. Linear codes have important properties including a concise description, nice mathematical properties, and efficient encoding and decoding. A linear code is a subset of words where the sum of any two codewords is also a codeword, and where codewords can be multiplied by field elements and remain codewords. Common operations on linear codes include finding equivalent codes through row and column operations, encoding by matrix multiplication, and decoding using coset leaders.
More from Jayanth Dwijesh H P (11)
Network and cyber security module(15ec835, 17ec835)
Network and cyber security module(15ec835, 17ec835)Jayanth Dwijesh H P NETWORK AND CYBER SECURITY(17ec835)
MODULE-1 :- Transport Level Security: Web Security Considerations, Secure Sockets Layer, Transport Layer Security, HTTPS, Secure Shell (SSH).
MODULE-2:-E-mail Security: Pretty Good Privacy, S/MIME, Domain keys identified mail.
MODULE-3:- IP Security: IP Security Overview, IP Security Policy, Encapsulation Security Payload (ESP), combining security Associations Internet Key Exchange. Cryptographic Suites.
MODULE-4:- Cyber network security concepts(CHAPTER-1): Security Architecture, Antipattern: signature based malware detection versus polymorphic threads, document driven certification and accreditation, policy driven security certifications. Refactored solution: reputational, behavioural and entropy based malware detection.
The problems(CHAPTER-2): cyber antipatterns concept, forces in cyber antipatterns, cyber anti pattern templates, cyber security Antipattern catalog.
MODULE-5 :- Cyber network security concepts contd. :
Enterprise security using Zachman framework
Zachman framework for enterprise architecture, primitive models versus composite models, architectural problem solving patterns, enterprise workshop, matrix mining, mini patterns for problem solving meetings.
Case study: cyber security hands on – managing administrations and root accounts, installing hardware, reimaging OS, installing system protection/ antimalware, configuring firewalls.
Text Books:
1. William Stallings, “Cryptography and Network Security Principles and Practice”, Pearson Education Inc., 6th Edition, 2014, ISBN: 978-93-325- 1877-3.
2. Thomas J. Mowbray, “Cyber Security – Managing Systems, Conducting Testing, and Investigating Intrusions”, Wiley.
VTU Network & cyber security (1-5 Module) Full notes
VTU Network & cyber security (1-5 Module) Full notesJayanth Dwijesh H P Network & cyber security
Transport Level Security: Web Security Considerations, Secure Sockets Layer, Transport
Layer Security, HTTPS, Secure Shell (SSH).
E-mail Security: Pretty Good Privacy, S/MIME, Domain keys identified mail.
IP Security: IP Security Overview, IP Security Policy, Encapsulation Security Payload (ESP),Combining security Associations Internet Key Exchange. Cryptographic Suites
Cyber network security concepts: Security Architecture, antipattern: signature based
malware detection versus polymorphic threads, document driven certification and
accreditation, policy driven security certifications. Refactored solution: reputational,
behavioural and entropy based malware detection.
The problems: cyber antipatterns concept, forces in cyber antipatterns, cyber anti pattern
templates, cyber security antipattern catalog.
Cyber network security concepts contd. :
Enterprise security using Zachman framework
Zachman framework for enterprise architecture, primitive models versus composite
models, architectural problem solving patterns, enterprise workshop, matrix mining, mini
patterns for problem solving meetings.
Case study: cyber security hands on – managing administrations and root accounts,
installing hardware, reimaging OS, installing system protection/ antimalware, configuring
firewalls
Vtu network security(10 ec832) unit 3 notes.
Vtu network security(10 ec832) unit 3 notes.Jayanth Dwijesh H P UNIT - 3
Principles of Public-Key Cryptosystems, The RSA algorithm, Key Management, Diffie - Hellman Key Exchange, Elliptic Curve Arithmetic, and Authentication functions, Hash Functions.
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...![VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-4-190103070746-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW] 5th Sem Information Theory and Coding Module-4 notes(15...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication Engineering /
Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code:15EC54 and 17EC54
Module-4
Error Control Coding:
Introduction, Examples of Error control coding, methods of Controlling Errors, Types of Errors, types of Codes, Linear Block Codes: matrix description of Linear Block Codes, Error Detection and Error Correction Capabilities of Linear Block Codes, Single Error Correcting hamming Codes, Table lookup Decoding using Standard Array.
Binary Cyclic Codes:
Algebraic Structure of Cyclic Codes, Encoding using an (n-k) Bit Shift register, Syndrome Calculation, Error Detection and Correction (Sections 9.1, 9.2, 9.3, 9.3.1, 9.3.2, 9.3.3 of Text 1).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
VTU E&C,TCE CBCS[NEW]5th Sem Information Theory and Coding Module-3 notes(15&...![VTU E&C,TCE CBCS[NEW]5th Sem Information Theory and Coding Module-3 notes(15&...](https://cdn.slidesharecdn.com/ss_thumbnails/itcmodule-3-190103070404-thumbnail.jpg?width=560&fit=bounds)
VTU E&C,TCE CBCS[NEW]5th Sem Information Theory and Coding Module-3 notes(15&...Jayanth Dwijesh H P INFORMATION THEORY AND CODING
B.E., V Semester, Electronics & Communication
Engineering / Telecommunication Engineering
[As per Choice Based Credit System (CBCS) scheme]
Subject Code:15EC54 and 17EC54
Module-3
Information Channels: Communication Channels ( Section 4.4 of Text 1). Channel Models, Channel Matrix, Joint probabilty Matrix, Binary Symmetric Channel, System Entropies, Mutual Information, Channel Capacity, Channel Capacity of : Binary Symmetric Channel, Binary Erasure Channel, Muroga,s Theorem, Contineuos Channels (Sections 4.2, 4.3, 4.4, 4.6, 4.7 of Text 3).
Question paper pattern:
The question paper will have ten questions
Each full question consists of 16marks.
There will be 2 full questions (with a maximum of four sub questions) from each module.
Each full question will have sub questions covering all the topics under a Module.
The students will have to answer 5 full questions, selecting one full question From each module.
Text Book:
1. Information Theory and Coding, Muralidhar Kulkarni , K.S. Shivaprakasha, Wiley India Pvt. Ltd, 2015, ISBN:978-81-265-5305-1
2. Digital and analog communication systems, K. Sam Shanmugam, John Wiley India Pvt. Ltd, 1996.
3. Digital communication, Simon Haykin, John Wiley India Pvt. Ltd, 2008.
Reference Books:
1. ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007
2. Principles of digital communication, J. Das, S. K. Mullick, P. K. Chatterjee, Wiley, 1986 - Technology & Engineering
3. Digital Communications – Fundamentals and Applications, Bernard Sklar, Second Edition, Pearson Education, 2016, ISBN: 9780134724058.
4. Information Theory and Coding, K.N.Hari bhat, D.Ganesh Rao, Cengage Learning, 2017.
Network security 10EC832 vtu notes
Network security 10EC832 vtu notesJayanth Dwijesh H P NETWORK SECURITY
UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for network security. 6 Hrs
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher. 7 Hrs
UNIT - 3
Principles of Public-Key Cryptosystems, The RSA algorithm, Key Management, Diffie - Hellman Key Exchange, Elliptic Curve Arithmetic, Authentication functions, Hash Functions. 6 Hrs
UNIT - 4
Digital signatures, Authentication Protocols, Digital Signature Standard. 7 Hrs
UNIT - 5
Web Security Consideration, Security socket layer (SSL) and Transport layer security, Secure Electronic Transaction. 6 Hrs
UNIT - 6
Intruders, Intrusion Detection, Password Management. 6 Hrs
UNIT - 7
MALICIOUS SOFTWARE: Viruses and Related Threats, Virus Countermeasures. 7 Hrs
UNIT - 8
Firewalls Design Principles, Trusted Systems. 6 Hrs
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
VTU network security(10 ec832) unit 6 notes
VTU network security(10 ec832) unit 6 notesJayanth Dwijesh H P This document discusses network security and focuses on unit 6 which covers intruders, intrusion detection, and password management. It defines different types of intruders such as masqueraders, misfeasors, and clandestine users. It also describes common intrusion techniques like exploiting vulnerabilities, password cracking, and acquiring privileged access. The document outlines typical behavior patterns of hackers, criminal enterprises, and insider threats. Finally, it discusses the importance of intrusion detection as a secondary line of defense when intrusion prevention fails.
Vtu network security(10 ec832) unit 5 notes.
Vtu network security(10 ec832) unit 5 notes.Jayanth Dwijesh H P UNIT - 5
Web Security Consideration, Security socket layer (SSL) and Transport layer security, Secure Electronic Transaction.
Vtu network security(10 ec832) unit 2 notes..
Vtu network security(10 ec832) unit 2 notes..Jayanth Dwijesh H P UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
Vtu network security(10 ec832) unit 1 notes
Vtu network security(10 ec832) unit 1 notesJayanth Dwijesh H P UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for
network security.
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -2notes
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -2notesJayanth Dwijesh H P This document contains formulas and definitions related to information theory and source coding. It includes equations for calculating entropy, average length, efficiency, and redundancy of various source coding techniques. Formulas are provided for binary, ternary, and quaternary Huffman coding, as well as extensions of the source. Definitions of terms like entropy, average length, efficiency, and redundancy are also given.
Recently uploaded (20)
"Orthoptera: Grasshoppers, Crickets, and Katydids pptx
"Orthoptera: Grasshoppers, Crickets, and Katydids pptxArshad Shaikh Orthoptera is an order of insects that includes grasshoppers, crickets, and katydids. Characterized by their powerful hind legs, Orthoptera are known for their impressive jumping ability. With diverse species, they inhabit various environments, playing important roles in ecosystems as herbivores and prey. Their sounds, often produced through stridulation, are distinctive features of many species.
Regression Analysis-Machine Learning -Different Types
Regression Analysis-Machine Learning -Different TypesGlobal Academy of Technology Regression
Linear Regression
Multiple Linear Regression
Polynomial Regression
Logistics Regression
Quiz-E-Mataram (Under 20 Quiz Set) .pptx
Quiz-E-Mataram (Under 20 Quiz Set) .pptxSouptikUkil Quiz-E-Mataram is an U-20 Quiz.Presented & Hosted by me in 15th August 2022.
Samarth QUIZ 2024-25_ FINAL ROUND QUESTIONS
Samarth QUIZ 2024-25_ FINAL ROUND QUESTIONSAnand Kumar SAMARTH QUIZ 2024-25- FINAL ROUND: As a part of SAIL level Management Business Quiz, final round of Quiz conducted at DSP SAIL.
Understanding-the-Weather.pdf/7th class/social/ 2nd chapter/Samyans Academy n...
Understanding-the-Weather.pdf/7th class/social/ 2nd chapter/Samyans Academy n...Sandeep Swamy Weather shapes our world and daily lives. This presentation explores how we measure weather conditions and use predictions to prepare for various weather events. "A change in the weather is sufficient to create the world and oneself anew." - Marcel Proust, French novelist by sandeep swamy
Unit 1 Kali NetHunter is the official Kali Linux penetration testing platform...
Unit 1 Kali NetHunter is the official Kali Linux penetration testing platform...ChatanBawankar Kali NetHunter is the official Kali Linux penetration testing platform for Android devices.
Odoo 18 Point of Sale PWA - Odoo Slides
Odoo 18 Point of Sale PWA - Odoo SlidesCeline George Progressive Web Apps (PWA) are web applications that deliver an app-like experience using modern web technologies, offering features like offline functionality, installability, and responsiveness across devices.
The Splitting of the Moon (Shaqq al-Qamar).pdf
The Splitting of the Moon (Shaqq al-Qamar).pdfMirza Gazanfar Ali Baig This article explores the miraculous event of the Splitting of the Moon (Shaqq al-Qamar) as recorded in Islamic scripture and tradition. Drawing from the Qur'an, authentic hadith collections, and classical tafsir, the article affirms the event as a literal miracle performed by Prophet Muhammad ﷺ in response to the Quraysh’s demand for a sign. It also investigates external historical accounts, particularly the legend of Cheraman Perumal, a South Indian king who allegedly witnessed the miracle and embraced Islam. The article critically examines the authenticity and impact of such regional traditions, while also discussing the lack of parallel astronomical records and how scholars have interpreted this event across centuries. Concluding with the theological significance of the miracle, the article offers a well-rounded view of one of Islam’s most discussed supernatural events.
[2025] Qualtric XM-EX-EXPERT Study Plan | Practice Questions + Exam Details![[2025] Qualtric XM-EX-EXPERT Study Plan | Practice Questions + Exam Details](https://cdn.slidesharecdn.com/ss_thumbnails/2025qualtricxm-ex-expertstudyplanpracticequestionsexamdetails-250527093747-448c8922-thumbnail.jpg?width=560&fit=bounds)
[2025] Qualtric XM-EX-EXPERT Study Plan | Practice Questions + Exam DetailsJenny408767 Pass the SAP XM-EX-EXPERT exam with expert-designed practice tests, accurate questions, and a 100% success guarantee. Start your prep today!
Unit 1 Tools Beneficial for Monitoring the Debugging Process.pdf
Unit 1 Tools Beneficial for Monitoring the Debugging Process.pdfChatanBawankar Unit 1 Tools Beneficial for Monitoring the Debugging Process.pdf
Geographical-Diversity-of-India.pptx/7th class /new ncert /samyans academy
Geographical-Diversity-of-India.pptx/7th class /new ncert /samyans academySandeep Swamy Geographical Diversity of India
India stands as a land of remarkable geographical diversity. Its unique features shape the national character, as noted by Sri Aurobindo.
We'll explore how India's varied landscapes influence daily life and contribute to its distinct identity on the world stage.
How to Use Owl Slots in Odoo 17 - Odoo Slides
How to Use Owl Slots in Odoo 17 - Odoo SlidesCeline George In this slide, we will explore Owl Slots, a powerful feature of the Odoo 17 web framework that allows us to create reusable and customizable user interfaces. We will learn how to define slots in parent components, use them in child components, and leverage their capabilities to build dynamic and flexible UIs.
the dynastic history of the Gahadwals of Early Medieval Period
the dynastic history of the Gahadwals of Early Medieval PeriodPrachiSontakke5 for students of Sem II BHU
Unit Kali NetHunter is the official Kali Linux penetration testing platform f...
Unit Kali NetHunter is the official Kali Linux penetration testing platform f...ChatanBawankar Kali NetHunter is the official Kali Linux penetration testing platform for Android devices.
Flower Identification Class-10 by Kushal Lamichhane.pdf
Flower Identification Class-10 by Kushal Lamichhane.pdfkushallamichhame This includes the overall cultivation practices of rose prepared by:
Kushal Lamichhane
Instructor
Shree Gandhi Adarsha Secondary School
Kageshowri Manohara-09, Kathmandu, Nepal
Protest - Student Revision Booklet For VCE English
Protest - Student Revision Booklet For VCE Englishjpinnuck The 'Protest Student Revision Booklet' is a comprehensive resource to scaffold students to prepare for writing about this idea framework on a SAC or for the exam. This resource helps students breakdown the big idea of protest, practise writing in different styles, brainstorm ideas in response to different stimuli and develop a bank of creative ideas.
Drug Metabolism advanced medicinal chemistry.pptx
Drug Metabolism advanced medicinal chemistry.pptxpharmaworld This document describes about structural metabolism relationship and drug designing and toxicity of drugs in " DRUG METABOLISM"
In Drug Metabolism is the process of converting a drug into product or inert substances after or before reaching at the site of action.
Metabolism plays an important role in elimination of drugs and foreign substance from the body.
The metabolism of any drug is generally characterised by two phases of reaction
1.Metabolic transformation ( biotransformation ) and
2.Conjugation
The Principal site of drug metabolism is the liver, but the kidney, lungs, and GIT also are important metabolic sites.
The enzymatic bio transformations of drugs is known as Drug Metabolism. Because many drugs have structures similar to those of endogenous compounds , drugs may get metabolised by specific enzymes for the related natural substrates as well as by non-specific enzymes.
Reaction type of Phase-I:
1.Oxidation
2.Reduction
3.Hydrolysis
Most drugs are metabolised ,atleast to some extent , by both phases of metabolism.
Example: Metabolism of Aspirin
Acetyl Salicylic acid undergoes hydrolysis to salicylic acid ( metabolic transformation ), which is then conjugated with glycine to form Salicyluric acid ( Conjugation ).
In Phase-II the metabolites formed in Phase-II are converted to more polar and water soluble product by attaching polar and ionisable moiety such as
1.Glucuronic acid
2.Glycine
3.Glutamine
4.Glutathione conjugation
5.Acetylation
6.Methylation
7.Sulfate conjugation
8.Nucleoside and Nucleotide formation
9.Amino Acid Conjugation
10.Fatty Acid and Cholesterol Conjugation
Drug design is the process of creating new drugs by using knowledge of a biological target.
Drug design considers metabolism to optimize pharmaco kinects ( ADME: Absorption , Distribution , Metabolism , Excretion )
Cytochrome CYP450 enzyme in Drug Metabolism is vital in drug design to enhance efficacy , reduce toxicity and improve bioavailability.
Cytochrome P450 enzymes (CYPs) are a superfamily of heme -containing proteins found from bacteria to human.
Cytochrome P-450 activity in various organs like Liver,Lung ,Kidney , Intestine,Placenta
Adrenal and Skin and they shows the relative activity with repect to their organs in the process of drug metabolism.
Most important CYP450 enzymes are CYP1A2 , CYP2C9 , CYP2E1
,etc...
Toxic Effects of Drug Metabolism
Toxicity: Accumulation of Excess of medications in the Blood Stream.
Ariens (1948) and Mitchell and Horning (1984) deal with this topic.
Some examples of Metabolism-Linked Toxicity are
1.Acetaminophen (paracetmol)
2.Isoniazid ( TB drug)
3.Chloroform
4.Dapsone
5.Diazepam
6.Salicylate
7.Halothane (Anesthetic)
8.Tamoxifen (Breast Cancer drug )
9.Clozapine(Antipsychotic)
These drugs are differentiates with the TOXIC METABOLITE , TOXICITY OF METABOLITE.
References for this topic also mentioned at the end.
VTU CBCS E&C 5th sem Information theory and coding(15EC54) Module -5 notes
- 1. INFORMATION THEORY AND CODING 5th SEM E&C JAYANTHDWIJESH H P M.tech (DECS) Assistant Professor – Dept of E&C B.G.S INSTITUTE OF TECHNOLOGY (B.G.S.I.T) B.G Nagara, Nagamangala Tq, Mandya District- 571448
- 2. FORMULAS FOR REFERENCE MODULE – 5 (Some Important Cyclic Codes and Convolution Codes) Chapter -1 Some Important Cyclic Codes Reed – Solomon (RS) codes Chapter-2 Convolution Codes Time domain approach The generator matrix G is given by
- 3. Number of rows in [G] =L (one input) Number of rows in [G] =2L (two inputs) Number of columns in [G]= n(L+M) The output of the encoder is given by [C] = [d][G] Transform domain approach The output polynomials for the j(j=1,2,3…) adders are given by 𝑪𝒋 (x)= d(x) 𝒈𝒋 (x) for j=1, 2, 3…. The output of the encoder is given by C(X) = 𝑪(𝟏) (𝑿 𝒏 ) +X 𝑪(𝟐) (𝑿 𝒏 ) + 𝑿 𝟐 𝑪(𝟑) (𝑿 𝒏 ) +……………+𝑿 𝒏−𝟏 𝑪(𝒏) (𝑿 𝒏 )