Sponsored Content
Full Discussion: Slow FFT in ksh93 and awk.
Operating Systems OS X (Apple) Slow FFT in ksh93 and awk. Post 303023145 by wisecracker on Wednesday 12th of September 2018 12:11:57 PM
Old 09-12-2018
Hi all...

Well guys, it took a while because of the serious limitations of ARexx for a stock AMIGA A1200 but here is a working FFT for it. ARexx has no ARRAY facility but there is a workaround. ;o)
Boy oh boy, ARexx's arithmetic is so convoluted and floating point precision is not the best.
This was a challenge. I could have generated SIN, COS and SQRT in pure ARexx but decided to use an external ARexx math(s) library instead...
It would be just as easy to create SIN, COS and SQRT in ksh too eliminating awk entirely but awk just made it easier...
Just for the record the AMIGA shell/terminal has a large subset of xterm's escape codes.
An exercise in futility? Maybe but serious fun nevertheless...
This is through FS-UAE AMIGA emulation and my real A1200 setup for easy transfer from this Macbook Pro.
ARexx code:
Code:
/* Simple_FFT_DEMO.rexx */

/* This ARexx version needs this dependency: */
/* http://aminet.net/package/util/rexx/RexxMathLib */
CALL ADDLIB('rexxmathlib.library',0,-30,0)

NUMERIC DIGITS 14

SAY ""
SAY "An experimental method to do an FFT in ARexx using the standard test values."
SAY "It requires rexxmathlib.library for the SIN and COS."
SAY "$VER Simple_FFT_DEMO.rexx_(C)06-09-2018_B.Walker_issued_under_GPL2."
SAY ""

/* Create standard test _ARRAYS_ REAL and IMAGINARY. */
/* These MUST be powers of 2 and greater than 2 in size. */
/* Real values, '1.0 1.0 1.0 1.0 0.0 0.0 0.0 0.0' */
/* Imag values, '0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0' */
/* Not really ARRAYS but good enough for this DEMO! */
DO N=0 TO 3 BY 1
	REAL_ARRAY.N=1.0
END
DO N=4 TO 7 BY 1
	REAL_ARRAY.N=0.0
END
DO N=0 TO 7 BY 1
	IMAG_ARRAY.N=0.0
END

/* Display them. */
SAY "Input, REAL: IMAG:"
DO N=0 TO 7 BY 1
	SAY "        "||REAL_ARRAY.N||"   "||IMAG_ARRAY.N
END

/* Only constant required, 14 decimal places. */
PI=3.14159265358979 
/* N should be 8 by default in this DEMO. */
/* SAY "Number of elements = "||N||"..." */
N=N-1

CALL FFT

SAY ""
DO N=0 TO 7 BY 1
	SAY "REAL: "||+OUT_REAL.N||",    IMAG: "||+OUT_IMAG.N
END

SAY ""
SAY "Final FFT values to 5 decimal places:"
STR=""
DO N=0 TO 7 BY 1
	CALL ABS_COMPLEX
	NUMERIC DIGITS 14
	IF +ABS <= 0.000000000001
	THEN
		ABS=0
	ENDIF
	NUMERIC DIGITS 6
	STR=STR||+ABS||" "
END
SAY STR
SAY ""
EXIT

/* Create the subroutines required. */
/* FFT subroutine. */
FFT:
DO K=0 TO N BY 1
	SUMREAL=0.0
	SUMIMAG=0.0
	DO T=0 TO N BY 1
		ANGLE=(2.0*PI*T*K)/(N+1)
		SUMREAL=SUMREAL+(REAL_ARRAY.T*COS(ANGLE))+(IMAG_ARRAY.T*SIN(ANGLE))
		SUMIMAG=SUMIMAG-(REAL_ARRAY.T*SIN(ANGLE))+(IMAG_ARRAY.T*COS(ANGLE))
	END
	OUT_REAL.K=SUMREAL
	OUT_IMAG.K=SUMIMAG
END
RETURN
/* FFT subroutine end. */

/* Absolute value of complex number subroutine. */
ABS_COMPLEX:
	ABS=SQRT( (OUT_REAL.N**2)+(OUT_IMAG.N**2) )
RETURN
/* Absolute value of complex number subroutine end. */

 

10 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

echo is too slow. HELP with Awk

Hello All, Below is a simple script i worte to find the 208th char in a file. If the char = "C" then I re-direct the line to a file called change.txt. If it is not "C" then I re-direct it to a file called delete.txt. My problem is I have a file 0f 500K lines. this script is very slow. I am... (4 Replies)
Discussion started by: eja
4 Replies

2. Shell Programming and Scripting

ksh93 deprecation...

Any means of running ksh93 in a ksh88-mode? Might sound odd, but I want/need to restrict U/Win-developed scripts to correspond to the ksh88 version on my Solaris environment(s). Thanks. (2 Replies)
Discussion started by: curleb
2 Replies

3. Shell Programming and Scripting

ksh88 or ksh93

Hi all! Does anybody know how can I check if any UNIX installation has implemented ksh88 or ksh93? Thanks in advance. Néstor. (3 Replies)
Discussion started by: Nestor
3 Replies

4. Shell Programming and Scripting

The builtin split function in AWK is too slow

I have a text file that contains 4 million lines, each line contains 2 fields(colon as field separator). as shown: 123:444,555,666,777,888,345 233:5444,555,666,777,888,345 623:454,585,664,773,888,345 ...... Here I have to split the second field(can be up to 40,000 fields) by comma into an... (14 Replies)
Discussion started by: kevintse
14 Replies

5. Shell Programming and Scripting

cut, sed, awk too slow to retrieve line - other options?

Hi, I have a script that, basically, has two input files of this type: file1 key1=value1_1_1 key2=value1_2_1 key4=value1_4_1 ... file2 key2=value2_2_1 key2=value2_2_2 key3=value2_3_1 key4=value2_4_1 ... My files are 10k lines big each (approx). The keys are strings that don't... (7 Replies)
Discussion started by: fzd
7 Replies

6. Shell Programming and Scripting

Making a faster alternative to a slow awk command

Hi, I have a large number of input files with two columns of numbers. For example: 83 1453 99 3255 99 8482 99 7372 83 175 I only wish to retain lines where the numbers fullfil two requirements. E.g: =83 1000<=<=2000 To do this I use the following... (10 Replies)
Discussion started by: s052866
10 Replies

7. UNIX for Advanced & Expert Users

Ksh93 on Linux compatible with ksh93 on AIX

Hi Experts, I have several shell scripts that have been developed on a Linux box for korn ksh93. If we want to run this software on an AIX 6.1 box that runs ksh88 by default can we just change the she-bang line to reference /bin/ksh93 which ships with AIX as its "enhanced shell" to ensure... (6 Replies)
Discussion started by: Keith Turley
6 Replies

8. OS X (Apple)

FFT for the AMIGA through ksh88 shell.

I don't know if anyone is interested but I have been meddling with FFT for the AMIGA. (Sadly we AMIGAns don't have these luxuries through any scripting language. Below is a Python snippet that uses the builtin 'cmath' module to work with the lowly Python 2.0.1 for the AMIGA. It is part of a... (0 Replies)
Discussion started by: wisecracker
0 Replies

9. AIX

Ksh93/AIX compatibility

Hi everyone ! Im trying to know from wich version of AIX KSH93 is available ? Internet tell me 6.x and 7.x AIX are available, bue what about 5.x ? Is KSH93 available on AIX 5.x ? Is it the same way to manipulate variables as KSH93 on 7.x ? Thanks for your support and have a nice day ! (2 Replies)
Discussion started by: majinfrede
2 Replies

10. OS X (Apple)

FFT for Python 2.0.x to 3.7.0.

Hi guys... This is code that was originally designed to work on an upgraded AMIGA A1200 using Python 2.0.x. Unfortunately it broke inside much later versions, NOT because of the print statement/function but other minor subtleties. So this is the final result tested on various machines including... (0 Replies)
Discussion started by: wisecracker
0 Replies
FFT(3)							User Contributed Perl Documentation						    FFT(3)

NAME
PDL::FFT - FFTs for PDL DESCRIPTION
FFTs for PDL. These work for arrays of any dimension, although ones with small prime factors are likely to be the quickest. Each routine works `inplace'. SYNOPSIS
use PDL::FFT qw/:Func/; fft($real,$imag); ifft($real,$imag); realfft($real); realifft($real); fftnd($real,$imag); ifftnd($real,$imag); $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); ALTERNATIVE FFT PACKAGES
Various other modules - such as PDL::FFTW and PDL::Slatec - contain FFT routines. However, unlike PDL::FFT, these modules are optional, and so may not be installed. FUNCTIONS
fft Signature: ([o,nc]real(n); [o,nc]imag(n)) Complex FFT of the "real" and "imag" arrays [inplace] ifft Signature: ([o,nc]real(n); [o,nc]imag(n)) Complex Inverse FFT of the "real" and "imag" arrays [inplace] realfft() One-dimensional FFT of real function [inplace]. The real part of the transform ends up in the first half of the array and the imaginary part of the transform ends up in the second half of the array. realfft($real); realifft() Inverse of one-dimensional realfft routine [inplace]. realifft($real); fftnd() N-dimensional FFT (inplace) fftnd($real,$imag); ifftnd() N-dimensional inverse FFT ifftnd($real,$imag); fftconvolve() N-dimensional convolution $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); fftconvolve works inplace, and returns an error array in kernel as an accuracy check -- all the values in it should be negligible. The sizes of the image and the kernel must be the same. kernctr centres a small kernel to emulate the behaviour of the direct convolution routines. The speed cross-over between using straight convolution (PDL::Image2D::conv2d()) and these fft routines is for kernel sizes roughly 7x7. kernctr() `centre' a kernel (auxiliary routine to fftconvolve) $kernel = kernctr($image,$smallk); fftconvolve($image,$kernel); kernctr centres a small kernel to emulate the behaviour of the direct convolution routines. convmath Signature: ([o,nc]a(m); [o,nc]b(m)) Internal routine doing maths for convolution cmul Signature: (ar(); ai(); br(); bi(); [o]cr(); [o]ci()) Complex multiplication cdiv Signature: (ar(); ai(); br(); bi(); [o]cr(); [o]ci()) Complex division BUGS
Where the source is marked `FIX', could re-implement using phase-shift factors on the transforms and some real-space bookkeeping, to save some temporary space and redundant transforms. AUTHOR
This file copyright (C) 1997, 1998 R.J.R. Williams (rjrw@ast.leeds.ac.uk), Karl Glazebrook (kgb@aaoepp.aao.gov.au), Tuomas J. Lukka, (lukka@husc.harvard.edu). All rights reserved. There is no warranty. You are allowed to redistribute this software / documentation under certain conditions. For details, see the file COPYING in the PDL distribution. If this file is separated from the PDL distribution, the copyright notice should be included in the file. perl v5.8.0 2003-01-29 FFT(3)
All times are GMT -4. The time now is 07:05 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy