Transformation de Fourier discrèteEn mathématiques, la transformation de Fourier discrète (TFD) sert à traiter un signal numérique. Elle constitue un équivalent discret (c'est-à-dire pour un signal défini à partir d'un nombre fini d'échantillons) de la transformation de Fourier (continue) utilisée pour traiter un signal analogique. Plus précisément, la TFD est la représentation spectrale discrète dans le domaine des fréquences d'un signal échantillonné. La transformation de Fourier rapide est un algorithme particulier de calcul de la transformation de Fourier discrète.
Signal-flow graphA signal-flow graph or signal-flowgraph (SFG), invented by Claude Shannon, but often called a Mason graph after Samuel Jefferson Mason who coined the term, is a specialized flow graph, a directed graph in which nodes represent system variables, and branches (edges, arcs, or arrows) represent functional connections between pairs of nodes. Thus, signal-flow graph theory builds on that of directed graphs (also called digraphs), which includes as well that of oriented graphs.
Vertex arrangementIn geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in polytopes. For example, a square vertex arrangement is understood to mean four points in a plane, equal distance and angles from a center point. Two polytopes share the same vertex arrangement if they share the same 0-skeleton. A group of polytopes that shares a vertex arrangement is called an army. The same set of vertices can be connected by edges in different ways.
