10 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.IT2016
A Quadratic Programming Relaxation Approach to Compute-and-Forward Network Coding Design
Baojian Zhou, Jinming Wen, Wai Ho Mow
Using physical layer network coding, compute-and-forward is a promising relaying scheme that effectively exploits the interference between users and thus achieves high rates. In th…
cs.IT2012★ 4 cited
A Lattice-Theoretic Characterization of Optimal Minimum-Distance Linear Precoders
D. Kapetanovic, H. V. Cheng, W. H. Mow +1
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance…
cs.IT2010★ 10 cited
Variants of the LLL Algorithm in Digital Communications: Complexity Analysis and Fixed-Complexity Implementation
Cong Ling, Wai Ho Mow, Nick Howgrave-Graham
The Lenstra-Lenstra-Lovász (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with ei…