About: Low Density Parity Check Coding     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • It is generally known that the code achieving Additive White Gaussian Noise (AWGN) channel capacity must have Gaussian distribution and infinite codeword dimension. In current communications such code is very frequently approximated by linear parity check code over finite field F^n_p having generating matrix that induces sparse parity check matrix with large dimension. This paper should summarize low density techniques used in channel code design. In the first part of this paper we focus on Low Density Parity Check (LDPC) codes properties over finite field and algorithms for generating matrices with desired properties. In the second part we describe Euclidean space extension known as Low Density Lattice Codes (LDLC), which can be efficiently used in dense networks by its natural structure.Recently, it was shown that lattice based codes can reach AWGN channel capacity, but under infinite codeword dimension constraint. This condition makes lattice codes practically unrealizable. However, by using nested scheme LDLC instead of general lattice, we can achieve rates being close to the channel capacity.
  • It is generally known that the code achieving Additive White Gaussian Noise (AWGN) channel capacity must have Gaussian distribution and infinite codeword dimension. In current communications such code is very frequently approximated by linear parity check code over finite field F^n_p having generating matrix that induces sparse parity check matrix with large dimension. This paper should summarize low density techniques used in channel code design. In the first part of this paper we focus on Low Density Parity Check (LDPC) codes properties over finite field and algorithms for generating matrices with desired properties. In the second part we describe Euclidean space extension known as Low Density Lattice Codes (LDLC), which can be efficiently used in dense networks by its natural structure.Recently, it was shown that lattice based codes can reach AWGN channel capacity, but under infinite codeword dimension constraint. This condition makes lattice codes practically unrealizable. However, by using nested scheme LDLC instead of general lattice, we can achieve rates being close to the channel capacity. (en)
Title
  • Low Density Parity Check Coding
  • Low Density Parity Check Coding (en)
skos:prefLabel
  • Low Density Parity Check Coding
  • Low Density Parity Check Coding (en)
skos:notation
  • RIV/68407700:21230/14:00219561!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LD12062), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 26664
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/14:00219561
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • LDPC; LDLC; capacity achieving codes; lattice codes (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [FE3D11B59B5C]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Prague
http://linked.open...i/riv/nazevZdroje
  • POSTER 2014 - 18th International Student Conference on Electrical Engineering
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hejtmánek, Jan
  • Růžička, Lukáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 978-80-01-05499-4
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software