/*---------------------------------------------------------------------------*\
  FILE........: gp_interleaver.c
  AUTHOR......: David Rowe
  DATE CREATED: April 2018
  Golden Prime Interleaver. My interpretation of "On the Analysis and
  Design of Good Algebraic Interleavers", Xie et al,eq (5).
  See also octvae/gp_interleaver.m
\*---------------------------------------------------------------------------*/
/*
  Copyright (C) 2018 David Rowe
  All rights reserved.
  This program is free software; you can redistribute it and/or modify
  it under the terms of the GNU Lesser General Public License version 2.1, as
  published by the Free Software Foundation.  This program 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 Lesser General Public License
  along with this program; if not, see .
*/
#include 
#include 
#include "gp_interleaver.h"
namespace FreeDV
{
/*
  Choose b for Golden Prime Interleaver.  b is chosen to be the
  closest integer, which is relatively prime to N, to the Golden
  section of N.
  Implemented with a LUT in C for convenience, Octave version
  has a more complete implementation.
*/
int b_table[] = {
  112,71,
  224,139,
  448,277,
  672,419,
  896,557,
  1120,701,
  1344,839,
  1568,971,
  1792,1109,
  2016,1249,
  2240,1399,
  2464,1523,
  2688,1663,
  2912,1801,
  3136,1949,
  3360,2081,
  3584,2213
};
int choose_interleaver_b(int Nbits)
{
    unsigned int i;
    for(i=0; i