| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| 9 |      | Luay Azzam, Ender Ayanoglu: A novel maximum likelihood decoding algorithm for orthogonal space-time block codes. IEEE Transactions on Communications 57(3): 606-609 (2009) |
| 8 | | Luay Azzam, Ender Ayanoglu: Real-valued maximum likelihood decoder for quasi-orthogonal space-time block codes. IEEE Transactions on Communications 57(8): 2260-2263 (2009) |
| 7 | | Luay Azzam, Ender Ayanoglu: Reduced complexity sphere decoding via a reordered lattice representation. IEEE Transactions on Communications 57(9): 2564-2569 (2009) |
| 2008 | ||
| 6 | | Luay Azzam, Ender Ayanoglu: An Efficient Tree Search for Reduced Complexity Sphere Decoding. GLOBECOM 2008: 4070-4073 |
| 5 | | Luay Azzam, Ender Ayanoglu: Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes. GLOBECOM 2008: 4196-4201 |
| 4 | | Luay Azzam, Ender Ayanoglu: Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes. GLOBECOM 2008: 4202-4206 |
| 3 | | Luay Azzam, Ender Ayanoglu: Maximum Likelihood Detection of Quasi-Orthogonal Space-Time Block Codes: Analysis and Simplification. ICC 2008: 3948-3954 |
| 2007 | ||
| 2 | | Luay Azzam, Ender Ayanoglu: Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation. GLOBECOM 2007: 4242-4246 |
| 1 | | Luay Azzam, Ender Ayanoglu: Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation CoRR abs/0705.2435: (2007) |
| 1 | Ender Ayanoglu | [1] [2] [3] [4] [5] [6] [7] [8] [9] |
Data released under the ODC-BY 1.0 license — See also our legal information page