© 2000 by CRC Press LLC 14Digital Signal Processing14.1 Fourier TransformsIntroduction •The Classical Fourier Transform for CT Signals •Fourier Series Representation of CT Periodic Signals •GeneralizedComplex Fourier Transform •DT Fourier Transform •Relationshipbetween the CT and DT Spectra •Discrete Fourier Transform14.2 Fourier Transforms and the Fast Fourier TransformThe Discrete Time Fourier Transform (DTFT)•Relationship to the Z-Transform •Properties • Fourier Transforms of Finite Time Sequences •Frequency Response of LTI Discrete Systems •The Discrete Fourier Transform •Properties of the DFT •Relation between DFT and Fourier Transform •Power, Amplitude, and Phase Spectra •Observations •Data Windowing •Fast Fourier Transform •Computation of the Inverse DFT14.3 Design and Implementation of Digital Filters Finite Impulse Response Filter Design •Infinite Impulse Response Filter Design •Finite Impulse Response Filter Implementation • Infinite Impulse Response Filter Implementation14.4 Signal Restoration Introduction •Attribute Sets: Closed Subspaces •Attribute Sets: Closed Convex Sets •Closed Projection Operators •AlgebraicProperties of Matrices •Structural Properties of Matrices •Nonnegative Sequence Approximation •Exponential Signals andthe Data Matrix •Recursive Modeling of Data W. Kenneth JenkinsIntroductionThe Fourier transform is a mathematical tool that is used to expand signals into a spectrum of sinusoidal components to facilitate signal analysis and system performance. In certain applications the Fourier transform is used for spectral analysis, or for spectrum shaping that adjusts the relative contributions of different frequency components in the filtered result. In other applications the Fourier transform is important for its ability to decompose the input signal into uncorrelated components, so that signal processing can be more effectively implemented on the individual spectral components. Decorrelating properties of the Fourier transform are important in frequency domain adaptive filtering, subband coding, image compression, and transform coding.Classical Fourier methods such as the Fourier series and the Fourier integral are used for continuous-time (CT) signals and systems, i.e., systems in which the signals are defined at all values of t on the continuum –¥< t < ¥. A more recently developed set of discrete Fourier methods, including the discrete-time (DT) Fourier transform and the discrete Fourier transform (DFT), are extensions of basic Fourier concepts for DT signals and systems. A DT signal is defined only for integer values of n in the range –¥ < n < ¥. The class of DT W. Kenneth JenkinsUniversity of IllinoisAlexander D. PoularikasUniversity of Alabama in Huntsville Bruce W. BomarUniversity of Tennessee SpaceInstitute L. Montgomery SmithUniversity of Tennessee SpaceInstitute James A. Cadzow Vanderbilt University© 2000 by CRC Press LLC Fourier methods is particularly useful as a basis for digital signal processing (DSP) because it extends the theory of classical Fourier analysis to DT signals and leads to many effective algorithms that can be directly implemented on general computers or special-purpose DSP devices.The Classical Fourier Transform for CT SignalsA CT signal s (t ) and its Fourier transform S (j w ) form a transform pair that are related by Eqs. (14.1) for any s (t ) for which the integral (14.1a) converges:(14.1a)(14.1b)In most literature Eq. (14.1a) is simply called the Fourier transform, whereas Eq. (14.1b) is called the Fourier integral . The relationship S (j w ) = F {s (t )} denotes the Fourier transformation of s (t ), where F { . } is a symbolic notation for the integral operator and where w is the continuous frequency variable expressed in radians per second. A transform pair s (t ) « S (j w ) represents a one-to-one invertible mapping as long as s (t ) satisfies conditions which guarantee that the Fourier integral converges.In the following discussion the symbol d (t ) is used to denote a CT impulse function that is defined to be zero for all t ¹ 0, undefined for t = 0, and has unit area when integrated over the range –¥ < t < ¥. From Eq.(14.1a) it is found that F {d (t – t o )} = e –j w t o due to the well-known sifting property of d (t ). Similarly, from Eq.(14.1b) we find that F –1{2pd (w – w o )} = e j w o t , so that d (t – t o ) « e –j w t o and e j w o t « 2pd (w – w o ) are Fourier transform pairs. By using these relationships, it is easy to establish the Fourier transforms of cos(w o t ) and sin(w o t ), as well as many other useful waveforms, many of which are listed in Table 14.1.The CT Fourier transform is useful in the analysis and design of CT systems, i.e., systems that process CT signals. Fourier analysis is particularly applicable to the design of CT filters which are characterized by Fourier magnitude and phase spectra, i.e., by |H (j w )| and arg H (j w ), where H (j w ) is commonly called the frequency response of the filter.Properties of the CT Fourier TransformThe CT Fourier transform has many properties that make it useful for the analysis and design of linear CT systems. Some of the more useful properties are summarized in this section, while a more complete list of the CT Fourier transform properties is given in Table 14.2. Proofs of these properties are found in Oppenheim et al. [1983] and Bracewell [1986]. Note that F { . } denotes the Fourier transform operation, F –1{ . } denotes the inverse Fourier transform operation, and “*” denotes the convolution operation defined as1.Linearity (superposition ):F {af 1(t ) + bf 2(t )} = aF {f 1(t )} + bF {f 2(t )}(a and b, complex constants)2.Time Shifting: F {f (t – t o )} = e –j w t o F {f (t )}3.Frequency Shifting: e j w o t f (t ) = F –1{F (j (w – w o ))}4.Time-Domain Convolution: F {f 1(t ) * f 2(t )} = F {f 1(t )}F {f 2(t )}5.Frequency-Domain Convolution: F {f 1(t )f 2(t )} = (1/2p )F {f 1(t )} * F {f 2(t )}6.Time Differentiation: –j w F (j w ) = F {d (f (t ))/dt }7.Time Integration: S j s t e dt j t w w ( )=()--¥¥òs t S j e d j t ()=( ) ( )-¥¥ò12p w w w f t f t f t t f t dt 1212()*()=-( )()-¥¥òF f t dt j F j F t ()ìíîüýþ=()()+ ()()¥ò–10w w p d w© 2000 by CRC Press LLCThe above properties are particularly useful in CT system analysis and design, especially when the system characteristics are easily specified in the frequency domain, as in linear filtering. Note that Properties 1, 6, and 7 are useful for solving differential or integral equations. Property 4 (time-domain convolution) provides the ——1——————a e k k jk t =¥+¥å–w 020p d w w a k k k -()=-¥+¥åa ke j tw 020pd w w -()a a k 110==, otherwise cos w 0tp d w w d w w -()++()[]00a a a k 11120===-, otherwisesin w 0t a aja k 11120=- ==-, otherwisex t ()=12pd w ()a a k k 01000==¹>,,()has this Forier series representationfor any choice of Td t nT n -()=-¥+¥åd t ()u t ()d t t -()0e j t -w 0e u t a at -() {}>,ete u t a at -() {}>,e© 2000 by CRC Press LLC basis for many signal-processing algorithms, since many systems can be specified directly by their impulse or frequency response. Property 3 (frequency shifting) is useful for analyzing the performance of communication systems where different modulation formats are commonly used to shift spectral energy among different frequency bands.Fourier Spectrum of a CT Sampled SignalThe operation of uniformly sampling a CT signal s (t ) at every T seconds is characterized by Eq. (14.2), where d (t ) is the CT impulse function defined earlier:(14.2)Definition SuperpositionSimplification if:(a) f (t ) is even(b) f (t ) is oddNegative tScaling:(a) Time(b) MagnitudeDifferentiation IntegrationTime shiftingModulation Time convolutionFrequency convolutionF j f t t dt F j j f t t dt w w w w ()=()()=()¥¥òò2200cos sin F f t F j -()=*()wF f t a F j e j a -()=()-w w F -¥¥()()[]=()-()ò112 12F j F j f f t d w w t t t –s t s t t nT s nT t nT a a n a n ()=()-( )=( )-( )=-¥¥=-¥¥ååd d© 2000 by CRC Press LLCSince s a (t ) is a CT signal, it is appropriate to apply the CT Fourier transform to obtain an expression for the spectrum of the sampled signal:(14.3)Since the expression on the right-hand side of Eq. (14.3) is a function of e j w T , it is customary to express the transform as F (e j w T ) = F {s a (t )}. It will be shown later that if w is replaced with a normalized frequency w¢ =w /T , so that –p < w¢ < p , then the right side of Eq. (14.3) becomes identical to the DT Fourier transform that is defined directly for the sequence s [n ] = s a (nT ).Fourier Series Representation of CT Periodic SignalsThe classical Fourier series representation of a periodic time domain signal s (t ) involves an expansion of s (t )into an infinite series of terms that consist of sinusoidal basis functions, each weighted by a complex constant (Fourier coefficient) that provides the proper contribution of that frequency component to the complete waveform. The conditions under which a periodic signal s (t ) can be expanded in a Fourier series are known as the Dirichlet conditions . They require that in each period s (t ) has a finite number of discontinuities, a finite number of maxima and minima, and that s (t ) satisfies the absolute convergence criterion of Eq. (14.4) [Van Valkenburg, 1974]:(14.4)It is assumed throughout the following discussion that the Dirichlet conditions are satisfied by all functions that will be represented by a Fourier series.The Exponential Fourier Series If s (t ) is a CT periodic signal with period T , then the exponential Fourier series expansion of s (t ) is given by(14.5a)where w o = 2p /T and where the a n terms are the complex Fourier coefficients given by(14.5b)For every value of t where s (t ) is continuous the right side of Eq. (14.5a) converges to s (t ). At values of t where s (t ) has a finite jump discontinuity, the right side of Eq. (14.5a) converges to the average of s (t –) and s (t +), whereFor example, the Fourier series expansion of the sawtooth waveform illustrated in Fig. 14.1 is characterized by T = 2p , w o = 1, a 0 = 0, and a n = a –n = A cos(n p )/(jn p ) for n = 1, 2, …. The coefficients of the exponential Fourier series given by Eq. (14.5b) can be interpreted as a spectral representation of s (t ), since the a n th coefficient represents the contribution of the (n w o )th frequency component to the complete waveform. Since the a n terms are complex valued, the Fourier domain (spectral) representation has both magnitude and phase spectra. For example, the magnitude of the a n values is plotted in Fig. 14.2 for the sawtooth waveform of Fig. 14.1. The fact that the a n terms constitute a discrete set is consistent with the fact that a periodic signal has a line spectrum ;F s t F s nT t nT s nT e a a n a j Tn n (){}=( )-( )ìíïîïüýïþï=( )[]=-¥¥-=-¥¥åådw s t a e n jn tn o ()==-¥¥åw a T s t e dt n n jn t T T o =( ) ()-¥< <¥--ò122w s t s t s t s t -®+®()=-( ) ()=+( )lim lim e e e e 00and© 2000 by CRC Press LLCi.e., the spectrum contains only integer multiples of the fundamental frequency w o . Therefore, the equation pair given by Eq. (14.5a) and (14.5b) can be interpreted as a transform pair that is similar to the CT Fourier transform for periodic signals. This leads to the observation that the classical Fourier series can be interpreted as a special transform that provides a one-to-one invertible mapping between the discrete-spectral domain and the CT domain.Trigonometric Fourier SeriesAlthough the complex form of the Fourier series expansion is useful for complex periodic signals, the Fourier series can be more easily expressed in terms of real-valued sine and cosine functions for real-valued periodic signals. In the following discussion it will be assumed that the signal s (t ) is real valued for the sake of simplifying the discussion. When s (t ) is periodic and real valued it is convenient to replace the complex exponential form of the Fourier series with a trigonometric expansion that contains sin(w o t ) and cos(w o t ) terms with corre-sponding real-valued coefficients [Van Valkenburg, 1974]. The trigonometric form of the Fourier series for a real-valued signal s (t ) is given by(14.6a)where w o = 2p /T . The b n and c n terms are real-valued Fourier coefficients determined byand(14.6b)FIGURE 14.1Periodic CT signal used in Fourier series example.FIGURE 14.2Magnitude of the Fourier coefficients for the example in Fig. 14.3.s t b n c n n n n n ()=( )+( )=¥=¥åå0001cos sin w w b T s t dt T T 0221=( ) ()-òb T s t n t dt n n T T =( ) () ( )=¼-ò212022cos , ,,w c T s t n t dt n n T T =( ) () ( )=¼-ò212022sin , ,,w© 2000 by CRC Press LLCAn arbitrary real-valued signal s (t ) can be expressed as a sum of even and odd components, s (t ) = s even (t ) +s odd (t ), where s even (t ) = s even (–t ) and s odd (t ) = –s odd (–t ), and where s even (t ) = [s (t ) + s (–t )]/2 and s odd (t ) = [s (t )– s (–t )]/2 . For the trigonometric Fourier series, it can be shown that s even (t ) is represented by the (even) cosine terms in the infinite series, s odd (t ) is represented by the (odd) sine terms, and b 0 is the dc level of the signal.Therefore, if it can be determined by inspection that a signal has a dc level, or if it is even or odd, then the correct form of the trigonometric series can be chosen to simplify the analysis. For example, it is easily seen that the signal shown in Fig. 14.3 is an even signal with a zero dc level. Therefore, it can be accurately represented by the cosine series with b n = 2A sin(p n /2)/(p n /2), n = 1, 2, …, as illustrated in Fig. 14.4. In contrast, note that the sawtooth waveform used in the previous example is an odd signal with zero dc level, so that it can be completely specified by the sine terms of the trigonometric series. This result can be demonstrated by pairing each positive frequency component from the exponential series with its conjugate partner; i.e., c n = sin(n w o t )= a n e jn w o t + a –n e –jn w o t , whereby it is found that c n = 2A cos(n p )/(n p ) for this example. In general, it is found that a n = (b n – jc n )/2 for n = 1, 2, …, a 0 = b 0, and a –n = a n *.The trigonometric Fourier series is common in the signal processing literature because it replaces complex coefficients with real ones and often results in a simpler and more intuitive interpretation of the results.Convergence of the Fourier SeriesThe Fourier series representation of a periodic signal is an approximation that exhibits mean-squared conver-gence to the true signal. If s (t ) is a periodic signal of period T and s ¢(t ) denotes the Fourier series approximation of s (t ), then s (t ) and s ¢(t ) are equal in the mean-squared sense if(14.7)Even when Eq. (14.7) is satisfied, mean-squared error (mse) convergence does not guarantee that s (t ) = s ¢(t )at every value of t . In particular, it is known that at values of t where s (t ) is discontinuous the Fourier series converges to the average of the limiting values to the left and right of the discontinuity. For example, if t 0 is apoint of discontinuity, then s ¢(t 0) = [s (t 0–)+ s (t 0+)]/2,where s (t 0–)and s (t 0+)were defined previously (note thatat points of continuity, this condition is also satisfied by the very definition of continuity). Since the Dirichlet conditions require that s (t ) have at most a finite number of points of discontinuity in one period, the set S t such that s (t ) ¹ s ¢(t ) within one period contains a finite number of points, and S t is a set of measure zero in the formal mathematical sense. Therefore, s (t ) and its Fourier series expansion s ¢(t ) are equal almost everywhere ,and s (t ) can be considered identical to s ¢(t ) for analysis in most practical engineering problems.FIGURE 14.3Periodic CT signal used in Fourier series example 2.FIGURE 14.4Fourier coefficients for example of Fig. 14.3.© 2000 by CRC Press LLCThe condition described above of convergence almosteverywhere is satisfied only in the limit as an infinite numberof terms are included in the Fourier series expansion. If theinfinite series expansion of the Fourier series is truncated toa finite number of terms, as it must always be in practicalapplications, then the approximation will exhibit an oscilla-tory behavior around the discontinuity, known as the Gibbsphenomenon [Van Valkenburg, 1974]. Let s N¢(t )denote a truncated Fourier series approximation of s (t ), where onlythe terms in Eq. (14.5a) from n = –N to n = N are includedif the complex Fourier series representation is used or whereonly the terms in Eq. (14.6a) from n = 0 to n = N are included if the trigonometric form of the Fourier series is used. It is well known that in the vicinity of a discontinuity at t 0 the Gibbs phenomenon causes s N¢(t )to be a poor approximation to s (t ). The peak magnitude of the Gibbs oscillation is 13% of the size of the jump discontinuity s (t 0–) –s (t 0+)regardless of the number of terms used in the approximation. As N increases, the region which contains the oscillation becomes more concentrated in the neighborhood of the discontinuity, until, in the limit as N approaches infinity, the Gibbs oscillation is squeezed into a single point of mismatch at t 0. The Gibbs phenom-enon is illustrated in Fig. 14.5, where an ideal low-pass frequency response is approximated by an impulse response function that has been limited to having only N nonzero coefficients, and hence the Fourier series expansion contains only a finite number of terms.If s ¢(t ) in Eq. (14.7) is replaced by s N ¢(t )it is important to understand the behavior of the error mse N as a function of N, where(14.8)An important property of the Fourier series is that the exponential basis functions e jn w o t (or sin(n w o t ) and cos(n w o t ) for the trigonometric form) for n = 0, ±1, ±2, … (or n = 0, 1, 2, … for the trigonometric form)constitute an orthonormal set ; i.e., t nk = 1 for n = k , and t nk = 0 for n ¹ k, where(14.9)As terms are added to the Fourier series expansion, the orthogonality of the basis functions guarantees that the error decreases monotonically in the mean-squared sense, i.e., that mse N monotonically decreases as N is increased. Therefore, when applying Fourier series analysis, including more terms always improves the accuracy of the signal representation.Fourier Transform of Periodic CT SignalsFor a periodic signal s (t ) the CT Fourier transform can then be applied to the Fourier series expansion of s (t )to produce a mathematical expression for the “line spectrum” that is characteristic of periodic signals:(14.10)The spectrum is shown in Fig. 14.6. Note the similarity between the spectral representation of Fig. 14.6 and the plot of the Fourier coefficients in Fig. 14.2, which was heuristically interpreted as a line spectrum. Figures 14.2 and FIGURE 14.5 Gibbs phenomenon in a low-pass digital filter caused by truncating the impulse response to Nterms.t T e e dtnk jn t jn t T T o o =( ) ( )( )--ò122w w F s t F a e a n n jn t n n o n o (){}=ìíïîïüýïþï=-( )=¥¥=-¥¥ååw p d w w 2© 2000 by CRC Press LLC14.6 are different, but equivalent, representations of the Fourier line spectrum that is characteristic of periodic signals.Generalized Complex Fourier TransformThe CT Fourier transform characterized by Eqs. (14.11a) and (14.11b) can be generalized by considering the variable j w to be the special case of u = s + j w with s = 0, writing Eqs. (14.11) in terms of u, and interpreting u as a complex frequency variable. The resulting complex Fourier transform pair is given by Eqs. (14.11a) and (14.11b):(14.11a)(14.11b)The set of all values of u for which the integral of Eq. (14.11b) converges is called the region of convergence,denoted ROC. Since the transform S (u ) is defined only for values of u within the ROC, the path of integration in Eq. (14.11a) must be defined by s so the entire path lies within the ROC. In some literature this transform pair is called the bilateral Laplace transform because it is the same result obtained by including both the negative and positive portions of the time axis in the classical Laplace transform integral. The complex Fourier transform (bilateral Laplace transform) is not often used in solving practical problems, but its significance lies in the fact that it is the most general form that represents the place where Fourier and Laplace transform concepts merge.Identifying this connection reinforces the observation that Fourier and Laplace transform concepts share common properties because they are derived by placing different constraints on the same parent form.DT Fourier TransformThe DT Fourier transform (DTFT) is obtained directly in terms of the sequence samples s [n ] by taking the relationship obtained in Eq. (14.3) to be the definition of the DTFT. By letting T = 1 so that the sampling period is removed from the equations and the frequency variable is replaced with a normalized frequency w¢= w T , the DTFT pair is defined by Eqs. (14.12). In order to simplify notation it is not customary to distinguish between w and w¢, but rather to rely on the context of the discussion to determine whether w refers to the normalized (T = 1) or to the unnormalized (T ¹ 1) frequency variable.(14.12a)(14.12b)FIGURE 14.6Spectrum of the Fourier representation of a periodic signal.s t j S u e du jut j j ()=()()-¥+¥ò12p s s s u s t e dt jut ()=()-¥¥ò–S e s n ej j n n ¢-¢=-¥¥()=[]åw w s n S e e d j jn []=()()¢¢¢-ò12p w w w p p© 2000 by CRC Press LLC The spectrum S (e j w¢) is periodic in w¢ with period 2p . The fundamental period in the range –p < w¢ £ p ,sometimes referred to as the baseband, is the useful frequency range of the DT system because frequency components in this range can be represented unambiguously in sampled form (without aliasing error). In much of the signal-processing literature the explicit primed notation is omitted from the frequency variable. However,the explicit primed notation will be used throughout this section because there is a potential for confusion when so many related Fourier concepts are discussed within the same framework.By comparing Eqs. (14.3) and (14.12a), and noting that w¢ = w T , we see that(14.13)where s [n ] = s (t )|t = nT . This demonstrates that the spectrum of s a (t ) as calculated by the CT Fourier transform is identical to the spectrum of s [n ] as calculated by the DTFT. Therefore, although s a (t ) and s [n ] are quite different sampling models, they are equivalent in the sense that they have the same Fourier domain represen-tation. A list of common DTFT pairs is presented in Table 14.3. Just as the CT Fourier transform is useful in CT signal system analysis and design, the DTFT is equally useful for DT system analysis and design.1. 12.3.4.5.6.7.8.9.10.11.d n[]d n n –0[]e j n -w 01-¥< <¥()n 22pd w p +()=-¥¥åkku n []x n n M []=££ìíî100,,otherwise e j nw 0220pd w w p -+()=-¥¥åk k cos w f 0n +()pd w w p d w w p f fe k e k j j k -+()+++()[]-=-¥¥å 0022F s t a (){}=[]{}DTFT s n© 2000 by CRC Press LLCIn the same way that the CT Fourier transform was found to be a special case of the complex Fourier transform (or bilateral Laplace transform), the DTFT is a special case of the bilateral z-transform with z = e j w¢t .The more general bilateral z -transform is given by(14.14a)(14.14b)where C is a counterclockwise contour of integration which is a closed path completely contained within the ROC of S (z ). Recall that the DTFT was obtained by taking the CT Fourier transform of the CT sampling model s a (t ). Similarly, the bilateral z -transform results by taking the bilateral Laplace transform of s a (t ). If the lower limit on the summation of Eq. (14.14a) is taken to be n = 0, then Eqs. (14.14a) and (14.14b) become the one-sided z -transform, which is the DT equivalent of the one-sided Laplace transform for CT signals.Properties of the DTFTSince the DTFT is a close relative of the classical CT Fourier transform, it should come as no surprise that many properties of the DTFT are similar to those of the CT Fourier transform. In fact, for many of the properties presented earlier there is an analogous property for the DTFT. The following list parallels the list that was presented in the previous section for the CT Fourier transform, to the extent that the same property exists. A more complete list of DTFT pairs is given in Table 14.4:1.Linearity (superposition): DTFT{af 1[n ] + bf 2[n ]} = a DTFT{f 1[n ]} + b DTFT{f 2[n ]}(a and b , complex constants)2.Index Shifting: DTFT{f [n – n o ]} = e –j w n o DTFT{f [n ]}3.Frequency Shifting: e j w o n f [n ] = DTFT –1{F (j (w – w o ))}4.Time-Domain Convolution: DTFT{f 1[n ] * f 2[n ]} = DTFT{f 1[n ]} DTFT{f 2[n ]}5.Frequency-Domain Convolution: DTFT{f 1[n ] f 2[n ]} = (1/2p )DTFT{f 1[n ]} * DTFT{f 2[n ]}6.Frequency Differentiation: nf [n ] = DTFT –1{dF (j w )/d w }Note that the time-differentiation and time-integration properties of the CT Fourier transform do not haveanalogous counterparts in the DTFT because time-domain differentiation and integration are not defined for DT signals. When working with DT systems practitioners must often manipulate difference equations in the frequency domain. For this purpose Property 1 (linearity) and Property 2 (index shifting) are important. As with the CT Fourier transform, Property 4 (time-domain convolution) is very important for DT systems because it allows engineers to work with the frequency response of the system in order to achieve proper shaping of the input spectrum, or to achieve frequency selective filtering for noise reduction or signal detection. Also,Property 3 (frequency shifting) is useful for the analysis of modulation and filtering common in both analog and digital communication systems.Relationship between the CT and DT SpectraSince DT signals often originate by sampling a CT signal, it is important to develop the relationship between the original spectrum of the CT signal and the spectrum of the DT signal that results. First, the CT Fourier transform is applied to the CT sampling model, and the properties are used to produce the following result:(14.15)S z s n z nn ()=[]-=-¥¥ås n j S z z dzn C[]=( ) ()-ò121p F s t F s t t nT S j F t nT a a n n (){}=()-( )ìíïîïüýïþï=( )( )-( )ìíïîïüýïþï=-¥¥=-¥¥ååd p w d 12。
