Abstract: The present application discloses an active sorting muck-collecting device for slurry balancing shield, aiming at solving a technical problem that an existing muck-collecting device cannot provide reliable sorting function for a shield slurry circulation system. The device includes a sorting stirring cylinder, a circulation pipeline and a muck-collecting box, the sorting stirring cylinder includes an outer cylinder and a rotatable grid cylinder coaxially-configured. The grid cylinder is configured with a rotating shaft, and a spiral conveying mechanism is fixedly configured inside. The rotating shaft is fixedly connected with the grid cylinder. A circulation pipeline communicated with the grid cylinder is correspondingly configured below the grid cylinder. A muck-collecting box is fixedly configured below the circulation pipeline, and the muck-collecting box is communicated with the grid cylinder at where an output end of a slurry discharging pipeline locates.

Abstract: The present application discloses an active sorting muck-collecting device for slurry balancing shield, aiming at solving a technical problem that an existing muck-collecting device cannot provide reliable sorting function for a shield slurry circulation system. The device includes a sorting stirring cylinder, a circulation pipeline and a muck-collecting box, the sorting stirring cylinder includes an outer cylinder and a rotatable grid cylinder coaxially-configured. The grid cylinder is configured with a rotating shaft, and a spiral conveying mechanism is fixedly configured inside. The rotating shaft is fixedly connected with the grid cylinder. A circulation pipeline communicated with the grid cylinder is correspondingly configured below the grid cylinder. A muck-collecting box is fixedly configured below the circulation pipeline, and the muck-collecting box is communicated with the grid cylinder at where an output end of a slurry discharging pipeline locates.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.