Spectrum interpolation method, spectrum interpolation apparatus, and spectrum interpolation program storage medium

Information

  • Patent Application
  • 20080219146
  • Publication Number
    20080219146
  • Date Filed
    May 25, 2007
    17 years ago
  • Date Published
    September 11, 2008
    16 years ago
Abstract
A spectrum interpolation method obtains a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform. The spectrum value FP(ω) at the arbitrary frequency f=ω/2π is obtained in accordance with the following formula or any of formulae equivalent to the following formula
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates to a spectrum interpolation method, a spectrum interpolation apparatus and a spectrum interpolation program storage medium. The spectrum interpolation method and spectrum interpolation apparatus are for obtaining a spectrum from discrete spectra generated by calculation such as the FFT (Fast Fourier Transform), while the spectrum at the arbitrary frequency is between two of the discrete spectra and is not included in the discrete spectra. The spectrum interpolation program storage medium stores a spectrum interpolation program that is executed on an information processing device and that causes the information processing device to function as the spectrum interpolation apparatus.


2. Description of the Related Art


Conventionally, spectrum analysis, for example, for a waveform changing over time, has been often used in various fields. FFT algorithms are used for the spectrum analysis.


In this FFT, a time domain waveform is treated as a periodic function and sampled at predetermined time intervals to obtain values at N discrete sampling points in one period of the periodic function. Then, a calculation is performed based on the values at the sampling points to obtain spectra at N discrete frequencies (see a non-patent document, http://www.kurims.kyotou.ac.jp/˜ooura/fftman/index.html).


In the FFT approach described above, there is a limit for performing a detail spectrum analysis, while a spectrum at a frequency between the discrete points is not shown because what can be obtained are spectra at discrete frequencies. It can be obtained to increase the number of sampling points (“N” given above). However, in this case, it is not realistic because a calculation amount of FFT will be massive. In addition, even when the number of sampling points is increased, the sample points are still discrete and a spectrum at an arbitrary frequency cannot be obtained.


SUMMARY OF THE INVENTION

The present invention has been made in view of the above circumstances and provides a spectrum interpolation method, a spectrum interpolation apparatus and a spectrum interpolation program storage medium. The spectrum interpolation method and spectrum interpolation apparatus make it possible to interpolate a spectrum at an arbitrary frequency with high precision from discrete spectra. The spectrum interpolation program storage medium stores a spectrum interpolation program that allows an information processing device to function as the spectrum interpolation apparatus capable of performing such highly precise interpolation.


According to the present invention, there is provided a spectrum interpolation method for obtaining a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained by sampling one period of a periodic function at N sampling points to perform a Fourier transform, wherein the spectrum value FP(ω) at the arbitrary frequency f=ω/2π is obtained in accordance with the following formula or any of formulae equivalent to the following formula









[

Formula





1

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)
















where









[

Formula





2

]












Ψ


(
ω
)


=


1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N





Δ





ω



)


·


sin


(


π
·
ω


Δ





ω


)



sin


(


π
·
ω


N
·
Δω


)
















where

  • ω is an angular frequency of interest,
  • FP(ω) is the spectrum value at the angular frequency ω,
  • Δω is a distance between discrete spectra,
  • ωo is an arbitrary reference angular frequency, including ωo=0, and
  • Ψ(ω) is an interpolation function.


According to the spectrum interpolation method of the present invention, it is possible to obtain a spectrum value at an arbitrary frequency with a considerably high precision without an error in principle at least in accordance with the formula given above, a method for deriving of which will be described later.


Here, an example of the equivalent formulae of the spectrum interpolation method according to the present invention, the following is included.









[

Formula





3

]













F
p



(
ω
)


=




R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-





k
·
Δω


)




+




k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
+

k
·
Δω


)

















where

  • RP(k) is the real part of a complex number FP(k), and
  • FP(k)* is the conjugate complex number of FP(k).


A method for deriving the formula given above will be described later.


The equivalent formulae mentioned above include variations of the formula and simplified formulae that include an error in interpolation, in addition to the form of the formula given above.


In addition, according to the present invention, there is also provided a spectrum interpolation apparatus which obtains a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform, the apparatus including:

  • an acquisition section which obtains the discrete spectra;
  • a calculation section which obtains the spectrum value FP(ω) at the arbitrary frequency f=ω/2π in accordance with the following formula or any of formulae equivalent to the following formula









[

Formula





4

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)
















where









[

Formula





5

]












Ψ


(
ω
)


=


1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N





Δω



)


·


sin


(


π
·
ω


Δ





ω


)



sin


(


π
·
ω


N
·
Δω


)
















where

  • ω is an angular frequency of interest,
  • FP(ω) is the spectrum value at the angular frequency ω,
  • Δω is a distance between discrete spectra,
  • ωo is an arbitrary reference angular frequency, including ωo=0, and
  • Ψ(ω) is an interpolation function; and
  • an output section which outputs the spectrum value FP(ω) obtained by the calculation section.


Here, in the spectrum interpolation apparatus of the present invention, the calculation section may obtain the spectrum value FP(ω) at the arbitrary frequency f=ω/2π in accordance with the following formula









[

Formula





6

]













F
p



(
ω
)


=




R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-





k
·
Δω


)




+




k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
+

k
·
Δω


)

















which is one of the equivalent formulae,


where

  • RP(k) is the real part of a complex number FP(k), and
  • FP(k)* is the conjugate complex number of FP(k).


In addition, in the spectrum interpolation apparatus of the present invention, the acquisition section obtains the discrete spectra and the obtaining mode does not the matter. For example, the acquisition section may read the discrete spectra stored beforehand or may by itself perform a FFT calculation to obtain the discrete spectra.


In addition, calculations in the calculation section include calculations of all modes corresponding to the modes of the spectrum interpolation method described above.


Further, the output section may display, print, transmit through a communication line, or output in a mode the spectrum value obtained by the calculation section.


In addition, according to the present invention, there is provided a storage spectrum interpolation program storage medium storing a spectrum interpolation program which is executed in a program executing information processing device and causes the information processing device to function as a spectrum interpolation apparatus which obtains a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform, the apparatus including:

  • an acquisition section which obtains the discrete spectra;
  • a calculation section which obtains the spectrum value FP(ω) at the arbitrary frequency f=ω/2π in accordance with the following formula or any of formulae equivalent to the following formula









[

Formula





7

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)
















where









[

Formula





8

]












Ψ


(
ω
)


=


1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N





Δω



)


·


sin


(


π
·
ω


Δ





ω


)



sin


(


π
·
ω


N
·
Δω


)
















where

  • ω is an angular frequency of interest,
  • FP(ω) is the spectrum value at the angular frequency ω,
  • Δω is a distance between discrete spectra,
  • ωo is an arbitrary reference angular frequency, including ωo=0, and
  • Ψ(ω) is an interpolation function; and
  • an output section which outputs the spectrum value FP(ω) obtained by the calculation section.


Here, the calculation section may obtain the spectrum value FP(ω) at the arbitrary frequency f=/2π in accordance with the following formula









[

Formula





9

]













F
p



(
ω
)


=




R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-





k
·
Δω


)




+




k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
+

k
·
Δω


)

















which is one of the equivalent formulae,


where

  • RP(k) is the real part of a complex number FP(k), and
  • FP(k)* is the conjugate complex number of FP(k).


The spectrum interpolation program storage medium according to the present invention includes modes corresponding to the modes of the spectrum interpolation apparatus.


According to the present invention, a spectrum value at an arbitrary frequency between discrete points on a frequency axis can be interpolated with high precision.





BRIEF DESCRIPTION OF THE DRAWINGS

An exemplary embodiment of the present invention will be described in detail with reference to the following drawings.



FIG. 1 is an external perspective view of a computer.



FIG. 2 shows a hardware configuration of the computer whose external appearance is shown in FIG. 1.



FIG. 3 is a conceptual diagram showing a CD-ROM in which a spectrum interpolation program is stored.



FIG. 4 shows a functional configuration of a spectrum interpolation apparatus according to an embodiment of the present invention.



FIG. 5 shows a damping oscillation waveform;



FIG. 6 shows spectra of data windowed with a Hanning window shown in FIG. 5.



FIG. 7 is an enlarged view of a portion of FIG. 6.



FIG. 8 shows a beat waveform.



FIG. 9 shows spectra of data windowed with a Hanning window shown in FIG. 8.



FIG. 10 is an enlarged view of a portion of FIG. 9.





DETAILED DESCRIPTION OF THE INVENTION

The embodiment of the present invention will be described below.



FIG. 1 is an external perspective view of a computer. This computer functions as a spectrum interpolation apparatus of an embodiment of the present invention by executing a program described later.


The computer 100 show in FIG. 1 includes, as an external appearance configuration, a main unit 110, an image display unit 120 which displays an image on a display screen 121 in response to an instruction from the main unit 110, a keyboard 130 for inputting various kinds of information in response to key operations into the main unit 110, and a mouse 140 for pointing a position on the display screen 121 to input an instruction associated with an object, for example an icon, displayed at the position. The main unit 110 includes, as an external appearance, a flexible disk (hereinafter abbreviated as FD) slot 111 for loading an FD and a CD-ROM slot 112 for loading a CD-ROM.



FIG. 2 shows a hardware configuration of the computer 100 shown in the external view of FIG. 1.


As shown in FIG. 2, included in the main unit 110 are a CPU 113 which executes programs, a main memory 114 into which a program stored in a hard disk unit 115 is read and loaded for execution by the CPU 113, the hard disk unit 115 in which programs and data are stored, an FD drive 116 which accesses an FD 400, a CD-ROM drive 117 which accesses a loaded CD-ROM 401, an input interface 118 through which a signal is input from an external source such as an external sensor, and an output interface 119 through which the result of a calculation is output to an external device. These components and the image display unit 120, keyboard 130, and mouse 140 shown in FIG. 1 are interconnected through a bus 150.


Stored on the CD-ROM 401 is a spectrum interpolation program for causing the computer 100 to function as a spectrum interpolation apparatus according to an embodiment of the present invention. The CD-ROM 401 is loaded into the CD-ROM drive 117 and the spectrum interpolation program stored on the CD-ROM 401 is uploaded into the computer and stored in the hard disk unit 115. When the spectrum interpolation program is activated and executed on the computer 100, the computer 100 operates as a spectrum interpolation apparatus according to an embodiment of the present invention.


While the CD-ROM 401 is illustrated as a storage medium in which the spectrum interpolation program is stored in the example, the storage medium for storing the spectrum interpolation program is not limited to a CD-ROM. Any of other types of storage media such as an optical disk, MO, FD, and magnetic tape may be used.



FIG. 3 is a conceptual diagram showing a CD-ROM 401 in which the spectrum interpolation program is stored.


Stored on the CD-ROM 401 shown in FIG. 3 is the spectrum interpolation program 410 including an acquisition section 411, a calculation section 412, and output section 413.


The computer 100 shown in FIGS. 1 and 2 also includes an FFT analyzer function that receives a time domain signal from the outside and performs FFT calculations to the time domain signal to obtain discrete spectra. The acquisition section 411 is a program component that causes the computer 100 to read discrete spectra obtained through FFT calculations and stored in the hard disk unit 115 to obtain the discrete spectra. The acquisition section 411 may include a program component that causes the computer 100 to perform FFT calculations.


The calculation section 412 is a program component that causes the computer 100 to calculate a spectrum value Fp(ω) at an arbitrary frequency f=ω/2π from acquired discrete spectra in accordance with the formula









[

Formula





10

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)
















where









[

Formula





11

]












Ψ


(
ω
)


=


1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N





Δω



)


·


sin


(


π
·
ω


Δ





ω


)



sin


(


π
·
ω


N
·
Δω


)
















where

  • ω is an angular frequency of interest,
  • FP(ω) is the spectrum value at the angular frequency ω,
  • Δω is a distance between discrete spectra,
  • ωo is a given reference angular frequency, including ωo=0, and
  • Ψ(ω) is an interpolation function.


Alternatively, the calculation section 412 may cause the computer 100 to obtain a spectrum value FP(ω) at an arbitrary frequency f=ω/2π from acquired discrete spectra in accordance with the following formula, instead of the formulae given above,









[

Formula





12

]













F
p



(
ω
)


=




R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-





k
·
Δω


)




+




k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
+

k
·
Δω


)

















where

  • RP(k) is the real part of a complex number Fp(k), and
  • FP(k)* is the conjugate complex number of FP(k).


In addition, the output section 413 is a program component that causes the computer 100 to display the results of calculations performed by the calculation section 412 on the display screen 121 of the image display unit 120 (see FIG. 1). The output section 413 may cause the computer 100 to output the results of calculations to an external device in addition to, or instead of displaying them.



FIG. 4 shows a functional configuration of a spectrum interpolation apparatus according to an embodiment of the present invention.


The spectrum interpolation apparatus 420 shown in FIG. 4 includes an acquisition section 421, a calculation section 422, and an output section 423. The acquisition section 421, calculation section 422, and output section 423 are functions implemented by executing on the computer 100 the acquisition section 411, calculation section 412, and output section 413, respectively, which are the program components of the spectrum interpolation program 410 shown in FIG. 3. Accordingly, the acquisition section 421, calculation section 422, and output section 423 shown in FIG. 4 are composed of the acquisition section 411, calculation section 412, and output section 413, respectively, which are program components, and hardware of the computer 100.


A derivation of the formulae given above will be described below.

  • 1. Introduction


This section briefly describes matters at the starting point regarding fundamentals of interpolation of a discretely sampled periodic spectral function. Expansions of Fourier series will be reviewed from the standpoint of numerically calculating a Fourier series coefficient to derive a sampling theorem for a periodic spectral signal. As a by-product of the derivation, interpolation formulae for periodic spectral functions using sample points will be derived.

  • 2. From integral representation of Fourier series coefficient to sample point Fourier transform formulae


Here, the periodic spectral function with a period 2π/ωs is denoted by FP(ω). That is,


[Formula 13]





F
p(ω)=Fp(ω±s)   (2.1)


Since FP(ω) is a periodic signal, Fourier series expansion of the signal is possible and is represented as









[

Formula





14

]













F
p



(
ω
)


=




n
=

-




+






d
n

·

exp


(


-
j




2


π
·
n



ω
s



ω

)








(
2.2
)






[

Formula





15

]












d
n

=


1

ω
s


·




ω
s






F
p



(
ω
)


·

exp


(


+
j




2


π
·
n



ω
s



ω

)


·


ω








(
2.3
)







Here, the integral sign in Formula (2.3) represents an integral over one period. When attempting to obtain (approximately at least) the integral through a numerical calculation, the first to come to mind may be the formula









[

Formula





16

]















d
n






Δω

ω
s


·




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

exp


(


+
j





2


π
·
n



ω
s


·

(


ω
0

+

k
·
Δω


)



)











=




1
N

·




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

exp


(


+
j




2

π





kn

N


)


·

exp


(


+
j




2


π
·
n







ω
0



N
·
Δω



)












(
2.4
)







where


[Formula 17]




ωs=N·Δω  (2.5)


Here, ωo is a given reference angular frequency, which may be zero. From Formula (2.4), the following formula can be written.









[

Formula





18

]

















d
n

(
D
)


=


1
N

·




k
=
0


N
-
1






F
p



(


ω
0

+


k
·
Δ






ω


)


·

exp


(


+
j




2





π





kn

N


)










(
2.6
)







Here, dn(D) has the following periodicity:


[Formula 19]





d
n
(D)
=d
n+1N
(D)   (2.7)


From Formula (2.6), FP(ωo+k·Δω) is represented with dn(D) by using the formula









[

Formula





20

]





















1
N






n
=
0


N
-
1




exp


(


-
j




2






π


(

l
-
k

)



n

N


)




=




1
N

·


1
-

exp


(


-
j






2






π


(

l
-
k

)



)




1
-

exp


(


-
j






2







π


(

l
-
k

)


/
N


)











=



exp


(


-
j







π


(

l
-
k

)



)












exp


(


-
j




π


(

l
-
k

)


N


)


·












sin


(

π


(

l
-
k

)


)



π


(

l
-
k

)



·



π


(

l
-
k

)


/
N


sin


(


π


(

l
-
k

)


/
N

)










=



δ


l
-
k

,
mN










(
2.8
)







That is, the Formula (2.6) is multiplied by exp (−j2π·n1/N), the sum of the values from 0 to (N−1) for n is calculated, and Formula (2.8) is used to obtain









[

Formula





21

]


















F
p



(


ω
0

+


l
·
Δ






ω


)


=




n
=
0


N
-
1





d
n

(
D
)


·

exp


(


-
j




2






π
·
nl


N


)









(
2.9
)







On the other hand, by making the following substitutions into Formula (2.2)


[Formula 22]




ω=ω0+l·Δω  (2.10)






n=n
0
+mN   (2.11)


and using ωs=N·Δω in Formula (2.5) to obtain









[

Formula





23

]





















F
p



(


ω
0

+


l
·
Δ






ω


)


=







n
0

=
0


N
-
1







m
=

-




+






d


n
0

+
mN


·
exp












(


-
j







2






π
·

(


n
0

+
mN

)

·







(


ω
0

+


l
·
Δ






ω


)





ω
s



)







=







n
0

=
0


N
-
1




{




m
=

-




+






d


n
0

+
mN


·
exp














(


-
j




2






π
·

(


n
0

+
mN

)




ω
0



ω
s



)

}



exp


(


-
j




2





π






n
0


l

N


)










(
2.12
)







By comparing Formulae (2.9) and (2.12),









[

Formula





24

]

















d
n

(
D
)


=




m
=

-




+






d

n
+
mN


·

exp


(


-
j




2






π
·

(

n
+
mN

)

·

ω
0




ω
s



)









(
2.13
)







is obtained. It is evident from Formula (2.13) that the periodicity of Formula (2.7) holds.

  • 3. Sampling Theorem for Periodic-Spectra


First, from Formula (2.13),









[

Formula





25

]

















d
n

(
D
)


=




m
=

-




+






d

n
+
mN


·

exp


(


-
j




2






π
·

(

n
+
mN

)

·

ω
0




ω
s



)









(
3.1
)







Here, consider a signal that is localized in time as follows.


[Formula 26]





d
n=0 for n≦−1 or n≧N   (3.2)


In this case, the following holds









[

Formula





27

]

















d
n

(
D
)


=




d
n

·

exp


(


-
j




2






π
·
n







ω
0



ω
s



)








for





0


n


(

N
-
1

)







(
3.3
)







From Formulae (2.2), (3.2), and (3.3),








[

Formula





28

]





















F
p



(
ω
)


=






n
=

-




+






d
n

·

exp


(


-
j




2






π
·
n



ω
s



ω

)










=






n
=
0


N
-
1





d
n

·

exp


(


-
j




2






π
·
n



ω
s



ω

)










=






n
=
0


N
-
1





d
n

(
D
)


·

exp


(



+
j




2






π
·
n







ω
0




N
·
Δ






ω



-

j



2






π
·
n




N
·
Δ






ω



ω


)












(
3.4
)







By using Formula (2.6)






[

Formula





29

]












d
n

(
D
)


=


1
N

·




k
=
0


N
-
1






F
p



(


ω
0

+


k
·
Δ






ω


)


·

exp


(


+
j




2





π





kn

N


)










to obtain









[

Formula





30

]


















F
p



(
ω
)


=








k
=
0


N
-
1






F
p



(


ω
0

+


k
·
Δ






ω


)




{


1
N






n
=
0


N
-
1




exp


(


-
j




2






π
·
n




N
·
Δ






ω




(

ω
-

ω
0

-


k
·
Δ






ω


)


)




}








(
3.5
)







By substituting









[

Formula





31

]

















Ψ


(
ω
)


=


1
N






n
=
0


N
-
1




exp


(


-
j




2






π
·
n




N
·
Δ






ω



ω

)









(
3.6
)







Formula (3.5) can be rewritten as









[

Formula





32

]


















F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+


k
·
Δ






ω


)


·

Ψ


(

ω
-

(


ω
0

+


k
·
Δ






ω


)


)









(
3.7
)







This formula (3.7) is one of the interpolation formulae of the present invention.


By substituting ω=ωo+1·Δω in Formula (3.7),









[

Formula





33

]


















F
p



(


ω
0

+


l
·
Δ






ω


)


=




k
=
0


N
-
1






F
p



(


ω
0

+


k
·
Δ






ω


)


·

Ψ


(



(

l
-
k

)

·
Δ






ω

)









(
3.8
)







can be obtained. Accordingly, taking the periodicity of FP(ω) represented by formulae (2.1) and (2.5) into consideration, the property


[Formula 34]




Ψ((l−k)·Δω)=δl−k,±mNl,k±mNk,l±mN   (3.9)


is required. Here, note that









[

Formula





35

]

















S
=


a
0






k
=
0

K



r
k




,





rS
=


a
0






k
=
1


K
+
1




r
k




,





S
=


a
0




1
-

r

K
+
1




1
-
r









(
3.10
)







then, Ψ(ω) in Formula (3.6) is given by









[

Formula





36

]




















Ψ


(

ω
+


mN
·
Δ






ω


)


=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·

(

ω
+


mN
·
Δ






ω


)





N
·
Δ






ω



)


·











sin


(


π
·

(

ω
+


mN
·
Δ






ω


)



Δ





ω


)



sin


(


π
·

(

ω
+


mN
·
Δ






ω


)




N
·
Δ






ω


)









=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω




N
·
Δ






ω



)


·










exp



(


-

j


(

N
-
1

)




m





π

)

·













sin


(


π





ω


Δ





ω


)




cos


(

mN





π

)





sin


(


π





ω



N
·
Δ






ω


)




cos


(

m





π

)










=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω




N
·
Δ






ω



)


·


sin


(


π





ω


Δ





ω


)



sin


(


π





ω



N
·
Δ






ω


)










=



Ψ


(
ω
)










(
3.12
)







This formula (3.11) is the interpolation function used in Formula (3.7).


By substituting ω with ω+mN·Δω=ω+mωs in Formula (3.11),









[

Formula





37

]















Ψ


(

ω
+

mN
·
Δω


)


=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·

(

ω
+

mN
·
Δω


)




N
·
Δω



)


·











sin


(


π
·

(

ω
+

mN
·
Δω


)


Δω

)



sin


(


π
·

(

ω
+

mN
·
Δω


)



N
·
Δω


)









=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N
·
Δω



)


·
exp











(


-

j


(

N
-
1

)




m





π

)

·



sin


(

πω
Δω

)




cos


(

mN





π

)





sin


(

πω

N
·
Δω


)




cos


(

m





π

)











=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N
·
Δω



)


·












sin


(

πω
Δω

)



sin


(

πω

N
·
Δω


)



=

Ψ


(
ω
)










(
3.12
)







is obtained. Therefore, Ψ(ω) is a periodic function of N Δω=ωs.


The function Ψ(ω) must satisfy Ψ(k·Δω)=δk, mN in Formula (3.9). That is, it must satisfy









[

Formula





38

]















δ

k
,
mN


=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
k
·
Δω



N
·
Δω



)


·











sin


(


π
·
k
·
Δω

Δω

)



sin


(


π
·
k
·
Δω


N
·
Δω


)









=




1
N

·

exp


(


-
j





(

N
-
1

)



π
·
k


N


)


·


sin


(

π
·
k

)



sin


(


π
·
k

N

)











(
3.13
)







If k≠mN, the right side of Formula (3.13) is obviously zero. On the other hand, if k=mN, then









[

Formula





39

]












Ψ


(

mN
·
Δω

)


=



1
N

·

exp


(


-
j







m


(

N
-
1

)



π

)


·



cos


(

mN





π

)



cos


(

m





π

)



.




N


=
1





(
3.14
)







Thus, it can be seen that Formula (3.13) and therefore Formula (3.9) hold.


It can be readily shown that the following properties of Ψ(ω) hold.

  • (1) Periodicity


[Formula 40]




Ψ(ω+mN·Δω)=Ψ(ω)   (3.15)

  • (2) The value when ω=mN·Δω and ω=k·Δω (where k=0, 1, 2, . . . , (N−1)) is


[Formula 41]




Ψ(k·Δω)=δk,mN   (3.16)


In the following description, the following substitution is used.









[

Formula





42

]















Ψ


(
ω
)


=


1
N

·

exp


(


-
j





(

N
-
1

)



π
·
ω



N
·
Δω



)


·


sin


(


π
·
ω

Δω

)



sin


(


π
·
ω


N
·
Δω


)










=



Ψ

(
r
)




(
ω
)


+

j







Ψ

(
i
)




(
ω
)











(
3.17
)







Here,








[

Formula





43

]













Ψ

(
r
)




(
ω
)


=


1
N

·

cos


(



(

N
-
1

)



π
·
ω



N
·
Δω


)


·


sin


(


π
·
ω

Δω

)



sin


(


π
·
ω


N
·
Δω


)








(
3.18
)







and









[

Formula





44

]













Ψ

(
i
)




(
ω
)


=


-

1
N


·

sin


(



(

N
-
1

)



π
·
ω



N
·
Δω


)


·


sin


(


π
·
ω

Δω

)



sin


(


π
·
ω


N
·
Δω


)








(
3.19
)







Then, the following can be shown.

  • (3) Values when ω=(N/2)·Δω and symmetry about ω=(N/2)·Δω


First, values when ω=(N/2)·Δω are determined. When N is an even number,









[

Formula





45

]













Ψ

(
r
)




(


N
2


Δω

)


=



1
N

·

cos


(



(

N
-
1

)


π

2

)


·


sin


(


N





π

2

)



sin


(

π
2

)




=
0





(
3.20
)






[

Formula





46

]













Ψ

(
i
)




(


N
2


Δω

)


=



-

1
N


·

sin


(



(

N
-
1

)


π

2

)


·


sin


(


N





π

2

)



sin


(

π
2

)




=
0





(
3.21
)







The symmetry about ω=(N/2)·Δω will be considered next. For the real part, the following symmetry about ω=(N/2)·Δω can be shown.









[

Formula





47

]













Ψ

(
r
)




(



N
2


Δω

+
Ω

)


=


Ψ

(
r
)




(



N
2


Δω

-
Ω

)






(
3.22
)







For the imaginary part, the following skew symmetry about ω=(N/2)·Δω can be shown.









[

Formula





48

]













Ψ

(
i
)




(



N
2


Δω

+
Ω

)


=

-


Ψ

(
i
)




(



N
2


Δω

-
Ω

)







(
3.24
)







  • (4) The symmetry about ω=(N/2)·Δω when N is an odd number



For the real part, the following symmetry about ω=(N/2)·Δω can be shown.









[

Formula





49

]













Ψ

(
r
)




(



N
2


Δω

+
Ω

)


=


Ψ

(
r
)




(



N
2


Δω

-
Ω

)






(
3.25
)







For the imaginary part, the following skew symmetry about ω=(N/2)·Δω can be shown, as in the case where N is an even number.









[

Formula





50

]













Ψ

(
i
)




(



N
2


Δω

+
Ω

)


=

-


Ψ

(
i
)




(



N
2


Δω

-
Ω

)







(
3.26
)







  • 4. Interpolation Formulae with Taking into Consideration the Symmetry of Spectra



The discussion so far has been made in general terms. When the original time signal is a real signal, the range of values to be added up can be reduced to half by using the fact that the real part of a spectrum is an even number and the imaginary part is an odd number.


This will be described below. First, in the following formula,









[

Formula





51

]













F
p



(
k
)


=




R
p



(
k
)


+

j







X
p



(
k
)




=


1
N






n
=
0


N
-
1






f
p



(
n
)


·

exp


(


-
j




2

π





kn

N


)










(
4.1
)







if the time signal is a real signal,









[

Formula





52

]













R
p



(
k
)


=


1
N






n
=
0


N
-
1






f
p



(
n
)


·

cos


(


2

π





kn

N

)









(
4.2
)






[

Formula





53

]













X
p



(
k
)


=


-

1
N







n
=
0


N
-
1






f
p



(
n
)


·

sin


(


2

π





kn

N

)









(
4.3
)







the following formulae hold.









[

Formula





54

]
















R
p



(

N
-
k

)


=


1
N






n
=
0


N
-
1






f
p



(
n
)


·

cos


(


2


π


(

N
-
k

)



n

N

)











=


1
N






n
=
0


N
-
1






f
p



(
n
)


·

cos


(

-


2

π





kn

N


)











=


R
p



(
k
)









(
4.4
)






[

Formula





55

]
















X
p



(

N
-
k

)


=


-

1
N







n
=
0


N
-
1






f
p



(
n
)


·

sin


(


2


π


(

N
-
k

)



n

N

)











=


-

1
N







n
=
0


N
-
1






f
p



(
n
)


·

sin


(

-


2

π





kn

N


)











=

-


X
p



(
k
)










(
4.5
)






[

Formula





56

]
















X
p



(

N
2

)


=



1
N






n
=
0


N
-
1






f
p



(
n
)


·

cos


(

π





n

)





-

j


1
N






n
=
0


N
-
1






f
p



(
n
)


·

sin


(

π





n

)












=


1
N






n
=
0


N
-
1






f
p



(
n
)


·

cos


(

π





n

)











=


R
p



(

N
2

)









(
4.6
)







If ωo=0 in interpolation Formula (3.8)









[

Formula





57

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)








(

(
3.8
)

)







then Formula (3.8) can be rewritten as









[

Formula





58

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(

k


·
Δω


)


·

Ψ


(

ω
-

k
·
Δω


)








(
4.7
)







Taking into consideration Formulae (4.4) through (4.6), Formula (4.7) can be rewritten as









[

Formula





59

]













F
p



(
ω
)


=





R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-

k
·
Δω


)




+




l
=


N
/
2

+
1



N
-
1






F
p



(

l
·
Δω

)


·

Ψ


(

ω
-

l
·
Δω


)









=





R
p



(
0
)


·

Ψ


(
ω
)



+




R
p



(


N
2

·
Δω

)


·
Ψ



(

ω
-

(


N
2

·
Δω

)


)


+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-

k
·
Δω


)




+




k
=
1



N
/
2

-
1






F
p



(


(

N
-
k

)

·
Δω

)


·

Ψ


(

ω
-

(


(

N
-
k

)

·
Δω

)


)








=





R
p



(
0
)


·

Ψ


(
ω
)



+




R
p



(


N
2

·
Δω

)


·
Ψ



(

ω
-

(


N
2

·
Δω

)


)


+




k
=
1



N
/
2

-
1






R
p



(

k
·
Δω

)


·

{


Ψ


(

ω
-

k
·
Δω


)


+

Ψ


(

ω
-

(


(

N
-
k

)

·
Δω

)


)



}



+

j





k
=
1



N
/
2

-
1






X
p



(

k
·
Δω

)


·

{


Ψ


(

ω
-

k
·
Δω


)


-



Ψ






(

ω
-

(


(

N
-
k

)

·
Δω

)


)



}









=




R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·

Ψ


(

ω
-

(


N
2

·
Δω

)


)



+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-

k
·
Δω


)




+




k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
-

(


(

N
-
k

)

·
Δω

)


)












(
4.8
)







From formulae (3.18) and (3.19)









[

Formula





60

]













Ψ

(
r
)




(
ω
)


=


1
N

·

cos


(



(

N
-
1

)



π
·
ω



N
·
Δω


)


·


sin


(


π
·
ω

Δω

)



sin


(


π
·
ω


N
·
Δω


)








(

(
3.18
)

)






[

Formula





61

]













Ψ

(
i
)




(
ω
)


=


-

1
N


·

sin


(



(

N
-
1

)



π
·
ω



N
·
Δω


)


·


sin


(


π
·
ω

Δω

)



sin


(


π
·
ω


N
·
Δω


)








(

(
3.19
)

)







the following formulae are derived.









[

Formula





62

]
















Ψ

(
r
)




(

ω
-


(

N
-
k

)


Δω


)


=




1
N

·

cos


(



(

N
-
1

)



π
·

(

ω
-


(

N
-
k

)


Δω


)




N
·
Δω


)


·











sin


(


π
·

(

ω
-


(

N
-
k

)


Δω


)


Δω

)



sin


(


π
·

(

ω
-


(

N
-
k

)


Δω


)



N
·
Δω


)









=




1
N

·

cos


(



(

N
-
1

)



π
·

(

ω
+

k





Δω


)




N
·
Δω


)


·











sin


(


π
·

(

ω
+

k





Δω


)


Δω

)



sin


(


π
·

(

ω
+

k





Δω


)



N
·
Δω


)









=




Ψ

(
r
)




(

ω
+

k





Δω


)









(
4.9
)






[

Formula





63

]
















Ψ

(
I
)




(

ω
-


(

N
-
k

)


Δω


)


=




-

1
N


·










sin



(



(

N
-
1

)



π
·

(

ω
-


(

N
-
k

)


Δω


)




N
·
Δω


)

·












sin


(


π
·

(

ω
-


(

N
-
k

)


Δω


)


Δω

)



sin


(


π
·

(

ω
-


(

N
-
k

)


Δω


)



N
·
Δω


)









=




-

1
N


·

sin


(



(

N
-
1

)



π
·

(

ω
+

k





Δω


)




N
·
Δω


)


·











sin


(


π
·

(

ω
+

k





Δω


)


Δω

)



sin


(


π
·

(

ω
+

k





Δω


)



N
·
Δω


)









=




Ψ

(
l
)




(

ω
+

k





Δω


)









(
4.10
)







Therefore,
[Formula 64]




Ψ(ω−(N−k)Δω)=Ψ(ω+kΔω)   (4.11)


Thus, the interpolation formula









[

Formula





65

]
















F
p



(
ω
)


=






R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·
Ψ












(

ω
-

(


N
2

·
Δω

)


)

+




k
=
1



N
/
2

-
1






R
p



(

k
·
Δω

)


·













{


Ψ


(

ω
-

k
·
Δω


)


+

Ψ


(

ω
+

k
·
Δω


)



}

+










j





k
=
1



N
/
2

-
1






X
p



(

k
·
Δω

)


·

{


Ψ


(

ω
-

k
·
Δω


)


-

Ψ


(

ω
+

k
·
Δω


)



}










=






R
p



(
0
)


·

Ψ


(
ω
)



+



R
p



(


N
2

·
Δω

)


·












Ψ


(

ω
-

(


N
2

·
Δω

)


)


+




k
=
1



N
/
2

-
1






F
p



(

k
·
Δω

)


·

Ψ


(

ω
-

k
·
Δω


)




+













k
=
1



N
/
2

-
1






(


F
p



(

k
·
Δω

)


)

*

·

Ψ


(

ω
+

k
·
Δω


)











(
4.12
)







can be obtained.


Formula (4.12) is another interpolation formula of the present invention.


The result of a simulation using an interpolation formula of the present invention will be described below.


Spectral interpolation and a demonstrative example of it will be summarized here.

  • 5. Overview of Principle of Spectral Interpolation


The principle of spectrum interpolation is based on a sampling theorem for a periodic function. The process for deriving formulae and details of interpolation functions are as described above. The interpolation formula is given as









[

Formula





66

]













F
p



(
ω
)


=




k
=
0


N
-
1






F
p



(


ω
0

+

k
·
Δω


)


·

Ψ


(

ω
-

(


ω
0

+

k
·
Δω


)


)








(
5.1
)







where ω is an angular frequency of interest to be obtained, FP(ω) is a complex spectrum to be obtained, FP(ωo+kΔω) is complex spectrum data at a discrete angular frequency obtained using FFT, and ωo is a given reference angular frequency, which may be zero, and Ψ(ω) is an interpolation function. That is, a complex spectrum at a desired frequency can be obtained without an error when N complex spectra FP(ωo+kΔω) obtained by using FFT are provided. Because formula (5.1) is in the form of convolution, a fast algorithm using FFT is possible if interpolation at a number of uniformly spaced points of a power of 2 is desired. However, (5.1) is advantageous in that the formula can be used in a case where the value at a single point is to be obtained.


Because the principle is based on a sampling theorem for a periodic signal, the following conditions must be satisfied.

  • (1) The signal is a time signal that starts with zero and ends with zero.


Impulse responses and time signals windowed with a Hanning window will satisfy the condition.

  • (2) All spectra obtained using FFT are used for interpolation calculation.


Spectral interpolation without an error is possible if the two conditions are satisfied.

  • 6. Example of Numerical Calculation
  • 6.1 Spectra of Damping Oscillation


The first example is damping oscillation waveform spectra as shown in FIG. 5.


In FIG. 5, the solid curve represents raw time data and the dashed curve represents time data windowed with a Hanning window.


A damping sine wave given by


[Formula 67]





f(t)=e−2πf0ζt sin(2πf0t)   (6.1.1)


is used. In this example, analysis is performed using fo=100 (Hz), ζ=0.008, N=32, and fmax=512 (Hz).



FIG. 6 shows the spectra of the data windowed with the Hanning window shown in FIG. 5 and FIG. 7 shows an enlarged view of a portion of the data shown in FIG. 6.


The dashed curve represents discrete spectra obtained using FFT calculation and is a line plot in which discrete spectra are connected by line segments. The solid curve represents spectrum values obtained from the discrete spectra represented by the line plot by using interpolation formula (6.1). It can be seen from these graphs that the spectrum value at each frequency between discrete points can be very accurately obtained.

  • 7.2. Spectra of Beat


The next example is beat waveform spectra as shown in FIG. 8.


In FIG. 8, the solid curve represents raw time data and the dashed curve represents time data windowed with a Hanning window.


A damping sine wave given by


[Formula 68]





f(t)=e−2πf1ζt sin(22πf1t)+e−2πf2ζt sin(2πf2t)   (6.2.1)


is used. In this example, analysis is performed using f1=100 (Hz), f1=114 (Hz), ζ=0.008, N=64, and fmax=512 (Hz).



FIG. 9 shows spectra of the data windowed with the Hanning window shown in FIG. 8 and FIG. 10 is an enlarged view of a portion of the graph shown in FIG. 9.


Because beat is treated in this example, two peaks of the spectra will appear. It can be seen that the interpolation formula of the present invention enables the peaks, which are obscure in discrete spectra obtained using FFT, to clearly appear with high precision.


It can be seen from these drawings that the interpolated data at the original data points coincides with the original data and passes through the other points at which probable true values appear.


A general purpose computer and the spectrum interpolation program executed on the computer are used to implement a spectrum interpolation apparatus in the embodiments described above. However, the spectrum interpolation apparatus of the present invention may be implemented as a dedicated apparatus, instead of using a general purpose computer, or may be implemented by using a general purpose computer and another apparatus such as a spectrum analyzer, or may be implemented as a measuring instrument.

Claims
  • 1. A spectrum interpolation method for obtaining a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform, wherein the spectrum value FP(ω) at the arbitrary frequency f=ω/2π is obtained in accordance with the following formula or any of formulae equivalent to the following formula
  • 2. The spectrum interpolation method according to claim 1, wherein the equivalent formulae include
  • 3. A spectrum interpolation apparatus that obtains a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform, the spectrum interpolation apparatus comprising: an acquisition section that obtains the discrete spectra;a calculation section that obtains the spectrum value FP(w) at the arbitrary frequency f=ω/2π in accordance with the following formula or any of formulae equivalent to the following formula
  • 4. The spectrum interpolation apparatus according to claim 3, wherein the calculation section obtains the spectrum value FP(ω) at the arbitrary frequency f=ω/2π in accordance with the following formula
  • 5. A spectrum interpolation program storage medium storing a spectrum interpolation program that is executed in a program executing information processing device and causes the information processing device to function as a spectrum interpolation apparatus that obtains a spectrum value at an arbitrary frequency by interpolating discrete spectra obtained through sampling one period of a periodic function at N sampling points to perform a Fourier transform, the spectrum interpolation apparatus comprising: an acquisition section which obtains the discrete spectra;a calculation section which obtains the spectrum value FP(w) at the arbitrary frequency f=ω/2π in accordance with the following formula or any of formulae equivalent to the following formula
  • 6. The spectrum interpolation storage medium storing the spectrum interpolation program according to claim 5, wherein the calculation section obtains the spectrum value FP(ω) at the arbitrary frequency f=ω/2π in accordance with the following formula
Priority Claims (1)
Number Date Country Kind
2006-150057 May 2006 JP national