1,096 reputation
815
bio website embeddedrelated.com/blogs-1/…
location Arizona
age
visits member for 4 years, 2 months
seen Sep 17 at 4:42

Mar
28
comment What comes after tetration ? And after ? And after ? etc.
the symbols didn't get displayed properly
Mar
20
comment Reed-Solomon encoding in GF2?
and there's no relation between GF(256) and the Galois fields used in LFSRs? (I can never remember the technical term for those, a ring over a characteristic polynomial of degree N mod GF(2), or something like that)
Mar
20
comment Reed-Solomon encoding in GF2?
oh, I see, so you can't arbitrarily choose the pair (255,239), for GF(256) it has to be (256 +/- 1, m).
Feb
23
comment Is it possible to build a circle with quadratic Bézier curves?
just curious: what software did you use to draw the diagram?
Feb
10
comment Calculating characteristic polynomials of matrices in GF(2)
So you have to calculate the determinant?
Jan
8
comment simple example of recursive least squares (RLS)
That's helpful for some of the conceptual understanding, but how do I figure out the K's? And I still really need to see some numerical data to understand how to choose the gain parameters in practice. Does RLS also give you a global error/noise estimate?
Oct
7
comment comparing bit lengths of binary numbers
thanks! It looks correct, I'll accept as soon as I have a chance to read more carefully. (Proofs have always eluded me. :/ )
Oct
7
comment comparing bit lengths of binary numbers
I didn't say I would get random results, but I couldn't find a counterexample.
Oct
3
comment Understanding Primitive Polynomials in GF(2)?
thanks for the reference! I like Saxena & McCluskey's algorithm for finding primitive polynomials.
Oct
3
comment Extended Euclidean Algorithm in bit representation problem
Thanks for mentioning Blankinship's algorithm! I'd never heard of it, but was able to implement it in Python for GF2 very easily.
Aug
10
comment generating a random periodic function with bounded amplitude and bounded fourier coefficients
re: randomly generating + scaling -- that's about what I thought of, but it skews the resulting probability distribution of the coefficients.
Aug
10
comment generating a random periodic function with bounded amplitude and bounded fourier coefficients
yes, a computational sense, let me elaborate; that's too loose of a bound.
Feb
11
comment convolution square root of uniform distribution
hmm, upon further reflection it seems like there is no such pdf; the convolution of f(x) with itself would always have a maximum when it lines up.
Feb
11
comment numerical integration for N datapoints
Huh, never heard of Romberg integration before, thanks... What if h is fixed (i.e. velocity measurements made once every N milliseconds) rather than something that can be increased adaptively?
Feb
11
comment numerical integration for N datapoints
Well, I understand that part when N is small (I guess it's kind of like windowing functions in FFTs), but not when N is large.
Jul
21
comment closed-form expressions for product of 3n+k where k = 1 or 2
yes, I know. Read the Wolfram Alpha link. The gamma function expressions involve gamma(n+4/3) or gamma(n+5/3) which are not integer factorials.
Apr
5
comment constructing “pseudonoise” sequences other than (2^n)-1? (low cyclical autocorrelation)
hmm, looks like there's a lot of research on this: signalslab.marstu.net/?page_id=1769
Mar
7
comment How can adding an infinite number of rationals yield an irrational number?
Infinite sums have meaning, sure. But I have a finite lifetime, and each addition step takes a finite time -- therefore I cannot add infinitely many numbers. Neither can a computer, by the same reasoning. However I can use reasoning in some cases to compute the limit of an infinite sum (as could a computer in some other cases, with sufficient programming). The difference may be a bit pedantic, but this is mathematics, after all.
Dec
26
comment how to distribute n red and m blue balls in some containers to maximize probability of random picking a red one from them?
off-topic. Best fit is probably math.stackexchange (NOT mathoverflow.net)
May
2
comment order-independent accumulator operations?
That's reasonable. I was going to put only + and XOR in my original post, but the context for this is an "accumulator" where you start with a = 0 and keep applying a = f(a,x) for some function/operation f. The functions f(a,x) = a+x, f(a,x) = a^x, and f(a,x) = a-x were the only ones I could think of where the order didn't matter.