Game of Life Neighbour count optimization
There are several style issues with this code. Most notably:


Use camelCase for method names
Use camelCase for variable names
Put spaces around operators, for example:

i = i1 instead of i=i1
yCoordinate + 1 == xLen instead of yCoordinate+1==xLen
... and so on

j1, j2, ... are poor variable names


To simplify this code, a couple of ideas:


Use an enum to represent neighbors: North, NorthEast, East, SouthEast, ...

Create custom fields dx and dy to represent the direction offset

Iterate over Neighbor.values(), for each item perform this check:

Calculate the neighbor position using current position + the neighbor's dx and dy
Check if the position is on the grid, for example with a isValid(Position pos, Neighbor neighbor) method
Check if the position is alive, for example with a isAlive(Position pos, Neighbor neighbor) method
If both the above are true, increment the count



To get you started, here's an example enum:

enum Neighbor {
    North(0, 1),
    NorthEast(1, 1),
    East(1, 0);

    private final int dx;
    private final int dy;

    Neighbor(int dx, int dy) {
        this.dx = dx;
        this.dy = dy;
    }
}