2016-08-03 02:53:50 -04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2014 Jared Boone, ShareBrained Technology, Inc.
|
|
|
|
* Copyright (C) 2016 Furrtek
|
|
|
|
*
|
|
|
|
* This file is part of PortaPack.
|
|
|
|
*
|
|
|
|
* This program 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 2, or (at your option)
|
|
|
|
* any later version.
|
|
|
|
*
|
|
|
|
* 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 General Public License
|
|
|
|
* along with this program; see the file COPYING. If not, write to
|
|
|
|
* the Free Software Foundation, Inc., 51 Franklin Street,
|
|
|
|
* Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "proc_ook.hpp"
|
|
|
|
#include "portapack_shared_memory.hpp"
|
|
|
|
#include "sine_table_int8.hpp"
|
|
|
|
#include "event_m4.hpp"
|
|
|
|
|
|
|
|
#include <cstdint>
|
|
|
|
|
2022-12-05 09:51:23 -05:00
|
|
|
inline void OOKProcessor::write_sample(const buffer_c8_t& buffer, uint8_t bit_value, size_t i) {
|
2017-01-17 03:42:35 -05:00
|
|
|
int8_t re, im;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
|
|
|
if (bit_value) {
|
|
|
|
phase = (phase + 200); // What ?
|
|
|
|
sphase = phase + (64 << 18);
|
|
|
|
|
|
|
|
re = (sine_table_i8[(sphase & 0x03FC0000) >> 18]);
|
|
|
|
im = (sine_table_i8[(phase & 0x03FC0000) >> 18]);
|
|
|
|
} else {
|
|
|
|
re = 0;
|
|
|
|
im = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer.p[i] = {re, im};
|
|
|
|
}
|
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
bool OOKProcessor::scan_init(unsigned int order) {
|
|
|
|
if (order > MAX_DE_BRUIJN_ORDER)
|
|
|
|
return false;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
scan_done = false;
|
|
|
|
scan_progress = 0;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
k = 0;
|
|
|
|
idx = 1;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
duval_symbols = 2; // 2 for binary, 3 for ternary encoders
|
|
|
|
duval_length = 0;
|
|
|
|
duval_bit = 0;
|
|
|
|
duval_sample_bit = 0;
|
|
|
|
duval_symbol = 0;
|
|
|
|
|
|
|
|
memset(v, 0, sizeof(v));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool OOKProcessor::scan_encode(const buffer_c8_t& buffer, size_t& buf_ptr) {
|
|
|
|
// encode data: 0 = 1000, 1 = 1110
|
|
|
|
// @TODO: make this user-configurable
|
|
|
|
const uint8_t sym[] = { 0b0001, 0b0111 };
|
|
|
|
constexpr auto symbol_length = 4;
|
|
|
|
|
|
|
|
// iterate over every symbol in the sequence and convert it to bits with required bitrate
|
|
|
|
for (; duval_bit < duval_length; duval_bit++) {
|
|
|
|
auto val = v_tmp[duval_bit];
|
|
|
|
for (; duval_symbol < symbol_length; duval_symbol++) {
|
|
|
|
auto s = sym[val] & (1 << duval_symbol);
|
|
|
|
for (; duval_sample_bit < samples_per_bit; duval_sample_bit++) {
|
|
|
|
if (buf_ptr >= buffer.count) {
|
|
|
|
// buffer is full - continue next time
|
2022-12-05 09:51:23 -05:00
|
|
|
txprogress_message.done = false;
|
|
|
|
txprogress_message.progress = scan_progress++;
|
|
|
|
shared_memory.application_queue.push(txprogress_message);
|
2023-02-02 10:54:36 -05:00
|
|
|
return false;
|
2022-12-05 09:51:23 -05:00
|
|
|
}
|
2023-02-02 10:54:36 -05:00
|
|
|
write_sample(buffer, s, buf_ptr++);
|
2022-12-05 09:51:23 -05:00
|
|
|
}
|
2023-02-02 10:54:36 -05:00
|
|
|
duval_sample_bit = 0;
|
|
|
|
}
|
|
|
|
duval_symbol = 0;
|
|
|
|
}
|
|
|
|
duval_bit = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline size_t OOKProcessor::duval_algo_step() {
|
|
|
|
size_t buf_ptr = 0;
|
|
|
|
const unsigned int w = de_bruijn_length;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
// Duval's algorithm for generating de Bruijn sequence
|
|
|
|
while (idx) {
|
|
|
|
if (w % idx == 0) {
|
|
|
|
for (unsigned int k = 0; k < idx; k++)
|
|
|
|
v_tmp[buf_ptr++] = v[k];
|
2022-12-05 09:51:23 -05:00
|
|
|
k = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (unsigned int j = 0; j < w - idx; j++)
|
|
|
|
v[idx + j] = v[j];
|
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
for (idx = w; (idx > 0) && (v[idx - 1] >= duval_symbols - 1); idx--) ;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
|
|
|
if (idx)
|
2023-02-02 10:54:36 -05:00
|
|
|
v[idx - 1]++;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
if (buf_ptr) {
|
|
|
|
// we fill at most de_bruijn_length number of elements
|
|
|
|
return buf_ptr;
|
2022-12-05 09:51:23 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void OOKProcessor::scan_process(const buffer_c8_t& buffer) {
|
|
|
|
size_t buf_ptr = 0;
|
|
|
|
|
|
|
|
// transmit any leftover bits from previous step
|
|
|
|
if (!scan_encode(buffer, buf_ptr))
|
|
|
|
return;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2023-02-02 10:54:36 -05:00
|
|
|
while (1) {
|
|
|
|
// calculate next chunk of deBruijn sequence
|
|
|
|
duval_length = duval_algo_step();
|
|
|
|
|
|
|
|
if (duval_length == 0) {
|
|
|
|
// last chunk - done
|
|
|
|
if (!scan_done) {
|
|
|
|
txprogress_message.done = true;
|
|
|
|
shared_memory.application_queue.push(txprogress_message);
|
|
|
|
}
|
|
|
|
scan_done = 1;
|
|
|
|
|
|
|
|
// clear the remaining buffer in case we have any bytes left
|
|
|
|
for (size_t i = buf_ptr; i < buffer.count; i++)
|
|
|
|
buffer.p[i] = { 0, 0 };
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
duval_bit = 0;
|
|
|
|
duval_sample_bit = 0;
|
|
|
|
duval_symbol = 0;
|
|
|
|
|
|
|
|
// encode the sequence into required format
|
|
|
|
if (!scan_encode(buffer, buf_ptr))
|
|
|
|
break;
|
|
|
|
}
|
2022-12-05 09:51:23 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
void OOKProcessor::execute(const buffer_c8_t& buffer) {
|
2016-08-03 02:53:50 -04:00
|
|
|
// This is called at 2.28M/2048 = 1113Hz
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2016-08-03 02:53:50 -04:00
|
|
|
if (!configured) return;
|
2022-12-05 09:51:23 -05:00
|
|
|
|
|
|
|
if (de_bruijn_length) {
|
2023-02-02 10:54:36 -05:00
|
|
|
scan_process(buffer);
|
2022-12-05 09:51:23 -05:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2017-01-17 03:42:35 -05:00
|
|
|
for (size_t i = 0; i < buffer.count; i++) {
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2016-08-06 02:49:45 -04:00
|
|
|
// Synthesis at 2.28M/10 = 228kHz
|
2016-08-03 02:53:50 -04:00
|
|
|
if (!s) {
|
2016-08-06 02:49:45 -04:00
|
|
|
s = 10 - 1;
|
2016-08-03 02:53:50 -04:00
|
|
|
if (sample_count >= samples_per_bit) {
|
|
|
|
if (configured) {
|
2016-08-06 02:49:45 -04:00
|
|
|
if (bit_pos >= length) {
|
2016-08-03 02:53:50 -04:00
|
|
|
// End of data
|
2016-08-06 02:49:45 -04:00
|
|
|
if (pause_counter == 0) {
|
|
|
|
pause_counter = pause;
|
2016-08-03 02:53:50 -04:00
|
|
|
cur_bit = 0;
|
2016-08-06 02:49:45 -04:00
|
|
|
} else if (pause_counter == 1) {
|
|
|
|
if (repeat_counter < repeat) {
|
|
|
|
// Repeat
|
2016-12-09 12:21:47 -05:00
|
|
|
cur_bit = shared_memory.bb_data.data[0] & 0x80;
|
2017-09-24 15:05:42 -04:00
|
|
|
txprogress_message.progress = repeat_counter + 1;
|
|
|
|
txprogress_message.done = false;
|
|
|
|
shared_memory.application_queue.push(txprogress_message);
|
2022-11-30 03:59:24 -05:00
|
|
|
bit_pos = 1;
|
2016-08-06 02:49:45 -04:00
|
|
|
repeat_counter++;
|
|
|
|
} else {
|
|
|
|
// Stop
|
|
|
|
cur_bit = 0;
|
2017-09-24 15:05:42 -04:00
|
|
|
txprogress_message.done = true;
|
|
|
|
shared_memory.application_queue.push(txprogress_message);
|
2016-08-06 02:49:45 -04:00
|
|
|
configured = false;
|
|
|
|
}
|
|
|
|
pause_counter = 0;
|
|
|
|
} else {
|
|
|
|
pause_counter--;
|
2016-08-03 02:53:50 -04:00
|
|
|
}
|
2016-08-06 02:49:45 -04:00
|
|
|
} else {
|
2016-12-09 12:21:47 -05:00
|
|
|
cur_bit = (shared_memory.bb_data.data[bit_pos >> 3] << (bit_pos & 7)) & 0x80;
|
2016-08-06 02:49:45 -04:00
|
|
|
bit_pos++;
|
2016-08-03 02:53:50 -04:00
|
|
|
}
|
|
|
|
}
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2016-08-03 02:53:50 -04:00
|
|
|
sample_count = 0;
|
|
|
|
} else {
|
|
|
|
sample_count++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
s--;
|
|
|
|
}
|
|
|
|
|
2022-12-05 09:51:23 -05:00
|
|
|
write_sample(buffer, cur_bit, i);
|
2016-08-03 02:53:50 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void OOKProcessor::on_message(const Message* const p) {
|
|
|
|
const auto message = *reinterpret_cast<const OOKConfigureMessage*>(p);
|
2022-12-05 09:51:23 -05:00
|
|
|
|
2016-08-03 02:53:50 -04:00
|
|
|
if (message.id == Message::ID::OOKConfigure) {
|
2022-12-05 09:51:23 -05:00
|
|
|
configured = false;
|
|
|
|
|
2016-08-03 02:53:50 -04:00
|
|
|
repeat = message.repeat - 1;
|
2017-09-21 04:18:17 -04:00
|
|
|
length = message.stream_length;
|
2016-08-06 02:49:45 -04:00
|
|
|
pause = message.pause_symbols + 1;
|
2022-12-05 09:51:23 -05:00
|
|
|
de_bruijn_length = message.de_bruijn_length;
|
|
|
|
samples_per_bit = message.samples_per_bit;
|
|
|
|
|
|
|
|
if (!length && !samples_per_bit) {
|
|
|
|
// shutdown
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (de_bruijn_length) {
|
2023-02-02 10:54:36 -05:00
|
|
|
if (!scan_init(de_bruijn_length))
|
2022-12-05 09:51:23 -05:00
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
samples_per_bit /= 10;
|
|
|
|
}
|
|
|
|
|
2016-08-06 02:49:45 -04:00
|
|
|
pause_counter = 0;
|
2016-08-03 02:53:50 -04:00
|
|
|
s = 0;
|
|
|
|
sample_count = samples_per_bit;
|
|
|
|
repeat_counter = 0;
|
|
|
|
bit_pos = 0;
|
|
|
|
cur_bit = 0;
|
2017-09-24 15:05:42 -04:00
|
|
|
txprogress_message.progress = 0;
|
|
|
|
txprogress_message.done = false;
|
2016-08-03 02:53:50 -04:00
|
|
|
configured = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
EventDispatcher event_dispatcher { std::make_unique<OOKProcessor>() };
|
|
|
|
event_dispatcher.run();
|
|
|
|
return 0;
|
|
|
|
}
|