Quantized compute and forward: A low-complexity architecture for distributed antenna systems

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 420-424

  Hong, Song Nam ^a   Caire, Giuseppe ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Compute and Forward; Distributed Antenna Systems; Network Coding; Relay Networks

Indexed keywords

ANTENNA ELEMENT; BELIEF PROPAGATION DECODING; CODING BLOCKS; COMPUTE-AND-FORWARD; DISTRIBUTED ANTENNA SYSTEM; GAUSSIAN ELIMINATION; INFORMATION MESSAGES; LINEAR COMBINATIONS; LOW-COMPLEXITY; LOW-COMPLEXITY ARCHITECTURE; NON-BINARY LDPC CODES; RELAY NETWORK; SCALAR QUANTIZATION; SYSTEM SIZE;

CODES (SYMBOLS); ERROR CORRECTION; MOBILE ANTENNAS;

NETWORK CODING;

EID: 83655202670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089493     Document Type: Conference Paper

References (23)

1. A. F. Molisch, Wireless Communications, IEEE Press - Wiley, 2005.
2. M. Etoh, T. Ohya, and Y. Nakayama, "Energy Consumption Issues on Mobile Network Systems," in Proc. of the IEEE Int. Symp. on Application and the Internet (SAINT), Turku, Finland, Jul-Aug. 2008.
3. M. Gruber, O. Blume, D. Ferling, D. Zeller, M. Imran, and E. Strinati, "EARTH Energy Aware Radio and Network Technologies," in Proc. of the Int. Symp. on Personal, Indoor and Mobile Radio Commun. (PIMRC), Tokyo, Japan, Sept. 13-16, 2009.
4. A. Sanderovich, O. Somekh, and S. Shamai (Shitz), "Uplink macro diversity with limited backhaul capacity," in Proc. of the IEEE Int. Symp. on Inform. Theory (ISIT), Nice, France, Jun. 2007.
5. S. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans, of Inform. Theory, vol. 57, pp. 1872.1905, April 2011.
6. S. Lim, Y. H. Kim, A. E. Gamal, and S. Chung, "Noisy network coding," submitted to IEEE Trans. Inform. Theory, Mar. 2010. [Online] Available: http://arXiv:1002.3188.
7. A. Ozgur and S. Diggavi, "Approximately achieving Gaussian relay network capacity with lattice codes," submitted to IEEE Trans. Inform. Theory, Mar. 2010. [Online] Available: http://arXiv:1005.1284.
8. B. Nazer and M. Gastpar, "Compute-and-Forward: Harnessing Interference through Structured Codes," accepted for IEEE Trans. Inform. Theory, Nov. 2010. [Online]. Available: http://arxiv.org/abs/0908.2119.
9. C. Feng, D. Silva, and F. Kschischang, "An algebraic approach to physical-layer network coding," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Austin, Tx, Jun. 2010.
10. B. Nazer, A. Sanderovich, M. Gastpar, and S. Shamai, "Structured Superposition for Backhaul Constrained Cellular Uplink," in Proc. of the IEEE Int. Symp. on Inform. Theory (ISIT), Seoul, Korea, Jun. 2009.
11. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans, on Net., vol. 11, pp. 782-795, Oct. 2003.
12. R. Walden, "Analog-to-Digital Converter Survey and Analysis," IEEE J. Select. Areas Comm., vol. 17, pp. 539-550, Apr. 1999.
13. J. Singh, P. Sandeep, and U. Madhow, "Multi-Gigabit Communication: the ADC Bottleneck," in Proc. of IEEE Int. Conf. Ultra-Wideband (ICUWB), Vancouver, Canada, Sept. 2009.
14. R. L. Dobrushin, "Asymptotic optimality of group and systematic codes for some channels," Theor. Probab. Appl, 8:47.59, 1963.
15. A. Bennatan and D. Burshtein, "Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels," IEEE Trans. Inform. Theory, vol. 52, pp. 549-583, Feb. 2006.
16. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate-Repeat-Accumulate Codes," IEEE Trans. Comm., vol. 55, pp. 692-702, Apr. 2007.
17. G. D. Forney, Jr, "On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, Il, 2003.
18. A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients", Math. Ann., Vol. 261, pp. 515.534, 1982.
19. M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point", IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389.2401, Oct. 2003.
20. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protograph," IPN Progress Report 42.154, JPL, Aug. 2003
21. S.-E. Park, C. Lim, T. Lestable, J. Kim, and K. Yang, "A Class of Structured LDPC Codes over GV (q) for Efficient Encoding," in Proc. Vehicular Technology Conference (VTC), Dublin, Ireland, Apr. 2007.
22. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest, France, Sep. 2000.
23. S.-N. Hong, H.-G. Joo, and D.-J. Shin, "Optimal Puncturing of Block-Type LDPC Codes and Their Fast Convergence Decoding," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, USA, Jul. 2006.