[Numpy-discussion] help on fast slicing on a grid
Wed Jan 28 23:57:16 CST 2009
On Wed, Jan 28, 2009 at 23:52, frank wang <firstname.lastname@example.org> wrote:
> I have to buidl a grid with 256 point by the command:
> a = arange(-15,16,2)
> L = len(a)
> cnstl = a.reshape(L,1)+1j*a
> My problem is that I have a big data array that contains the data round the
> points in cnstl. I want to slice the point to the closest cnstl point and
> also compute the error. The condition is in the middle of the two point in x
> and y axis. I can do it in a for loop. Since Python and numpy have a lot of
> magic, I want to find an efficient way to do. This problem arise from QAM
> 256 modulation.
Can you show us the for loop? I'm not really sure what you want to compute.
"I have come to believe that the whole world is an enigma, a harmless
enigma that is made terrible by our own mad attempt to interpret it as
though it had an underlying truth."
-- Umberto Eco
More information about the Numpy-discussion