On Aug 20, 11:08 am, dbd <d...@ieee.org> wrote:
> On Aug 19, 12:12 pm, robert bristow-johnson
>
> <r...@audioimagination.com> wrote:
> > ...
> > > > BTW, i hope you read the other post where i made it even more clear
> > > > that O&S don't take your position on this. they don't at all.
>
> > > I read the post and considered your interpretation to be at odds with
> > > the words you quoted from O&S.
>
> The words I refer to are:
>
> On Aug 8, 2:49 pm, robert bristow-johnson <r...@audioimagination.com>
> wrote:
>
> > ...
> > at the beginning of
> > their DFT chapter (ch 8, pp 514 in my edition):
>
> > "Although several points of view can be taken toward the derivation
> > and interpretation of the DFT representation of a finite-duration
> > sequence, we have chosen to base our presentation on the relationship
> > between periodic sequences and finite-length sequences. We will begin
> > by considering the Fourier series representation of periodic
> > sequences.
> > ...
>
> Having made the -assumption- of periodic sequences, the rest does
> follow, from the assumption.
>
>
it's no assumption. it's a recognition. it's a derivation. we call
that math.
N-1
x[n] = (1/N) * SUM{ X[k] * e^(j*2*pi*n*k/N) }
k=0
hmmm, what happens when you plug in n+N in for n?
N-1
x[n+N] = (1/N) * SUM{ X[k] * e^(j*2*pi*(n+N)*k/N) }
k=0
N-1
= (1/N) * SUM{ X[k] * e^(j*2*pi*n*k/N) * e^(j*2*pi*N*k/N) }
k=0
N-1
= (1/N) * SUM{ X[k] * e^(j*2*pi*n*k/N) * e^(j*2*pi*k) }
k=0
N-1
= (1/N) * SUM{ X[k] * e^(j*2*pi*n*k/N) * ! }
k=0
N-1
= (1/N) * SUM{ X[k] * e^(j*2*pi*n*k/N) }
k=0
= x[n]
>
>
>
> > O&S: "The inherent periodicity is always present. Sometimes it causes
> > us difficulty and sometimes we can exploit it, but to totally ignore
> > it is to invite trouble."
>
> > what points do you derive from these O&S words? certainly not these
> > points:
>
> > 1. There is periodicity regarding the DFT.
>
> > 2. It's inherent to the DFT.
>
> > 3. It's always present with the DFT.
>
> > 4. Sometimes we have to worry about it.
>
> > 5. Sometimes we can exploit it.
>
> > 6. Ignoring it invites trouble.
>
>
> I do agree with those points, they follow directly on their decision
> to consider periodic sequences.
no, you *missed* the point. that continues to be evident. they never
said that the facts are true *only* because the investigated the
periodic properties of the DFT. they are saying that these facts are
true regardless (they never qualified them) and it's *because* they
investigated the potential periodic properties (a fact is a
hypothetical until it's investigated and shown to be true) that they
discover that, in fact, that math says it's true.
don't consider a career in law, Dale. your clients would be ill
served.
> But they don't say that you must or
> can only deal with periodic sequences,
but they say in an unqualified manner that if you ignore it, you're
heading for trouble. your inability to face the facts, even when they
are slapping your face, reveals in you this common malady of
"cognitive dissonance". you just cannot admit, either publically, or
likely even to yourself in the privacy of your thoughts, that *maybe*,
just *maybe* you missed something. but the fantasy that you're
completely on top of this was destroyed (by me) several times. i
pressed you for specifics about what, if anything, you're doing with
your DFT outputs X[k]. you continued to be evasive and i continued to
say that "if you do nothing with your DFT output X[k] (beyond
multiplication by a constant), the periodicity will not be
superficially eveident. so then, finally, you suggested that if you
magnitude squared the DFT output, that such was an example where there
is no periodic extension evident. but that was objective incorrect.
the iDFT{|X[k]|^2} is the *circular* (or "periodic", choose your
poison) convolution of x[n] with x[-n]
i'll bet money, Dale, that you're a Bushie Republican. those people
*never* admit they're wrong, no matter how high the body count gets.
> but if you do consider periodic
> sequences, those are their conclusions. That's their choice of
> application to discuss, not their characterization of the DFT.
that's the dumbest (mis)application of logic. the choice to
investigate the behavior of x[n] outside of the domain of n originally
supplied is just a choice. but the fact remains whether you make that
choice or not. that is the way it is with *any* mathematical
derivation.
when investigating the recursion formula for the Tchebyshev function:
T[n](x) = cos(n*arccos(x))
(we haven't established yet that it's a polynomial), one can *choose*
to inquire what T[n+1](x) is. so we look into it and discover by the
wonders of trigonometry that
T[n+1](x) = 2*T[n](x) - T[n-1](x)
that combined with the obvious initial conditions for n=0 and n=1
leaves us with the *conclusion* (not the assumption) that the
Tchebyshev function is really an nth order polynomial. it's math.
not an assumption.
in fact, even though the original definition of T[n](x) doesn't have
apparent meaning for |x| > 1, the recognition of T[n](x) as a
polynomial cause mathematicians (and electrical engineers that don't
have their head in the sand) to understand that the original
definition implies an extension *outside* of the original domain for
x, even if the arccos(x) function has no definition outside. then,
mathematicians (and electrical engineers that don't have their head in
the sand), investigate how that extension would appear and we get:
{ cos(n*arccos(x)) |x| <= 1
T[n](x) = {
{ (sgn(x))^n * cosh(n*arccosh|x|) |x| >= 1
now, you're free to leave your head in the sand and deny the math.
perhaps in your fantasy land, the Tchebyshev function (which the rest
of us know is a polynomial) only has definition for |x| <= 1. but
it's not true. if you're smart and intellectually curious and say to
yourself, "gee, with cos(n*arccos(x)) definition that doesn't work for
|x|>1, we find out that it's really a polynomical, i wonder if my
synapses would fry if i considered the possibility that this
polynomial will still work for |x|>1?"
you are free to recognize or not recognize what the math tells us.
tho "choice" only exposes a mathematical fact that has existed
eternally. that fact remains despite what the choice was. it may
remain undiscovered, but a mathematical truth (or "theorem" if you
don't like "truth" language) remains whether some of us fail to
discover it or not.
this is not religion. this is about objective, falsifiable fact.
before it got to be politically incorrect, what we used to call "the
truth." but in today's politically correctness, we seem to have
relegated all notions of truth to one's own belief system ("Your
truths may be different than mine."). so now, when materialists try
to discuss what really happens in reality, have to use language such
as "objective fact", "falsifiablity" and the like, otherwize the
Intelligent Design people will slip in their *beliefs* and claim that
they have every claim to "truth" as do the biologists and
palentologists.
Dale, the DFT transforms one periodic sequence of period N to another
periodic sequence also with period N. that is an objective and
falsifiable fact. because it's falsifiable, that means if we
hypothesize that maybe it isn't true, we should be able to come up
with a contradiction. and we do. we've been doing this math over and
over again.
you deny the periodicity of the DFT and rely on that denial to do
*anything* non-trivial with the results of the DFT, you *will* run
into trouble. that is because e^(j*2*pi*k) = 1 for any integer k.
you cannot avoid that trouble unless you do *nothing* to your DFT
results.
the Young Earth Creationists insist that the earth was created about
6000 years ago. when confronted by evidence that there is stuff
laying around that is older, they counter in a manner just like you
do, Dale. they say, well, when the earth was created, it was created
with a history. so the fossils with Carbon-14 evidence that are
billions of years old suddenly appeared on the landscape some 6000
years ago.
they hold up the fossil and draw a completely different conclusion
about it that the palentologist does. their truth seems just as
plausible as the palentologist's truth, *until* they try to do
anything with their version of science. then it fails. that's what
falsifiability is.
when you try to do anything non-trivial with your version of the DFT
(that does not periodically extend the data passed to it), you fail.
you get errors or contradictions. you made a falsifiable claim and it
didn't survive the test. because for falsifiability, *you* don't get
to choose the test, the devil hands you the test and if your theory is
correct, it continues to be true, without contradiction, despite
whatever test the devil hands to you. that's how you prove things in
mathematics.
r b-j