We investigate depoissonization, the problem of recovering asymptotics of sequence coefficients from their exponential generating function. Classical approaches rely on complex-analytic growth conditions, but here we develop real-variable methods that avoid such assumptions. We also address the inverse problem, deriving asymptotic expansions of the generating function itself in terms of its coefficients, thereby extending Ramanujan's original expansion. Taken together, these results offer a unified and elementary framework for depoissonization and its reverse, with applications to analytic combinatorics and probability.