2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Jointly optimal chunk and power allocation in uplink SC-FDMA(IEEE, 2013) Mert, Teoman; Kaya, Onur; Çırpan, Hakan AliFor a single carrier frequency division multiple access (SC-FDMA) system, we obtain the jointly optimal power and chunk allocation policies which maximize the sum rate. Our solution is applicable to both localized and interleaved subcarrier mapping schemes. We solve the joint optimization problem by sequentially solving two sub-problems: power allocation and chunk allocation. Primarily, we use an optimal power allocation algorithm, which we derive from Karush-Kuhn-Tucker (KKT) conditions; and then we convert the optimum chunk assignment problem into a maximum weighted matching problem on a bipartite graph, and hence solve it in polynomial time. We also propose two greedy chunk allocation algorithms with lower complexity, and demonstrate that these algorithms produce near optimal results, especially for interleaved subcarrier mapping, when used in conjunction with optimal power control.Yayın Wavelet-based image compression by hierarchical quantization indexing(IEEE, 2009) Ateş, Hasan Fehmi; Tamer, EnginIn this paper, we introduce the quantization index hierarchy, which is used for efficient coding of quantized wavelet coefficients. A hierarchical classification map is defined in each wavelet subband, which describes the quantized data through a series of index classes. Going from bottom to the top of the tree, neighboring coefficients are combined to form classes that represent some statistics of the quantization indices of these coefficients. Higher levels of the tree are constructed iteratively by repeating this class assignment to partition the coefficients into larger subsets. The class assignments are optimized using a rate-distortion cost analysis. The optimized tree is coded hierarchically from top to bottom by coding the class membership information at each level of the tree. Despite its simplicity, the algorithm produces PSNR results that are competitive with the state-of-art coders in literature.
