Results 231 to 240 of about 71,014 (263)

On characteristic polarization states in the cross-polarized radar channel

IEEE Transactions on Geoscience and Remote Sensing, 1992
The characteristic polarization states in the cross-polarized radar channel for the monostatic reciprocal case is derived based on a Stokes vector formulation. The optimization procedure for the channel power leads to an eigenvalue equation which explains the characteristic polarization state properties mathematically and physically.
Yoshio Yamaguchi, Wolfgang-Martin Boerner, Hyo Joon Eom, Masakazu Sengoku, Seiichi Motooka, Takeo Abe   +5 more
openaire   +1 more source

Relaxed channel polarization for reduced complexity polar coding

2015 IEEE Wireless Communications and Networking Conference (WCNC), 2015
Arikan's polar codes are proven to be capacity-achieving error correcting codes while having explicit constructions. They are characterized to have encoding and decoding complexities of l log l, for code length l. In this work, we construct another family of capacity-achieving codes that have even lower encoding and decoding complexities, by relaxing ...
Mostafa El-Khamy, Hessam Mahdavifar, Gennady Feygin, Jungwon Lee, Inyup Kang   +4 more
openaire   +1 more source

A simple proof of polarization and polarization for non-stationary channels

2014 IEEE International Symposium on Information Theory, 2014
We give a simple proof of Arikan's polarization phenomenon that uses only elementary methods. Using the same method, we show that Arikan's construction also polarizes non-stationary memoryless channels in the same way it polarizes stationary memoryless channels. This is a new result.
Alsan Mine, Telatar Emre
openaire   +1 more source

Characteristic polarization states in the cross-polarized radar channel

SPIE Proceedings, 1992
The characteristic polarization theory for the monostatic reciprocal coherent case in the cross- polarized radar channel is developed using a Stokes vector formalism. Power representation in terms of the Stokes vector and the Mueller matrix is utilized to determine the characteristic polarization states for optimal reception of the coherent wave.
Y. Yamaguchi, W.-M. Boerner, H.J. Eom, M. Sengoku, T. Abe   +4 more
openaire   +1 more source

On the Bit-Channels for Channel Polarization

2022 IEEE International Symposium on Information Theory (ISIT), 2022
Wen-Yao Chen, Chung-Chin Lu
openaire   +1 more source

Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels

IEEE Transactions on Information Theory, 2013
It is shown that polar codes, with their original (u,u+v) kernel, achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the synthesized channels are either useless, perfect or “partially perfect.” Any ...
Aria Ghasemian Sahebi, S. Sandeep Pradhan   +1 more
openaire   +1 more source

Polarization of quasi-static fading channels

2013 IEEE International Symposium on Information Theory, 2013
This work investigates polar coding for block-fading channels. We show that polarization does occur at infinity for three types of channel multiplexers. Nevertheless, the polarization process is not unique, as it is shaped by the choice of the multiplexer.
Joseph Jean Boutros, Ezio Biglieri
openaire   +1 more source

Polar Coding for Parallel Gaussian Channels

2019 IEEE International Symposium on Information Theory (ISIT), 2019
In this paper, we propose a polar coding scheme for parallel Gaussian channels. The encoder knows the sum capacity of the parallel channels (the capacity of each channel is assumed to be fractional) but does not know the capacity of any channel. By using the nesting property of polar codes, we design a coding/decoding scheme to achieve the sum capacity.
David Tse, Bin Li 0013, Kai Chen 0013, Ling Liu, Jiaqi Gu   +4 more
openaire   +1 more source

Universal Polar Coding for Asymmetric Channels

2018 IEEE Information Theory Workshop (ITW), 2018
We present a universal coding scheme, based on polar codes, that can achieve the compound capacity of any finite set of binary-input asymmetric channels. The scheme is a hybrid combination of Honda and Yamamoto’s polar coding scheme for asymmetric channels and a universal polar coding scheme for symmetric channels proposed by Hassani and Urbanke.
Karthik Nagarjuna, Paul H. Siegel
openaire   +1 more source

On the Channel-Specific Construction of Polar Codes

IEEE Communications Letters, 2015
We consider polar coding over a binary-input, discrete-output memoryless channel. We obtain bounds on the Bhattacharyya parameters of the so-called synthesized binary-input channels by using the Hamming weights of the rows of the generator matrix and the symmetric capacity of the underlying channel.
Huseyin Afser, Hakan Deliç
openaire   +1 more source