mirror of https://github.com/pvnis/srsRAN_4G.git
Moved prime number to different file
parent
ae3c5ec7d0
commit
a7ca8ffff7
@ -0,0 +1,34 @@
|
|||||||
|
/**
|
||||||
|
*
|
||||||
|
* \section COPYRIGHT
|
||||||
|
*
|
||||||
|
* Copyright 2013-2020 Software Radio Systems Limited
|
||||||
|
*
|
||||||
|
* By using this file, you agree to the terms and conditions set
|
||||||
|
* forth in the LICENSE file which can be found at the top level of
|
||||||
|
* the distribution.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef SRSLTE_PRIMES_H
|
||||||
|
#define SRSLTE_PRIMES_H
|
||||||
|
|
||||||
|
#include "srslte/config.h"
|
||||||
|
#include <stdint.h>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Finds the smallest prime number greater than n
|
||||||
|
* @param[in] n Provide the number
|
||||||
|
* @return A prime number below 1193, SRSLTE_ERROR code otherwise
|
||||||
|
*/
|
||||||
|
SRSLTE_API int srslte_prime_greater_than(uint32_t n);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Finds the biggest prime number lesser than n
|
||||||
|
* @attention the maximum prime number it can return is 1193
|
||||||
|
* @param[in] n Provide the number
|
||||||
|
* @return A prime number below 1193, SRSLTE_ERROR code otherwise
|
||||||
|
*/
|
||||||
|
SRSLTE_API int srslte_prime_lower_than(uint32_t n);
|
||||||
|
|
||||||
|
#endif // SRSLTE_PRIMES_H
|
@ -0,0 +1,55 @@
|
|||||||
|
/**
|
||||||
|
*
|
||||||
|
* \section COPYRIGHT
|
||||||
|
*
|
||||||
|
* Copyright 2013-2020 Software Radio Systems Limited
|
||||||
|
*
|
||||||
|
* By using this file, you agree to the terms and conditions set
|
||||||
|
* forth in the LICENSE file which can be found at the top level of
|
||||||
|
* the distribution.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "srslte/phy/utils/primes.h"
|
||||||
|
|
||||||
|
#define NOF_PRIME_NUMBERS 196
|
||||||
|
|
||||||
|
static const uint32_t prime_numbers[NOF_PRIME_NUMBERS] = {
|
||||||
|
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,
|
||||||
|
67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
|
||||||
|
157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251,
|
||||||
|
257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,
|
||||||
|
367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
|
||||||
|
467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593,
|
||||||
|
599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,
|
||||||
|
709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827,
|
||||||
|
829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953,
|
||||||
|
967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
|
||||||
|
1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193};
|
||||||
|
|
||||||
|
int srslte_prime_greater_than(uint32_t n)
|
||||||
|
{
|
||||||
|
for (uint32_t i = 0; i < NOF_PRIME_NUMBERS; i++) {
|
||||||
|
if (prime_numbers[i] > n) {
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return SRSLTE_ERROR_OUT_OF_BOUNDS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int srslte_prime_lower_than(uint32_t n)
|
||||||
|
{
|
||||||
|
|
||||||
|
if (n > prime_numbers[NOF_PRIME_NUMBERS - 1]) {
|
||||||
|
return SRSLTE_ERROR_OUT_OF_BOUNDS;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (uint32_t i = NOF_PRIME_NUMBERS - 1; i > 0; i--) {
|
||||||
|
if (prime_numbers[i] < n) {
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 2;
|
||||||
|
}
|
Loading…
Reference in New Issue