Skip to content
Snippets Groups Projects
DepQuant.cpp 67 KiB
Newer Older
  • Learn to ignore specific revisions
  •         rdCost += m_sigFracBits.intBits[0];
          }
          else
          {
            return;
          }
          if( rdCost < decision.rdCost )
          {
            decision.rdCost   = rdCost;
            decision.absLevel = 0;
            decision.prevId   = m_stateId;
          }
        }
    
        inline int32_t getLevelBits(const unsigned level) const
        {
          if( level < 5 )
          {
            return m_coeffFracBits.bits[level];
          }
          unsigned  value   = ( level - 5 ) >> 1;
          int32_t   bits    = m_coeffFracBits.bits[ level - (value << 1) ];
          unsigned  thres   = g_auiGoRiceRange[ m_goRicePar ] << m_goRicePar;
          if( value < thres )
          {
            return bits + ( ( ( value >> m_goRicePar ) + 1 + m_goRicePar ) << SCALE_BITS );
          }
          unsigned  length  = m_goRicePar;
          unsigned  delta   = 1 << length;
          unsigned  valLeft = value - thres;
          while( valLeft >= delta )
          {
            valLeft -= delta;
            delta    = 1 << (++length);
          }
          return bits + ( ( g_auiGoRiceRange[ m_goRicePar ] + 1 + ( length << 1 ) - m_goRicePar ) << SCALE_BITS );
        }
    
        template<ScanPosType spt> inline void checkRdCostNonZero(const PQData &pqData, Decision &decision) const
        {
          int64_t rdCost = m_rdCost + pqData.deltaDist + getLevelBits( pqData.absLevel );
          if( spt == SCAN_ISCSBB )
          {
            rdCost += m_sigFracBits.intBits[1];
          }
          else if( spt == SCAN_SOCSBB )
          {
            rdCost += m_sbbFracBits.intBits[1] + m_sigFracBits.intBits[1];
          }
          else if( m_numSigSbb )
          {
            rdCost += m_sigFracBits.intBits[1];
          }
          if( rdCost < decision.rdCost )
          {
            decision.rdCost   = rdCost;
            decision.absLevel = pqData.absLevel;
            decision.prevId   = m_stateId;
          }
        }
    
    
        inline void checkRdCostStart(int32_t lastOffset, const PQData &pqData, Decision &decision) const
        {
    
    #if JVET_L0274
          int64_t rdCost = pqData.deltaDist + lastOffset;
          if (pqData.absLevel < 4)
          {
            rdCost += m_coeffFracBits.bits[pqData.absLevel];
          }
          else
          {
            const unsigned value = (pqData.absLevel - 4) >> 1;
            rdCost += m_coeffFracBits.bits[pqData.absLevel - (value << 1)] + g_goRiceBits[m_goRicePar][value < RICEMAX ? value : RICEMAX-1];
          }
    #else
    
          int64_t rdCost = pqData.deltaDist + lastOffset + getLevelBits( pqData.absLevel );
    
          if( rdCost < decision.rdCost )
          {
            decision.rdCost   = rdCost;
            decision.absLevel = pqData.absLevel;
            decision.prevId   = -1;
          }
        }
    
        inline void checkRdCostSkipSbb(Decision &decision) const
        {
          int64_t rdCost = m_rdCost + m_sbbFracBits.intBits[0];
          if( rdCost < decision.rdCost )
          {
            decision.rdCost   = rdCost;
            decision.absLevel = 0;
            decision.prevId   = 4+m_stateId;
          }
        }
    
      private:
        int64_t                   m_rdCost;
        uint16_t                  m_absLevelsAndCtxInit[24];  // 16x8bit for abs levels + 16x16bit for ctx init id
    
    #if JVET_L0274
        int8_t                    m_numSigSbb;
        int8_t                    m_remRegBins;
        int8_t                    m_refSbbCtxId;
    #else
    
        BinFracBits               m_sbbFracBits;
        BinFracBits               m_sigFracBits;
        CoeffFracBits             m_coeffFracBits;
    
    #if JVET_L0274
        int8_t                    m_goRicePar;
        int8_t                    m_goRiceZero;
        const int8_t              m_stateId;
    #else
    
        const BinFracBits*const   m_sigFracBitsArray;
        const CoeffFracBits*const m_gtxFracBitsArray;
    
    #if JVET_L0274
        const uint32_t*const      m_goRiceZeroArray;
    #endif
    
        CommonCtx&                m_commonCtx;
      };
    
    
      State::State( const RateEstimator& rateEst, CommonCtx& commonCtx, const int stateId )
        : m_sbbFracBits     { { 0, 0 } }
        , m_stateId         ( stateId )
        , m_sigFracBitsArray( rateEst.sigFlagBits(stateId) )
        , m_gtxFracBitsArray( rateEst.gtxFracBits(stateId) )
    
    #if JVET_L0274
        , m_goRiceZeroArray ( g_auiGoRicePosCoeff0[std::max(0,stateId-1)] )
    #endif
    
        , m_commonCtx       ( commonCtx )
      {
      }
    
      template<uint8_t numIPos>
      inline void State::updateState(const ScanInfo &scanInfo, const State *prevStates, const Decision &decision)
      {
        m_rdCost = decision.rdCost;
        if( decision.prevId > -2 )
        {
          if( decision.prevId >= 0 )
          {
            const State*  prvState  = prevStates            +   decision.prevId;
            m_numSigSbb             = prvState->m_numSigSbb + !!decision.absLevel;
            m_refSbbCtxId           = prvState->m_refSbbCtxId;
            m_sbbFracBits           = prvState->m_sbbFracBits;
    
    #if JVET_L0274
            m_remRegBins            = prvState->m_remRegBins - 1;
            m_goRicePar             = prvState->m_goRicePar;
            if( m_remRegBins >= 3 )
            {
              TCoeff rem = (decision.absLevel - 4) >> 1;
              if( m_goRicePar < 3 && rem > (3<<m_goRicePar)-1 )
              {
                m_goRicePar++;
              }
              m_remRegBins -= std::min<TCoeff>( decision.absLevel, 2 );
            }
    #endif
    
            ::memcpy( m_absLevelsAndCtxInit, prvState->m_absLevelsAndCtxInit, 48*sizeof(uint8_t) );
          }
          else
          {
            m_numSigSbb     =  1;
            m_refSbbCtxId   = -1;
    
    #if JVET_L0274
            if ( scanInfo.sbbSize == 4 )
            {
              m_remRegBins  = MAX_NUM_REG_BINS_2x2SUBBLOCK - MAX_NUM_GT2_BINS_2x2SUBBLOCK - std::min<TCoeff>( decision.absLevel, 2 );
            }
            else
            {
              m_remRegBins  = MAX_NUM_REG_BINS_4x4SUBBLOCK - MAX_NUM_GT2_BINS_4x4SUBBLOCK - std::min<TCoeff>( decision.absLevel, 2 );
            }
            m_goRicePar     = ( ((decision.absLevel - 4) >> 1) > (3<<0)-1 ? 1 : 0 );
    #endif
    
            ::memset( m_absLevelsAndCtxInit, 0, 48*sizeof(uint8_t) );
          }
    
          uint8_t* levels               = reinterpret_cast<uint8_t*>(m_absLevelsAndCtxInit);
          levels[ scanInfo.insidePos ]  = (uint8_t)std::min<TCoeff>( 255, decision.absLevel );
    
    
    #if JVET_L0274
          if (m_remRegBins >= 3)
          {
            TCoeff  tinit = m_absLevelsAndCtxInit[8 + scanInfo.nextInsidePos];
            TCoeff  sumAbs1 = (tinit >> 3) & 31;
            TCoeff  sumNum = tinit & 7;
    #define UPDATE(k) {TCoeff t=levels[scanInfo.nextNbInfoSbb.inPos[k]]; sumAbs1+=std::min<TCoeff>(2+(t&1),t); sumNum+=!!t; }
            if (numIPos == 1)
            {
              UPDATE(0);
            }
            else if (numIPos == 2)
            {
              UPDATE(0);
              UPDATE(1);
            }
            else if (numIPos == 3)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
            }
            else if (numIPos == 4)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
              UPDATE(3);
            }
            else if (numIPos == 5)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
              UPDATE(3);
              UPDATE(4);
            }
    #undef UPDATE
            TCoeff sumGt1 = sumAbs1 - sumNum;
            m_sigFracBits = m_sigFracBitsArray[scanInfo.sigCtxOffsetNext + (sumAbs1 < 5 ? sumAbs1 : 5)];
            m_coeffFracBits = m_gtxFracBitsArray[scanInfo.gtxCtxOffsetNext + (sumGt1 < 4 ? sumGt1 : 4)];
          }
          else
          {
            TCoeff  sumAbs = m_absLevelsAndCtxInit[8 + scanInfo.nextInsidePos] >> 8;
    #define UPDATE(k) {TCoeff t=levels[scanInfo.nextNbInfoSbb.inPos[k]]; sumAbs+=t; }
            if (numIPos == 1)
            {
              UPDATE(0);
            }
            else if (numIPos == 2)
            {
              UPDATE(0);
              UPDATE(1);
            }
            else if (numIPos == 3)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
            }
            else if (numIPos == 4)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
              UPDATE(3);
            }
            else if (numIPos == 5)
            {
              UPDATE(0);
              UPDATE(1);
              UPDATE(2);
              UPDATE(3);
              UPDATE(4);
            }
    #undef UPDATE
            sumAbs = std::min(31, sumAbs);
            m_goRicePar = g_auiGoRiceParsCoeff[sumAbs];
            m_goRiceZero = m_goRiceZeroArray[sumAbs];
          }
    #else
    
          TCoeff  tinit   = m_absLevelsAndCtxInit[ 8 + scanInfo.nextInsidePos ];
          TCoeff  sumAbs  =   tinit >> 8;
          TCoeff  sumAbs1 = ( tinit >> 3 ) & 31;
          TCoeff  sumNum  =   tinit        & 7;
    #define UPDATE(k) {TCoeff t=levels[scanInfo.nextNbInfoSbb.inPos[k]]; sumAbs+=t; sumAbs1+=std::min<TCoeff>(4-(t&1),t); sumNum+=!!t; }
          if( numIPos == 1 )
          {
            UPDATE(0);
          }
          else if( numIPos == 2 )
          {
            UPDATE(0);
            UPDATE(1);
          }
          else if( numIPos == 3 )
          {
            UPDATE(0);
            UPDATE(1);
            UPDATE(2);
          }
          else if( numIPos == 4 )
          {
            UPDATE(0);
            UPDATE(1);
            UPDATE(2);
            UPDATE(3);
          }
          else if( numIPos == 5 )
          {
            UPDATE(0);
            UPDATE(1);
            UPDATE(2);
            UPDATE(3);
            UPDATE(4);
          }
    #undef UPDATE
          TCoeff sumGt1   = sumAbs1 - sumNum;
          sumAbs         -= sumNum;
          m_sigFracBits   = m_sigFracBitsArray[ scanInfo.sigCtxOffsetNext + ( sumAbs1 < 5 ? sumAbs1 : 5 ) ];
          m_coeffFracBits = m_gtxFracBitsArray[ scanInfo.gtxCtxOffsetNext + ( sumGt1  < 4 ? sumGt1  : 4 ) ];
          m_goRicePar     = g_auiGoRicePars   [ sumAbs < 31 ? sumAbs : 31 ];
    
        }
      }
    
      inline void State::updateStateEOS(const ScanInfo &scanInfo, const State *prevStates, const State *skipStates,
                                        const Decision &decision)
      {
        m_rdCost = decision.rdCost;
        if( decision.prevId > -2 )
        {
          const State* prvState = 0;
          if( decision.prevId  >= 0 )
          {
            prvState    = ( decision.prevId < 4 ? prevStates : skipStates - 4 ) +   decision.prevId;
            m_numSigSbb = prvState->m_numSigSbb                                 + !!decision.absLevel;
            ::memcpy( m_absLevelsAndCtxInit, prvState->m_absLevelsAndCtxInit, 16*sizeof(uint8_t) );
          }
          else
          {
            m_numSigSbb = 1;
            ::memset( m_absLevelsAndCtxInit, 0, 16*sizeof(uint8_t) );
          }
          reinterpret_cast<uint8_t*>(m_absLevelsAndCtxInit)[ scanInfo.insidePos ] = (uint8_t)std::min<TCoeff>( 255, decision.absLevel );
    
          m_commonCtx.update( scanInfo, prvState, *this );
    
          TCoeff  tinit   = m_absLevelsAndCtxInit[ 8 + scanInfo.nextInsidePos ];
          TCoeff  sumNum  =   tinit        & 7;
          TCoeff  sumAbs1 = ( tinit >> 3 ) & 31;
    
          TCoeff  sumGt1  = sumAbs1        - sumNum;
          m_sigFracBits   = m_sigFracBitsArray[ scanInfo.sigCtxOffsetNext + ( sumAbs1 < 5 ? sumAbs1 : 5 ) ];
          m_coeffFracBits = m_gtxFracBitsArray[ scanInfo.gtxCtxOffsetNext + ( sumGt1  < 4 ? sumGt1  : 4 ) ];
    
          m_goRicePar     = g_auiGoRicePars   [ sumAbs < 31 ? sumAbs : 31 ];
    
        }
      }
    
      inline void CommonCtx::update(const ScanInfo &scanInfo, const State *prevState, State &currState)
      {
        uint8_t*    sbbFlags  = m_currSbbCtx[ currState.m_stateId ].sbbFlags;
        uint8_t*    levels    = m_currSbbCtx[ currState.m_stateId ].levels;
        std::size_t setCpSize = m_nbInfo[ scanInfo.scanIdx - 1 ].maxDist * sizeof(uint8_t);
        if( prevState && prevState->m_refSbbCtxId >= 0 )
        {
          ::memcpy( sbbFlags,                  m_prevSbbCtx[prevState->m_refSbbCtxId].sbbFlags,                  scanInfo.numSbb*sizeof(uint8_t) );
          ::memcpy( levels + scanInfo.scanIdx, m_prevSbbCtx[prevState->m_refSbbCtxId].levels + scanInfo.scanIdx, setCpSize );
        }
        else
        {
          ::memset( sbbFlags,                  0, scanInfo.numSbb*sizeof(uint8_t) );
          ::memset( levels + scanInfo.scanIdx, 0, setCpSize );
        }
        sbbFlags[ scanInfo.sbbPos ] = !!currState.m_numSigSbb;
        ::memcpy( levels + scanInfo.scanIdx, currState.m_absLevelsAndCtxInit, scanInfo.sbbSize*sizeof(uint8_t) );
    
        const int       sigNSbb   = ( ( scanInfo.nextSbbRight ? sbbFlags[ scanInfo.nextSbbRight ] : false ) || ( scanInfo.nextSbbBelow ? sbbFlags[ scanInfo.nextSbbBelow ] : false ) ? 1 : 0 );
        currState.m_numSigSbb     = 0;
    
    #if JVET_L0274
        if (scanInfo.sbbSize == 4)
        {
          currState.m_remRegBins  = MAX_NUM_REG_BINS_2x2SUBBLOCK - MAX_NUM_GT2_BINS_2x2SUBBLOCK;
        }
        else
        {
          currState.m_remRegBins  = MAX_NUM_REG_BINS_4x4SUBBLOCK - MAX_NUM_GT2_BINS_4x4SUBBLOCK;
        }
    #endif
        currState.m_goRicePar     = 0;
    
        currState.m_refSbbCtxId   = currState.m_stateId;
        currState.m_sbbFracBits   = m_sbbFlagBits[ sigNSbb ];
    
        uint16_t          templateCtxInit[16];
        const int         scanBeg   = scanInfo.scanIdx - scanInfo.sbbSize;
        const NbInfoOut*  nbOut     = m_nbInfo + scanBeg;
        const uint8_t*    absLevels = levels   + scanBeg;
        for( int id = 0; id < scanInfo.sbbSize; id++, nbOut++ )
        {
          if( nbOut->num )
          {
            TCoeff sumAbs = 0, sumAbs1 = 0, sumNum = 0;
    
    #if JVET_L0274
    #define UPDATE(k) {TCoeff t=absLevels[nbOut->outPos[k]]; sumAbs+=t; sumAbs1+=std::min<TCoeff>(2+(t&1),t); sumNum+=!!t; }
    #else
    
    #define UPDATE(k) {TCoeff t=absLevels[nbOut->outPos[k]]; sumAbs+=t; sumAbs1+=std::min<TCoeff>(4-(t&1),t); sumNum+=!!t; }
    
            UPDATE(0);
            if( nbOut->num > 1 )
            {
              UPDATE(1);
              if( nbOut->num > 2 )
              {
                UPDATE(2);
                if( nbOut->num > 3 )
                {
                  UPDATE(3);
                  if( nbOut->num > 4 )
                  {
                    UPDATE(4);
                  }
                }
              }
            }
    #undef UPDATE
            templateCtxInit[id] = uint16_t(sumNum) + ( uint16_t(sumAbs1) << 3 ) + ( (uint16_t)std::min<TCoeff>( 127, sumAbs ) << 8 );
          }
          else
          {
            templateCtxInit[id] = 0;
          }
        }
        ::memset( currState.m_absLevelsAndCtxInit,     0,               16*sizeof(uint8_t) );
        ::memcpy( currState.m_absLevelsAndCtxInit + 8, templateCtxInit, 16*sizeof(uint16_t) );
      }
    
    
    
      /*================================================================================*/
      /*=====                                                                      =====*/
      /*=====   T C Q                                                              =====*/
      /*=====                                                                      =====*/
      /*================================================================================*/
      class DepQuant : private RateEstimator
      {
      public:
        DepQuant();
    
        void    quant   ( TransformUnit& tu, const CCoeffBuf& srcCoeff, const ComponentID compID, const QpParam& cQP, const double lambda, const Ctx& ctx, TCoeff& absSum );
        void    dequant ( const TransformUnit& tu,  CoeffBuf& recCoeff, const ComponentID compID, const QpParam& cQP )  const;
    
      private:
        void    xDecideAndUpdate  ( const TCoeff absCoeff, const ScanInfo& scanInfo );
    
    #if JVET_L0274
        void    xDecide           ( const ScanPosType spt, const TCoeff absCoeff, const int lastOffset, Decision* decisions );
    #else
    
        template<ScanPosType spt>
        void    xDecide           ( const TCoeff absCoeff, int32_t lastOffset, Decision* decisions );
    
    
      private:
        CommonCtx   m_commonCtx;
        State       m_allStates[ 12 ];
        State*      m_currStates;
        State*      m_prevStates;
        State*      m_skipStates;
        State       m_startState;
        Quantizer   m_quant;
        Decision    m_trellis[ MAX_TU_SIZE * MAX_TU_SIZE ][ 8 ];
      };
    
    
    #define TINIT(x) {*this,m_commonCtx,x}
      DepQuant::DepQuant()
        : RateEstimator ()
        , m_commonCtx   ()
        , m_allStates   {TINIT(0),TINIT(1),TINIT(2),TINIT(3),TINIT(0),TINIT(1),TINIT(2),TINIT(3),TINIT(0),TINIT(1),TINIT(2),TINIT(3)}
        , m_currStates  (  m_allStates      )
        , m_prevStates  (  m_currStates + 4 )
        , m_skipStates  (  m_prevStates + 4 )
        , m_startState  TINIT(0)
      {}
    #undef TINIT
    
    
      void DepQuant::dequant( const TransformUnit& tu,  CoeffBuf& recCoeff, const ComponentID compID, const QpParam& cQP ) const
      {
        m_quant.dequantBlock( tu, compID, cQP, recCoeff );
      }
    
    
    #define DINIT(l,p) {std::numeric_limits<int64_t>::max()>>2,l,p}
      static const Decision startDec[8] = {DINIT(-1,-2),DINIT(-1,-2),DINIT(-1,-2),DINIT(-1,-2),DINIT(0,4),DINIT(0,5),DINIT(0,6),DINIT(0,7)};
    #undef  DINIT
    
    
    
    #if JVET_L0274
      void DepQuant::xDecide( const ScanPosType spt, const TCoeff absCoeff, const int lastOffset, Decision* decisions)
    #else
    
      template<ScanPosType spt>
      void DepQuant::xDecide( const TCoeff absCoeff, int32_t lastOffset, Decision* decisions )
    
      {
        ::memcpy( decisions, startDec, 8*sizeof(Decision) );
    
        PQData  pqData[4];
        m_quant.preQuantCoeff( absCoeff, pqData );
    
    #if JVET_L0274
        m_prevStates[0].checkRdCosts( spt, pqData[0], pqData[2], decisions[0], decisions[2]);
        m_prevStates[1].checkRdCosts( spt, pqData[0], pqData[2], decisions[2], decisions[0]);
        m_prevStates[2].checkRdCosts( spt, pqData[3], pqData[1], decisions[1], decisions[3]);
        m_prevStates[3].checkRdCosts( spt, pqData[3], pqData[1], decisions[3], decisions[1]);
    #else
    
        m_prevStates[0].checkRdCostNonZero<spt> ( pqData[0],  decisions[0] );
        m_prevStates[0].checkRdCostNonZero<spt> ( pqData[2],  decisions[2] );
        m_prevStates[0].checkRdCostZero<spt>                ( decisions[0] );
        m_prevStates[1].checkRdCostNonZero<spt> ( pqData[2],  decisions[0] );
        m_prevStates[1].checkRdCostNonZero<spt> ( pqData[0],  decisions[2] );
        m_prevStates[1].checkRdCostZero<spt>                ( decisions[2] );
        m_prevStates[2].checkRdCostNonZero<spt> ( pqData[3],  decisions[1] );
        m_prevStates[2].checkRdCostNonZero<spt> ( pqData[1],  decisions[3] );
        m_prevStates[2].checkRdCostZero<spt>                ( decisions[1] );
        m_prevStates[3].checkRdCostNonZero<spt> ( pqData[1],  decisions[1] );
        m_prevStates[3].checkRdCostNonZero<spt> ( pqData[3],  decisions[3] );
        m_prevStates[3].checkRdCostZero<spt>                ( decisions[3] );
    
        if( spt==SCAN_EOCSBB )
        {
          m_skipStates[0].checkRdCostSkipSbb( decisions[0] );
          m_skipStates[1].checkRdCostSkipSbb( decisions[1] );
          m_skipStates[2].checkRdCostSkipSbb( decisions[2] );
          m_skipStates[3].checkRdCostSkipSbb( decisions[3] );
        }
        m_startState.checkRdCostStart( lastOffset, pqData[0], decisions[0] );
        m_startState.checkRdCostStart( lastOffset, pqData[2], decisions[2] );
      }
    
      void DepQuant::xDecideAndUpdate( const TCoeff absCoeff, const ScanInfo& scanInfo )
      {
        Decision* decisions = m_trellis[ scanInfo.scanIdx ];
    
        std::swap( m_prevStates, m_currStates );
    
    
    #if JVET_L0274
        xDecide( scanInfo.spt, absCoeff, lastOffset(scanInfo.scanIdx), decisions);
    #else
    
        if     ( scanInfo.socsbb )  { xDecide<SCAN_SOCSBB>( absCoeff, scanInfo.lastOffset, decisions ); }
        else if( scanInfo.eocsbb )  { xDecide<SCAN_EOCSBB>( absCoeff, scanInfo.lastOffset, decisions ); }
        else                        { xDecide<SCAN_ISCSBB>( absCoeff, scanInfo.lastOffset, decisions ); }
    
    
        if( scanInfo.scanIdx )
        {
          if( scanInfo.eosbb )
          {
            m_commonCtx.swap();
            m_currStates[0].updateStateEOS( scanInfo, m_prevStates, m_skipStates, decisions[0] );
            m_currStates[1].updateStateEOS( scanInfo, m_prevStates, m_skipStates, decisions[1] );
            m_currStates[2].updateStateEOS( scanInfo, m_prevStates, m_skipStates, decisions[2] );
            m_currStates[3].updateStateEOS( scanInfo, m_prevStates, m_skipStates, decisions[3] );
            ::memcpy( decisions+4, decisions, 4*sizeof(Decision) );
          }
          else
          {
            switch( scanInfo.nextNbInfoSbb.num )
            {
            case 0:
              m_currStates[0].updateState<0>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<0>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<0>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<0>( scanInfo, m_prevStates, decisions[3] );
              break;
            case 1:
              m_currStates[0].updateState<1>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<1>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<1>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<1>( scanInfo, m_prevStates, decisions[3] );
              break;
            case 2:
              m_currStates[0].updateState<2>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<2>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<2>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<2>( scanInfo, m_prevStates, decisions[3] );
              break;
            case 3:
              m_currStates[0].updateState<3>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<3>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<3>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<3>( scanInfo, m_prevStates, decisions[3] );
              break;
            case 4:
              m_currStates[0].updateState<4>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<4>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<4>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<4>( scanInfo, m_prevStates, decisions[3] );
              break;
            default:
              m_currStates[0].updateState<5>( scanInfo, m_prevStates, decisions[0] );
              m_currStates[1].updateState<5>( scanInfo, m_prevStates, decisions[1] );
              m_currStates[2].updateState<5>( scanInfo, m_prevStates, decisions[2] );
              m_currStates[3].updateState<5>( scanInfo, m_prevStates, decisions[3] );
            }
          }
    
    
    #if JVET_L0274
          if( scanInfo.spt == SCAN_SOCSBB )
    #else
    
          {
            std::swap( m_prevStates, m_skipStates );
          }
        }
      }
    
    
      void DepQuant::quant( TransformUnit& tu, const CCoeffBuf& srcCoeff, const ComponentID compID, const QpParam& cQP, const double lambda, const Ctx& ctx, TCoeff& absSum )
      {
    
    #if JVET_L0274
        CHECKD( tu.cs->sps->getSpsRangeExtension().getExtendedPrecisionProcessingFlag(), "ext precision is not supported" );
    #endif
    
    
        //===== reset / pre-init =====
        RateEstimator::initBlock  ( tu, compID );
        m_quant.initQuantBlock    ( tu, compID, cQP, lambda );
        TCoeff*       qCoeff      = tu.getCoeffs( compID ).buf;
        const TCoeff* tCoeff      = srcCoeff.buf;
        const int     numCoeff    = tu.blocks[compID].area();
        ::memset( tu.getCoeffs( compID ).buf, 0x00, numCoeff*sizeof(TCoeff) );
        absSum          = 0;
    
        //===== find first test position =====
        int   firstTestPos = numCoeff - 1;
        const TCoeff thres = m_quant.getLastThreshold();
        for( ; firstTestPos >= 0; firstTestPos-- )
        {
          if( abs( tCoeff[ rasterPos(firstTestPos) ] ) > thres )
          {
            break;
          }
        }
        if( firstTestPos < 0 )
        {
          return;
        }
    
        //===== real init =====
        RateEstimator::initCtx( tu, ctx.getFracBitsAcess() );
        m_commonCtx.reset( *this );
        for( int k = 0; k < 12; k++ )
        {
          m_allStates[k].init();
        }
        m_startState.init();
    
    
        //===== populate trellis =====
        for( ScanData scanData(*this,firstTestPos); scanData.valid(); scanData.next() )
        {
          xDecideAndUpdate( abs( tCoeff[ scanData.rasterPos ] ), scanData );
        }
    
        //===== find best path =====
        Decision  decision    = { std::numeric_limits<int64_t>::max(), -1, -2 };
        int64_t   minPathCost =  0;
        for( int8_t stateId = 0; stateId < 4; stateId++ )
        {
          int64_t pathCost = m_trellis[0][stateId].rdCost;
          if( pathCost < minPathCost )
          {
            decision.prevId = stateId;
            minPathCost     = pathCost;
          }
        }
    
        //===== backward scanning =====
        int scanIdx = 0;
        for( ; decision.prevId >= 0; scanIdx++ )
        {
          decision          = m_trellis[ scanIdx ][ decision.prevId ];
          int32_t blkpos    = rasterPos( scanIdx );
          qCoeff[ blkpos ]  = ( tCoeff[ blkpos ] < 0 ? -decision.absLevel : decision.absLevel );
          absSum           += decision.absLevel;
        }
      }
    
    }; // namespace DQIntern
    
    
    
    
    //===== interface class =====
    DepQuant::DepQuant( const Quant* other, bool enc ) : QuantRDOQ( other )
    {
      const DepQuant* dq = dynamic_cast<const DepQuant*>( other );
      CHECK( other && !dq, "The DepQuant cast must be successfull!" );
      p = new DQIntern::DepQuant();
      if( enc )
      {
        DQIntern::g_Rom.init();
      }
    }
    
    DepQuant::~DepQuant()
    {
      delete static_cast<DQIntern::DepQuant*>(p);
    }
    
    void DepQuant::quant( TransformUnit &tu, const ComponentID &compID, const CCoeffBuf &pSrc, TCoeff &uiAbsSum, const QpParam &cQP, const Ctx& ctx )
    {
      if( tu.cs->slice->getDepQuantEnabledFlag() )
      {
        static_cast<DQIntern::DepQuant*>(p)->quant( tu, pSrc, compID, cQP, Quant::m_dLambda, ctx, uiAbsSum );
      }
      else
      {
        QuantRDOQ::quant( tu, compID, pSrc, uiAbsSum, cQP, ctx );
      }
    }
    
    void DepQuant::dequant( const TransformUnit &tu, CoeffBuf &dstCoeff, const ComponentID &compID, const QpParam &cQP )
    {
      if( tu.cs->slice->getDepQuantEnabledFlag() )
      {
        static_cast<DQIntern::DepQuant*>(p)->dequant( tu, dstCoeff, compID, cQP );
      }
      else
      {
        QuantRDOQ::dequant( tu, dstCoeff, compID, cQP );
      }
    }