Concatenated symbolical MTD1 Concatenated coding for data bases with MTD * * * * * * * MNITI, Space Institute Research (the Report at 10-th International.

Slides:



Advertisements
Similar presentations
Decoding of Convolutional Codes  Let C m be the set of allowable code sequences of length m.  Not all sequences in {0,1}m are allowable code sequences!
Advertisements

Inserting Turbo Code Technology into the DVB Satellite Broadcasting System Matthew Valenti Assistant Professor West Virginia University Morgantown, WV.
Information Theory EE322 Al-Sanie.
Modern Digital and Analog Communication Systems Lathi Copyright © 2009 by Oxford University Press, Inc. C H A P T E R 15 ERROR CORRECTING CODES.
Maximum Likelihood Sequence Detection (MLSD) and the Viterbi Algorithm
For channels with a large noise level: MTD - IKI RAS Dr. Sc. V. V. Zolotarev.
CB1004 Modelling Business Systems 51 Modelling Business Systems 5 Information and Communication.
Cellular Communications
Turbo Codes – Decoding and Applications Bob Wall EE 548.
Figure 6.1. A convolutional encoder. Figure 6.2. Structure of a systematic convolutional encoder of rate.
1 Chapter 1 Introduction. 2 Outline 1.1 A Very Abstract Summary 1.2 History 1.3 Model of the Signaling System 1.4 Information Source 1.5 Encoding a Source.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Reed Solomon Codes block oriented FEC used in high reliability wireless applications non-binary code with m-ary symbol alphabet e.g. M = 8  alphabet size.
296.3Page :Algorithms in the Real World Convolutional Coding & Viterbi Decoding.
BLOCK DIAGRAM OF COMPUTER
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 10 Database Performance Tuning and Query Optimization.
1 INF244 Textbook: Lin and Costello Lectures (Tu+Th ) covering roughly Chapter 1;Chapters 9-19? Weekly exercises: For your convenience Mandatory.
Review of modern noise proof coding methods D. Sc. Valeri V. Zolotarev.
Sequential Soft Decision Decoding of Reed Solomon Codes Hari Palaiyanur Cornell University Prof. John Komo Clemson University 2003 SURE Program.
Chapter 1 In-lab Quiz Next week
A Soft Decision Decoding Scheme for Wireless COFDM with Application to DVB-T Advisor : Yung-An Kao Student : Chi-Ting Wu
Chapter 1 Database Systems
1 (Chapter 15): Concatenated codes Simple (classical, single-level) concatenation Length of concatenated code: n 1 n 2 Dimension of concatenated code:
Scientific session DNIT of the RAS New optimization coding theory and its applied achievements V.V.Zolotarev, SRI RAS.
Optimum Decoding Characteristics Achievement on the Basis of Multithreshold Algorithms (for ISCTA’07) Space Research Institute RAS United Radioelectronic.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Chapter 2 Data Manipulation Yonsei University 1 st Semester, 2015 Sanghyun Park.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
Computer Hardware Basic Computer Concepts Data Representation and Digital Electronics  Data Representation  makes it possible to convert letters, sounds,
Coding Theory Efficient and Reliable Transfer of Information
Evaluation of Digital Technology
Computer Science Binary. Binary Code Remember the power supply that is inside your computer and how it sends electricity to all of the components? That.
Iterative decoding If the output of the outer decoder were reapplied to the inner decoder it would detect that some errors remained, since the columns.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Last time, we talked about:
Basics Modulation Multiple Access
Coding technology Lecturer: Prof. Dr. János LEVENDOVSZKY Course website:
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Error Correction Code (2)
Achievement of Optimum Decoding Performance at the Multithreshold Algorithms Basis * * * * * * * MNITI, Space Research Institute (Report at Conference.
Performance of Coherent M-ary Signaling ENSC 428 – Spring 2007.
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
Sujan Rajbhandari LCS Convolutional Coded DPIM for Indoor Optical Wireless Links S. Rajbhandari, N. M. Aldibbiat and Z. Ghassemlooy Optical Communications.
Sequential Soft Decision Decoding of Reed Solomon Codes Hari Palaiyanur Cornell University Prof. John Komo Clemson University 2003 SURE Program.
Code Division Multiple Access. 2 Code Division Multiplexing Also known as code division multiple access An advanced technique that allows multiple devices.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Implementation of Turbo Code in TI TMS320C8x Hao Chen Instructor: Prof. Yu Hen Hu ECE734 Spring 2004.
1 Product Codes An extension of the concept of parity to a large number of words of data 0110… … … … … … …101.
Block Coded Modulation Tareq Elhabbash, Yousef Yazji, Mahmoud Amassi.
1 Chapter 1 Basic Structures Of Computers. Computer : Introduction A computer is an electronic machine,devised for performing calculations and controlling.
FEC decoding algorithm overview VLSI 자동설계연구실 정재헌.
1 The user’s view  A user is a person employing the computer to do useful work  Examples of useful work include spreadsheets word processing developing.
Chapter 4: Information Theory. Learning Objectives LO 4.1 – Understand discrete and continuous messages, message sources, amount of information and its.
Non-Binary Multithreshold Decoders with Almost Optimum Performance (For ISCTA’07) Space Research Institute RAS United Radioelectronic Technologies - -
Coding technology Lecturer:
296.3:Algorithms in the Real World
What is this “Viterbi Decoding”
Coding for Noncoherent M-ary Modulation
Coding and Interleaving
Error Correction Code (2)
Error Correction Code (2)
Database Systems Chapter 1
Chapter 8 Models and Decision Support
Error Trapping on LFBSR
Unequal Error Protection for Video Transmission over Wireless Channels
USE OF MULTITHRESHOLD DECODERS IN EARTH REMOTE SENSING SYSTEMS
Error Correction Code (2)
*** Series 3RS Version 1, ***
Presentation transcript:

Concatenated symbolical MTD1 Concatenated coding for data bases with MTD * * * * * * * MNITI, Space Institute Research (the Report at 10-th International conference DSPA-2008, in Moscow, ) J.B.Zubarev,V.V.Zolotarev

Concatenated symbolical MTD2 Chipset of the MTD decoder at PLIS Xilinx

Concatenated symbolical MTD3 МАКЕТ МПД для каналов на 640 Мбит/с. Многопороговый декодер (МПД) для спутниковых и космических каналов связи. Повышает кпд их использования в раз, в том числе для ДЗЗ. Может работать на информационных скоростях до 1,6 Гбит/с

Concatenated symbolical MTD4 Chipset of the MTD decoder at PLIS ALTERA

Concatenated symbolical MTD5 The reference book " Noiseproof coding. Methods and algorithms " Under edition the member - correspondent of the Russian Academy of Sciences U.B.Zubarev Authors: V.V.Zolotarev, G.V.Ovechkin Publishing house Publishing house "the Hot Line - a Telecom ", 2004г. "the Hot Line - a Telecom ", 2004г.

Concatenated symbolical MTD6 V.V.Zolotarev The Theory and Algorithms of Multithreshold Decoding Under edition the member - correspondent of the Russian Academy of Science J.B.Zubarev ( Do you want to get translated this monograph?) Publishing houses " Radio and communication ", " the Hot Line - Telecom " 2006 Publishing houses " Radio and communication ", " the Hot Line - Telecom " 2006

Concatenated symbolical MTD7 Example of MTD with 3 iterations The convolutional multithreshold decoder for a code with R=1/2, d=5 and 3 iterations

Concatenated symbolical MTD8 The block symbolical MTD for a code with R=1/2 and d=5

Concatenated symbolical MTD9 Application of coding in databases necessarily, because: 1. Raises fidelity the stored data. 1. Raises fidelity the stored data. 2. Integrity of the digital information is guaranteed 2. Integrity of the digital information is guaranteed 3. Increased reliability of storage is provided 3. Increased reliability of storage is provided 4. The fast control of the storage reliability changes is realized. 4. The fast control of the storage reliability changes is realized. 5. Work of system of storage is provided at high levels of distortions in the data. 5. Work of system of storage is provided at high levels of distortions in the data. 6. It is provided with increased adjusting ability of MTD at the big decoder productivity 6. It is provided with increased adjusting ability of MTD at the big decoder productivity 7. Non-binary MTD – discovery in symbol decoding processing! RS codes- are out of any competions at all! 7. Non-binary MTD – discovery in symbol decoding processing! RS codes- are out of any competions at all!

Concatenated symbolical MTD10 Decoders MPD for the superbig DB 1. Speeds of soft decoders for usual PC - up to 30 Mbit/s 1. Speeds of soft decoders for usual PC - up to 30 Mbit/s 2. A level of error probabilities - up to 1 % - 8 %! 2. A level of error probabilities - up to 1 % - 8 %! 3. Code rates R=1/4 - 19/20 - anyone and for all levels of error probabilities. 3. Code rates R=1/4 - 19/20 - anyone and for all levels of error probabilities. 4. The decoder price will be quickly reduced from 30'000 $(development!) up to 3000 $ $ for small series 4. The decoder price will be quickly reduced from 30'000 $(development!) up to 3000 $ $ for small series

Concatenated symbolical MTD11

Concatenated symbolical MTD12 Characteristics of the symbolical MTD and Read - Solomon codes, R=7/8

Concatenated symbolical MTD13 Characteristics of the symbolical MTD and Read - Solomon codes, R=19/20

Concatenated symbolical MTD14 Visitors of bilingual specialized site SRI of the Russian Academy of Sciences in December, Over 8000 visitors of our website from 46 countries have copied more than 2 Гбайт the data on algorithms МПД in Over 8000 visitors of our website from 50 countries have copied more than 5 Gbites the data on MTD algorithms in THE USA Russia More 250 info-blocks! Statistics for 2006, December

Concatenated symbolical MTD15 The REVIEW of METHODS NOISEPROOF CODING with MULTITHRESHOLD ALGORITHMS J.B.Zubarev, V.V.Zolotarev, G.V.Ovechkin Digital signals processing, RF, Moscow, № 1, 2008 (in Russian! Do you want to get translation in English?)

Concatenated symbolical MTD16Conclusions 1. Binary MTD algorithms are revealed 35 years, and non-binary - 24 years ago. 2. Complexity of soft versions of QMTD is an absolute minimum of calculations known now. 3. They can get QMTD simulation statistics up to bits for ~1 hour with the usual PC! 4. Hard MTD at PLIS is extremely quick decoder 5. Decisions of QMTD usually well converge to decisions of the optimum decoder (OD) 6. QMTD – is the absolute leader among all algorithms by criteria "complexity - efficiency" 7. QMTD is out of to comparison! Their characteristics are fully unique because of decoding simplicity. 8.We suggest many demo programs from our web-site about various best algorithms. Let's work together!

Concatenated symbolical MTD MNITI, SRI RAS ph: , in Moscow! mobile.: