row70.cpp
#include "rows.hpp"
const signed char row70[726] = {
105, -126, 48, -127, 7, -63, -116, 7, 125, 43, 90, -82, 12, 28, -49, 115, -20, -114, 3, 2, -67, 81,
....
-25, -122, 58, -36, -65, 117, 100, -126, -50, 81, -113, -128, 124, 57, 65, 51, -117, 119, -114, -59, 39, -90,
};
main.cpp
#include "rows.hpp"
const signed char *table[73] = {
row00, row01, row02, row03, row04, row05, row06, row07, row08, row09,
row10, row11, row12, row13, row14, row15, row16, row17, row18, row19,
row20, row21, row22, row23, row24, row25, row26, row27, row28, row29,
row30, row31, row32, row33, row34, row35, row36, row37, row38, row39,
row40, row41, row42, row43, row44, row45, row46, row47, row48, row49,
row50, row51, row52, row53, row54, row55, row56, row57, row58, row59,
row60, row61, row62, row63, row64, row65, row66, row67, row68, row69,
row70, row71, row72,
};
This results in a slight increase of space used because we now have a table of pointers and not a single packed array, but it still results in binary of slightly over 50K - plenty of space remains for the other code.
Dear all,
I need to use a very large (static) look-up-table (>145K entries) in a real-time control loop.
I know that I can easily read data from a text file, that could have stored the table. However, what I don't know is if this is fast enough to maintain a real-time controller bandwidth of let's say >100Hz?
Is this possible and the best way to use such a large look-up-table? Or are there better alternatives I could consider to use?
Thanks for all your help.