Rate Allocation for Noncollaborative Multiuser Speech Communication Systems Based on Bargaining Theory

We propose a novel rate allocation algorithm for multiuser speech communication systems based on bargaining theory. Specifically, we apply the generalized Kalai-Smorodinsky bargaining solution since it allows varying bargaining powers to match the dynamic nature of speech signals. We propose a novel method to derive bargaining powers based on the short-time energy of the input speech signals, and subsequently allocate rates accordingly to the users. An important merit of the proposed framework is that it is general and can be applicable for resource allocation across a variety of multirate speech coders, and it is robust to a variety of speech quality metrics. The proposed system is also shown to involve a quick and low-complexity training process. We generalize the algorithm to scenarios in which users have unequally weighted priorities. These scenarios might arise in emergency situations, in which certain users are more important than others. The proposed rate allocation system is shown to increase the utility measures for both the Itakura and segmental signal-to-noise ratio (SNR) functions relative to the baseline system that performs uniform rate allocation. Additionally, although the instantaneous bitrate resolution of the speech encoder is not changed, the proposed system is shown to increase the short-time average bitrate resolution, and therefore provides a greater number of operational rate modes for the network

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  J. Nash THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[3]  H. Raiffa 21. Arbitration Schemes for Generalized Two-person Games , 1953 .

[4]  K. W. Cattermole,et al.  Principles of pulse code modulation , 1969 .

[5]  E. Kalai,et al.  OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[7]  Jonathan G. Fiscus,et al.  Darpa Timit Acoustic-Phonetic Continuous Speech Corpus CD-ROM {TIMIT} | NIST , 1993 .

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[9]  Biing-Hwang Juang,et al.  Fundamentals of speech recognition , 1993, Prentice Hall signal processing series.

[10]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[11]  I. Forkel,et al.  Dynamic channel allocation in UMTS terrestrial radio access TDD systems , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[12]  R. Tafazolli,et al.  Dynamic spectrum allocation in a multi-radio environment: concept and algorithm , 2001 .

[13]  Carlos Teixeira,et al.  A Summary of Dynamic Spectrum Allocation Results from DRiVE , 2002 .

[14]  Juan Carlos,et al.  Review of "Discrete-Time Speech Signal Processing - Principles and Practice", by Thomas Quatieri, Prentice-Hall, 2001 , 2003 .

[15]  Abeer Alwan,et al.  Speech Coding: Fundamentals and Applications , 2003 .

[16]  Fernando Paganini,et al.  Game theoretic approach to power control in cellular CDMA , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[17]  Christopher A. Mattson,et al.  Pareto Frontier Based Concept Selection Under Uncertainty, with Visualization , 2005 .

[18]  Eytan Modiano,et al.  Wireless channel allocation using an auction algorithm , 2006, IEEE Journal on Selected Areas in Communications.

[19]  Mihaela van der Schaar,et al.  Bargaining Strategies for Networked Multimedia Resource Management , 2007, IEEE Transactions on Signal Processing.