Lattice Builder Manual Software Package for Constructing Rank-1 Lattices

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files
- Examples

All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
tutorial/MeritSeqFastCBC.cc

This example shows how to instantiate a sequence of merit values computed using the fast CBC method.

// Copyright (c) 2012 David Munger, Pierre L'Ecuyer, Université de Montréal.
//
// This file is part of Lattice Builder.
//
// Lattice Builder is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// Lattice Builder is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Lattice Builder. If not, see <http://www.gnu.org/licenses/>.
#include "latbuilder/CoordUniformFigureOfMerit.h"
#include "latcommon/ProductWeights.h"
#include "latbuilder/Kernel/PAlpha.h"
#include "latbuilder/Accumulator.h"
#include "latbuilder/Storage.h"
#include "latbuilder/MeritFilterList.h"
#include "latbuilder/MeritCombiner.h"
#include "latbuilder/MeritSeq/CoordUniformCBC.h"
#include "latbuilder/MeritSeq/CoordUniformInnerProdFast.h"
#include "latbuilder/GenSeq/CyclicGroup.h"
#include "latbuilder/GenSeq/Creator.h"
#include "latbuilder/TextStream.h"
#include <iostream>
#include <limits>
using namespace LatBuilder;
using TextStream::operator<<;
template <typename T, typename... ARGS>
std::unique_ptr<T> unique(ARGS&&... args)
{ return std::unique_ptr<T>(new T(std::forward<ARGS>(args)...)); }
void setCombiner(MeritFilterList<LatType::ORDINARY>&, const SizeParam<LatType::ORDINARY>&) {}
void setCombiner(MeritFilterList<LatType::EMBEDDED>& filters, const SizeParam<LatType::EMBEDDED>& size)
{ filters.add(unique<MeritCombiner::SelectLevel>(size.maxLevel())); }
template <LatType L, Compress C>
void test(const Storage<L, C>& storage, Dimension dimension)
{
auto weights = unique<LatCommon::ProductWeights>();
weights->setDefaultWeight(0.7);
CoordUniformFigureOfMerit<Kernel::PAlpha> figure(std::move(weights), 2);
std::cout << "figure of merit: " << figure << std::endl;
typedef GenSeq::CyclicGroup<decltype(figure)::suggestedCompression()> Coprime;
auto genSeq = GenSeq::Creator<Coprime>::create(storage.sizeParam());
auto genSeq0 = GenSeq::Creator<Coprime>::create(SizeParam<L>(2));
auto cbc = MeritSeq::cbc<MeritSeq::CoordUniformInnerProdFast>(storage, figure);
MeritFilterList<L> filters;
setCombiner(filters, storage.sizeParam());
while (cbc.baseLat().dimension() < dimension) {
Dimension baseDim = cbc.baseLat().dimension();
std::cout << "CBC search for dimension: " << (baseDim + 1) << std::endl;
std::cout << " base lattice: " << cbc.baseLat() << std::endl;
std::cout << " base merit value: " << cbc.baseMerit() << std::endl;
auto meritSeq = cbc.meritSeq(baseDim == 0 ? genSeq0 : genSeq);
auto filteredSeq = filters.apply(meritSeq);
auto best = std::min_element(filteredSeq.begin(), filteredSeq.end());
cbc.select(best.base());
std::cout << "BEST LATTICE: " << cbc.baseLat() << " with merit value " << *best << std::endl;
}
}
int main()
{
Dimension dim = 3;
test(Storage<LatType::ORDINARY, Compress::SYMMETRIC>(256), dim);
test(Storage<LatType::EMBEDDED, Compress::SYMMETRIC>(256), dim);
return 0;
}