2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003. 2003
DOI: 10.1109/wcnc.2003.1200405
|View full text |Cite
|
Sign up to set email alerts
|

Power minimization under real-time source distortion constraints in wireless networks

Abstract: Abstract-In multiple access wireless networks with co-channel interference, allocating resources such as transmitted powers and source rates is a task critical to improve performance. In this paper, we introduce a new technique aimed at minimizing the overall transmitted power subject to constraints on the incurred source distortion. The technique is based on the use of real-time source codecs with externally adaptable output rate and Rate Compatible Punctured Convolutional (RCPC) channel encoders. We develop … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2006
2006
2010
2010

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…As we can see from the figure, the approximation in (13) is a good approximation for the qualitative behavior of the practical voice encoder, as well. Notice that the curve of the GSM-AMR NB coder simulations differs from 2 It is worthy of mention that the encoders in transmitters still encode according to the distortion defined in (5).…”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…As we can see from the figure, the approximation in (13) is a good approximation for the qualitative behavior of the practical voice encoder, as well. Notice that the curve of the GSM-AMR NB coder simulations differs from 2 It is worthy of mention that the encoders in transmitters still encode according to the distortion defined in (5).…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Since the constraint is satisfied by the approximation in (13), the optimization goal in (14) is equal to minimize . From (2), the overall power that satisfies can be written in a matrix form [5] …”
Section: B Pizza Party Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The R-D function for SD source encoders is frequently considered to be of the form R ¼ ð1=c 2 Þ logðc 1 =DÞ, where we are taking the logarithm with base e, and hence, R, the source encoding rate, is measured in nats per channel use. This form of R-D function can approximate or bound a wide range of practical systems such as video coding with an MPEG codec [20], speech using a CELP-type codec [21], or when the high rate approximation holds [6]. Assuming that highresolution approximation can be applied to the source encoding operation, each of the input samples can be modeled as a memoryless Gaussian source, showing a zero mean, unit-variance Gaussian distribution.…”
Section: System Modelmentioning
confidence: 99%
“…The D-R function for SD source codecs is frequently considered to be of the form D S (R S ) = c . This form of D-R function can approximate or bound a wide range of practical systems such as video coding with an MPEG codec [10], speech using a CELP-type codec [11], or when the high rate approximation holds. Assuming that each of the input signal samples are memoryless, following a zero-mean, unit-variance Gaussian distribution and if long block source codes are used, we have c 1 = 1, c 2 = 2 ( [12]).…”
Section: System Modelmentioning
confidence: 99%