| 21. |
- Asraf, Daniel, et al.
(författare)
-
An analytical series expansion solution to the problem of noncoherent detection
- 2004
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 50:12, s. 3369-3375
-
Tidskriftsartikel (refereegranskat)abstract
- The well-known noncoherent detection problem concerns optimal detection of an amplitude-modulated sinusoid, with an unknown phase angle, corrupted by additive Gaussian noise. The classical solution to this problem is the noncoherent detector which is known to be optimal if the envelope belongs to a specific set of functions or satisfies the narrow-band approximation i.e., that the bandwidth of the envelope is narrow in comparison with the (carrier) frequency of the sinusoid. In this work, an analytical series expansion solution to the likelihood ratio for the noncoherent detection problem is derived. This solution offers a generalization of the noncoherent detector in which the conditions imposed on the envelope stated above have been relaxed. Analytical expressions for the joint probability density functions (pdfs) of the in-phase and quadrature components, jointly expressed in polar coordinates, are also derived under the signal-plus-noise and the noise-only hypotheses, respectively. Numerical simulations of the detector performance are presented in the form of receiver operating characteristics (ROC) and minimum probability of error curves. The results from a comparison of the general analytical solution with the classical noncoherent detector show significant differences between the two detectors when the narrow-band approximation does not hold.
|
|
| 22. |
- Asraf, Daniel, et al.
(författare)
-
Detection of Multiple Transient Signals with Unknown Arrival Times
- 2005
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 51:5, s. 1856-1860
-
Tidskriftsartikel (refereegranskat)abstract
- The problem of optimal detection of signal transients with unknown arrival times contaminated by additive Gaussian noise is considered. The transients are assumed to be time continuous and belong to a parameterized family with the uncertainty about the parameters described by means of an a priori distribution. Under the assumption of a negligible probability that the independent transient observations overlap in time, a likelihood ratio is derived for the problem of detecting an unknown number of transients from the family, each transient with unknown arrival time. The uncertainty about the arrival times is assumed to be equal for all transients and is also described by means of a distribution. Numerical simulations of the performance of detecting a particular transient signal family are presented in the form of receiver operating characteristics (ROCs) for both the optimal detector and the classical generalized likelihood ratio test (GLRT). The results show that the optimal detector yields noticeable performance improvements over the GLRT. Moreover, the results show that the optimal detector may still outperform the GLRT when the true and modeled uncertainties about arrival times no longer agree.
|
|
| 23. |
- Aulin, Tor, 1948
(författare)
-
Comment on “Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes”
- 2009
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 55:8, s. 3892-
-
Tidskriftsartikel (refereegranskat)abstract
- In a recent paper (Bai et al, IEEE Trans. Inf. Theory, 2007) an improved analysis concerning the analysis of List Decoding was presented. The event that the correct codeword is excluded from the list is central. For the additive white Gaussian noise (AWGN) channel an important quantity is the in (Bai et al, IEEE Trans. Inf. Theory, 2007) called effective Euclidean distance. This was earlier considered in (Aulin, IEEE Trans. Commun., 1999) under the name Vector Euclidean Distance, where also a simple mathematical expression for this quantity was easily derived for any list size. In (Bai et al, IEEE Trans. Inf. Theory, 2007), a geometrical analysis gives this when the list size is 1, 2 or 3.
|
|
| 24. |
- Austrin, Per, et al.
(författare)
-
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
- 2014
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 60:10, s. 6636-6645
-
Tidskriftsartikel (refereegranskat)abstract
- We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F-2. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly nontrivial coding theoretic constructions, whereas our reduction is elementary. As an additional feature, our reduction gives hardness within a constant factor even for asymptotically good codes, i.e., having constant positive rate and relative distance. Previously, it was not known how to achieve a deterministic reduction for such codes.
|
|
| 25. |
- Austrin, Per, 1981-, et al.
(författare)
-
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- 2018
-
Ingår i: IEEE Transactions on Information Theory. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0018-9448 .- 1557-9654. ; 64:2, s. 1368-1373
-
Tidskriftsartikel (refereegranskat)abstract
- Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian product is of the same size as their sumset, where the addition is pointwise over integers. For the size of the sumset of such a pair, van Tilborg has given an upper bound in the general case. Urbanke and Li, and later Ordentlich and Shayevitz, have given better bounds in the unbalanced case, that is, when either of the two sets is sufficiently large. Improvements to the latter bounds are presented.
|
|
| 26. |
- Bassi, German, et al.
(författare)
-
The Wiretap Channel With Generalized Feedback : Secure Communication and Key Generation
- 2019
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 65:4, s. 2213-2233
-
Tidskriftsartikel (refereegranskat)abstract
- It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this paper, an achievable scheme for the wiretap channel with generalized feedback is presented. This scheme, which uses the feedback signal to generate a shared secret key between the legitimate users, encrypts the message to be sent at the bit level. New capacity results for a class of channels are provided, as well as some new insights into the secret key agreement problem. Moreover, this scheme recovers previously reported rate regions from the literature, and thus it can be seen as a generalization that unifies several results in the field.
|
|
| 27. |
- Battaglioni, Massimo, et al.
(författare)
-
Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes
- 2021
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 67:4, s. 2217-2235
-
Tidskriftsartikel (refereegranskat)abstract
- Time-varying spatially coupled low-density parity-check (SC-LDPC) codes with very large period are characterized by significantly better error rate performance and girth properties than their time-invariant counterparts, but the number of parameters they require to be described is usually very large and unpractical. Time-invariant SC-LDPC codes, which can be seen as periodically time-varying codes with unitary period, are represented through a small number of parameters and designed exploiting few degrees of freedom, but their error rate performance and girth properties are sub-optimal. In this paper, we show that the limits of time-invariant SC-LDPC codes can be overcome by transforming them into time-varying SC-LDPC codes with very small period. In particular, we show that periodically time-varying SC-LDPC codes with small period may exhibit significantly better girth properties than the corresponding time-invariant codes by exploiting a larger number of degrees of freedom in the code design, which however scale at most linearly with the product of the code period and the size of the considered base matrix.
|
|
| 28. |
- Björnson, Emil, et al.
(författare)
-
Massive MIMO Systems With Non-Ideal Hardware : Energy Efficiency, Estimation, and Capacity Limits
- 2014
-
Ingår i: IEEE Transactions on Information Theory. - : IEEE Press. - 0018-9448 .- 1557-9654. ; 60:11, s. 7112-7139
-
Tidskriftsartikel (refereegranskat)abstract
- The use of large-scale antenna arrays can bring substantial improvements in energy and/or spectral efficiency to wireless systems due to the greatly improved spatial resolution and array gain. Recent works in the field of massive multiple-input multiple-output (MIMO) show that the user channels decorrelate when the number of antennas at the base stations (BSs) increases, thus strong signal gains are achievable with little interuser interference. Since these results rely on asymptotics, it is important to investigate whether the conventional system models are reasonable in this asymptotic regime. This paper considers a new system model that incorporates general transceiver hardware impairments at both the BSs (equipped with large antenna arrays) and the single-antenna user equipments (UEs). As opposed to the conventional case of ideal hardware, we show that hardware impairments create finite ceilings on the channel estimation accuracy and on the downlink/uplink capacity of each UE. Surprisingly, the capacity is mainly limited by the hardware at the UE, while the impact of impairments in the large-scale arrays vanishes asymptotically and interuser interference (in particular, pilot contamination) becomes negligible. Furthermore, we prove that the huge degrees of freedom offered by massive MIMO can be used to reduce the transmit power and/or to tolerate larger hardware impairments, which allows for the use of inexpensive and energy-efficient antenna elements.
|
|
| 29. |
- Blom, Rolf
(författare)
-
Bounds on key equivocation for simple substitution ciphers
- 1979
-
Ingår i: IEEE Transactions on Information Theory. - : IEEE. - 0018-9448 .- 1557-9654. ; 25:1, s. 8-18
-
Tidskriftsartikel (refereegranskat)abstract
- The equivocation of the key for a simple substitution cipher is upper and lower hounded, when the message source is memoryless. The hounds are shown to be exponentially tight. The results are compared with random ciphering. It is observed that the exponential behavior of the equivocation of the key is not determined by the redundancy in the message source, but by the symbol probabilities which are closest in a certain sense.
|
|
| 30. |
- Bocharova, Irina, et al.
(författare)
-
A BEAST for prowling in trees
- 2004
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 50:6, s. 1295-1302
-
Tidskriftsartikel (refereegranskat)abstract
- When searching for convolutional codes and tailbiting codes of high complexity it is of vital importance to use fast algorithms for computing their weight spectra, which corresponds to finding low-weight paths in their code trellises. This can be efficiently done by a combined search in both forward and backward code trees. A bidirectional efficient algorithm for searching such code trees (BEAST) is presented. For large encoder memories, it is shown that BEAST is significantly more efficient than comparable algorithms. BEAST made it possible to rind new convolutional and tailbiting codes that have larger free (minimum) distances than the previously best known codes with the same parameters. Tables of such codes are presented.
|
|
