memory full

[Yamaeda]

I assume you're making a Bit Error Ratio?

http://en.wikipedia.org/wiki/Bit_error_probability

"Examples of bit error ratio are (a) transmission BER, i.e., the number of erroneous bits received divided by the total number of bits transmitted; and (b) information BER, i.e., the number of erroneous decoded (corrected) bits divided by the total number of decoded (corrected) bits."

From my understanding, you shouldn't need to have any array at all, just a few counters and a random bit input. If so, you can easily have 10 billion bits (loops) assuming you can wait. 🙂

I cant open your examples as i only have 8.2.

/Y

[altenbach]

---

LSASS wrote:

So to get rid of coercions, do I have to use data conversion evrywhere ther is a red dot?

---

No, you should make sure that all data has suitable representations so it does not need to be changed constantly. A conversion also forces a new buffer allocation.

(See also this discussion)

As I said, I don't know what your program is doing, but I would advise you to read the post above carefully. Many times an algorithm can be implemented much leaner.

[DFGray]

I would recommend you read the tutorial Managing Large Data Sets in LabVIEW.  It will give you tips on how to debug memory problems using internal LabVIEW tools and your operating system task manager.  In general, get familiar with the array operation palette and use the higher level functions when possible.  They are usually in-place (no copy made).