We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O s log s . This bound is tight upto a factor of log s as the Fourier dimension and sparsity of the address function are quadratically related. We obtain the bound by observing that the Fourier dimension of a Boolean function is equivalent to its non-adaptive parity decision tree complexity, and then bounding the latter.