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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n7http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F10%3A00177611%21RIV11-GA0-21230___/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F10%3A00177611%21RIV11-GA0-21230___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
The sum product algorithm on factor graphs (FG/SPA) is a widely used tool to solve various problems in a wide area of fields. A representation of generally-shaped continuously valued messages in the FG/SPA is commonly solved by a proper parameterization of the messages. Obtaining such a proper parameterization is, however, a crucial problem in general. The paper introduces a systematic procedure for obtaining a scalar message representation with well-defined fidelity criterion in a general FG/SPA. The procedure utilizes a stochastic nature of the messages as they evolve during the FG/SPA processing. A Karhunen-Loeve Transform (KLT) is used to find a generic canonical message representation which exploits the message stochastic behavior with mean square error (MSE) fidelity criterion. We demonstrate the procedure on a range of scenarios including mixture-messages (a digital modulation in phase parametric channel). The sum product algorithm on factor graphs (FG/SPA) is a widely used tool to solve various problems in a wide area of fields. A representation of generally-shaped continuously valued messages in the FG/SPA is commonly solved by a proper parameterization of the messages. Obtaining such a proper parameterization is, however, a crucial problem in general. The paper introduces a systematic procedure for obtaining a scalar message representation with well-defined fidelity criterion in a general FG/SPA. The procedure utilizes a stochastic nature of the messages as they evolve during the FG/SPA processing. A Karhunen-Loeve Transform (KLT) is used to find a generic canonical message representation which exploits the message stochastic behavior with mean square error (MSE) fidelity criterion. We demonstrate the procedure on a range of scenarios including mixture-messages (a digital modulation in phase parametric channel).
dcterms:title
Karhunen-Loeve-Based Reduced-Complexity Representation of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER Karhunen-Loeve-Based Reduced-Complexity Representation of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER
skos:prefLabel
Karhunen-Loeve-Based Reduced-Complexity Representation of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER Karhunen-Loeve-Based Reduced-Complexity Representation of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER
skos:notation
RIV/68407700:21230/10:00177611!RIV11-GA0-21230___
n3:aktivita
n4:Z n4:R n4:S n4:P
n3:aktivity
P(7E10039), P(GA102/09/1624), P(OC 188), R, S, Z(MSM6840770014)
n3:cisloPeriodika
0
n3:dodaniDat
n9:2011
n3:domaciTvurceVysledku
n5:2663627 n5:6880053
n3:druhVysledku
n13:J
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
266157
n3:idVysledku
RIV/68407700:21230/10:00177611
n3:jazykVysledku
n18:eng
n3:klicovaSlova
factor graphs
n3:klicoveSlovo
n19:factor%20graphs
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[A73A2419E108]
n3:nazevZdroje
EURASIP Journal on Wireless Communications and Networking
n3:obor
n11:JA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n16:7E10039 n16:GA102%2F09%2F1624 n16:OC%20188
n3:rokUplatneniVysledku
n9:2010
n3:svazekPeriodika
2010
n3:tvurceVysledku
Sýkora, Jan Procházka, Pavel
n3:zamer
n7:MSM6840770014
s:issn
1687-1499
s:numberOfPages
11
n15:organizacniJednotka
21230