[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tsp/Duhamel90>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Pierre_Duhamel>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F29.60070>
foaf:homepage <https://doi.org/10.1109/29.60070>
dc:identifier DBLP journals/tsp/Duhamel90 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F29.60070 (xsd:string)
dcterms:issued 1990 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tsp>
rdfs:label Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Pierre_Duhamel>
swrc:number 9 (xsd:string)
swrc:pages 1504-1511 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tsp/Duhamel90/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tsp/Duhamel90>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tsp/tsp38.html#Duhamel90>
rdfs:seeAlso <https://doi.org/10.1109/29.60070>
dc:title Algorithms meeting the lower bounds on the multiplicative complexity of length-2n DFTs and their connection with practical algorithms. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 38 (xsd:string)