[Numpy-discussion] help on fast slicing on a grid

[frank wang]

Hi,
 
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.
 
Thanks
 
Frank
_________________________________________________________________
Windows Live™ Hotmail®:…more than just e-mail. 
http://windowslive.com/explore?ocid=TXT_TAGLM_WL_t2_hm_justgotbetter_explore_012009
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://projects.scipy.org/pipermail/numpy-discussion/attachments/20090128/e04745e8/attachment.html