Ying Hung Gan

Electrical and Electronic Engineering · 2009

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Ying Hung Gan trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Joakim Jaldén
  2. Dirk Wübben
  3. Björn E. Ottersten
  4. Ronald Böhnke
  5. Christoph Windpassinger

Who trusts Ying Hung Gan overall

  1. Adeline Langlois
  2. Shaoshi Yang

Papers from Ying Hung Gan's perspective

Ordered by how strongly the researchers Ying Hung Gan trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Closest point search in lattices (IEEE Transactions on Information Theory)
  2. Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction (Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674))
  3. Efficient algorithm for decoding layered space-time codes
  4. On the complexity of sphere decoding in digital communications (IEEE Transactions on Signal Processing)
  5. Lattice-reduction-aided detectors for MIMO communication systems (Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE)
  6. Lattice code decoder for space-time codes (IEEE Communications Letters)
  7. High-rate codes that are linear in space and time (IEEE Transactions on Information Theory)
  8. An efficient square-root algorithm for BLAST (2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100))
  9. MMSE extension of V-BLAST based on sorted QR decomposition (2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484))
  10. The Design and Analysis of Computer Algorithms

Their papers