CPL - Chalmers Publication Library

Finite-Blocklength Channel Coding Rate Under a Long-Term Power Constraint

Wei Yang (Institutionen för signaler och system, Kommunikationssystem) ; Giuseppe Caire ; Giuseppe Durisi (Institutionen för signaler och system, Kommunikationssystem) ; Yury Polyanskiy
2014 IEEE International Symposium on Information Theory, ISIT 2014; Honolulu, HI; United States; 29 June 2014 through 4 July 2014 (2157-8095). p. 2067-2071. (2014)
[Konferensbidrag, refereegranskat]

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-n expansion of the maximal channel coding rate is characterized both for AWGN channels and for quasi-static fading channels with perfect channel state information at the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to $\sqrt{(\log n)/n}$.

Article number 6875197

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden

CPL Pubid: 197193

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)