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
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985556%3A_____%2F02%3A16020187%21RIV%2F2003%2FAV0%2FA16003%2FN/
n20http://linked.opendata.cz/resource/domain/vavai/zamer/
n12https://schema.org/
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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985556%3A_____%2F02%3A16020187%21RIV%2F2003%2FAV0%2FA16003%2FN
rdf:type
skos:Concept n15:Vysledek
dcterms:description
In the paper, we reexamine the Finite Interval Constant Modulus Algorithm (FI-CMA) proposed by P.Regalia and we present our modifications leading to its recursive form. The proposed modifications are based on recursive updates of QR decomposition. The presented results shows the computation savings and ability to use Recursive FI-CMA for tracking time variant channels. In the paper, we reexamine the Finite Interval Constant Modulus Algorithm (FI-CMA) proposed by P.Regalia and we present our modifications leading to its recursive form. The proposed modifications are based on recursive updates of QR decomposition. The presented results shows the computation savings and ability to use Recursive FI-CMA for tracking time variant channels.
dcterms:title
Recursive Finite Interval Constant Modulus Algorithm for blind equalization. Recursive Finite Interval Constant Modulus Algorithm for blind equalization.
skos:prefLabel
Recursive Finite Interval Constant Modulus Algorithm for blind equalization. Recursive Finite Interval Constant Modulus Algorithm for blind equalization.
skos:notation
RIV/67985556:_____/02:16020187!RIV/2003/AV0/A16003/N
n3:strany
133;141
n3:aktivita
n10:Z
n3:aktivity
Z(AV0Z1075907)
n3:dodaniDat
n8:2003
n3:domaciTvurceVysledku
n11:2584026
n3:druhVysledku
n13:D
n3:duvernostUdaju
n6:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
661727
n3:idVysledku
RIV/67985556:_____/02:16020187
n3:jazykVysledku
n16:eng
n3:klicovaSlova
blind equalization; signal processing; telecommunication
n3:klicoveSlovo
n4:blind%20equalization n4:telecommunication n4:signal%20processing
n3:kontrolniKodProRIV
[A29067D3B4A7]
n3:mistoKonaniAkce
Praha [CZ]
n3:mistoVydani
Praha
n3:nazevZdroje
MATLAB 2002. Sborník příspěvků 10. ročníku konference.
n3:obor
n14:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:rokUplatneniVysledku
n8:2002
n3:tvurceVysledku
Heřmánek, Antonín Regalia, P.
n3:typAkce
n9:EUR
n3:zahajeniAkce
2002-11-07+01:00
n3:zamer
n20:AV0Z1075907
s:numberOfPages
9
n18:hasPublisher
Vysoká škola chemicko-technologická v Praze
n12:isbn
80-7080-500-5