The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we investigate the localization performance of far field sources that have sparse time-frequency (T-F) representations. The Cramér-Rao Bound (CRB) under the sparsity assumption is developed and the impact of the T-F sparsity prior on the localization performance is analyzed. In particular, one studies how the different T-F sparsity properties i.e. local SNR level, source supports spreading...
In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical results, we find that our technique gives better performance prediction compared to existing techniques.
Magnetic resonance imaging (MRI) is widely used to study population effects of factors on brain morphometry. Inference from such studies often require the simultaneous testing of millions of statistical hypotheses. Such scale of inference is known to lead to large numbers of false positive results. Control of the false discovery rate (FDR) is commonly employed to mitigate against such outcomes. However,...
In this paper, we propose an efficient channel coding scheme for anytime communications. We design this anytime code based on spatially coupled LDPC codes and investigate the performance over binary erasure channels. Through density evolution analysis, we asymptotically show the desired anytime properties of the proposed code. We also numerically predict the finite-length performance of the anytime...
Integer addition is a universal building block, and applications such as quad-precision floating-point or elliptic curve cryptography now demand precisions well beyond 64 bits. This study explores the trade-offs between size, latency and frequency for pipelined large-precision adders on FPGA. It compares three pipelined adder architectures: the classical pipelined ripple-carry adder, a variation that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.