Showing 1 - 8 results of 8 for search 'had decision decoding', query time: 0.07s Refine Results
  1. 1

    Research on multi-bit decoding algorithms for polar codes by Zhouqing SHEN, Junna SHANG

    Published 2018-11-01
    “…Aiming at the problem of high delay of successive cancellation lists (SCL) decoding algorithm for polar codes,a multi-bit SCL (MSCL) decoding algorithm based on log-likelihood ratio was proposed.The multiple codeword bits could be decoded simultaneously at a single decision time.Without loss of SCL decoding performance,the decoding delay was reduced from 3N-2 clocks to 4N/M-2 clocks.Compared with the existing multi-bit SCL decoding algorithm,the MSCL decoding algorithm had a lower complexity of the path metric calculation.In order to reduce the decoding delay and memory space of the cyclical redundancy check (CRC) assisted SCL (CA-SCL) decoding algorithm,a segmented CRC assisted MSCL (SCA-MSCL) decoding algorithm was proposed,and a segmentation information codeword length correction algorithm was proposed.By adjusting the length of the relevant segment,the information bit index set A was guaranteed.Under the same premise,the corresponding information bit index at the end of each segment could be divisible by M.The SCA-MSCL algorithm could output decoded code words as early as possible by using multiple CRC decisions,thereby reducing the decoder’s storage space and decoding delay.…”
    Get full text
    Article
  2. 2

    Research on multi-bit decoding algorithms for polar codes by Zhouqing SHEN, Junna SHANG

    Published 2018-11-01
    “…Aiming at the problem of high delay of successive cancellation lists (SCL) decoding algorithm for polar codes,a multi-bit SCL (MSCL) decoding algorithm based on log-likelihood ratio was proposed.The multiple codeword bits could be decoded simultaneously at a single decision time.Without loss of SCL decoding performance,the decoding delay was reduced from 3N-2 clocks to 4N/M-2 clocks.Compared with the existing multi-bit SCL decoding algorithm,the MSCL decoding algorithm had a lower complexity of the path metric calculation.In order to reduce the decoding delay and memory space of the cyclical redundancy check (CRC) assisted SCL (CA-SCL) decoding algorithm,a segmented CRC assisted MSCL (SCA-MSCL) decoding algorithm was proposed,and a segmentation information codeword length correction algorithm was proposed.By adjusting the length of the relevant segment,the information bit index set A was guaranteed.Under the same premise,the corresponding information bit index at the end of each segment could be divisible by M.The SCA-MSCL algorithm could output decoded code words as early as possible by using multiple CRC decisions,thereby reducing the decoder’s storage space and decoding delay.…”
    Get full text
    Article
  3. 3
  4. 4
  5. 5
  6. 6

    Efficient tree mapping through deep distance transform (DDT) learning by Jan Schindler, Ziyi Sun, Bing Xue, Mengjie Zhang

    Published 2025-08-01
    “…While previous methods had to combine multi-model and multi-task outputs to create decision surfaces, we developed an efficient UNet-based modelling approach which focusses solely on learning the distance transforms of tree objects as cost surface for watershed segmentation. …”
    Get full text
    Article
  7. 7

    Balancing Innovation and Ethics by Anisa Patel

    Published 2025-03-01
    “…People need all the information necessary to make informed decisions about their health. Individuals should also consult a medical professional regarding their test results to help them better understand these outcomes. …”
    Get full text
    Article
  8. 8

    Balancing Innovation and Ethics by Anisa Patel

    Published 2025-03-01
    “…People need all the information necessary to make informed decisions about their health. Individuals should also consult a medical professional regarding their test results to help them better understand these outcomes. …”
    Get full text
    Article