public class Compute
{
    public static final int[] BASE_PATTERN = {0, 1, 0, -1};

    public Compute (boolean debug)
    {
        _debug = debug;
    }

    public int[] process (int[] input, int numberOfPhases)
    {
        int[] results = input;

        for (int i = 0; i < numberOfPhases; i++)
        {
            results = processPhase(input);

            //phaseInput = results;
        }

        return results;
    }

    /*
     * A reminder of the example ...
     * 
     * 10-1010-10
     * 01100-1-10
     * 00111000
     * 00011110
     * 00001111
     * 00000111
     * 00000011
     * 00000001
     * 
     * 10-1010-1010-1010-1  --> miss first digit [010-1010-1010-1]
     * 01100-1-1001100-1-1  --> miss first digit [001100-1-1]
     * 00111000-1-1-1000111000-1-1-1  --> miss first digit [000111000-1-1-1]
     * 00011110000-1-1-1-1000011110000-1-1-1-1  --> miss first digit [000011110000-1-1-1-1]
     * 00001111100000-1-1-1-1-1  --> miss first digit [000001111100000-1-1-1-1-1]
     */

    private int[] processPhase (int[] input)
    {
        int[] results = new int[input.length];

        /*
        int basePatternLowerBounds = 0;

        for (int i = 0; i < input.length; i++)
        {
            int value = 0;
            int basePatternIndex = 1;
            int basePatternLoop = 0;

            for (int j = 0; j < input.length; j++)
            {
                int[] work = new int[input.length];
                int pattern = BASE_PATTERN[basePatternIndex];


                work[j] = input[j] * BASE_PATTERN[basePatternIndex];

                System.out.println(input[j]+"*"+BASE_PATTERN[basePatternIndex]);

                if (basePatternIndex == BASE_PATTERN.length)
                    basePatternIndex = basePatternLowerBounds;

                value += work[j];
            }

            results[i] = value;
        }
*/

        return results;
    }

    private final int[] getBasePattern (int phase)
    {
        int[] data = new int[BASE_PATTERN.length*phase];
        int basePtr = 0;

        for (int i = 0; i < phase; i++)
        {
            
        }

        return data;
    }

    private boolean _debug;
}
@@ -2037,24 +2037,46 @@
 basePtr = 0;
+%0A        int loop = 0;
 %0A%0A        fo
@@ -2097,42 +2097,214 @@
 i %3C 
-phase; i++)%0A        %7B%0A            
+data.length; i++)%0A        %7B%0A            data%5Bi%5D = BASE_PATTERN%5BbasePtr%5D;%0A%0A            loop++;%0A%0A            if (loop == phase)%0A            %7B%0A                loop = 0;%0A                basePtr++;%0A            %7D
 %0A   

Update Compute.java