Can blocked matrix multiplication operation be optimally reduced to 2*N^3/B^3+N^2/B^2 reads on cache?

Question

According to this paper https://suif.stanford.edu/papers/lam-asplos91.pdf, the number of data read is 2N^3+N^2 for a square matrix multiplication operation (XY=Z) in th