4 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 4 / 4
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.Yayın Low complexity least minimum symbol error rate based post-distortion for vehicular VLC(Institute of Electrical and Electronics Engineers Inc., 2020-10-22) Mitra, Rangeet; Miramirkhani, Farshad; Bhatia, Vimal; Uysal, MuratVehicular visible light communications (VLC) has emerged as a viable supplement for high speed next-generation vehicle to vehicle (V2V) communication systems. However, performance of a V2V-VLC link is impaired due to nonlinear transfer-characteristics of light emitting diodes (LEDs), and inter-symbol interference (ISI). In this article, a low-complexity least-squares based post-distortion algorithm is formulated over reproducing kernel Hilbert space (RKHS) for a multi-hop V2V-VLC link. The impairments encountered in V2V-VLC channels are mitigated in RKHS by a minimum symbol error-rate post-distorter using a low dimensional approximation of random Fourier features (RFF) (which is a soft approximation of the feature-map to RKHS), that facilitates computationally simple post-distortion under finite memory-budget. The convergence and the BER-performance of the proposed post-distorter is analyzed over realistic V2V VLC channels obtained via ray-tracing. From the analysis, and the presented computer-simulations, the proposed post-distorter is found to exhibit equivalent convergence characteristics and error-rate over reasonable distances, with much lower computational complexity.Yayın A hierarchical key assignment scheme: a unified approach for ccalability and efficiency(IEEE, 2024-05-24) Çelikbilek, İbrahim; Çeliktaş, Barış; Özdemir, EnverThis study introduces a hierarchical key assignment scheme (HKAS) based on the closest vector problem in an inner product space (CVP-IPS). The proposed scheme offers a comprehensive solution with scalability, flexibility, cost-effectiveness, and high performance. The key features of the scheme include CVP-IPS based construction, the utilization of two public keys by the scheme, a distinct basis set designated for each class, a direct access scheme to enhance user convenience, and a rigorous mathematical and algorithmic presentation of all processes. This scheme eliminates the need for top-down structures and offers a significant benefit in that the lengths of the basis sets defined for classes are the same and the costs associated with key derivation are the same for all classes, unlike top-down approaches, where the higher class in the hierarchy generally incurs much higher costs. The scheme excels in both vertical and horizontal scalability due to its utilization of the access graph and is formally proven to achieve strong key indistinguishability security (S-KI-security). This research represents a significant advancement in HKAS systems, providing tangible benefits and improved security for a wide range of use cases.
