Notes on channel capacity per unit cost
For the computation of the capacity per unit cost,an extension of the basic theorem connect the capacity per unit cost with the capacity-cost function was made,and the single peak of the generalized capacity-cost function per unit cost was proved.Then,an algorithm to locate the optimal point of the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2011-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74419362/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537118041538560 |
|---|---|
| author | TIAN Da-gang |
| author_facet | TIAN Da-gang |
| author_sort | TIAN Da-gang |
| collection | DOAJ |
| description | For the computation of the capacity per unit cost,an extension of the basic theorem connect the capacity per unit cost with the capacity-cost function was made,and the single peak of the generalized capacity-cost function per unit cost was proved.Then,an algorithm to locate the optimal point of the generalized capacity-cost function per unit cost based on the single peak of the function was proposed.Meanwhile,it was proved that the computation of the capac-ity-cost function,which is a constrained channel capacity issue,can be expressed as a convex optimization,to which the objective function is self-concordant.The algorithm and its computational complexity were given. |
| format | Article |
| id | doaj-art-624e842cd7354b50818ac25b41d7f6f2 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2011-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-624e842cd7354b50818ac25b41d7f6f22025-01-14T08:45:41ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2011-01-0132323874419362Notes on channel capacity per unit costTIAN Da-gangFor the computation of the capacity per unit cost,an extension of the basic theorem connect the capacity per unit cost with the capacity-cost function was made,and the single peak of the generalized capacity-cost function per unit cost was proved.Then,an algorithm to locate the optimal point of the generalized capacity-cost function per unit cost based on the single peak of the function was proposed.Meanwhile,it was proved that the computation of the capac-ity-cost function,which is a constrained channel capacity issue,can be expressed as a convex optimization,to which the objective function is self-concordant.The algorithm and its computational complexity were given.http://www.joconline.com.cn/zh/article/74419362/channel capacitychannel capacity per unit costself-concordant functionscomputational complexity |
| spellingShingle | TIAN Da-gang Notes on channel capacity per unit cost Tongxin xuebao channel capacity channel capacity per unit cost self-concordant functions computational complexity |
| title | Notes on channel capacity per unit cost |
| title_full | Notes on channel capacity per unit cost |
| title_fullStr | Notes on channel capacity per unit cost |
| title_full_unstemmed | Notes on channel capacity per unit cost |
| title_short | Notes on channel capacity per unit cost |
| title_sort | notes on channel capacity per unit cost |
| topic | channel capacity channel capacity per unit cost self-concordant functions computational complexity |
| url | http://www.joconline.com.cn/zh/article/74419362/ |
| work_keys_str_mv | AT tiandagang notesonchannelcapacityperunitcost |