## Abstract

The main purpose of this paper is to present a method to design tunable quadrature filters in phase shifting interferometry. From a general tunable two-frame algorithm introduced, a set of individual filters corresponding to each quadrature conditions of the filter is obtained. Then, through a convolution algorithm of this set of filters the desired symmetric quadrature filter is recovered. Finally, the method is applied to obtain several tunable filters, like four and five-frame algorithms.

©2010 Optical Society of America

## 1. Introduction

Several kinds of methods to design quadrature filters are found in the literature and references therein . However, most of them give an algorithm designed for a specific phase step . In a previous work, a theory to design tunable filters was presented . Then, in this paper another method to obtain tunable filters is introduced. Like in the previous work , the quadrature conditions of the filter and errors like the phase shift detuning error and bias modulation are represented as geometrical conditions to be satisfied by the filter. Thus, from these conditions and the desired errors to minimize, a set of two-frame filters for each condition is obtained. Hence, trough the convolution of this set of individual filters we recover the desired filter as an algebraic problem. Finally, the method is applied to obtain novel results for tunable four and five-frame algorithms.

The estimated phase of a quadrature filter order M is given by ,

It should be noticed that is the column vector of frames, and N and D are the desired numerator and denominator row vectors; then, for a symmetrical filter the corresponding temporal impulse response $h(t)$ is given by 

where , $p=(2k−M−1)α/2$ and $δ→$ is a column vector where each element is . That is from the scalar vectors N and D the Eqs. (1) and (2) are recovered easily. In the previous work it was proved that the Fourier transform of h(t) is the real function $H(ω)$ [7,8]. For an α step, any quadrature filter satisfies the two conditions $H(0)=0$;$H(α)=0$. That is, the filter cuts off both ω = 0 and ω = α frequencies. Therefore, the condition for a filter tuned onto the right side and insensitive to the mth order phase shift detuning error is 

$H′(α)=0; H″(α)=0; H″(α)=0;... Hm(α)=0.$

In other words, m gives the order of insensitivity to the phase shift error, and $Hm(ω)$ is the mth derivate of $H(ω)$ with regard to ω. In the same way, the condition to be satisfied by a filter which is insensitive to the mth order bias variation error $H(ω)$ is ,

$H′(0)=0; H″(0)=0; H″(0)=0 ... Hm(0)=0.$

## 2. Convolution algorithm

Assuming that the Fourier transform of a filter can be factorized in two functions such as , where $H1(ω)$ and $H2(ω)$ are the Fourier transforms of and which are an n and m order filters respectively, the individual estimated phases $φ1$ and $φ2$ are given by

Hence, the desired filter $h(t)$ is obtained from the expression $h(t)=h1(t)∗h2(t)$, where ∗ denotes the temporal discrete convolution, and $h(t)$ becomes,

and this expression corresponds with the estimated phase ϕ and given bythat is, the convolution algorithm can simply be represented as

$ND=(N1D1)∗(N2D2)=[N1∗D2+D1∗N2][D1∗D2−N1∗N2].$

In other words, as mentioned before, a new (n + m-1) frame filter from two individual filters is obtained. Likewise, the design of a tunable quadrature filter is seen as an algebraic problem without the use of Fourier formalisms. The convolution properties allow this case to be extended for three or more filters.

## 3. Design of tunable filters

The design of a quadrature filter order M implies that only M-1 parameters are free, two of which are the quadrature conditions and the other M-3 are used to compensate some errors.

#### 3.1 The tunable two-frame algorithm

The general form of a symmetric two-frame algorithm is ,

As in the previous work , the Fourier transform of Eq. (9) for a given α step is,

$H(ω,α)=2[a1cos(ω/2)−b1sin(ω/2)].$

Tuning this filter to cut off the frequency $ω=α$, the condition $H(ω=α,α)=0$ is satisfied. Hence, the solution of Eq. (10) is given by the ratio $b1/a1=cos(α/2)/sin(α/2)$. And from Eq. (9) the corresponding tunable two-frame filter and the ratio N/D are respectively,

Furthermore, this two-frame filter has the following Fourier transform

$H(ω,α)=−2sin[(ω−α)/2].$

Therefore, from Eq. (3) the Fourier transform and the corresponding algorithm for a filter insensitive to the 0, 1, 2 … and m orders phase shift detuning error are respectively

$Hm+1(ω,α)=(−2)m+1sinm+1[(ω−α)/2].$
$ND={cos(α/2)sin(α/2)[1−1]}m+1.$
where m + 1 denotes the times that the convolution is applied. From Eq. (13), for α = 0, the other quadrature condition $H(ω=0,α)=0$ is recovered and its Fourier transform becomes
$H(ω,α)=H(ω,0)=−2sin(ω/2).$
and from Eq. (11) the corresponding two-frame algorithm that cuts off the frequency $ω=0$ is

$tan(φ)=[1−1]I→I→=[I1−I20I1+0I2].$

Then, from Eqs. (4) and (16) the filter insensitive to the m order bias modulation error is,

$Hm+1(ω,0)=(−2)m+1sinm+1(ω/2).$
and from Eq. (15) for α = 0, the corresponding algorithm is

$ND={[1−1]}m+1.$

In the same way, other possible conditions working over the frequency $ω=π$ are,

$H(π)=0 H′(π)=0; H″(π)=0; H‴(π)=0 ... Hm(π)=0.$
where the Fourier transform for the filter insensitive to the 0, 1, 2 and m order of the derivative function at frequency ω = π is
$H(ω,π)=(−2)m+1cosm+1(ω/2).$
and from Eqs. (12) and (20) the respective algorithm becomes

$ND={}m+1.$

#### 3.2 The tunable three-frame algorithm

The Fourier transform that meets the two quadrature conditions H(0) = 0 and H(α) = 0 is

This function is the product of the two filters that cuts off individually both frequencies ω = 0 and ω = α. Then, in terms of the corresponding two-frame filters, and through the convolution algorithm Eq. (8), the desired N/D becomes

and from Eq. (7) the estimated phase is expressed as ,

$tan(φ)=N I→D I→=sin(α/2)[10−1]I→−cos(α/2)[1−21]I→=tan(α/2)I1−I3−I1+2I2−I3.$

#### 3.3 The tunable four-frame algorithm

Like Eq. (1), the general form for the estimated phase of a four-frame algorithm is

From Eq. (13), the Fourier transform that cuts off the frequencies $ω=0$, $ω=α$ and $ω=β$ is

That is, two conditions correspond to the necessary quadrature conditions, and $H(ω,β)=0$ is the particular condition that cuts off the frequency β. Then, by applying the corresponding two-frame filters, the result is

From Eq. (8) the last two terms become,

therefore, by applying Eqs. (7) and (8) the estimated phase is expressed as

This is the general four-frame filter that cuts off both frequencies, the α step and an arbitrary frequency β. Thus, by using the geometrical condition $β=π$, a new four-frame algorithm is obtained. Therefore, as reported in  we named it “tunable four-frame algorithm in X”,

and for $α=π/2$, the well known four-frame algorithm in X is recovered . On the other hand, Eq. (30) for $β=α$ gives a filter that cuts off twice the same frequency α, then the derivative at frequency α is zero. That is to say, that the filter becomes insensitive to the linear phase shift detuning error, and gives the reported four-frame algorithm class B . Finally, Eq. (30) for $β=0$ recovers the reported four-frame algorithm class C , which is a four-frame algorithm insensitive to the linear bias modulation error.

#### 3.4 The tunable five-frame algorithm

For the α step and the two arbitrary frequencies β and γ, the Fourier transform of the filter is,

$H(ω)=16sin(ω/2)sin[(ω−α)/2]sin[(ω−β)/2]sin[(ω−γ)/2].$

From Eqs. (7) and (8) the desired phase is obtained through the following expression

In Table 1 , particular cases of several five-frame algorithms are shown. Case 1 meets the conditions $H(0)=H′(0)=H″(0)=H(α)=0$, therefore from Eq. (32) $H(ω)$ becomes, Table 1. Several particular five-frame temporal phase shifting algorithms

$H(ω)=16sin3(ω/2)sin[(ω−α)/2].$

In case 2, $H(0)=H(α)=H′(0)=H(π)=0$ and $H(ω)$ becomes,

$H(ω)=16sin2(ω/2)cos(ω/2)sin[(ω−α)/2].$

In case 3, $H(0)=H(α)=H′(α)=H(π)=0$ and $H(ω)$ gives

$H(ω)=16sin(ω/2)cos(ω/2)sin2[(ω−α)/2].$

In case 4, $H(0)=H(α)=H(π)=H′(π)=0$ and $H(ω)$ results

$H(ω)=16sin(ω/2)cos2(ω/2)sin[(ω−α)/2].$

In case 5, the filter meets the conditions $H(0)=H(α)=H′(0)=H′(α)=0$ and gives

$H(ω)=16sin2(ω/2)sin2[(ω−α)/2].$

This is a tunable five-frame algorithm which is simultaneously insensitive to linear bias modulation and linear phase shift detuning errors. It comprises the results reported in . To conclude, in case 6 the tunable filter insensitive to second order phase shift detuning error is,

$H(ω)=16sin(ω/2)sin3[(ω−α)/2].$

Finally, from [7,8], the detuning error of the function $sin[(ω−α)/2]$ gives $Δφ=−tan(Δ/2)$ for the angle Δ. Therefore, for $sinq[(ω−α)/2]$ the detuning error is $Δφ=(−1)qtanq(Δ/2)$. Thus, cases 3 and 5 have q = 2, while case 6 has q = 3, and the others cases have the value q = 1.

## 4. Conclusions

A new method to design quadrature filters is presented. The design problem is reduced to an algebraic problem that through the convolution of a set of two-frame filters gives the desired phase without the use of Fourier’s formalisms. Each individual condition of the filter corresponds with a specific two-frame filter. Therefore, several new tunable four and five-frame symmetrical algorithms are reported. This method is easily evaluated numerically.

## Acknowledgments

This work was partially supported by CONACyT México through scholarship granted #175434. The authors also acknowledge the help granted by MDD. J. J. Lozano in the revision of this paper.

1. J. Schmit and K. Creath, “Extended averaging technique for derivation of error-compensating algorithms in phase-shifting interferometry,” Appl. Opt. 34(19), 3610–3619 (1995). [CrossRef]   [PubMed]

2. Y. Surrel, “Design of algorithms for phase measurements by the use of phase stepping,” Appl. Opt. 35(1), 51–60 (1996). [CrossRef]   [PubMed]

3. D. W. Phillion, “General methods for generating phase-shifting interferometry algorithms,” Appl. Opt. 36(31), 8098–8115 (1997). [CrossRef]

4. Y. Surrel, “Design of phase-detection algorithms insensitive to bias modulation,” Appl. Opt. 36(4), 805–807 (1997). [CrossRef]   [PubMed]

5. H. Schreiber, J. H. Brunning, and J. E. Greivenkamp, “Phase shifting interferometry,” in Optical Shop Testing, D. Malacara ed., (John Wiley & Sons, 2007).

6. M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001). [CrossRef]

7. J. F. Mosiño, M. Servin, J. C. Estrada, and J. A. Quiroga, “Phasorial analysis of detuning error in temporal phase shifting algorithms,” Opt. Express 17(7), 5618–5623 (2009). [CrossRef]   [PubMed]

8. J. F. Mosiño, D. M. Doblado, and D. M. Hernández, “Calculus of exact detuning phase shift error in temporal phase shifting algorithms,” Opt. Express 17(18), 15766–15771 (2009). [CrossRef]   [PubMed]

9. J. F. Mosiño, D. M. Doblado, and D. M. Hernández, “A method to design tunable quadrature filters in phase shifting interferometry,” Opt. Express 17(18), 15772–15777 (2009). [CrossRef]   [PubMed]

### References

• View by:
• |
• |
• |

1. J. Schmit and K. Creath, “Extended averaging technique for derivation of error-compensating algorithms in phase-shifting interferometry,” Appl. Opt. 34(19), 3610–3619 (1995).
[Crossref] [PubMed]
2. Y. Surrel, “Design of algorithms for phase measurements by the use of phase stepping,” Appl. Opt. 35(1), 51–60 (1996).
[Crossref] [PubMed]
3. D. W. Phillion, “General methods for generating phase-shifting interferometry algorithms,” Appl. Opt. 36(31), 8098–8115 (1997).
[Crossref]
4. Y. Surrel, “Design of phase-detection algorithms insensitive to bias modulation,” Appl. Opt. 36(4), 805–807 (1997).
[Crossref] [PubMed]
5. H. Schreiber, J. H. Brunning, and J. E. Greivenkamp, “Phase shifting interferometry,” in Optical Shop Testing, D. Malacara ed., (John Wiley & Sons, 2007).
6. M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]
7. J. F. Mosiño, M. Servin, J. C. Estrada, and J. A. Quiroga, “Phasorial analysis of detuning error in temporal phase shifting algorithms,” Opt. Express 17(7), 5618–5623 (2009).
[Crossref] [PubMed]
8. J. F. Mosiño, D. M. Doblado, and D. M. Hernández, “Calculus of exact detuning phase shift error in temporal phase shifting algorithms,” Opt. Express 17(18), 15766–15771 (2009).
[Crossref] [PubMed]
9. J. F. Mosiño, D. M. Doblado, and D. M. Hernández, “A method to design tunable quadrature filters in phase shifting interferometry,” Opt. Express 17(18), 15772–15777 (2009).
[Crossref] [PubMed]

#### 2001 (1)

M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]

#### Afifi, M.

M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]

#### Nassim, K.

M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]

#### Rachafi, S.

M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]

#### Opt. Commun. (1)

M. Afifi, K. Nassim, and S. Rachafi, “Five-frame phase-shifting algorithm insensitive to diode laser power variation,” Opt. Commun. 197(1-3), 37–42 (2001).
[Crossref]

#### Other (1)

H. Schreiber, J. H. Brunning, and J. E. Greivenkamp, “Phase shifting interferometry,” in Optical Shop Testing, D. Malacara ed., (John Wiley & Sons, 2007).

### Cited By

OSA participates in Crossref's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.

### Tables (1) Table 1 Several particular five-frame temporal phase shifting algorithms

### Equations (39)

Equations on this page are rendered with MathJax. Learn more.

$H ′ ( α ) = 0 ; H ″ ( α ) = 0 ; H ″ ( α ) = 0 ; ... H m ( α ) = 0.$
$H ′ ( 0 ) = 0 ; H ″ ( 0 ) = 0 ; H ″ ( 0 ) = 0 ... H m ( 0 ) = 0.$
$N D = ( N 1 D 1 ) ∗ ( N 2 D 2 ) = [ N 1 ∗ D 2 + D 1 ∗ N 2 ] [ D 1 ∗ D 2 − N 1 ∗ N 2 ] .$
$H ( ω , α ) = 2 [ a 1 cos ( ω / 2 ) − b 1 sin ( ω / 2 ) ] .$
$H ( ω , α ) = − 2 sin [ ( ω − α ) / 2 ] .$
$H m + 1 ( ω , α ) = ( − 2 ) m + 1 sin m + 1 [ ( ω − α ) / 2 ] .$
$N D = { cos ( α / 2 ) sin ( α / 2 ) [ 1 − 1 ] [ 1 1 ] } m + 1 .$
$H ( ω , α ) = H ( ω , 0 ) = − 2 sin ( ω / 2 ) .$
$tan ( φ ) = [ 1 − 1 ] I → [ 0 0 ] I → = [ I 1 − I 2 0 I 1 + 0 I 2 ] .$
$H m + 1 ( ω , 0 ) = ( − 2 ) m + 1 sin m + 1 ( ω / 2 ) .$
$N D = { [ 1 − 1 ] [ 0 0 ] } m + 1 .$
$H ( π ) = 0 H ′ ( π ) = 0 ; H ″ ( π ) = 0 ; H ‴ ( π ) = 0 ... H m ( π ) = 0.$
$H ( ω , π ) = ( − 2 ) m + 1 cos m + 1 ( ω / 2 ) .$
$N D = { [ 0 0 ] [ 1 1 ] } m + 1 .$
$tan ( φ ) = N I → D I → = sin ( α / 2 ) [ 1 0 − 1 ] I → − cos ( α / 2 ) [ 1 − 2 1 ] I → = tan ( α / 2 ) I 1 − I 3 − I 1 + 2 I 2 − I 3 .$
$H ( ω ) = 16 sin ( ω / 2 ) sin [ ( ω − α ) / 2 ] sin [ ( ω − β ) / 2 ] sin [ ( ω − γ ) / 2 ] .$
$H ( ω ) = 16 sin 3 ( ω / 2 ) sin [ ( ω − α ) / 2 ] .$
$H ( ω ) = 16 sin 2 ( ω / 2 ) cos ( ω / 2 ) sin [ ( ω − α ) / 2 ] .$
$H ( ω ) = 16 sin ( ω / 2 ) cos ( ω / 2 ) sin 2 [ ( ω − α ) / 2 ] .$
$H ( ω ) = 16 sin ( ω / 2 ) cos 2 ( ω / 2 ) sin [ ( ω − α ) / 2 ] .$
$H ( ω ) = 16 sin 2 ( ω / 2 ) sin 2 [ ( ω − α ) / 2 ] .$
$H ( ω ) = 16 sin ( ω / 2 ) sin 3 [ ( ω − α ) / 2 ] .$