--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/COPYING	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,162 @@
+
+This collection of functions for use with GNU Octave is hereby 
+granted to the public domain.
+
+THIS COLLECTION IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY
+EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+The individual functions are copyrighted by their respective authors
+and released under different licenses.  See the corresponding source
+files for the specific copyright and license.  A summary is provided
+below for your convenience, but it is not guaranteed to be complete
+or up to date.
+
+GPL (see file GPL for details)
+------------------------------
+Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+	nanstd, nanmean, nanmedian, nanmax, nanmin, nansum
+	mad, trimean, geomean, harmmean, zscore, prctile, perms, nchoosek
+	now, weekday, datevec, datestr, datenum
+	test, example, demo, assert, speed_test, lasterr
+	isequal, fzero, cplxpair, complex, gammaln, factor, factorial, primes
+	strtok, strmatch, strjust, magic, rref, repmat
+	zplane, zp2tf, xcov, xcorr, triang, tfe, tf2zp, specgram, sftrans
+	resample, rceps, pyulear, pwelch, pulstran, __power, pburg,
+	medfilt1, levinson, kaiserord, interp, impz, sgolay, sgolayfilt,
+	gaussian, fir2, fir1, filtfilt, decimate, czt, csd, cohere, chirp,
+	cheby2, cheby1, chebord, cheb1ord, buttord, butter, boxcar, bilinear
+	imnoise, polygcd, unmkpp, ppval, mkpp, interp1, lookup, hilbert
+	dct, idct, dct2, idct2, dctmtx, filter2, interpft, rectpuls, tripuls
+	soundsc, sound, clip, aurecord, auplot, au, aucapture, ausave, auload
+	unique, union, setxor, setdiff, ismember, intersect
+	aryule, arburg, poly2th, mktheta, idsim, idplot
+	text, surf, surfc, stem, pcolor, drawnow
+	full, issparse, spdiags, spy
+	pretty (modified from jwe), 
+	strvcat (modified from Kurt Hornik), 
+	mat2str (modified from jwe thru Ariel Tankus)
+	grpdelay (modified from jwe)
+	plot3, __plt3__ (modified from jwe)
+	meshc (modified from jwe)
+	rand, randn (modified from jwe and Dirk Eddelbuettel)
+Kai Habel <kai.habel@gmx.de>
+	bitand, bitor, bitcmp, bitmax, bitxor, bitset, bitget, bitshift
+	csape,csapi,spline,trisolve,fnplt
+	trapz,cumtrapz,del2,gradient,interp2,legendre
+	cool,copper,flag,hot,hsv,jet,pink,prism,rainbow,white
+	autumn,spring,summer,winter
+	brighten,hsv2rgb,mat2gray,rgb2gray,rgb2hsv
+	cart2pol,cart2sph,pol2car,sph2cart
+	corr2,mean2,std2
+	grayslice,histeq,im2bw,imadjust,imhist,isbw,isgray,isind
+Teemu Ikonen <tpikonen@pcu.helsinki.fi>
+	cordflt2,impad,medfilt2,ordfilt2
+Etienne Grossmann <etienne@isr.ist.utl.pt>
+	struct,setfield,rmfield,isstruct,isfield,getfield
+	rmpath, fullfile, addpath
+	bwlabel, bwborder
+	sub2ind, ind2sub
+Andreas Weingessel <Andreas.Weingessel@ci.tuwien.ac.at>
+	cceps
+Pascal Fleury <fleury@sslab.sony.co.jp>
+	sparse
+Stephen Eglen <stephen@cogsci.ed.ac.uk>
+	randperm
+Benn Sapp <bsapp@lanl.gov>
+	__quasi_func__, nrm, lp, dfp, deriv, bs_gradient, bfgs, fminbnd
+Marc Compere <compere@mail.utexas.edu>
+	rk8fixed, rk4fixed, rk2fixed, pendulum, pendot, ode78, ode45, ode23
+P.R. Nienhuis <106130.1515@compuserve.com>
+	funm
+David Doolin <doolin@ce.berkeley.edu>
+	polyarea
+Vincent Cautaerts <vincent@comf5.comm.eng.osaka-u.ac.jp>
+	ifftshift
+Daniel Heiserer <Daniel.heiserer@physik.tu-muenchen.de>
+	patch,dhbar,fill,pie,print,gget
+Ariel Tankus <arielt@math.tau.ac.il>
+	deal, double, view
+Kurt Hornik <??>
+	kaiser
+Roberto A. F. Almeida <roberto@calvin.ocfis.furg.br>
+	quiver
+Jake Janovetz <??>
+	remez
+Peter Ekberg <??>
+	pascal, rosser, wilkinson
+Andy Adler <en254@freenet.carleton.ca>
+	conv2, ginput
+Laurent Mazet <mazet@crm.mot.com>
+	legend, unix, transpose, ctranspose, bi2de, de2bi, vec2mat, randint
+Daniel Calvelo <dcalvelo@yahoo.com>
+	dec2base, base2dec, hex2dec, dec2hex
+	blkdiag, sortrows
+David Billinghurst <David.Billinghurst@riotinto.com>
+	ellipke, ellipj
+Richard I. Shrager <rs9e@nih.gov>
+Arthur Jutan <jutan@charon.engga.uwo.ca>
+Ray Muzic <rfm2@po.cwru.edu>
+Francesco Potorti <F.Potorti@cnuce.cnr.it>
+	leasqr, dfdp, leasqrdemo
+Dave Cogdell <cogdelld@asme.org>
+	xcorr2
+Bryce Gardner <bgard@autoa.com>
+	(grants permission to modify for and distribute with octave)
+	quadndg, quadg, quadc, quad2dg, quad2dggen, quad2dc, quad2dcgen,
+	ncrule, innerfun, grule, grule2d, grule2dgen, gquadnd, gquad,
+	gquad6, gquad2d, gquad2dgen, gquad2d6, crule, crule2d, crule2dgen,
+	cquadnd, count
+
+public domain
+-------------
+Bruce T. Lowerre <??>
+	endpoint.h, endpoint.doc, endpoint.cc
+Sam Sirlin <sirlin@izap.com>
+	fill3  (from http://www.izap.com/~sirlin/matlab/)
+Bill Lash <lash@tellabs.com>
+	unwrap, strncmp, strncmpi, strcmpi
+
+GPL header
+----------
+## Copyright (C) 2001 "author"
+##
+## This program is free software; you can redistribute it and/or modify
+## it under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2 of the License, or
+## (at your option) any later version.
+##
+## This program is distributed in the hope that it will be useful,
+## but WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+## GNU General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with this program; if not, write to the Free Software
+## Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+Public domain header
+--------------------
+## Author: "author"
+##
+## This program is granted to the public domain.
+##
+## THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+## ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+## ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+## FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+## OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+## HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+## LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+## OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+## SUCH DAMAGE.

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/COPYING.GPL	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+                          675 Mass Ave, Cambridge, MA 02139, USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) 19yy  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) 19yy name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/Makefile	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,12 @@
+include ../Makeconf
+
+PROGS = rand.oct randn.oct
+
+all: $(PROGS)
+
+randn.oct: rand.oct
+	-$(RM) randn.oct
+	$(LN_S) rand.oct randn.oct
+
+clean: 
+	$(RM) *.o $(PROGS) octave-core core *~OA

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/MersenneTwister.h	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,334 @@
+// MersenneTwister.h
+// Mersenne Twister random number generator -- a C++ class MTRand
+// Based on code by Makoto Matsumoto, Takuji Nishimura, and Shawn Cokus
+// Richard J. Wagner  v0.6  14 February 2001  rjwagner@writeme.com
+
+// The Mersenne Twister is an algorithm for generating random numbers.  It
+// was designed with consideration of the flaws in various other generators.
+// The period, 2^19937-1, and the order of equidistribution, 623 dimensions,
+// are far greater.  The generator is also fast; it avoids multiplication and
+// division, and it benefits from caches and pipelines.  For more information
+// see the inventors' web page at http://www.math.keio.ac.jp/~matumoto/emt.html
+
+// Reference
+// M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-Dimensionally
+// Equidistributed Uniform Pseudo-Random Number Generator", ACM Transactions on
+// Modeling and Computer Simulation, Vol. 8, No. 1, January 1998, pp 3-30.
+
+// Copyright (C) 2001  Richard J. Wagner
+// 
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+// 
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// Lesser General Public License for more details.
+// 
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+// The original code included the following notice:
+//
+//     Copyright (C) 1997, 1999 Makoto Matsumoto and Takuji Nishimura.
+//     When you use this, send an email to: matumoto@math.keio.ac.jp
+//     with an appropriate reference to your work.
+//
+// It would be nice to CC: rjwagner@writeme.com and Cokus@math.washington.edu
+// when you write.
+
+#ifndef MERSENNETWISTER_H
+#define MERSENNETWISTER_H
+
+// Not thread safe (unless auto-initialization is avoided and each thread has
+// its own MTRand object)
+
+#include <stdio.h>
+#include <time.h>
+#include <limits.h>
+#include <iostream.h>
+
+class MTRand {
+// Data
+public:
+	typedef unsigned long uint32;  // unsigned integer type, at least 32 bits
+	
+	enum { N = 624 };              // length of state vector
+	enum { SAVE = N + 1 };         // length of array for save()
+
+protected:
+	enum { M = 397 };              // period parameter
+	enum { MAGIC = 0x9908b0dfU };  // magic constant
+	
+	uint32 state[N];  // internal state
+	uint32 *pNext;    // next value to get from state
+	int left;         // number of values left before reload needed
+
+
+//Methods
+public:
+	MTRand( const uint32& oneSeed );  // initialize with a simple uint32
+	MTRand( uint32 *const bigSeed );  // initialize with an array of N uint32's
+	MTRand();  // auto-initialize with /dev/urandom or time() and clock()
+	
+	// Access to 32-bit random numbers
+	// Do NOT use for CRYPTOGRAPHY without securely hashing several returned
+	// values together, otherwise the generator state can be learned after
+	// reading 624 consecutive values.
+	double rand();                      // real number in [0,1]
+	double rand( const double& n );     // real number in [0,n]
+	double randExc();                   // real number in [0,1)
+	double randExc( const double& n );  // real number in [0,n)
+	uint32 randInt();                       // integer in [0,2^32-1]
+	uint32 randInt( const uint32& n );      // integer in [0,n] for n < 2^32
+	double operator()() { return rand(); }  // same as rand()
+	
+	// Re-seeding functions with same behavior as initializers
+	void seed( uint32 oneSeed );
+	void seed( uint32 *const bigSeed );
+	void seed();
+	
+	// Saving and loading generator state
+	void save( uint32* saveArray ) const;  // to array of size SAVE
+	void load( uint32 *const loadArray );  // from such array
+	friend ostream& operator<<( ostream& os, const MTRand& mtrand );
+	friend istream& operator>>( istream& is, MTRand& mtrand );
+
+protected:
+	void reload();
+	uint32 hiBit( const uint32& u ) const { return u & 0x80000000U; }
+	uint32 loBit( const uint32& u ) const { return u & 0x00000001U; }
+	uint32 loBits( const uint32& u ) const { return u & 0x7fffffffU; }
+	uint32 mixBits( const uint32& u, const uint32& v ) const
+		{ return hiBit(u) | loBits(v); }
+	uint32 twist( const uint32& m, const uint32& s0, const uint32& s1 ) const
+		{ return m ^ (mixBits(s0,s1)>>1) ^ (loBit(s1) ? MAGIC : 0U); }
+	static uint32 hash( time_t t, clock_t c );
+};
+
+
+inline MTRand::MTRand( const uint32& oneSeed )
+	{ seed(oneSeed); }
+
+inline MTRand::MTRand( uint32 *const bigSeed )
+	{ seed(bigSeed); }
+
+inline MTRand::MTRand()
+	{ seed(); }
+
+inline double MTRand::rand()
+    { return double(randInt()) * 2.3283064370807974e-10; }
+
+inline double MTRand::rand( const double& n )
+	{ return rand() * n; }
+
+inline double MTRand::randExc()
+	{ return double(randInt()) * 2.3283064365386963e-10; }
+
+inline double MTRand::randExc( const double& n )
+	{ return randExc() * n; }
+
+inline MTRand::uint32 MTRand::randInt()
+{
+	if( left == 0 ) reload();
+	--left;
+		
+	register uint32 s1;
+	s1 = *pNext++;
+	s1 ^= (s1 >> 11);
+	s1 ^= (s1 <<  7) & 0x9d2c5680U;
+	s1 ^= (s1 << 15) & 0xefc60000U;
+	return ( s1 ^ (s1 >> 18) );
+}
+
+
+inline MTRand::uint32 MTRand::randInt( const uint32& n )
+{
+	// Find which bits are used in n
+	uint32 used = ~0;
+	for( uint32 m = n; m; used <<= 1, m >>= 1 ) {}
+	used = ~used;
+	
+	// Draw numbers until one is found in [0,n]
+	uint32 i;
+	do
+		i = randInt() & used;  // toss unused bits to shorten search
+	while( i > n );
+	return i;
+}
+
+
+inline void MTRand::seed( uint32 oneSeed )
+{
+	// Seed the generator with a simple uint32
+	register uint32 *s;
+	register int i;
+	for( i = N, s = state;
+	     i--;
+		 *s    = oneSeed & 0xffff0000,
+		 *s++ |= ( (oneSeed *= 69069U)++ & 0xffff0000 ) >> 16,
+		 (oneSeed *= 69069U)++ ) {}  // hard to read, but fast
+	reload();
+}
+
+
+inline void MTRand::seed( uint32 *const bigSeed )
+{
+	// Seed the generator with an array of 624 uint32's
+	// There are 2^19937-1 possible initial states.  This function allows
+	// any one of those to be chosen by providing 19937 bits.  The lower
+	// 31 bits of the first element, bigSeed[0], are discarded.  Any bits
+	// above the lower 32 in each element are also discarded.  Theoretically,
+	// the rest of the array can contain any values except all zeroes.
+	// Just call seed() if you want to get array from /dev/urandom
+	register uint32 *s = state, *b = bigSeed;
+	register int i = N;
+	for( ; i--; *s++ = *b++ & 0xffffffff ) {}
+	reload();
+}
+
+
+inline void MTRand::seed()
+{
+	// Seed the generator with an array from /dev/urandom if available
+	// Otherwise use a hash of time() and clock() values
+	
+	// First try getting an array from /dev/urandom
+	FILE* urandom = fopen( "/dev/urandom", "rb" );
+	if( urandom )
+	{
+		register uint32 *s = state;
+		register int i = N;
+		register bool success = true;
+		while( success && i-- )
+		{
+			success = fread( s, sizeof(uint32), 1, urandom );
+			*s++ &= 0xffffffff;  // filter in case uint32 > 32 bits
+		}
+		fclose(urandom);
+		if( success )
+		{
+			// There is a 1 in 2^19937 chance that a working urandom gave
+			// 19937 consecutive zeroes and will make the generator fail
+			// Ignore that case and continue with initialization
+			reload();
+			return;
+		}
+	}
+	
+	// Was not successful, so use time() and clock() instead
+	seed( hash( time(NULL), clock() ) );
+}
+
+
+inline void MTRand::reload()
+{
+	// Generate N new values in state
+	// Made clearer and faster by Matthew Bellew (matthew.bellew@home.com)
+	register uint32 *p = state;
+	register int i;
+	for( i = N - M; i--; )
+		*p++ = twist( p[M], p[0], p[1] );
+	for( i = M; --i; )
+		*p++ = twist( p[M-N], p[0], p[1] );
+	*p = twist( p[M-N], p[0], state[0] );
+
+	left = N, pNext = state;
+}
+
+
+inline MTRand::uint32 MTRand::hash( time_t t, clock_t c )
+{
+	// Get a uint32 from t and c
+	// Better than uint32(x) in case x is floating point in [0,1]
+	// Based on code by Lawrence Kirby (fred@genesis.demon.co.uk)
+
+	static uint32 differ = 0;  // guarantee time-based seeds will change
+
+	uint32 h1 = 0;
+	unsigned char *p = (unsigned char *) &t;
+	for( size_t i = 0; i < sizeof(t); ++i )
+	{
+		h1 *= UCHAR_MAX + 2U;
+		h1 += p[i];
+	}
+	uint32 h2 = 0;
+	p = (unsigned char *) &c;
+	for( size_t j = 0; j < sizeof(c); ++j )
+	{
+		h2 *= UCHAR_MAX + 2U;
+		h2 += p[j];
+	}
+	return ( h1 + differ++ ) ^ h2;
+}
+
+
+inline void MTRand::save( uint32* saveArray ) const
+{
+	register uint32 *sa = saveArray;
+	register const uint32 *s = state;
+	register int i = N;
+	for( ; i--; *sa++ = *s++ ) {}
+	*sa = left;
+}
+
+
+inline void MTRand::load( uint32 *const loadArray )
+{
+	register uint32 *s = state;
+	register uint32 *la = loadArray;
+	register int i = N;
+	for( ; i--; *s++ = *la++ ) {}
+	left = *la;
+	pNext = &state[N-left];
+}
+
+
+inline ostream& operator<<( ostream& os, const MTRand& mtrand )
+{
+	register const MTRand::uint32 *s = mtrand.state;
+	register int i = mtrand.N;
+	for( ; i--; os << *s++ << "\t" ) {}
+	return os << mtrand.left;
+}
+
+
+inline istream& operator>>( istream& is, MTRand& mtrand )
+{
+	register MTRand::uint32 *s = mtrand.state;
+	register int i = mtrand.N;
+	for( ; i--; is >> *s++ ) {}
+	is >> mtrand.left;
+	mtrand.pNext = &mtrand.state[mtrand.N-mtrand.left];
+	return is;
+}
+
+#endif  //MERSENNETWISTER_H
+
+// Change log:
+//
+// v0.1 - First release on 15 May 2000
+//      - Based on code by Makoto Matsumoto, Takuji Nishimura, and Shawn Cokus
+//      - Translated from C to C++
+//      - Made completely ANSI compliant
+//      - Designed convenient interface for initialization, seeding, and
+//        obtaining numbers in default or user-defined ranges
+//      - Added automatic seeding from /dev/urandom or time() and clock()
+//      - Provided functions for saving and loading generator state
+//
+// v0.2 - Fixed bug which reloaded generator one step too late
+//
+// v0.3 - Switched to clearer, faster reload() code from Matthew Bellew
+//
+// v0.4 - Removed trailing newline in saved generator format to be consistent
+//        with output format of built-in types
+//
+// v0.5 - Improved portability by replacing static const int's with enum's and
+//        clarifying return values in seed(); suggested by Eric Heimburg
+//      - Removed MAXINT constant; use 0xffffffff instead
+//
+// v0.6 - Eliminated seed overflow when uint32 is larger than 32 bits
+//      - Changed integer [0,n] generator to give better uniformity

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/README	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,43 @@
+Status as of Octave version 2.0.16/2.1.31
+
+Interface compatibility changes
+===============================
+lin2mu.m        (defaults to -1:1 audio range)
+mu2lin.m	(defaults to -1:1 audio range)
+
+Interface compatibility extensions
+==================================
+contour.m       (default number of contours)
+__pltopt1__.m   (accepts line types)
+cross.m		(accepts matrices)
+deblank.m	(accepts matrices, better \0 handling)
+fftfilt.m	(accepts matrices)
+freqz.m		(lots of changes)
+imagesc.m	(only display if not returning scaled image)
+polyder.m       (accepts a*b, a/b)
+polyderiv.m     (accepts a*b, a/b)
+polygcd.m	(new function for auto-reduction on polyder)
+rand.cc         (accepts "state" argument; use MT)
+MersenneTwister.h (long period random number generator)
+
+Interface extensions
+====================
+grid.m          (control x/y grids and grid density independently)
+
+Bug fixes
+=========
+tf2zp.m         (don't remember)
+zp2tf.m         (don't remember)
+
+Speedups
+========
+findstr.m
+hankel.m
+hilb.m
+index.m
+invhilb.m
+kron.m
+rindex.m
+toeplitz.m
+vander.m
+

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/contour.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,113 @@
+## Copyright (C) 1996, 1997 John W. Eaton
+##
+## This file is part of Octave.
+##
+## Octave is free software; you can redistribute it and/or modify it
+## under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## Octave is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with Octave; see the file COPYING.  If not, write to the Free
+## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+## 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {} contour (@var{z}, @var{n})
+## @deftypefnx {Function File} {} contour (@var{x}, @var{y}, @var{z}, @var{n})
+## Make a contour plot of the three-dimensional surface described by
+## @var{z}.  Someone needs to improve @code{gnuplot}'s contour routines
+## before this will be very useful.
+## @end deftypefn
+## @seealso{plot, semilogx, semilogy, loglog, polar, mesh, contour,
+## bar, stairs, gplot, gsplot, replot, xlabel, ylabel, and title}
+
+## Author: jwe
+## Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+##    matlab compatible interface
+
+function contour (x, y, z, n)
+
+  ## XXX FIXME XXX -- these plot states should really just be set
+  ## temporarily, probably inside an unwind_protect block, but there is
+  ## no way to determine their current values.
+
+  if (nargin == 1 || nargin == 2)
+    z = x;
+    if (nargin == 1) 
+      n = 10;
+    else
+      n = y; 
+    endif
+    if (is_matrix (z))
+      gset nosurface;
+      gset contour;
+      gset cntrparam bspline;
+      if (is_scalar (n))
+        command = sprintf ("gset cntrparam levels %d", n);
+      elseif (is_vector (n))
+        tmp = sprintf ("%f", n(1));
+        for i = 2:length (n)
+          tmp = sprintf ("%s, %f", tmp, n(i));
+        endfor
+        command = sprintf ("gset cntrparam levels discrete %s", tmp);
+      endif
+      eval (command);
+      gset noparametric;
+      gset view 0, 0, 1, 1;
+      gsplot z w l 1;
+    else
+      error ("contour: argument must be a matrix");
+    endif
+  elseif (nargin == 3 || nargin == 4)
+    if (nargin == 3) n = 9; endif
+    if (is_vector (x) && is_vector (y) && is_matrix (z))
+      xlen = length (x);
+      ylen = length (y);
+      if (xlen == rows (z) && ylen == columns (z))
+        if (rows (x) == 1)
+          x = x';
+        endif
+        len = 3 * ylen;
+        zz = zeros (xlen, len);
+        k = 1;
+        for i = 1:3:len
+          zz(:,i)   = x;
+          zz(:,i+1) = y(k) * ones (xlen, 1);
+          zz(:,i+2) = z(:,k);
+          k++;
+        endfor
+        gset nosurface;
+        gset contour;
+        gset cntrparam bspline;
+        if (is_scalar (n))
+          command = sprintf ("gset cntrparam levels %d", n);
+        elseif (is_vector (n))
+          tmp = sprintf ("%f", n(1));
+          for i = 2:length (n)
+            tmp = sprintf ("%s, %f", tmp, n(i));
+          endfor
+          command = sprintf ("gset cntrparam levels discrete %s", tmp);
+        endif
+        eval (command);
+        gset parametric;
+        gset view 0, 0, 1, 1;
+        gsplot zz w l 1;
+      else
+        msg = "contour: rows (z) must be the same as length (x) and";
+        msg = sprintf ("%s\ncolumns (z) must be the same as length (y)", msg);
+        error (msg);
+      endif
+    else
+      error ("contour: x and y must be vectors and z must be a matrix");
+    endif
+  else
+    usage ("contour (z, levels, x, y)");
+  endif
+
+endfunction

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/cross.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,84 @@
+## Copyright (C) 1995, 1996  Kurt Hornik
+##
+## This program is free software; you can redistribute it and/or modify
+## it under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## This program is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with this file.  If not, write to the Free Software Foundation,
+## 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {} cross (@var{x}, @var{y})
+## Computes the vector cross product of the two 3-dimensional vectors
+## @var{x} and @var{y}.
+##
+## A row vector is returned if @var{x} and @var{y} are both row vectors;
+## otherwise, a column vector is returned.
+##
+## If @var{x} and @var{y} are two - dimensional matrices the
+## cross product is applied along the first dimension with 3 elements.
+##
+## @example
+## @group
+## cross ([1,1,0], [0,1,1])
+##      @result{} [ 1; -1; 1 ]
+## @end group
+## @end example
+## @end deftypefn
+
+## Author: KH <Kurt.Hornik@ci.tuwien.ac.at>
+## Created: 15 October 1994
+## Adapted-By: jwe
+
+function z = cross (x, y)
+	
+  if (nargin != 2)
+    usage ("cross (x, y)");
+  endif
+ 
+  if (is_vector(x) && is_vector(y))
+    if (length (x) == 3 && length (y) == 3)
+
+      z = [x(2)*y(3) - x(3)*y(2);\
+           x(3)*y(1) - x(1)*y(3);\
+           x(1)*y(2) - x(2)*y(1)];
+
+      x_nr = rows (x);
+      y_nr = rows (y);
+
+      if (x_nr == y_nr && x_nr == 1)
+        z = z.';
+      endif
+
+    else
+      error ("cross: both x and y must be 3-dimensional vectors");
+    endif
+  elseif (size(x) == size(y))
+
+    [xr,xc]=size(x);
+
+    if (xr == 3)
+      x=x';y=y';
+	elseif (xc != 3)
+      error ("cross: x and y must have one dimension with 3 elements")
+    endif
+
+	z = [x(:,2).*y(:,3) .- x(:,3).*y(:,2)\
+         x(:,3).*y(:,1) .- x(:,1).*y(:,3)\
+         x(:,1).*y(:,2) .- x(:,2).*y(:,1)];
+
+    if (xr == 3)
+      z=z';
+    endif
+  else
+    error ("cross: for matrix arguments x and y must have same size");
+  endif
+
+endfunction

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/deblank.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,78 @@
+## Copyright (C) 1996 Kurt Hornik
+##
+## This file is part of Octave.
+##
+## Octave is free software; you can redistribute it and/or modify it
+## under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## Octave is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with Octave; see the file COPYING.  If not, write to the Free
+## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+## 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {} deblank (@var{s})
+## Removes the trailing blanks and nulls from the string @var{s}.
+## If @var{s} is a matrix, @var{deblank} trims each row to the 
+## length of longest string.
+## @end deftypefn
+
+## Author: Kurt Hornik <Kurt.Hornik@ci.tuwien.ac.at>
+## Adapted-By: jwe
+## Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+##    vectorize for speed
+
+function t = deblank (s)
+
+  if (nargin != 1)
+    usage ("deblank (s)");
+  endif
+
+  if (isstr (s))
+
+    [nr, nc] = size (s);
+
+    if (nc == 0)
+      t = s;
+    else
+      ## Need to compare s against space and null.  Since "\0" is not
+      ## defined, need to use setstr.  Since setstr(0) is [], for 2.1.31
+      ## at least, need to store setstr([0, 1]) to variable t and use
+      ## t(1) as the null character.
+      t = setstr([0, 1]);
+      k = find (s != " " & s != t (1));
+      if isempty (k)
+	t = "";
+      else
+	t = s (:, 1 : ceil (max (k) / nr));
+      endif
+    endif
+
+  else
+    error ("deblank: expecting string argument");
+  endif
+
+endfunction
+
+%!assert (deblank(""), "");
+%!assert (deblank(" "), "");
+%!assert (deblank([" ", " "]), "")
+%!assert (isempty(deblank([" ", " "])));
+%!assert (deblank(" f o o "), " f o o");
+%!assert (deblank(["f "; "o "; "o "]), [ "f"; "o"; "o" ]);
+%!test
+%! ## Test strings containing \0 as well.  Need to work a bit to
+%! ## construct them, though.
+%! in = ["fr "; "o0 "; "o 0"]; 
+%! in(2,2:3) = setstr([0 32]);
+%! in(3,2:3) = setstr([32 0]);
+%! out = [ "fr"; "o0"; "o " ];
+%! out(2,:) = setstr([toascii("o") 0]);
+%! assert(deblank(in), out);

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/fftfilt.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,100 @@
+## Copyright (C) 1996, 1997 John W. Eaton
+##
+## This file is part of Octave.
+##
+## Octave is free software; you can redistribute it and/or modify it
+## under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## Octave is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with Octave; see the file COPYING.  If not, write to the Free
+## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+## 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {} fftfilt (@var{b}, @var{x}, @var{n})
+##
+## With two arguments, @code{fftfilt} filters @var{x} with the FIR filter
+## @var{b} using the FFT.
+##
+## Given the optional third argument, @var{n}, @code{fftfilt} uses the
+## overlap-add method to filter @var{x} with @var{b} using an N-point FFT.
+##
+## If @var{x} is a matrix, filter each column of the matrix.
+## @end deftypefn
+
+## Author: KH <Kurt.Hornik@ci.tuwien.ac.at>
+## Created: 3 September 1994
+## Adapted-By: jwe
+## Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+##    handle matrices
+
+function y = fftfilt (b, x, N)
+
+  ## If N is not specified explicitly, we do not use the overlap-add
+  ## method at all because loops are really slow.  Otherwise, we only
+  ## ensure that the number of points in the FFT is the smallest power
+  ## of two larger than N and length(b).  This could result in length
+  ## one blocks, but if the user knows better ...
+
+  if (nargin < 2 || nargin > 3)
+    usage (" fftfilt (b, x, N)");
+  endif
+
+  transpose = rows(x) == 1;
+  if transpose, x = x.'; endif
+  [r_x, c_x] = size (x);
+  [r_b, c_b] = size (b);
+  if min ([r_b, c_b]) != 1
+    error ("fftfilt: b should be a vector");
+  endif
+  l_b  = r_b * c_b;
+  b = reshape (b, l_b, 1);
+
+  if (nargin == 2)
+    ## Use FFT with the smallest power of 2 which is >= length (x) +
+    ## length (b) - 1 as number of points ...
+    N    = 2^(ceil (log (r_x + l_b - 1) / log(2)));
+    B = fft (b, N);
+    y = ifft(fft (x, N) .* B(:,ones(1,c_x)));
+  else
+    ## Use overlap-add method ...
+    if (! (is_scalar (N)))
+      error ("fftfilt: N has to be a scalar");
+    endif
+    N = 2^(ceil (log (max ([N, l_b])) / log(2)));
+    L = N - l_b + 1;
+    B = fft (b, N);
+    R = ceil (r_x / L);
+    y = zeros (r_x, c_x);
+    for r = 1:R;
+      lo  = (r - 1) * L + 1;
+      hi  = min (r * L, r_x);
+      tmp = zeros(N,c_x);
+      tmp(1:(hi-lo+1),:) = x(lo:hi,:);
+      tmp = ifft(fft (tmp) .* B(:,ones(c_x,1)));
+      hi  = min (lo+N-1, r_x);
+      y(lo:hi,:) = y(lo:hi,:) + tmp(1:(hi-lo+1),:);
+    endfor
+  endif
+
+  y = y(1:r_x,:);
+  if transpose, y=y.'; endif
+
+  ## Final cleanups: if both x and b are real respectively integer, y
+  ## should also be
+
+  if (! (any (imag (x)) || any (imag (b))))
+    y = real (y);
+  endif
+  if (! (any (x - round (x)) || any (b - round (b))))
+    y = round (y);
+  endif
+
+endfunction

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/findstr.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,127 @@
+## Copyright (C) 1996 Kurt Hornik
+##
+## This file is part of Octave.
+##
+## Octave is free software; you can redistribute it and/or modify it
+## under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## Octave is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with Octave; see the file COPYING.  If not, write to the Free
+## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+## 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {} findstr (@var{s}, @var{t}, @var{overlap})
+## Return the vector of all positions in the longer of the two strings
+## @var{s} and @var{t} where an occurrence of the shorter of the two starts.
+## If the optional argument @var{overlap} is nonzero, the returned vector
+## can include overlapping positions (this is the default).  For example,
+##
+## @example
+## findstr ("ababab", "a")
+##      @result{} [ 1, 3, 5 ]
+## findstr ("abababa", "aba", 0)
+##      @result{} [ 1, 5 ]
+## @end example 
+## @end deftypefn
+##
+## Note that this implementation swaps the strings if second on is longer
+## than the first, so try to put the longer one first.
+##
+## Author: Kurt Hornik <Kurt.Hornik@ci.tuwien.ac.at>
+## Adapted-By: jwe
+## Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+##    vectorize for speed
+
+function v = findstr (s, t, overlap)
+
+  if (nargin < 2 || nargin > 3)
+    usage ("findstr (s, t, overlap)");
+  endif
+
+  if (!isstr (s) || !isstr (t) || all (size (s) > 1) || all (size (t) > 1) )
+    error ("findstr: expecting first two arguments to be strings");
+  endif
+
+  if (nargin == 2)
+    overlap = 1;
+  endif
+
+  ## Make S be the longer string.
+  if (length (s) < length (t))
+    tmp = s;
+    s = t;
+    t = tmp;
+  endif
+  
+  l_s = length (s);
+  l_t = length (t);
+  
+  if ( l_t == 0 )
+    ## zero length target: return all indices
+    v = 1 : l_s;
+    
+  elseif ( l_t == 1 )
+    ## length one target: simple find
+    v = find (s==t);
+    
+  elseif ( l_t == 2 )
+    ## length two target: find first at i and second at i+1
+    v = find (s (1 : l_s-1) == t (1) & s (2 : l_s) == t (2));
+    
+  else
+    ## length three or more: match the first three by find then go through
+    ## the much smaller list to determine which of them are real matches
+    limit = l_s - l_t + 1;
+    v = find (s (1 : limit) == t(1) & s (2 : limit+1) == t (2)
+	      & s (3 : limit+2) == t(3) );
+  endif
+
+  ## Need to search the index vector if our find was too short
+  ## (target length > 3), or if we don't allow overlaps.  Note though
+  ## that there cannot be any overlaps if the first character in the
+  ## target is different from the remaining characters in the target,
+  ## so a single character, two different characters, or first character
+  ## different from the second two don't need to be searched.
+  if ( l_t >= 3 || ( !overlap && l_t > 1 && any (t(1) == t(2:l_t)) ) )
+    ## force strings to be both row vectors or both column vectors
+    if (all (size (s) != size (t)))
+      t = t.';
+    endif
+    
+    ## determine which ones to keep
+    keep = zeros(size(v));
+    ind = 0:l_t-1;
+    if ( overlap )
+      for idx = 1:length(v)
+	keep(idx) = all (s (v(idx) + ind) == t);
+      endfor
+    else
+      next = 1; # first possible position for next non-overlapping match
+      for idx = 1:length(v)
+	if (v (idx) >= next && s (v (idx) + ind) == t)
+	  keep(idx) = 1;
+	  next = v(idx) + l_t; # skip to the next possible match position
+	else
+	  keep(idx) = 0;
+	endif
+      endfor
+    endif
+    if (!isempty(v))
+      v = v(find(keep));
+    endif
+  endif
+  
+  ## Always return a column vector, because that's what the old one did
+  if (rows (v) > 1) 
+    v = v.';
+  endif
+
+endfunction

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/FIXES/freqz.m	Wed Oct 10 19:54:49 2001 +0000
@@ -0,0 +1,214 @@
+## Copyright (C) 1996, 1997 John W. Eaton
+##
+## This file is part of Octave.
+##
+## Octave is free software; you can redistribute it and/or modify it
+## under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2, or (at your option)
+## any later version.
+##
+## Octave is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with Octave; see the file COPYING.  If not, write to the Free
+## Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+## 02111-1307, USA.
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {[@var{h}, @var{w}] =} freqz (@var{b}, @var{a}, @var{n}, "whole")
+## Return the complex frequency response @var{h} of the rational IIR filter
+## whose numerator and denominator coefficients are @var{b} and @var{a},
+## respectively.  The response is evaluated at @var{n} angular frequencies
+## between 0 and
+## @ifinfo
+##  2*pi.
+## @end ifinfo
+## @iftex
+## @tex
+##  $2\pi$.
+## @end tex
+## @end iftex
+##
+## @noindent
+## The output value @var{w} is a vector of the frequencies.
+##
+## If the fourth argument is omitted, the response is evaluated at
+## frequencies between 0 and
+## @ifinfo
+##  pi.
+## @end ifinfo
+## @iftex
+## @tex
+##  $\pi$.
+## @end tex
+## @end iftex
+##
+## If @var{n} is omitted, a value of 512 is assumed.
+##
+## If @var{a} is omitted, the denominator is assumed to be 1 (this
+## corresponds to a simple FIR filter).
+##
+## For fastest computation, @var{n} should factor into a small number of
+## small primes.
+##
+## @deftypefnx {Function File} {@var{h} =} freqz (@var{b}, @var{a}, @var{w})
+## Evaluate the response at the specific frequencies in the vector @{w}.
+##
+## @deftypefnx {Function File} {... =} freqz (..., @var{Fs})
+## Return frequencies in Hz instead of radians assuming a sampling rate
+## @{Fs}.  If you are evaluating the response at specific frequencies 
+## @var{w}, those frequencies should be requested in Hz rather than radians.
+##
+## @deftypefnx {Function File} freqz(...)
+## Plot the pass band, stop band and phase response of @var{h} rather
+## than returning them.
+##
+## @end deftypefn
+
+## Author: jwe ???
+## Paul Kienzle <pkienzle@kienzle.powernet.co.uk>
+##    matlab compatible interface
+
+function [h_r, w_r] = freqz(b, a, n, region, Fs)
+
+  if (nargin<1 || nargin>5)
+    usage("[h w]=freqz(b, a, n [, 'whole'] [, Fs])");
+  elseif (nargin == 1)
+    ## Response of an FIR filter.
+    a=[]; n=[]; region=[]; Fs=[];
+  elseif (nargin == 2)
+    ## Response of an IIR filter
+    n=[]; region=[]; Fs=[];
+  elseif (nargin == 3)
+    region=[]; Fs=[];
+  elseif (nargin == 4)
+    Fs=[];
+    if !isstr(region) && !isempty(region)
+      Fs = region; region=[];
+    endif
+  endif
+
+  if isempty(a) a=1; endif
+  if isempty(n) n=512; endif
+  if isempty(region) 
+    if isreal(b) && isreal(a)
+      region = "half";
+    else
+      region = "whole";
+    endif
+  endif
+  if isempty(Fs) 
+    if (nargout==0) Fs = 2; else Fs = 2*pi; endif
+  endif
+
+  la = length(a);
+  a = reshape(a,1,la);
+  lb = length(b);
+  b = reshape(b,1,lb);
+  k = max([la, lb]);
+
+  if !is_scalar(n)
+    if nargin==4 ## Fs was specified
+      w = 2*pi*n/Fs;
+    else
+      w = n;
+    endif
+    n = length(n);
+    extent = 0;
+  elseif strcmp(region,"whole")
+    w = 2*pi*[0:(n-1)]/n;
+    extent = n;
+  else
+    w = pi*[0:(n-1)]/n;
+    extent = 2*n;
+  endif
+
+  if length(b) == 1
+    if length(a) == 1
+      hb=b*ones(1,n);
+    else
+      hb = b;
+    endif
+  elseif extent >= k 
+    hb = fft(postpad(b,extent));
+    hb = hb(1:n);
+  else
+    hb = polyval(postpad(b,k),exp(j*w));
+  endif
+  if length(a) == 1
+    ha = a;
+  elseif  extent >= k
+    ha = fft(postpad(a,extent));
+    ha = ha(1:n);
+  else
+    ha = polyval(postpad(a,k),exp(j*w));
+  endif
+  h = hb./ha;
+  w = Fs*w/(2*pi);
+
+  if nargout != 0, # return values and don't plot
+    h_r = h;
+    w_r = w;
+  else             # plot and don't return values
+    ## ## exclude zero-frequency
+    ## h = h(2:length(h));
+    ## w = w(2:length(w));
+    ## n = n-1;
+    mag = 20*log10(abs(h));
+    phase = unwrap(arg(h));
+    maxmag = max(mag);
+
+    unwind_protect # protect graph state
+      if gnuplot_has_multiplot
+      	subplot(311);
+      	gset lmargin 10;
+	axis("labely");
+	xlabel("");
+      endif
+      grid("on");
+      axis([w(1), w(n), maxmag-3, maxmag]);
+      plot(w, mag, ";Pass band (dB);");
+
+      if gnuplot_has_multiplot
+      	subplot(312);
+	axis("labely");
+	title("");
+	xlabel("");
+      	gset tmargin 0;
+      else
+	input("press any key for the next plot: ");
+      endif
+      grid("on");
+      if (maxmag - min(mag) > 100)
+      	axis([w(1), w(n), maxmag-100, maxmag]);
+      else
+      	axis("autoy");
+      endif
+      plot(w, mag, ";Stop band (dB);");
+      
+      if gnuplot_has_multiplot
+      	subplot(313);
+	axis("label");
+	title("");
+      else
+	input("press any key for the next plot: ");
+      endif
+      grid("on");
+      axis("autoy");
+      xlabel(["Frequency (Fs=", num2str(Fs), ")"]);
+      axis([w(1), w(n)]);
+      plot(w, phase/(2*pi), ";Phase (radians/2pi);");
+      
+    unwind_protect_cleanup # restore graph state
+      grid("off");
+      axis("auto","label");
+      gset lmargin;
+      gset tmargin;
+      oneplot();
+    end_unwind_protect
+  end
+
+endfunction