Wireless Communications

It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

National Institute of Standards and Technology における超伝導研究及び生活

Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.

/pdf/a-survey-of-monte-carlo-tree-search-methods-2mj9olkdni.pdf

A Survey of Monte Carlo Tree Search Methods

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.

/pdf/reduced-complexity-iterative-decoding-of-low-density-parity-1mvw7z7d8k.pdf

Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

We analyze the performance of the clipped orthogonal frequency division multiplexing (OFDM) system in terms of peak power reduction capability and degradation of channel capacity. The clipping is performed on the baseband OFDM signals with and without oversampling, followed by the ideal low-pass filter. First, the effect of the envelope clipping on the peak-to-average power ratio (PAPR) and the instantaneous power of the band-limited OFDM signal is studied. We then discuss the channel capacity of the oversampled and clipped OFDM signals over the additive white Gaussian noise and ideally interleaved Rayleigh fading channels. The capacity is calculated based on the assumption that the distortion terms caused by the clipping are Gaussian. It is shown that the SNR penalty due to the clipping can be considerably alleviated by using optimal coding and reducing the information data rate. The results are justified by the simulation results using near optimal turbo codes.

Performance analysis of deliberately clipped OFDM signals

The distribution of the peak-to-average power ratio (PAPR) in strictly band-limited orthogonal frequency-division multiplexing (OFDM) signals is studied. Assuming that the base-band OFDM signal is characterized as a band-limited complex Gaussian process, we first attempt to derive the exact distribution of the PAPR in the band-limited OFDM signals. Since this distribution cannot be expressed in a closed form, we further develop a simple closed-form approximation, based on the level-crossing rate analysis. Comparisons of the proposed distributions with those obtained by computer simulations show good agreement and convergence with an increase in the number of subcarriers.

On the distribution of the peak-to-average power ratio in OFDM signals

Attribute-based encryption (ABE) system enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. There are two flavors of ABE, namely key-policy and ciphertext-policy, depending on which of private keys or ciphertexts that access policies are associated with. In this paper we propose a new cryptosystem called Broadcast ABE for both flavors. Broadcast ABE can be used to construct ABE systems with direct revocation mechanism. Direct revocation has a useful property that revocation can be done without affecting any non-revoked users; in particular, it does not require users to update keys periodically. For key-policy variant, our systems appear to be the first fully-functional directly revocable schemes. For ciphertext-policy variant, our systems improve the efficiency from the previously best revocable schemes; in particular, one of our schemes admits ciphertext and private key sizes roughly the same as the currently best (non-revocable) ciphertext-policy ABE. Broadcast ABE can also be utilized to construct multi-authority ABE in the disjunctive setting.

Hideki Imai

Papers

Reduced complexity iterative decoding of low-density parity check codes based on belief propagation

Performance analysis of deliberately clipped OFDM signals

On the distribution of the peak-to-average power ratio in OFDM signals

Conjunctive Broadcast and Attribute-Based Encryption

How to construct efficient signcryption schemes on elliptic curves