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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F67985556%3A_____%2F03%3A16030120%21RIV%2F2004%2FAV0%2FA16004%2FN
rdf:type
n11:Vysledek skos:Concept
dcterms:description
In the paper we compare two recursive constant modulus algorithms for blind equalization: the gradient steap descent CMA and recursive Finite Interval Constant Modulus Algorithm (FI-CMA). Algorithms are tested on the BPSK random data. Their convergence speed and computation requirements is discussed. In the paper we compare two recursive constant modulus algorithms for blind equalization: the gradient steap descent CMA and recursive Finite Interval Constant Modulus Algorithm (FI-CMA). Algorithms are tested on the BPSK random data. Their convergence speed and computation requirements is discussed.
dcterms:title
Comparison of two recursive constant modulus algorithms. Comparison of two recursive constant modulus algorithms.
skos:prefLabel
Comparison of two recursive constant modulus algorithms. Comparison of two recursive constant modulus algorithms.
skos:notation
RIV/67985556:_____/03:16030120!RIV/2004/AV0/A16004/N
n3:strany
159;162
n3:aktivita
n20:Z
n3:aktivity
Z(AV0Z1075907)
n3:dodaniDat
n13:2004
n3:domaciTvurceVysledku
n18:2584026
n3:druhVysledku
n15:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
601799
n3:idVysledku
RIV/67985556:_____/03:16030120
n3:jazykVysledku
n17:eng
n3:klicovaSlova
blind equalization; constant modulus algorithm
n3:klicoveSlovo
n6:constant%20modulus%20algorithm n6:blind%20equalization
n3:kontrolniKodProRIV
[61B7D2144C40]
n3:mistoKonaniAkce
Bratislava [SK]
n3:mistoVydani
Bratislava
n3:nazevZdroje
Proceedings of the 4th Electronic Circuits and Systems Conference.
n3:obor
n10:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:rokUplatneniVysledku
n13:2003
n3:tvurceVysledku
Heřmánek, Antonín Regalia, P.
n3:typAkce
n16:WRD
n3:zahajeniAkce
2003-09-11+02:00
n3:zamer
n12:AV0Z1075907
s:numberOfPages
4
n19:hasPublisher
Slovenská technická univerzita v Bratislave
n14:isbn
80-227-1939-0