Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bit-reversal_permutation> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Bit-reversal_permutation abstract "In applied mathematics, a bit-reversal permutation is a permutation of a sequence of n items, where n = 2k is a power of two. It is defined by indexing the elements of the sequence by the numbers from 0 to n − 1 and then reversing the binary representations of each of these numbers (padded so that each of these binary numbers has length exactly k). Each item is then mapped to the new position given by this reversed value. The bit reversal permutation is an involution, so repeating the same permutation twice returns to the original ordering on the items.".
- Bit-reversal_permutation wikiPageID "25692725".
- Bit-reversal_permutation wikiPageRevisionID "599656143".
- Bit-reversal_permutation hasPhotoCollection Bit-reversal_permutation.
- Bit-reversal_permutation subject Category:Combinatorial_algorithms.
- Bit-reversal_permutation subject Category:FFT_algorithms.
- Bit-reversal_permutation subject Category:Permutations.
- Bit-reversal_permutation type Abstraction100002137.
- Bit-reversal_permutation type Act100030358.
- Bit-reversal_permutation type Activity100407535.
- Bit-reversal_permutation type Algorithm105847438.
- Bit-reversal_permutation type Change107296428.
- Bit-reversal_permutation type CombinatorialAlgorithms.
- Bit-reversal_permutation type Event100029378.
- Bit-reversal_permutation type FFTAlgorithms.
- Bit-reversal_permutation type Happening107283608.
- Bit-reversal_permutation type Permutations.
- Bit-reversal_permutation type Procedure101023820.
- Bit-reversal_permutation type PsychologicalFeature100023100.
- Bit-reversal_permutation type Rule105846932.
- Bit-reversal_permutation type Substitution107443761.
- Bit-reversal_permutation type Variation107337390.
- Bit-reversal_permutation type YagoPermanentlyLocatedEntity.
- Bit-reversal_permutation comment "In applied mathematics, a bit-reversal permutation is a permutation of a sequence of n items, where n = 2k is a power of two. It is defined by indexing the elements of the sequence by the numbers from 0 to n − 1 and then reversing the binary representations of each of these numbers (padded so that each of these binary numbers has length exactly k). Each item is then mapped to the new position given by this reversed value.".
- Bit-reversal_permutation label "Bit-reversal permutation".
- Bit-reversal_permutation sameAs m.09v4z01.
- Bit-reversal_permutation sameAs Q4918660.
- Bit-reversal_permutation sameAs Q4918660.
- Bit-reversal_permutation sameAs Bit-reversal_permutation.
- Bit-reversal_permutation wasDerivedFrom Bit-reversal_permutation?oldid=599656143.
- Bit-reversal_permutation isPrimaryTopicOf Bit-reversal_permutation.