DOCSLIB.ORG

Download Special Issue

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Wireless Communications and Mobile Computing Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Lead Guest Editor: Zesong Fei Guest Editors: Jinhong Yuan and Qin Huang Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Wireless Communications and Mobile Computing Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Lead Guest Editor: Zesong Fei Guest Editors: Jinhong Yuan and Qin Huang Copyright © 2018 Hindawi. All rights reserved. This is a special issue published in “Wireless Communications and Mobile Computing.” All articles are open access articles distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, pro- vided the original work is properly cited. Editorial Board Javier Aguiar, Spain Oscar Esparza, Spain Maode Ma, Singapore Ghufran Ahmed, Pakistan Maria Fazio, Italy Imadeldin Mahgoub, USA Wessam Ajib, Canada Mauro Femminella, Italy Pietro Manzoni, Spain Muhammad Alam, China Manuel Fernandez-Veiga, Spain Álvaro Marco, Spain Eva Antonino-Daviu, Spain Gianluigi Ferrari, Italy Gustavo Marfia, Italy Shlomi Arnon, Israel Ilario Filippini, Italy Francisco J. Martinez, Spain Leyre Azpilicueta, Mexico Jesus Fontecha, Spain Davide Mattera, Italy Paolo Barsocchi, Italy Luca Foschini, Italy Michael McGuire, Canada Alessandro Bazzi, Italy A. G. Fragkiadakis, Greece Nathalie Mitton, France Zdenek Becvar, Czech Republic Sabrina Gaito, Italy Klaus Moessner, UK Francesco Benedetto, Italy Óscar García, Spain Antonella Molinaro, Italy Olivier Berder, France Manuel García Sánchez, Spain Simone Morosi, Italy Ana M. Bernardos, Spain L. J. García Villalba, Spain Kumudu S. Munasinghe, Australia Mauro Biagi, Italy José A. García-Naya, Spain Enrico Natalizio, France Dario Bruneo, Italy Miguel Garcia-Pineda, Spain Keivan Navaie, UK Jun Cai, Canada A.-J. García-Sánchez, Spain Thomas Newe, Ireland Zhipeng Cai, USA Piedad Garrido, Spain Wing Kwan Ng, Australia Claudia Campolo, Italy Vincent Gauthier, France Tuan M. Nguyen, Vietnam Gerardo Canfora, Italy Carlo Giannelli, Italy Petros Nicopolitidis, Greece Rolando Carrasco, UK Carles Gomez, Spain Giovanni Pau, Italy Vicente Casares-Giner, Spain Juan A. Gomez-Pulido, Spain R. Pérez-Jiménez, Spain Luis Castedo, Spain Ke Guan, China Matteo Petracca, Italy Ioannis Chatzigiannakis, Greece Antonio Guerrieri, Italy Nada Y. Philip, UK Lin Chen, France Daojing He, China Marco Picone, Italy Yu Chen, USA Paul Honeine, France Daniele Pinchera, Italy Hui Cheng, UK Sergio Ilarri, Spain Giuseppe Piro, Italy Ernestina Cianca, Italy Antonio Jara, Switzerland Vicent Pla, Spain Riccardo Colella, Italy Xiaohong Jiang, Japan Javier Prieto, Spain Mario Collotta, Italy Minho Jo, Republic of Korea R. C. Pryss, Germany Massimo Condoluci, Sweden Shigeru Kashihara, Japan Sujan Rajbhandari, UK Daniel G. Costa, Brazil Dimitrios Katsaros, Greece Rajib Rana, Australia Bernard Cousin, France Minseok Kim, Japan Luca Reggiani, Italy Telmo Reis Cunha, Portugal Mario Kolberg, UK Daniel G. Reina, Spain Igor Curcio, Finland Nikos Komninos, UK Abusayeed Saifullah, USA Laurie Cuthbert, Macau Juan A. L. Riquelme, Spain Jose Santa, Spain Donatella Darsena, Italy Pavlos I. Lazaridis, UK Stefano Savazzi, Italy Pham Tien Dat, Japan Tuan Anh Le, UK Hans Schotten, Germany AndrédeAlmeida,Brazil Xianfu Lei, China Patrick Seeling, USA Antonio De Domenico, France Hoa Le-Minh, UK Muhammad Z. Shakir, UK Antonio de la Oliva, Spain Jaime Lloret, Spain Mohammad Shojafar, Italy Gianluca De Marco, Italy M. López-Benítez, UK Giovanni Stea, Italy Luca De Nardis, Italy M. López-Nores, Spain E. Stevens-Navarro, Mexico Liang Dong, USA Javier D. S. Lorente, Spain Zhou Su, Japan Mohammed El-Hajjar, UK Tony T. Luo, Singapore Luis Suarez, Russia V. Syrjälä, Finland Reza Monir Vaghefi, USA Jie Yang, USA Hwee Pink Tan, Singapore J. F. Valenzuela-Valdés, Spain Sherali Zeadally, USA Pierre-Martin Tardif, Canada Aline C. Viana, France Jie Zhang, UK Mauro Tortonesi, Italy Enrico M. Vitucci, Italy Meiling Zhu, UK Federico Tramarin, Italy Honggang Wang, USA Contents Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Zesong Fei ,JinhongYuan,andQinHuang Editorial(2pages),ArticleID2643205,Volume2018(2018) Efficient Quantization with Linear Index Coding for Deep-Space Images Rehan Mahmood , Zulin Wang, and Qin Huang Research Article (13 pages), Article ID 6387214, Volume 2018 (2018) Superposition Coded Modulation Based Faster-Than-Nyquist Signaling Shuangyang Li ,BaomingBai , Jing Zhou, Qingli He, and Qian Li Research Article (10 pages), Article ID 4181626, Volume 2018 (2018) A Novel Design of Downlink Control Information Encoding and Decoding Based on Polar Codes Ce Sun , Zesong Fei , Jiqing Ni, Wei Zhou, and Dai Jia Research Article (7 pages), Article ID 5957320, Volume 2018 (2018) Performance Analysis of CRC Codes for Systematic and Nonsystematic Polar Codes with List Decoding Takumi Murata and Hideki Ochiai Research Article (8 pages), Article ID 7286909, Volume 2018 (2018) Adding a Rate-1 Third Dimension to Parallel Concatenated Systematic Polar Code: 3D Polar Code Zhenzhen Liu ,KaiNiu,ChaoDong ,andJiaruLin Research Article (6 pages), Article ID 8928761, Volume 2018 (2018) Construction and Decoding of Rate-Compatible Globally Coupled LDPC Codes Ji Zhang ,BaomingBai ,XijinMu ,HengzhouXu ,ZhenLiu,andHuaanLi Research Article (14 pages), Article ID 4397671, Volume 2018 (2018) Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic Hai Zhu ,LiqunPu,HengzhouXu ,andBoZhang Research Article (9 pages), Article ID 5264724, Volume 2018 (2018) Code-Hopping Based Transmission Scheme for Wireless Physical-Layer Security Liuguo Yin and Wentao Hao Research Article (12 pages), Article ID 7063758, Volume 2018 (2018) Research and Implementation of Rateless Spinal Codes Based Massive MIMO System Liangliang Wang ,XiangChen ,andHongzhouTan Research Article (9 pages), Article ID 6101853, Volume 2018 (2018) Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage Guangjun Ge and Liuguo Yin Research Article (13 pages), Article ID 7658093, Volume 2018 (2018) A CCM-Based OFDM System with Low PAPR for Sparse Source Qinbiao Yang, Zulin Wang, and Qin Huang Research Article (7 pages), Article ID 8923478, Volume 2018 (2018) Hindawi Wireless Communications and Mobile Computing Volume 2018, Article ID 2643205, 2 pages https://doi.org/10.1155/2018/2643205 Editorial Error Control Codes for Next-Generation Communication Systems: Opportunities and Challenges Zesong Fei ,1 Jinhong Yuan,2 and Qin Huang 3 1 School of Information and Electronics, Beijing Institute of Technology, Beijing 10081, China 2School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW 2052, Australia 3School of Electronic and Information Engineering, Beihang University, Beijing 100191, China Correspondence should be addressed to Zesong Fei; [email protected] Received 3 October 2018; Accepted 3 October 2018; Published 2 December 2018 Copyright © 2018 Zesong Fei et al. Tis is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Error control codes are widely applied in modern com- “Superposition Coded Modulation Based Faster-Tan- munication systems to improve the bandwidth-power ef- Nyquist Signaling”, by S. Li et al.,presentedatransmis- ciency and the reliability of data transmissions. Modern sion scheme of faster-than-Nyquist signaling combined with error control codes have attracted the interest of scholars superposition coded modulation. Te proposed scheme and industry partners since Turbo codes were invented. For requires a lower SNR than orthogonal signaling with a larger example, Turbo codes have been used in the 4G cellular alphabet to achieve a wide range of spectral efciencies. mobile systems. Nowadays, LDPC codes and the polar codes “A Novel Design of Downlink Control Information are adopted in the 5G standard. Te recent development on Encoding and Decoding Based on Polar Codes”, by C. the theoretic framework of new channel coding theorem for Sun et al., proposed a novel design on downlink control fnite code length will provide guidelines for future practical information encoding and decoding. Te proposed scheme could support dynamic confguration of transmission modes error control codes designs. with low complexity. It is shown that the proposed scheme In the age of IoT, everything will be connected via can comply with the false alarm rate target of 5G standard. communication links. It is expected that the next-generation “Performance Analysis of CRC Codes for Systematic communication systems need to support many scenarios and Nonsystematic Polar Codes with List Decoding”, by T. such as wireless communications, optical communications, Murata and H. Ochiai, studied the efect of the length and distributed storage systems, V2X networks, and sensor net- generator polynomials of CRC codes on frame error rate works. Tese scenarios will impose new requirements to performance of polar codes with list decoding. Te authors the communication systems ranging from lower complex- found that the length of CRC will afect the performance ity encoder/decoder, lower delay or latencies, ultrareliable signifcantly, while the generator polynomials will only afect
Recommended publications
  • Ts 136 212 V11.1.0 (2013-02)

    Ts 136 212 V11.1.0 (2013-02)

    ETSI TS 136 212 V11.1.0 (2013-02) Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 11.1.0 Release 11) 3GPP TS 36.212 version 11.1.0 Release 11 1 ETSI TS 136 212 V11.1.0 (2013-02) Reference RTS/TSGR-0136212vb10 Keywords LTE ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice Individual copies of the present document can be downloaded from: http://www.etsi.org The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is the Portable Document Format (PDF). In case of dispute, the reference shall be the printing on ETSI printers of the PDF version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at http://portal.etsi.org/tb/status/status.asp If you find errors in the present document, please send your comment to one of the following services: http://portal.etsi.org/chaircor/ETSI_support.asp Copyright Notification No part may be reproduced except as authorized by written permission.
  • Tm Synchronization and Channel Coding—Summary of Concept and Rationale

    Tm Synchronization and Channel Coding—Summary of Concept and Rationale

    Report Concerning Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING— SUMMARY OF CONCEPT AND RATIONALE INFORMATIONAL REPORT CCSDS 130.1-G-3 GREEN BOOK June 2020 Report Concerning Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING— SUMMARY OF CONCEPT AND RATIONALE INFORMATIONAL REPORT CCSDS 130.1-G-3 GREEN BOOK June 2020 TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALE AUTHORITY Issue: Informational Report, Issue 3 Date: June 2020 Location: Washington, DC, USA This document has been approved for publication by the Management Council of the Consultative Committee for Space Data Systems (CCSDS) and reflects the consensus of technical panel experts from CCSDS Member Agencies. The procedure for review and authorization of CCSDS Reports is detailed in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4). This document is published and maintained by: CCSDS Secretariat National Aeronautics and Space Administration Washington, DC, USA Email: [email protected] CCSDS 130.1-G-3 Page i June 2020 TM SYNCHRONIZATION AND CHANNEL CODING—SUMMARY OF CONCEPT AND RATIONALE FOREWORD This document is a CCSDS Report that contains background and explanatory material to support the CCSDS Recommended Standard, TM Synchronization and Channel Coding (reference [3]). Through the process of normal evolution, it is expected that expansion, deletion, or modification of this document may occur. This Report is therefore subject to CCSDS document management and change control procedures, which are defined in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4). Current versions of CCSDS documents are maintained at the CCSDS Web site: http://www.ccsds.org/ Questions relating to the contents or status of this document should be sent to the CCSDS Secretariat at the email address indicated on page i.
  • Ioag Infusion Plans and Roadmaps

    Ioag Infusion Plans and Roadmaps

    IOAG ROADMAP DRAFT IOAG INFUSION PLANS AND ROADMAPS (this version contains all IOAG agency(s) input) (Draft IOAG-8 Version – July 2005) (Draft IOAG-8 Version, Revision 1 – August 2005) IOAG ROADMAP This document is uncontrolled when printed. Please check the IOAG web site at http://www.ioag.org prior to use to ensure this is the latest version. IOAG ROADMAP TABLE OF CONTENTS 1 – INTRODUCTION .................................................................................................................1 2 – STRUCTURE AND MANAGEMENT OF THE PRESENT DOCUMENT...........................1 2-1 STRUCTURE ..................................................................................................................1 2-2 DOCUMENT MANAGEMENT..........................................................................................2 3 – IOAG STRATEGY PLAN....................................................................................................2 3-1 IOAG OBJECTIVES ........................................................................................................2 3-2 IOAG AREAS OF INTEREST ..........................................................................................3 4 – IOAG INTEROPERABILITY ITEMS...................................................................................6 5 – AGENCIES’ INFUSION PLANS AND ROADMAPS..........................................................7 ANNEX-1 – ASI INFUSION PLAN AND ROADMAP ...........................................................1-1 ANNEX-2 – CNES INFUSION PLAN AND ROADMAP
  • Source Coding: Part I of Fundamentals of Source and Video Coding

    Source Coding: Part I of Fundamentals of Source and Video Coding

    Foundations and Trends R in sample Vol. 1, No 1 (2011) 1–217 c 2011 Thomas Wiegand and Heiko Schwarz DOI: xxxxxx Source Coding: Part I of Fundamentals of Source and Video Coding Thomas Wiegand1 and Heiko Schwarz2 1 Berlin Institute of Technology and Fraunhofer Institute for Telecommunica- tions — Heinrich Hertz Institute, Germany, [email protected] 2 Fraunhofer Institute for Telecommunications — Heinrich Hertz Institute, Germany, [email protected] Abstract Digital media technologies have become an integral part of the way we create, communicate, and consume information. At the core of these technologies are source coding methods that are described in this text. Based on the fundamentals of information and rate distortion theory, the most relevant techniques used in source coding algorithms are de- scribed: entropy coding, quantization as well as predictive and trans- form coding. The emphasis is put onto algorithms that are also used in video coding, which will be described in the other text of this two-part monograph. To our families Contents 1 Introduction 1 1.1 The Communication Problem 3 1.2 Scope and Overview of the Text 4 1.3 The Source Coding Principle 5 2 Random Processes 7 2.1 Probability 8 2.2 Random Variables 9 2.2.1 Continuous Random Variables 10 2.2.2 Discrete Random Variables 11 2.2.3 Expectation 13 2.3 Random Processes 14 2.3.1 Markov Processes 16 2.3.2 Gaussian Processes 18 2.3.3 Gauss-Markov Processes 18 2.4 Summary of Random Processes 19 i ii Contents 3 Lossless Source Coding 20 3.1 Classification
  • Short Low-Rate Non-Binary Turbo Codes Gianluigi Liva, Bal´Azs Matuz, Enrico Paolini, Marco Chiani

    Short Low-Rate Non-Binary Turbo Codes Gianluigi Liva, Bal´Azs Matuz, Enrico Paolini, Marco Chiani

    Short Low-Rate Non-Binary Turbo Codes Gianluigi Liva, Bal´azs Matuz, Enrico Paolini, Marco Chiani Abstract—A serial concatenation of an outer non-binary turbo decoding thresholds lie within 0.5 dB from the Shannon code with different inner binary codes is introduced and an- limit in the coherent case, for a wide range of coding rates 1 alyzed. The turbo code is based on memory- time-variant (1/3 ≤ R ≤ 1/96). Remarkably, a similar result is achieved recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity-approaching performance, in the noncoherent detection framework as well. thus representing an appealing solution for spread spectrum We then focus on the specific case where the inner code is communications. The performance of the scheme is investigated either an order-q Hadamard code or a first order length-q Reed- on the additive white Gaussian noise channel with coherent and Muller (RM) code, due to their simple fast Hadamard trans- noncoherent detection via density evolution analysis. The pro- form (FHT)-based decoding algorithms. The proposed scheme posed codes compare favorably w.r.t. other low rate constructions in terms of complexity/performance trade-off. Low error floors can be thus seen either as (i) a serial concatenation of an outer and performances close to the sphere packing bound are achieved Fq-based turbo code with an inner Hadamard/RM code with down to small block sizes (k = 192 information bits). antipodal signalling, or (ii) as a coded modulation Fq-based turbo/LDPC code with q-ary (bi-) orthogonal modulation.
  • Tm Synchronization and Channel Coding

    Tm Synchronization and Channel Coding

    Recommendation for Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING RECOMMENDED STANDARD CCSDS 131.0-B-3 BLUE BOOK September 2017 Recommendation for Space Data System Standards TM SYNCHRONIZATION AND CHANNEL CODING RECOMMENDED STANDARD CCSDS 131.0-B-3 BLUE BOOK September 2017 CCSDS RECOMMENDED STANDARD FOR TM SYNCHRONIZATION AND CHANNEL CODING AUTHORITY Issue: Recommended Standard, Issue 3 Date: September 2017 Location: Washington, DC, USA This document has been approved for publication by the Management Council of the Consultative Committee for Space Data Systems (CCSDS) and represents the consensus technical agreement of the participating CCSDS Member Agencies. The procedure for review and authorization of CCSDS documents is detailed in Organization and Processes for the Consultative Committee for Space Data Systems (CCSDS A02.1-Y-4), and the record of Agency participation in the authorization of this document can be obtained from the CCSDS Secretariat at the e-mail address below. This document is published and maintained by: CCSDS Secretariat National Aeronautics and Space Administration Washington, DC, USA E-mail: [email protected] CCSDS 131.0-B-3 Page i September 2017 CCSDS RECOMMENDED STANDARD FOR TM SYNCHRONIZATION AND CHANNEL CODING STATEMENT OF INTENT The Consultative Committee for Space Data Systems (CCSDS) is an organization officially established by the management of its members. The Committee meets periodically to address data systems problems that are common to all participants, and to formulate sound technical solutions to these problems. Inasmuch as participation in the CCSDS is completely voluntary, the results of Committee actions are termed Recommended Standards and are not considered binding on any Agency.
  • Configurable and Scalable Turbo Decoder for 4G Wireless Decoder

    Configurable and Scalable Turbo Decoder for 4G Wireless Decoder

    Configurable and Scalable Turbo Decoder for 4G Wireless Receivers Yang Sun Rice University, USA Joseph R. Cavallaro Rice University, USA Yuming Zhu Texas Instruments, USA Manish Goel Texas Instruments, USA ABSTRACT The increasing requirements of high data rates and quality of service (QoS) in fourth-generation (4G) wireless communication require the implementation of practical capacity approaching codes. In this chapter, the application of Turbo coding schemes that have recently been adopted in the IEEE 802.16e WiMax standard and 3GPP Long Term Evolution (LTE) standard are reviewed. In order to process several 4G wireless standards with a common hardware module, a reconfigurable and scalable Turbo decoder architecture is presented. A parallel Turbo decoding scheme with scalable parallelism tailored to the target throughput is applied to support high data rates in 4G applications. High-level decoding parallelism is achieved by employing contention-free interleavers. A multi-banked memory structure and routing network among memories and MAP decoders are designed to operate at full speed with parallel interleavers. A new on-line address generation technique is introduced to support multiple Turbo interleaving patterns, which avoids the interleaver address memory that is typically necessary in the traditional designs. Design trade-offs in terms of area and power efficiency are analyzed for different parallelism and clock frequency goals. KEYWORDS Error Correction Codes, Turbo Codes, MAP Algorithm, BCJR Algorithm, Turbo Decoder, Interleaver, Wireless PHY, 4G Receiver, VLSI Architecture INTRODUCTION The approaching fourth-generation (4G) wireless systems are promising to support very high data rates from 100 Mbps to 1 Gbps. This consequently leads to orders of complexity increases in a 4G wireless receiver.
  • BER Comparison Between Convolutional, Turbo, LDPC, and Polar Codes

    BER Comparison Between Convolutional, Turbo, LDPC, and Polar Codes

    BER Comparison Between Convolutional, Turbo, LDPC, and Polar Codes Bashar Tahir∗, Stefan Schwarzy, and Markus Ruppz Institute of Telecommunications Technische Universitat¨ (TU) Wien Vienna, Austria Email: f∗bashar.tahir, ystefan.schwarz, [email protected] Abstract—Channel coding is a fundamental building block in A major breakthrough happened in 1993 when turbo codes any communications system. High performance codes, with low were introduced [5]. They represent a class of codes that complexity encoding and decoding are a must-have for future can perform very close to the capacity limit. In its common wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages form, turbo encoding is done using two recursive convolutional and low code rates, to high throughput scenarios, working with encoders. The input stream is passed to the first encoder, and a long messages, and high code rates. permuted version is passed to the second one. At the receiving We investigate in this paper the performance of Convolutional, side, two decoders are used, each one decodes the streams Turbo, Low-Density Parity-Check (LDPC), and Polar codes, in of the corresponding encoder. By exchanging probabilistic terms of the Bit-Error-Ratio (BER) for different information block lengths and code rates, spanning the multiple scenarios information, the two decoders can iteratively help each other of reliability and high throughput. We further investigate their in a manner similar to a turbo engine. convergence behavior with respect to the number of iterations Another class of capacity-approaching codes, are the LDPC (turbo and LDPC), and list size (polar), as well as how their per- codes.
  • Services Catalog

    Services Catalog

    Deep Space Network Deep Space Network Services Catalog Document Owner: Approved by: Signature Provided 02/03/15 Signature Provided 01/22/15 Jeff Berner Date Alaudin M. Bhanji Date DSN Project Chief Engineer DSN Project Manager Prepared by: Approved by: Signature Provided 01/16/15 Signature Provided 01/16/15 Timothy Pham Date Charles Scott Date DSN Chief Systems Engineer DSN Commitment Office Manager Signature Provided 02/20/15 DSN Document Release Date DSN No. 820-100, Rev. F Issue Date: February 24, 2015 JPL D-19002 Jet Propulsion Laboratory California Institute of Technology Users must ensure that they are using the current version in PDMS: https://pdms.jpl.nasa.gov Copyright 2015 California Institute of Technology. U.S. Government sponsorship acknowledged 820-100, Rev. F Review Acknowledgment By signing below, the signatories acknowledge that they have reviewed this document and provided comments, if any, to the signatories on the Cover Page. Signature Provided 02/19/15 Signature Provided 02/17/15 Ana Guerrero Date Pat Beyer Date DSN TTC &Data Delivery Office Manager DSN Service Management Office Manager Signature Provided 02/17/15 Signature Provided 02/23/15 Peter Hames Date James A. O’dea Date DSN Antenna Front-End, Facilities and TTC System Engineer Infrastructure Office Manager Signature Provided 02/16/15 Signature Provided 02/17/15 Tim Cornish Date Alina Bedrossian Date Uplink System Engineer Science System Engineer Signature Provided 02/17/15 Signature Provided 02/17/15 Leslie Deutsch Date Cathy Cagle Date Architecture Strategic Planning and Mission Support Definition and System Engineering Manager Commitments Manager ii 820-100, Rev.
  • Dynamic Code Selection Method for Content Transfer in Deep Space Network

    Dynamic Code Selection Method for Content Transfer in Deep Space Network

    University of Mississippi eGrove Electronic Theses and Dissertations Graduate School 2019 Dynamic Code Selection Method for Content Transfer in Deep Space Network Rojina Adhikary University of Mississippi Follow this and additional works at: https://egrove.olemiss.edu/etd Part of the Electrical and Computer Engineering Commons Recommended Citation Adhikary, Rojina, "Dynamic Code Selection Method for Content Transfer in Deep Space Network" (2019). Electronic Theses and Dissertations. 1528. https://egrove.olemiss.edu/etd/1528 This Dissertation is brought to you for free and open access by the Graduate School at eGrove. It has been accepted for inclusion in Electronic Theses and Dissertations by an authorized administrator of eGrove. For more information, please contact [email protected]. DYNAMIC CODE SELECTION METHOD FOR CONTENT TRANSFER IN DEEP SPACE NETWORK A Dissertation presented in partial fulfillment of requirements for the degree of Doctor of Philosophy in the Department of Electrical Engineering The University of Mississippi by Rojina Adhikary May 2019 Copyright Rojina Adhikary 2019 ALL RIGHTS RESERVED ABSTRACT Space communications feature large round-trip time delays (for example, be- tween 6.5 and 44 minutes for Mars to Earth and return, depending on the actual distance between the two planets) and highly variable data error rates, for example, bit error rate (BER) of 10−5 is very common and even higher BERs on the order of 10−1 is observed in the deep-space environment. We develop a new content transfer protocol based on RaptorQ codes and turbo codes together with a real-time channel prediction model to maximize file transfer from space vehicles to the Earth stations.
  • CCSDS Glossary Export 8Nov11

    CCSDS Glossary Export 8Nov11

    Space Assigned Number Authority(SANA) Registry: CCSDS Glossary 11/8/11 1:18 PM SPACE ASSIGNED NUMBER AUTHORITY(SANA) REGISTRY CCSDS GLOSSARY XML version of this registry Created 2010-11-03 Registration Policy TBD Review authority Signature md5 Status Candidate Keyword Definition Synonym Related Status Reference (N)-association A cooperative relationship among (N)-entity-invocations. [A30X0G3] (N)-entity An active element within an (N)-subsystem embodying a set of [A30X0G3] capabilities defined for the (N)-layer that corresponds to a specific (N)- entity-type (without any extra capabilities being used). (N)-entity-invocation A specific utilization of part or all of the capabilities of a given (N)-entity [A30X0G3] (without any extra capabilities being used) []. (N)-entity-type A description of a class of (N)-entities in terms of a set of capabilities [A30X0G3] defined for the (N)-layer []. (N)-function A part of the activity of (N)-entities. [A30X0G3] (N)-layer A subdivision of the OSI architecture, constituted by subsystems of the [A30X0G3] http://sanaregistry.org/r/glossary/glossary.html Page 1 of 193 Space Assigned Number Authority(SANA) Registry: CCSDS Glossary 11/8/11 1:18 PM (N)-layer A subdivision of the OSI architecture, constituted by subsystems of the [A30X0G3] same rank (N) []. (N)-layer management Functions related to the management of the (N)-layer partly performed [A30X0G3] in the (N)-layer itself according to the (N)-protocol of the layer (activities such as activation and error control) and partly performed as a subset of systems management. (N)-layer operation The monitoring and control of a single instance of communication.
  • Dynamic Data Distribution

    Dynamic Data Distribution

    An overview of Compression Compression becomes necessary in multimedia because it requires large amounts of storage space and bandwidth CpSc 863: Multimedia Systems Types of Compression and Applications Lossless compression = data is not altered or lost in the process Lossy = some info is lost but can be reasonably Data Compression reproduced using the data. James Wang 2 Binary Image Compression Binary Image Compression RLE (Run Length Encoding) Disadvantage of RLE scheme: Also called Packed Bits encoding When groups of adjacent pixels change rapidly, E.g. aaaaaaaaaaaaaaaaaaaa111110000000 the run length will be shorter. It could take more bits for the code to represent the run length that Can be coded as: the uncompressed data negative Byte1 Byte 2 Byte3 Byte4 Byte5 Byte6 compression. 20 a 05 1 07 0 It is a generalization of zero suppression, which This is a one dimensional scheme. Some assumes that just one symbol appears schemes will also use a flag to separate the data particularly often in sequences. bytes http://astronomy.swin.edu.au/~pbourke/dataformats/rle/ http://datacompression.info/RLE.shtml 3 http://www.data-compression.info/Algorithms/RLE/ 4 Basics of Information Theory According to Shannon, the entropy of an information source S is defined as: 1 H(S) pi log2 i pi Lossless Compression Algorithms where p is the probability that symbol S in S will occur. (Entropy Encoding) i i 1 log 2 indicates the amount of information Adapted from: pi http://www.cs.cf.ac.uk/Dave/Multimedia/node207.html contained in Si, i.e., the number of bits needed to code Si.