Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems identified with the use of these shape-spaces, negative algorithm in general, when applied to anomaly detection. A straightforward self detector classification principle is proposed its performance compared a one-class support vector machine. Earlier work suggests that real-value requires single class learn from. The investigations presented this paper reveal, however, detection, techniques require...

Acoustic and optical televiewers are becoming routinely used to capture structural geotechnical data for use in pit slope underground design.They provide rapid accurate high resolution oriented images of the borehole walls can be as a replacement manual core orientation techniques, with picking structures being left televiewer operator who then engineers.SRK UK Ltd. has developed an approach where raw acoustic logs conjunction rock mass logging core.This hybrid method allows detailed...

In recent years coarsely quantized LDPC decoding using a flooding schedule has been extensively studied. However, there exist few works addressing coarse quantization for layered schedule, which enables improved convergence speed of the message passing algorithm. The can especially be beneficial high throughput applications like fiber optical systems. This paper presents innovative approaches, where information bottleneck method is used design different decoder architectures. varieties...

According to the ancient Romans, “Delectare, docere, movere” are goals of eloquence. To be accepted by museums, landscapes and archaeological sites, technology has win same challenge. Is unobtrusive enough avoid compromising emotional involvement that makes a visit cultural site unforgettable? Can it achieve dissemination information in such way is understood better? And how can used increase visibility understanding numerous sites not yet able attract amount people they deserve? This paper...

Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check nodes requires expensive non-uniform operations. Instead, we propose to use uniform with a simple hardware structure, which reduces complexity of individual node operations approximately by half shortens decoding delay significantly. Our analysis shows loss preserved resulting from restriction is very small....

An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, decoding performs concatenated compression the received channel to aggregate compact reliability information error correction. These or mappings can be considered as lookup tables. For codes, design boils down constructing tables upper lower branches of building blocks within code structure. A key challenge realize a...

This paper presents novel techniques for improving the error correction performance and reducing complexity of coarsely quantized 5G-LDPC decoders. The proposed decoder design supports arbitrary message-passing schedules on a base-matrix level by modeling exchanged messages with entry-specific discrete random variables. Variable nodes (VNs) check (CNs) involve compression operations designed using information bottleneck method to maximize preserved mutual between code bits messages. We...

We enhance coarsely quantized LDPC decoding by reusing computed check node messages from previous iterations. Typically, variable and nodes generate replace old in every iteration. show that, under coarse quantization, discarding involves a significant loss of mutual information. The is avoided with additional memory, improving performance up to 0.36 dB. propose modified information bottleneck algorithm design operations taking the iteration(s) into account as side Finally, we reveal 2-bit...

This paper proposes a turbo equalizer for intersymbol interference channels (ISI) that uses coarsely quantized messages across all receiver components. Lookup tables (LUTs) carry out compression operations designed with the information bottleneck method aiming to maximize relevant mutual information. The setup consists of an and decoder provide extrinsic each other over multiple iterations. We develop simplified LUT structures incorporate feedback in significantly reduced complexity....

For improving coarsely quantized decoding of LDPC codes, we propose a check node aware design the variable update. In contrast to previous works, optimize explicitly maximize mutual information preserved in check-to-variable instead variable-to-check messages. The extended optimization leads significantly different solution for compression operation at node. Simulation results regular codes confirm that design, especially very coarse quantization with 2- or 3-bit messages, achieves...

Next-generation satellite communication systems require high spectral efficiency to meet future data rate requirements. Faster-than-Nyquist signaling offers improvement potential by exploiting excess bandwidth of the transmit pulses at price inter-symbol interference. This paper studies sophisticated receiver structures that lead linear discrete minimum phase models with uncorrelated noise. They enable equalization interference feasible complexity in trellis-based decoders. Another challenge...

<p>The concept of structure engineering has been proposed for the exploration next generation radiation detectors with improved performance. A Time Of Flight Positron Emission Tomography (TOF-PET) scanner heterostructured scintillators a pixel size 3.0×3.1×15 mm<sup>3</sup> was simulated. The heterostructures consisted alternating layers BGO as dense material high stopping power and plastic fast light emitter. Using GATE simulation toolkit, detector time resolution...

This paper leverages the information bottleneck method to design receivers for ISI channels working with coarsely quantized messages. The proposed equalizer is based on forward-backward algorithm. In contrast conventional approaches, state reliability exchanged a finite alphabet message instead of real-valued probability vector. Moreover, each node update performs only single lookup many arithmetic operations. table construction aims at maximizing preserved relevant mutual information. We...