About: Folding (DSP implementation)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FFolding_%28DSP_implementation%29

Foldingis a transformation technique using in DSP architecture implementation for minimizing the number of functional blocks in synthesizing DSP architecture.Folding was first developed by and his students in 1992.Its concept is contrary to unfolding.Folding transforms an operation from a unit-time processing to N unit-times processing where N is called folding factor.Therefore, multiple same operations (less than N) used in original system could be replaced with a signal operation block in transformed system.Thus, in N unit-times, a functional block in transformed system could be reused to perform N operations in original system.

AttributesValues
rdfs:label
  • Folding (DSP implementation) (en)
rdfs:comment
  • Foldingis a transformation technique using in DSP architecture implementation for minimizing the number of functional blocks in synthesizing DSP architecture.Folding was first developed by and his students in 1992.Its concept is contrary to unfolding.Folding transforms an operation from a unit-time processing to N unit-times processing where N is called folding factor.Therefore, multiple same operations (less than N) used in original system could be replaced with a signal operation block in transformed system.Thus, in N unit-times, a functional block in transformed system could be reused to perform N operations in original system. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
has abstract
  • Foldingis a transformation technique using in DSP architecture implementation for minimizing the number of functional blocks in synthesizing DSP architecture.Folding was first developed by and his students in 1992.Its concept is contrary to unfolding.Folding transforms an operation from a unit-time processing to N unit-times processing where N is called folding factor.Therefore, multiple same operations (less than N) used in original system could be replaced with a signal operation block in transformed system.Thus, in N unit-times, a functional block in transformed system could be reused to perform N operations in original system. While the folding transformation reduces the number of functional units in the architecture, it needs more memory element to store the temporary data.The reason is that multiple data produced from an operation block needs to be distinguished from N data produced from original operations.Therefore, the number of register may be increased.Furthermore, it needs additional multiplexer for switching different operation paths.Hence, the number of switching elements would also be increased.To counterattack such issues, the considerations of folding is * How to schedule multiple operations into an operation block. * How to schedule the memory element for reducing the number of registers and multiplexers. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software