Abstract
We consider a CDMA cell with multiple terminals transmitting video signals. We minimize the sum of signal processing and transmitter power while the received quality at each terminal is guaranteed. The system parameters to be adjusted include video coding bit rate, video compression complexity and transmitter power. Instead of full search in the space of {bit rate, complexity, transmitter power} for all users, we design a two-step fast algorithm to reduce the computation burden in the base station. In our algorithm, the search in the base station is over the space of complexity only. Our results indicate that, for the same class of video users, the one who is closest to the base station compresses at least complexity. This is used to further reduce the computation required by our algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
