This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n8http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n10http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n15https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00219561%21RIV15-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00219561%21RIV15-MSM-21230___
rdf:type
n9:Vysledek skos:Concept
dcterms: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.
dcterms:title
Low Density Parity Check Coding Low Density Parity Check Coding
skos:prefLabel
Low Density Parity Check Coding Low Density Parity Check Coding
skos:notation
RIV/68407700:21230/14:00219561!RIV15-MSM-21230___
n3:aktivita
n17:S n17:P
n3:aktivity
P(LD12062), S
n3:dodaniDat
n4:2015
n3:domaciTvurceVysledku
n21:1765310
n3:druhVysledku
n5:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
26664
n3:idVysledku
RIV/68407700:21230/14:00219561
n3:jazykVysledku
n18:eng
n3:klicovaSlova
LDPC; LDLC; capacity achieving codes; lattice codes
n3:klicoveSlovo
n12:capacity%20achieving%20codes n12:LDPC n12:LDLC n12:lattice%20codes
n3:kontrolniKodProRIV
[FE3D11B59B5C]
n3:mistoKonaniAkce
Praha
n3:mistoVydani
Prague
n3:nazevZdroje
POSTER 2014 - 18th International Student Conference on Electrical Engineering
n3:obor
n14:JA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n16:LD12062
n3:rokUplatneniVysledku
n4:2014
n3:tvurceVysledku
Hejtmánek, Jan Růžička, Lukáš
n3:typAkce
n8:EUR
n3:zahajeniAkce
2014-05-15+02:00
s:numberOfPages
5
n10:hasPublisher
České vysoké učení technické v Praze
n15:isbn
978-80-01-05499-4
n19:organizacniJednotka
21230