89 citations · 242 across the 34 of their papers we have counts for
4 papers · 2 filters
Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels
Kaveh Mahdaviani, Shervin Shahidi, Shima Haddadi +2
A lower bound on the minimum required code length of binary codes is obtained. The bound is obtained based on observing a close relation between the Ulam's liar game and channel co…
Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay
Youngwook Ko, Masoud Ardakani, Sergiy A. Vorobyov
We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed via N orthogonal channels. This, for example,…
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Youngwook Ko, Sergiy~A. ~Vorobyov, Masoud Ardakani
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effe…
Efficient LLR Calculation for Non-Binary Modulations over Fading Channels
Raman Yazdani, Masoud Ardakani
Log-likelihood ratio (LLR) computation for non-binary modulations over fading channels is complicated. A measure of LLR accuracy on asymmetric binary channels is introduced to faci…