|
|
parity bit an extra bit included in a bi- nary sequence to make the total number of parity check matrix a matrix whose rows are orthogonal to the rows in the generator Is generated from the parity check poly- nomial of any linear (n, k) code and has di- mension of (n − k × n). It is used by the decoder for error detection by checking the parity detection circuit a parity check logic incorporated within the processor to fa- parity-check code a binary linear block code. Park’s transformation a change of vari- ables represented by a linear matrix multi- parking on a bus, a priority scheme that allows a bus master to gain control of the bus parse tree the tree that is used for parsing strings of a given language. Parseval’s equation See Parseval’s Parseval’s theorem a relationship that states that the integral of the square of the of the square of the magnitude of each har- Rigorously, suppose that two continuous time signals f 1 (t) and f 2 (t) have correspond- ing Fourier transforms F 1 (ω) and F 2 (ω), and that F 2 (ω) is the complex conjugate of F 2 (ω). Then Parseval’s theorem states that Z ∞ −∞ f 1 (t)f 2 (t)dt = 1 2 π Z ∞ −∞ F 1 (ω)F 2 (ω)dω . If f 1 (t) = f 2 (t), then the left-hand side of the above equation provides an expression of Z ∞ −∞ f (t) 2 dt = 1 2 π Z ∞ −∞ |F (ω)| 2 dω . parsing the process of detecting whether a given string belongs to a given language, partial coherence the ratio of the sine of the maximum half-angle of illumination s. partial element equivalent method an integral equation technique in which the elec- c 2000 by CRC Press LLC |