01-12-2012 03:02 AM
I am stuck here with the problem. I want to make a VI which makes the combination of 4 groups of number and each group containing 2 numbers. This should result in 16 combination. This is simillar to the classical problem of P&C where we have 4 urns and each urn contains 2 different ball.
Thank you in advance,
01-12-2012 06:56 AM
4 arrays with 2 elements in each array? Or a single 2 dimensional array: 4x2 elements?
Where did you get 16 values from?
01-12-2012 07:18 AM
01-12-2012 07:47 AM
Hi interstellar,
your question is solved by using some basic features of LabVIEW: autoindexing and shift registers!
Please do the basic tutorials!
01-12-2012 08:02 AM - edited 01-12-2012 08:03 AM
deleted
01-12-2012 11:08 AM
Thanks a lot GerdW. Kudos indeed. 🙂
I made the VI. Actually I am not very comfortable with autoindexing and shift registers. So it would be of great help to me if you can explain me how to make 16 element array. Each element of the array say represent the sum/product of combination.
01-12-2012 11:08 AM
Thanks a lot GerdW. Kudos indeed. 🙂
I made the VI. Actually I am not very comfortable with autoindexing and shift registers. So it would be of great help to me if you can explain me how to make 16 element array. Each element of the array say represent the sum/product of combination.
Thanks for your help.
01-12-2012 11:52 AM
Another good old-fashioned Cartesian product. See here:
http://forums.ni.com/t5/LabVIEW/3-loops-incrementing/m-p/1439422#M552998
04-19-2012 12:52 PM
Is there a 64 bit version of the cartesian product vi? I'm trying to setup a routine for image filtering. I have 9 types of filters that can vary the filter level from 0-9 for each typeof filter. I'm trying to get the list of indices for all combinations. I'm thinking that the cartesian product vi is hanging up with the large number of permutations. Basically I have 90 choices for each of 9 layers of filtering.
04-19-2012 01:04 PM
I'd use the lower snippet in that post to get the individual values instead of the entire list at once.