This paper addresses the joint Feedback bit allocation(FBA) and Power allocation(PA)problem for a limited feedback coordinated multi-cell transmission system over composite fading channels. The Rayleigh/Lognormal fading channel is considered, and the effects of path loss and the macro-level correlation are also taken into account. A modified performance measure, referred to as the virtual sum rate is adopted to facilitate the analysis. The closed forms of the lower bound on virtual sum rate are derived over uncorrelated and correlated shadowed fading channels. Based on the lower bound, we then formulate an optimization problem of maximizing the virtual sum rate under constraints on the total number of feedback bits per MS and the total transmit power per BS. Considering the tight coupling between the FBA and the PA, we solve the optimization problem by solving an alternating sequence of FBA and PA subproblems using a coordinated ascent searching method. Numerical results show that the proposed strategy can converge in a few iterations and generally yield better performance than the conventional FBA schemes under composite fading channels. This paper addresses the joint Feedback bit allocation (FBA) and Power allocation (PA) problem for a limited feedback coordinated multi-cell transmission system over composite fading channels. The Rayleigh / Lognormal fading channel is considered, and the effects of path loss and the macro-level correlation are also taken into account. A modified performance measure, referred to as the virtual sum rate is adopted to facilitate the analysis. The closed forms of the lower bound on virtual sum rate are derived over uncorrelated and correlated shadowed fading channels. Based on the lower bound, we then formulate an optimization problem of maximizing the virtual sum rate under constraints on the total number of feedback bits per MS and the total transmit power per BS. Considering the tight coupling between the FBA and the PA, we solve the optimization problem by solving an alternating sequence of FBA and PA subproblems using a coordinated ascent searching method. Numerical results show that the proposed strategy can converge in a few iterations and generally yield better performance than the conventional FBA schemes under composite fading channels.