IEEE/CAM Information Theory Workshop at Cornell最新文献_第3页

A general parity check equation for rotationally invariant trellis codes 旋转不变格码的一般奇偶校验方程

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761403

S. S. Pietrobon, G. Ungerboeck, D. Costello

引用次数: 0

Minimum Complexity Estimation 最小复杂度估计

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761423

A. Barron

引用次数: 0

Information Storage Problems 信息存储问题

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761431

Z. Zhang

引用次数: 0

Bounds on the Binary Symmetric Cut-off Rate with Application to the Peak-and Slope-limited Magnetization Model 二元对称截止率的边界及其在峰-坡限制磁化模型中的应用

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761425

S. Shamai, A. Dembo

引用次数: 0

Time-Hopping and Frequency-Hopping Multiple-Access Packet 跳时和跳频多址分组

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761415

A. W. Lam, D. Sarwate

{"title":"Time-Hopping and Frequency-Hopping Multiple-Access Packet","authors":"A. W. Lam, D. Sarwate","doi":"10.1109/ITW.1989.761415","DOIUrl":"https://doi.org/10.1109/ITW.1989.761415","url":null,"abstract":"Time-hopping and frequency-hopping multiple-access (TH/FH MA) can be regarded as a hybrid product of timehopping multiple-access (THMA) and frequency-hopping multiple-access (FHMA) schemes. In THEHMA communication systems, a message of duration T seconds is encoded into n subpackets each of duration T/k seconds via a (n,k) Reed-Solomon error correcting code. The codewords are interleaved so that all the symbols in the same coordinate of the codewords are contained in the same subpacket. Thus, the information in the message packet can be recovered from any k of the n subpackets. The channel time is slotted into time slots of duration equal to TA seconds and the time interval [iT/k,(i+l)T/k) is referred to as the ith time slot. The available frequency spectrum is slotted into q noninterfering frequency slots of equal bandwidth. If the system is slot-synchronous, then subpackets are transmitted and received within the time slots. The n subpackets are transmitted in some n time slots via some n frequencies chosen according to a time- hopping pattern and a frequency-hopping pattern, respectively. Different terminals can be assigned different time-hopping and frequency-hopping patterns, or the terminals can be divided into groups with every member in the same group using the same time-hopping and frequency-hopping patterns. Since the terminals are hopping in both the time and the frequency domains, a subpacket hit occurs when and only when two or more terminals are transmitting in the same time slot and also in the same frequency slot. In this paper, it is assumed that the channel is noiseless and all the subpacket hits are correctly detected and erased. The received message packet will be correctly decoded by the receiver unless it suffers more than n-k subpacket hits. The results in this talk can be easily extended to include undetected hits and a noisy channel. It is possible to design time-hopping and frequency-hopping patterns such that if two terminals transmit at the same time, then they rarely transmit at the same frequency. Conversely, it can also be arranged that if two transmissions are to be transmitted at the same frequency, then such transmissions will seldom occur at the same time. If only a few subpacket transmissions are erased in the collisions, then the receiver will be able to reconstruct the message packet from the uncollided subpackets using an erasure- correcting decoder.","PeriodicalId":413028,"journal":{"name":"IEEE/CAM Information Theory Workshop at Cornell","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122020907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Completely asynchronous multiple-access channels 完全异步多址通道

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761409

S. Verdú

引用次数: 0

Multidimensional signal set design for transmission over parallel channels 并行信道传输的多维信号集设计

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761404

P. Fortier, A. Ruiz, J. Cioffi

引用次数: 2

Robust Signal Detection and Estimation: A Geometric Approach 鲁棒信号检测与估计:一种几何方法

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761418

R. Barton, H. Poor

{"title":"Robust Signal Detection and Estimation: A Geometric Approach","authors":"R. Barton, H. Poor","doi":"10.1109/ITW.1989.761418","DOIUrl":"https://doi.org/10.1109/ITW.1989.761418","url":null,"abstract":"In this paper, we consider the problems of f2 estimation and signal detection in the presence of uncertainty regarding the statistical structure of the problem. These problems, which fall within the more general context of robust signal processing, have been studied in recent years by several investigators. In this paper, we formulate and analyze the robust estimation and detection problems in the context of reproducing kernel Hilbert space (RKHS) theory. The relationship between classical detection/estimation and RKHS theory is well-known, but as far as we know, the theory has not been applied previously to the study of robust estimation and detection. By using an RKHS approach, we are able to generalize the notion of a linear filter and to give necessary and sufficient conditions for such a filter to be robust in the minimax sense for the general L2-estimation problem in which there is uncertainty in both the covariance structure of the observed process X = X(t) and the cross-covariance structure of X and Z, the variable to be estimated. We have shown that, under mild regularity conditions, the robust filter can be found by solving a related minimization problem. We also give conditions sufficient to insure that the robust filter exists. In particular, we show that, if the Covariance structure of the observed process is assumed to be known, so that the only uncertainty is in the crosscovariance structure of X and Z, then a robust filter will always exist and can be found by solving a straightforward minimization problem. A somewhat surprising consequence of this analysis is the striking similarity between these results for the general robust f2-estimation problem and results given previously by the second author relating to robust matched filtering. Reformulating the robust matched filtering problem in an RKHS context allows us to generalize these previous results and clearly reveals the underlying similarity between the robust estimation and matched filtering problems. In fact, the structures of minimax solutions to the two problems are seen to be virtually identical. As a final application of the RKHS approach to robustness, we consider the problem of robust quadratic detection of a Gaussian signal in the presence of Gaussian noise, in which the deflection ration is used as a performance criterion. We show that this problem also can be formulated in an RKHS context, and, when the structure of the noise covariance is assumed to be known, is exactly analogous to the robust matched filtering problem. If the covariance structure of the noise is also unknown, the robust quadratic detection problem can be embedded in a larger problem, which is again analogous to the robust matched filtering problem. A robust filter for this larger problem will then possess desirable robustness properties when applied to the quadratic detection problem. The approach presented in this paper, in addition to providing a unified view of the problems discussed above, pro","PeriodicalId":413028,"journal":{"name":"IEEE/CAM Information Theory Workshop at Cornell","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133975637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robustness: a qualitative approach 稳健性:一种定性方法

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761417

K. Vastola

引用次数: 1

Recent results an coherent frequency hopping 最近的研究结果是相干跳频

IEEE/CAM Information Theory Workshop at Cornell Pub Date : 1989-06-25 DOI: 10.1109/ITW.1989.761416

L. Milstein

引用次数: 0