|
[1] WAN H. KIM, and CHARLES V. FREIMAN, “Single Error-Correcting Codes for Asynnetric Binary Channels” IRE Trans. Inform. Theory, vol. IT-1, pp. 62-66, June. [2] Beooru, C, Glavieux, A., and Thitimajshima, P., “Near Shannon limit error-correcting coding and decoding: Turbo-codes” IEEE International Conference on Communications, ICC’93, Geneva. Vol. 2, 1993, pp. 1064 – 1070. [3] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. -284 – 287, March 1974. [4] J.Vogt, K. Koora, A.Finger and G. Fettweis, “Comparison of Different Turbo Decoder Realizations for IMT-2000,” GLOBECOM 99, pp. 2704 – 2708, Dec. 1999. [5] Forney, G. D., Concatenated codes, Cambridge, Massachusetts: M.I.T Press, 1996. [6] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260 – 269, Apr. 1967. [7] A. J. Viterbi and J. K. Omura. “Principles of digital communication and coding. New York”: MacGraw-Hill, 1979. [8] J. B. Cain, G. C. Clark, and J. M. Geist, “Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 97 – 100, Jan 1979. [9] E. Dunscombe and F. C. Piper, “Optimal interleaving scheme for convolutional coding,” Electron. Lett., vol. 25, no. 22, pp. 1517 – 1518, Oct. 1989. [10] Hagenauer, J. “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. On Information Theory, vol. 42, on. 2, March 1996, pp. 429 – 278, Mar. 1973. [11] Robertson, P., Villebrun, E., and Hoeher, P. “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” IEEE International Conference on Communications, ICC ’95, Seattle, 1955, vol. 2, 1955, pp. 1009 – 1013. [12] Forney, G. D., “The Viterbi algorithm,” Proc. IEEE, Vol. 61, pp. 268 – 278 Mar. 1973. [13] H. Shen and A. Ghrayeb, “Analysis of the outage probability for MIMO systems with receive antenna selection,” IEEE Trans. Veh. Technol., vol.55, pp. 1435–1441, July 2006. [14] L. Zheng and D. N. C. Tse, “Diversity and multiplexing: A fundamental tradeoff in multiple antenna channels, ” IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073–1096, May 2003. [15] G. J. Foschini and M. J. Gans, “On limits of wireless communication in a fading environment when using multiple antennas,” Wireless Personal Commun., vol. 6, no. 3, pp. 311–335, Mar. 1998. [16] I. E. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans.Telecom., vol. 10, no. 6, pp. 585–595, Nov. 1999. [17] F. R. Farrokhi, G. J. Foschini, A. Lozano, and R. Valenzuela, “Linkoptimal space-time processing with multiple transmit and receive antennas,” IEEE Commun. Lett., vol. 5, no. 3, pp. 85–87, Mar. 2001. [18] A. T. James, “Distributions of matrix variates and latent roots derived from normal samples,” Ann. Math. Statist., vol. 35, no. 1, pp. 475–501, 1964. [19] K. I. Gross and D. S. P. Richards, “Total positivity, spherical series, and hypergeometric functions of matrix argument,” Journal of Approximation Theory, vol. 59, pp. 224–246, 1989. [20] J. Spanier and K. B. Oldham, Eds., An Atlas of Functions. NewYork : HemispherePublishing Corporation, 1987. [21] R. A. Fisher, “The general sampling distribution of the multiple correlation coefficient,” in Proc. Roy. Soc. London Ser. A, vol. 121, 1928, pp. 654–673. [22] N.Metropolis, "The Beginning of the Monte Carlo Method." Los Alamos Science, No. 15, p. 125., 1987 [23] Mark Danny, “Introduction to importance sampling in rare-event simulations”, European Journal of Physics, Volume 22, Number 4 , pp. 403-411(9), 2001
|