# # GENERATED WITH PDL::PP from fftw3.pd! Don't modify! # package PDL::FFTW3; our @EXPORT_OK = qw( fft1 ifft1 rfft1 rNfft1 irfft1 fft2 ifft2 rfft2 rNfft2 irfft2 fft3 ifft3 rfft3 rNfft3 irfft3 fft4 ifft4 rfft4 rNfft4 irfft4 fft5 ifft5 rfft5 rNfft5 irfft5 fft6 ifft6 rfft6 rNfft6 irfft6 fft7 ifft7 rfft7 rNfft7 irfft7 fft8 ifft8 rfft8 rNfft8 irfft8 fft9 ifft9 rfft9 rNfft9 irfft9 fft10 ifft10 rfft10 rNfft10 irfft10 fftn ifftn rfftn irfftn ); our %EXPORT_TAGS = (Func=>\@EXPORT_OK); use PDL::Core; use PDL::Exporter; use DynaLoader; our $VERSION = '0.203'; our @ISA = ( 'PDL::Exporter','DynaLoader' ); push @PDL::Core::PP, __PACKAGE__; bootstrap PDL::FFTW3 $VERSION; #line 25 "fftw3.pd" #line 0 "README.pod" =head1 NAME PDL::FFTW3 - PDL interface to the Fastest Fourier Transform in the West v3 =head1 SYNOPSIS use PDL; use PDL::FFTW3; use PDL::Graphics::Gnuplot; # Basic functionality my $x = sin( sequence(100) * 2.0 ) + 2.0 * cos( sequence(100) / 3.0 ); my $F = rfft1( $x ); gplot( with => 'lines', $F->abs ); =====> 8000 ++------------+-------------+------------+-------------+------------++ + + + + + + | | | * | 7000 ++ * ++ | * | | * | | * | | * | 6000 ++ * ++ | * | | * | | * | 5000 ++ * ++ | * | | * | | ** | 4000 ++ ** ++ | ** | | * * | | * * | | * * | 3000 ++ * * ++ | * * | | * * | | * * * | 2000 ++ * * * ++ | * * * | | * * ** | | * * ** | | * * ** | 1000 ++ * * * * ++ | * * * * | | ** * * * | + * * + + + * * + + 0 ****-------*********************************--************************ 0 10 20 30 40 50 # Correlation of two real signals # two signals offset by 30 units my $x = sequence(100); my $y1 = exp( 0.2*($x - 20.5) ** (-2.0) ); my $y2 = exp( 0.2*($x - 50.5) ** (-2.0) ); # compute the correlation my $F12 = rfft1( cat($y1,$y2) ); my $corr = irfft1( $F12(:,(1)) * $F12(:,(0))->conj ); # and find the peak say maximum_ind($corr); =====> 30 =head1 DESCRIPTION This is a PDL binding to version 3 of the FFTW library. Supported are complex <-> complex and real <-> complex FFTs. =head2 NB to install wget http://www.fftw.org/fftw-3.3.4.tar.gz tar xvf fftw-3.3.4.tar.gz cd fftw-3.3.4/ ./configure --prefix=/usr --enable-threads --enable-float --enable-shared --with-pic make all install install-pkgconfigDATA make clean ./configure --prefix=/usr --enable-threads --enable-shared --with-pic make all install install-pkgconfigDATA This will give you both fftw3f (first chunk) and fftw3 (second). =head2 Supported operations This module computes the Discrete Fourier Transform. In its most basic form, this transform converts a vector of complex numbers in the time domain into another vector of complex numbers in the frequency domain. These complex <-> complex transforms are supported with C functions for a rank-C transform. The opposite effect (transform data in the frequency domain back to the time domain) can be achieved with the C functions. A common use case is to transform purely-real data. This data has 0 for its complex component, and FFTW can take advantage of this to compute the FFT faster and using less memory. Since a Fourier Transform of a real signal has an even real part and an odd imaginary part, only 1/2 of the spectrum is needed. These forward real -> complex transforms are supported with the C functions. The backward version of this transform is complex -> real and is supported with the C functions. =head2 Basic usage details Arbitrary C-dimensional transforms are supported. All functions exported by this module have the C in their name, so for instance a complex <-> complex 3D forward transform is computed with the C function. The rank I be specified in this way; there is no function called simply C. In-place operation is supported for complex <-> complex functions, but not the real ones (real function don't have mathing dimensionality of the input and output). An in-place transform of C<$x> can be computed with fft1( $x->inplace ); All the functions in this module support PDL threading. For instance, if we have 4 different image ndarrays C<$a>, C<$b>, C<$c>, C<$d> and we want to compute their 2D FFTs at the same time, we can say my $ABCD_transformed = rfft2( PDL::cat( $a, $b, $c, $d) ); This takes advantage of PDL's automatic parallelization, if appropriate (See L). =head2 Data formats FFTW supports single and double-precision floating point numbers directly. If possible, the PDL input will be used as-is. If not, a type conversion will be made to use the lowest-common type. So as an example, the following will perform a single-precision floating point transform (and return data of that type). fft1( $x->byte ) As of 0.20, this module expects complex numbers to be stored as "native complex" types (C, C). Complex outputs will also be native complex. Generally, the sizes of the input and the output must match. This is completely true for the complex <-> complex transforms: the output will have the same size and the input, and an error will result if this isn't possible for some reason. This is a little bit more involved for the real <-> complex transforms. If I'm transforming a real 3D vector of dimensions C, I will get a complex output of dimensions C. The C is there because the input was real. The first dimension is always the one that gets the C. This is described in detail in section 2.4 of the FFTW manual. Note that given a real input, the dimensionality of the complex transformed output is unambiguous. However, this is I true for the backward transform. For instance, a 1D inverse transform of a vector of 10 complex numbers can produce real output of either 18 or 19 elements (because C and C). I. Thus Cdim(0) == 18> is true. If we want the odd-sized output, we have to explicitly pass this into the function like this: irfft1( sequence(cdouble,10), zeros(19) ) Here I create a new output ndarray with the C function; C then fills in this ndarray with the result of the computation. This module validates all of its input, so only 18 and 19 are valid here. An error will be thrown if you try to pass in C. This all means that the following will produce surprising results if C<$x-Edim(0)> isn't even irfft1( rfft1( $x ) ) =head2 FFT normalization Following the widest-used convention for discrete Fourier transforms, this module normalizes the inverse transform (but not the forward transform) by dividing by the number of elements in the data set, so that ifft1( fft1( $x ) ) is a slow approximate no-op, if C<$x> is well-behaved. This is different from the behavior of the underlying FFTW3 library itself, but more consistent with other FFT packages for popular analysis languages including PDL. =head1 FUNCTIONS =head2 fftX (fft1, fft2, fft3, ..., fftn) The basic complex <-> complex FFT. You can pass in the rank as a parameter with the C form, or append the rank to the function name for ranks up to 9. These functions all take one input ndarray and one output ndarray. The dimensions of the input and the output are identical. The output parameter is optional and, if present, must be the last argument. If the output ndarray is passed in, the user I make sure the dimensions match. As of 0.20, inputs must be "native complex" data. Any type other than C or C will be converted in the normal PP way. The fftn form takes a minimum of two arguments: the PDL to transform, and the number of dimensions to transform as a separate argument. The following are equivalent: $X = fftn( $x, 1 ); $X = fft1( $x ); fft1( $x, my $X = $x->zeros ); =head2 ifftX (ifft1, ifft2, ifft3, ..., ifftn) The basic, properly normalized, complex <-> complex backward FFT. Everything is exactly like in the C functions, except the inverse transform is computed and normalized, so that (for example) ifft1( fft1 ( $x ) ) is a good approximation of C<$x> itself. =head2 rfftX (rfft1, rfft2, rfft3, ..., rfftn) The real -> complex FFT. You can pass in the rank with the C form, or append the rank to the function name for ranks up to 9. These functions all take one input ndarray and one output ndarray. The dimensions of the input and the output are not identical, but are related as described in L. The output can be passed in as the last argument, if desired. If the output ndarray is passed in, the user I make sure the dimensions match. In the C form, the rank is the second argument. The following are equivalent: $X = rfftn( $x, 1 ); $X = rfft1( $x ); rfft1( $x, my $X = $x->zeroes ); As of 0.20, only returns native-complex data. Support for PDL::Complex has been removed. =head2 rNfftX (rNfft1, rNfft2, rNfft3, ..., rNfftn) As of 0.20, just an alias for rfftX, etc. =head2 irfftX (irfft1, irfft2, irfft3, ..., irfftn) The complex -> real inverse FFT. You can pass in the rank with the C form, or append the rank to the function name for ranks up to 9. Argument passing and interpretation is as described in C above. Please read L for details about dimension interpretation. There's an ambiguity about the output dimensionality, which is described in that section. =head1 AUTHOR Dima Kogan, C<< >>; contributions from Craig DeForest, C<< >>. =head1 LICENSE AND COPYRIGHT Copyright 2013 Dima Kogan and Craig DeForest. This program is free software; you can redistribute it and/or modify it under the same terms as PDL. =cut use strict; use warnings; #line 226 "fftw3.pd" use PDL::Types; use List::Util 'reduce'; use threads::shared; # When I compute an FFTW plan, it goes here. # This is :shared so that it can be used with Perl threads. my %existingPlans :shared; # these are for the unit tests our $_Nplans = 0; our $_last_do_double_precision; # This is a function that sits between the user's call into this module and the # PP-generated internals. Specifically, this function is called BEFORE any PDL # threading happens. Here I make sure the FFTW plan exists, or if it doesn't, I # make it. Thus the PP-based internals can safely assume that the plan exists sub __fft_internal { my $thisfunction = shift; my ($do_inverse_fft, $is_real_fft, $rank) = $thisfunction =~ /^(i?)(r?)N?.*fft([0-9]+)/; # first I parse the variables. This is a very direct translation of what PP # does normally. Plan-creation has to be outside of PP, so I must re-do this # here my $Nargs = scalar @_; my ($in, $out); if ( $Nargs == 2 ) { # all variables on stack, read in output and temp vars ($in, $out) = map {defined $_ ? PDL::Core::topdl($_) : $_} @_; } elsif ( $Nargs == 1 ) { $in = PDL::Core::topdl $_[0]; if ( $in->is_inplace ) { barf <set_inplace(0); } else { $out = PDL::null(); } } else { barf( <isnull ) { my ($type, @dims) = getOutArgs($in, $is_real_fft, $do_inverse_fft); $out->set_datatype($type->enum); $out->setdims(\@dims); $out->make_physical; } validateArguments( $rank, $is_real_fft, $do_inverse_fft, $thisfunction, $in, $out ); # I need to physical-ize the ndarrays before I make a plan. Again, normally PP # does this, but to make sure alignments match, I need to do this myself, now $in->make_physical; $out->make_physical; my $plan = getPlan( $thisfunction, $rank, $is_real_fft, $do_inverse_fft, $in, $out ); barf "$thisfunction couldn't make a plan. Giving up\n" unless defined $plan; my $is_native = !$in->type->real; # native complex # I now have the arguments and the plan. Go! my $internal_function = 'PDL::__'; $internal_function .= !$is_real_fft ? 'N' : ($is_native && $do_inverse_fft) ? 'irN' : $do_inverse_fft ? barf("irfft no longer supports PDL::Complex") : 'rN'; $internal_function .= "fft$rank"; eval { no strict 'refs'; $internal_function->( $in, $out, $plan ) }; barf $@ if $@; $out; } sub getOutArgs { my ($in, $is_real_fft, $do_inverse_fft) = @_; my @dims = $in->dims; my $is_native = !$in->type->real; my $out_type = $in->type; if ( !$is_real_fft ) { # complex fft. Output is the same size as the input. } elsif ( !$do_inverse_fft ) { # forward real fft $dims[0] = int($dims[0]/2)+1; $out_type = typeWithComplexity(getPrecision($out_type), 1); } else { # backward real fft # # there's an ambiguity here. I want int($out->dim(0)/2) + 1 == $in->dim(1), # however this could mean that # $out->dim(0) = 2*$in->dim(1) - 2 # or # $out->dim(0) = 2*$in->dim(1) - 1 # # WITHOUT ANY OTHER INFORMATION, I ASSUME EVEN INPUT SIZES, SO I ASSUME # $out->dim(0) = 2*$in->dim(1) - 2 if ($is_native) { $out_type = ($out_type == cfloat) ? float : double; } else { shift @dims; } $dims[0] = 2*($dims[0]-1); } ($out_type, @dims); } sub validateArguments { my ($rank, $is_real_fft, $do_inverse_fft, $thisfunction, $in, $out) = @_; for my $arg ( $in, $out ) { barf <isa('PDL'); $thisfunction arguments must be of type 'PDL'. Instead I got an arg of type '$type'. Giving up. EOF } # validate dimensionality of the ndarrays my @inout = ($in, $out); for my $iarg ( 0..1 ) { my $arg = $inout[$iarg]; if( $arg->isnull ) { barf "$thisfunction: don't know what to do with a null input. Giving up"; } if( !$is_real_fft ) { validateArgumentDimensions_complex( $rank, $thisfunction, $arg); } else { validateArgumentDimensions_real( $rank, $do_inverse_fft, $thisfunction, $iarg, $arg); } } # we have an explicit output ndarray we're filling in. Make sure the # input/output dimensions match up if ( !$is_real_fft ) { matchDimensions_complex($thisfunction, $rank, $in, $out); } else { matchDimensions_real($thisfunction, $rank, $do_inverse_fft, $in, $out); } } sub validateArgumentDimensions_complex { my ( $rank, $thisfunction, $arg ) = @_; barf "Tried to compute a complex FFT, but non-native-complex argument given" if $arg->type->real; my $dims_cmp = $arg->ndims; barf <type->real; # native complex # real FFT. Forward transform takes in real and spits out complex; # backward transform does the reverse if (!!$do_inverse_fft == !!($iarg == 0)) { # need complex for this my ($verb, $var, $reason) = ($iarg == 0) ? qw(takes input) : qw(produces output); if ( ($iarg == 1 && !$is_native) || ($iarg == 0 && !$is_native) ) { $reason = "\$$var should be native-complex"; } elsif (!$is_native && $arg->dim(0) != 2) { $reason = "\$$var->dim(0) == 2 should be true"; } barf <info]}: $arg). Giving up. EOF } my ($min_dimensionality, $var) = ($rank, $iarg == 0 ? 'input' : 'output'); if ( $arg->ndims < $min_dimensionality ) { barf <dim($idim) != $out->dim($idim) ) { barf <dim(1) should be int($input->dim(0)/2) + 1 (Section 2.4 of # the FFTW3 documentation) ($varname1, $varname2, $var1, $var2) = (qw(input output), $in, $out); } else { # Backward FFT. The input is complex, the output is real. ($varname1, $varname2, $var1, $var2) = (qw(output input), $out, $in); } barf <dim(0)/2) + 1 != $var2->dim(0); $thisfunction: mismatched first dimension: \$$varname2->dim(0) == int(\$$varname1->dim(0)/2) + 1 wasn't true. $varname1: @{[$var1->info]} $varname2: @{[$var2->info]} Giving up. EOF for my $idim (1..$rank-1) { if ( $var1->dim($idim) != $var2->dim($idim) ) { barf <isnull ) { if( $$in->type < float ) { forceType( $in, (float) ); } } else { # I'm given an output. Make sure this is of a type I can work with, # otherwise give up my $out_type = $$out->type; barf <type; my $in_precision = getPrecision($in_type); my $out_precision = getPrecision($out_type); return if $in_precision == $out_precision; forceType( $in, typeWithComplexity($out_precision, !$in_type->real) ); forceType( $out, typeWithComplexity($out_precision, !$out_type->real) ); } } sub typeWithComplexity { my ($precision, $complex) = @_; $complex ? ($precision == 1 ? cfloat : cdouble) : $precision == 1 ? float : double; } sub getPrecision { my ($type) = @_; ($type <= float || $type == cfloat) ? 1 : # float 2; # double } sub forceType { my ($x, $type) = @_; $$x = convert( $$x, $type ) unless $$x->type == $type; } sub getPlan { my ($thisfunction, $rank, $is_real_fft, $do_inverse_fft, $in, $out) = @_; # I get the plan ID, check if I already have a plan, and make a new plan if I # don't already have one my @dims = ((!$is_real_fft || !$do_inverse_fft) ? $in : $out)->dims; # FFT dimensionality my $Nslices = reduce {$a*$b} 1, splice(@dims, $rank); my $do_double_precision = ($in->get_datatype == $PDL_F || $in->get_datatype == $PDL_CF) ? 0 : 1; $_last_do_double_precision = $do_double_precision; my $do_inplace = is_same_data( $in, $out ); # I compute a single plan for the whole set of thread slices. I make a # worst-case plan, so I find the worst-aligned thread slice and plan off of # it. So if $Nslices>1 then the worst-case alignment is the worse of (1st, # 2nd) slices my $in_alignment = get_data_alignment_pdl( $in ); my $out_alignment = get_data_alignment_pdl( $out ); my $stride_bytes = ($do_double_precision ? 8 : 4) * reduce {$a*$b} @dims; if( $Nslices > 1 ) { my $in_alignment_2nd = get_data_alignment_int($in_alignment + $stride_bytes); my $out_alignment_2nd = get_data_alignment_int($out_alignment + $stride_bytes); $in_alignment = $in_alignment_2nd if $in_alignment_2nd < $in_alignment; $out_alignment = $out_alignment_2nd if $out_alignment_2nd < $out_alignment; } my $planID = join('_', $thisfunction, $do_double_precision, $do_inplace, $in_alignment, $out_alignment, @dims); if ( !exists $existingPlans{$planID} ) { lock(%existingPlans); $existingPlans{$planID} = compute_plan( \@dims, $do_double_precision, $is_real_fft, $do_inverse_fft, $in, $out, $in_alignment, $out_alignment ); $_Nplans++; } return $existingPlans{$planID}; } #line 580 "fftw3.pd" sub fft1 { __fft_internal( "fft1",@_ ); } *PDL::fft1 = \&fft1; sub ifft1 { my $a = __fft_internal( "ifft1", @_ ); $a /= $a->shape->slice('0:0')->prodover; $a; } *PDL::ifft1 = \&ifft1; sub rfft1 { __fft_internal( "rfft1", @_ ); } *PDL::rfft1 = \&rfft1; sub rNfft1 { __fft_internal( "rNfft1", @_ ); } *PDL::rNfft1 = \&rNfft1; sub irfft1 { my $a = __fft_internal( "irfft1", @_ ); $a /= $a->shape->slice('0:0')->prodover; $a; } *PDL::irfft1 = \&irfft1; #line 580 "fftw3.pd" sub fft2 { __fft_internal( "fft2",@_ ); } *PDL::fft2 = \&fft2; sub ifft2 { my $a = __fft_internal( "ifft2", @_ ); $a /= $a->shape->slice('0:1')->prodover; $a; } *PDL::ifft2 = \&ifft2; sub rfft2 { __fft_internal( "rfft2", @_ ); } *PDL::rfft2 = \&rfft2; sub rNfft2 { __fft_internal( "rNfft2", @_ ); } *PDL::rNfft2 = \&rNfft2; sub irfft2 { my $a = __fft_internal( "irfft2", @_ ); $a /= $a->shape->slice('0:1')->prodover; $a; } *PDL::irfft2 = \&irfft2; #line 580 "fftw3.pd" sub fft3 { __fft_internal( "fft3",@_ ); } *PDL::fft3 = \&fft3; sub ifft3 { my $a = __fft_internal( "ifft3", @_ ); $a /= $a->shape->slice('0:2')->prodover; $a; } *PDL::ifft3 = \&ifft3; sub rfft3 { __fft_internal( "rfft3", @_ ); } *PDL::rfft3 = \&rfft3; sub rNfft3 { __fft_internal( "rNfft3", @_ ); } *PDL::rNfft3 = \&rNfft3; sub irfft3 { my $a = __fft_internal( "irfft3", @_ ); $a /= $a->shape->slice('0:2')->prodover; $a; } *PDL::irfft3 = \&irfft3; #line 580 "fftw3.pd" sub fft4 { __fft_internal( "fft4",@_ ); } *PDL::fft4 = \&fft4; sub ifft4 { my $a = __fft_internal( "ifft4", @_ ); $a /= $a->shape->slice('0:3')->prodover; $a; } *PDL::ifft4 = \&ifft4; sub rfft4 { __fft_internal( "rfft4", @_ ); } *PDL::rfft4 = \&rfft4; sub rNfft4 { __fft_internal( "rNfft4", @_ ); } *PDL::rNfft4 = \&rNfft4; sub irfft4 { my $a = __fft_internal( "irfft4", @_ ); $a /= $a->shape->slice('0:3')->prodover; $a; } *PDL::irfft4 = \&irfft4; #line 580 "fftw3.pd" sub fft5 { __fft_internal( "fft5",@_ ); } *PDL::fft5 = \&fft5; sub ifft5 { my $a = __fft_internal( "ifft5", @_ ); $a /= $a->shape->slice('0:4')->prodover; $a; } *PDL::ifft5 = \&ifft5; sub rfft5 { __fft_internal( "rfft5", @_ ); } *PDL::rfft5 = \&rfft5; sub rNfft5 { __fft_internal( "rNfft5", @_ ); } *PDL::rNfft5 = \&rNfft5; sub irfft5 { my $a = __fft_internal( "irfft5", @_ ); $a /= $a->shape->slice('0:4')->prodover; $a; } *PDL::irfft5 = \&irfft5; #line 580 "fftw3.pd" sub fft6 { __fft_internal( "fft6",@_ ); } *PDL::fft6 = \&fft6; sub ifft6 { my $a = __fft_internal( "ifft6", @_ ); $a /= $a->shape->slice('0:5')->prodover; $a; } *PDL::ifft6 = \&ifft6; sub rfft6 { __fft_internal( "rfft6", @_ ); } *PDL::rfft6 = \&rfft6; sub rNfft6 { __fft_internal( "rNfft6", @_ ); } *PDL::rNfft6 = \&rNfft6; sub irfft6 { my $a = __fft_internal( "irfft6", @_ ); $a /= $a->shape->slice('0:5')->prodover; $a; } *PDL::irfft6 = \&irfft6; #line 580 "fftw3.pd" sub fft7 { __fft_internal( "fft7",@_ ); } *PDL::fft7 = \&fft7; sub ifft7 { my $a = __fft_internal( "ifft7", @_ ); $a /= $a->shape->slice('0:6')->prodover; $a; } *PDL::ifft7 = \&ifft7; sub rfft7 { __fft_internal( "rfft7", @_ ); } *PDL::rfft7 = \&rfft7; sub rNfft7 { __fft_internal( "rNfft7", @_ ); } *PDL::rNfft7 = \&rNfft7; sub irfft7 { my $a = __fft_internal( "irfft7", @_ ); $a /= $a->shape->slice('0:6')->prodover; $a; } *PDL::irfft7 = \&irfft7; #line 580 "fftw3.pd" sub fft8 { __fft_internal( "fft8",@_ ); } *PDL::fft8 = \&fft8; sub ifft8 { my $a = __fft_internal( "ifft8", @_ ); $a /= $a->shape->slice('0:7')->prodover; $a; } *PDL::ifft8 = \&ifft8; sub rfft8 { __fft_internal( "rfft8", @_ ); } *PDL::rfft8 = \&rfft8; sub rNfft8 { __fft_internal( "rNfft8", @_ ); } *PDL::rNfft8 = \&rNfft8; sub irfft8 { my $a = __fft_internal( "irfft8", @_ ); $a /= $a->shape->slice('0:7')->prodover; $a; } *PDL::irfft8 = \&irfft8; #line 580 "fftw3.pd" sub fft9 { __fft_internal( "fft9",@_ ); } *PDL::fft9 = \&fft9; sub ifft9 { my $a = __fft_internal( "ifft9", @_ ); $a /= $a->shape->slice('0:8')->prodover; $a; } *PDL::ifft9 = \&ifft9; sub rfft9 { __fft_internal( "rfft9", @_ ); } *PDL::rfft9 = \&rfft9; sub rNfft9 { __fft_internal( "rNfft9", @_ ); } *PDL::rNfft9 = \&rNfft9; sub irfft9 { my $a = __fft_internal( "irfft9", @_ ); $a /= $a->shape->slice('0:8')->prodover; $a; } *PDL::irfft9 = \&irfft9; #line 580 "fftw3.pd" sub fft10 { __fft_internal( "fft10",@_ ); } *PDL::fft10 = \&fft10; sub ifft10 { my $a = __fft_internal( "ifft10", @_ ); $a /= $a->shape->slice('0:9')->prodover; $a; } *PDL::ifft10 = \&ifft10; sub rfft10 { __fft_internal( "rfft10", @_ ); } *PDL::rfft10 = \&rfft10; sub rNfft10 { __fft_internal( "rNfft10", @_ ); } *PDL::rNfft10 = \&rNfft10; sub irfft10 { my $a = __fft_internal( "irfft10", @_ ); $a /= $a->shape->slice('0:9')->prodover; $a; } *PDL::irfft10 = \&irfft10; #line 608 "fftw3.pd" sub _rank_springboard { my ($name, $source, $rank, @rest) = @_; my $inverse = ($name =~ m/^i/); unless(defined $rank) { die "${name}n: second argument must be the rank of the transform you want"; } $rank = 0+$rank; # force numeric context unless($rank>=1 ) { die "${name}n: second argument (rank) must be between 1 and 10"; } my $active_lo = 0; my $active_hi = $rank-1; unless($source->ndims > $active_hi) { die "${name}n: rank is $rank but input has only ".($active_hi-$active_lo)." active dims!"; } my $out = __fft_internal( $name.$rank, $source, @rest ); if($inverse) { $out /= $out->shape->slice("$active_lo:$active_hi")->prodover; } return $out; } sub fftn { _rank_springboard( "fft", @_ ) } sub ifftn { _rank_springboard( "ifft", @_ ) } sub rfftn { _rank_springboard( "rfft", @_ ) } sub irfftn { _rank_springboard( "irfft", @_ ) } *PDL::fftn = \&fftn; *PDL::ifftn = \&ifftn; *PDL::rfftn = \&rfftn; *PDL::irfftn = \&irfftn; #line 890 "FFTW3.pm" # Exit with OK status 1;