1-4hit |
Kuo CAO Yueming CAI Yongpeng WU Weiwei YANG
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
Yoshinobu TAKEUCHI Akira OOYAGI
We consider the blind recovery problem such that images embedded with side information are given, and we want to obtain the side information under some prescribed constraints. In this case, the system equation becomes y=Ax+b where in addition to the unknown A and x, b also is an unknown quantity and but clearly not a noise component. We assume that several images with the same embedding side information are given, and the image processing to b is described as the perturbation of A. We formulate the optimization function to obtain A, b and x, under the constraint of some finite brightness levels i.e. finite alphabets.
Tomohiko UYEMATSU Fumio KANAYA
This paper considers the universal coding problem for stationary ergodic sources with countably infinite alphabets. We propose modified versions of LZ77 and LZ78 codes for sources with countably infinite alphabets. Then, we show that for any source µ with Eµ[log X1]<∞, both codes are asymptotically optimum, i.e. the code length per input symbol approaches its entropy rate with probability one. Further, we show that we can modify LZ77 and LZ78 codes so that both are asymptotically optimal for a family of ergodic sources satisfying Kieffer's condition.
Koji SHIBATA Takuma YAGI Takakazu SAKAI Atsushi NAKAGAKI
Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.