Fix range to search proper bit allocation

    In some cases we have quite small target number of bits so we unable to fit without reducing BFU number. But current algorithm starts reduce BFU only after succeful (from bit numbet perspctive) allocation. Which mean we must create zero allocation and only after that we restart allocation with reduced bfu number. The issue was the range to shift SNR  was not enough to create zerro allocation in some cases.

1 files changed, 3 insertions, 3 deletions

diff --git a/src/atrac/atrac3_bitstream.cpp b/src/atrac/atrac3_bitstream.cpp
index df0130c..5343579 100644
--- a/src/atrac/atrac3_bitstream.cpp
+++ b/src/atrac/atrac3_bitstream.cpp
@@ -191,15 +191,15 @@ std::pair<uint8_t, vector<uint32_t>> TAtrac3BitStreamWriter::CreateAllocation(co
     bool cont = true;
     while (cont) {
         precisionPerEachBlocks.resize(numBfu);
-        TFloat maxShift = 15;
-        TFloat minShift = -3;
+        TFloat maxShift = 20;
+        TFloat minShift = -8;
         for (;;) {
             TFloat shift = (maxShift + minShift) / 2;
             const vector<uint32_t>& tmpAlloc = CalcBitsAllocation(scaledBlocks, numBfu, spread, shift);
             auto consumption = CalcSpecsBitsConsumption(sce, tmpAlloc, mt);
 
             auto bitsUsedByTonal = EncodeTonalComponents(sce, tmpAlloc, nullptr);
-            //std::cerr << consumption.second << " |tonal: " << bitsUsedByTonal << " target: " << targetBits << " shift " << shift << " max | min " << maxShift << " " << minShift << std::endl;
+//            std::cerr << consumption.second << " |tonal: " << bitsUsedByTonal << " target: " << targetBits << " shift " << shift << " max | min " << maxShift << " " << minShift << " numBfu: " << numBfu << std::endl;
             consumption.second += bitsUsedByTonal;
 
             if (consumption.second < targetBits) {