Optimization of half-rate codec assignment in GERAN

Wireless Personal Communications

Volumn 34, Issue 3, 2005, Pages 321-331

  Toril, M ^a   Ferrer, R ^b   Pedraza, S ^b   Wille, V ^c   Escobar, J J ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b Edif Inst Universitarios   (Spain)

^c NOKIA SIEMENS NETWORKS   (Finland)

Author keywords

Codec; Mobile; Network; Optimization; Traffic

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DATA ACQUISITION; ENCODING (SYMBOLS); OPTIMIZATION; RADIO COMMUNICATION; TELECOMMUNICATION TRAFFIC; TRANSCEIVERS;

CODEC; ENHANCED DATA RATES FOR GLOBAL EVOLUTION (EDGE); HALF-RATE (HR) CHANNEL CODING; NETWORK CONGESTION REDUCTION;

GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS;

EID: 27144537788     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-005-4827-9     Document Type: Article

References (17)

1. T. Toftegaard and J. Wigard, Performance Enhancements in a Frequency Hopping GSM Network, Kluwer Academics Publishers, Dordrecht, 2000.
2. T. Halonen, J. Romero, and J. Melero, GSM, GPRS and EDGE Performance, 2nd edn., Wiley, New York, 2003.
3. V. Wille, S. Pedraza, M. Toril, R. Ferrer, and J.J. Escobar, "Trial Results from Adaptive Hand-Over Boundary Modification in GERAN", Electronics Letters , Vol. 39, No. 4, pp. 405-407, February 2003.
4. B. Eklund, "Channel Utilization and Blocking Probability in a Cellular Mobile Telephone System with Directed Retry", IEEE Transactions Communications, Vol. 34, No. 4, pp. 329-337, April 1986.
5. M. Mouly and M.B. Pautet, "The GSM System for Mobile Communications", Cell & Systems, p. 189, 1992.
6. 3GPP TS 06.02, Half-Rate Speech Processing Function, GSM-Phase2+, release 99.
7. 3GPP TS 45.001, Physical Layer on the Radio Path; General Description, GSM/EDGE Radio Access? Network, release 6.
8. 3GPP TS 45.003, Channel Coding, GSM/EDGE Radio Access Network, release 6.
9. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
10. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer Verlag, Berlin, 2003.
11. S. Martello and P. Toth, "Algorithms for Knapsack Problems", in S. Martello (ed.), Surveys in Combinatorial Optimization, Vol. 31 of Annals of Discrete Mathematics, North-Holland, 1987, pp. 213-258.
12. G. Carpaneto, S. Martello, and P. Toth, "Algorithms and Codes for the Assignment Problem", in B. Simeone, P. Toth, G. Gallo, F. Maffioli, and S. Pallottino (eds.), FORTRAN Codes for Network Optimization; Annals of Operations Research, Vol 13, 1988.
13. S. Martello, D. Pisinger, and P. Toth, "New Trends in Exact Algorithms for the 0-1 Knapsack Problem", European Journal of Operational Research, Vol. 123, pp. 325-332, 2000.
14. G.B. Dantzig, "Discrete Variable Extremum Problems", Operations Research Vol. 5, pp. 266-277, 1957.
15. H.A. Taha, Integer Programming: Theory, Applications and Computations, Academic Press, New York, 1975, pp. 276-285.
16. L. Kleinrock, Queueing Theory, Vol. I, Wiley, New York, 1975.
17. ITU-D SG2 Q16/2, Teletraffic Engineering Handbook, Geneva, 2003, p. 125.