diff spandsp-0.0.3/spandsp-0.0.3/src/spandsp/bert.h @ 5:f762bf195c4b

import spandsp-0.0.3
author Peter Meerwald <pmeerw@cosy.sbg.ac.at>
date Fri, 25 Jun 2010 16:00:21 +0200
parents
children
line wrap: on
line diff
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/spandsp-0.0.3/spandsp-0.0.3/src/spandsp/bert.h	Fri Jun 25 16:00:21 2010 +0200
@@ -0,0 +1,199 @@
+/*
+ * SpanDSP - a series of DSP components for telephony
+ *
+ * bert.h - Bit error rate tests.
+ *
+ * Written by Steve Underwood <steveu@coppice.org>
+ *
+ * Copyright (C) 2004 Steve Underwood
+ *
+ * All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2, 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 General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *
+ * $Id: bert.h,v 1.13 2006/10/24 13:45:27 steveu Exp $
+ */
+
+#if !defined(_BERT_H_)
+#define _BERT_H_
+
+/*! \page bert_page The Bit Error Rate tester
+\section bert_page_sec_1 What does it do?
+The Bit Error Rate tester generates a pseudo random bit stream. It also accepts such
+a pattern, synchronises to it, and checks the bit error rate in this stream.
+
+\section bert_page_sec_2 How does it work?
+The Bit Error Rate tester generates a bit stream, with a repeating 2047 bit pseudo
+random pattern, using an 11 stage polynomial generator. It also accepts such a pattern,
+synchronises to it, and checks the bit error rate in this stream. If the error rate is
+excessive the tester assumes synchronisation has been lost, and it attempts to
+resynchronise with the stream.
+
+The bit error rate is continuously assessed against decadic ranges -
+    > 1 in 10^2
+    > 1 in 10^3
+    > 1 in 10^4
+    > 1 in 10^5
+    > 1 in 10^6
+    > 1 in 10^7
+    < 1 in 10^7
+To ensure fairly smooth results from this assessment, each decadic level is assessed
+over 10/error rate bits. That is, to assess if the signal's BER is above or below 1 in 10^5
+the software looks over 10*10^5 => 10^6 bits.
+*/
+
+enum
+{
+    BERT_REPORT_SYNCED,
+    BERT_REPORT_UNSYNCED,
+    BERT_REPORT_REGULAR,
+    BERT_REPORT_GT_10_2,
+    BERT_REPORT_LT_10_2,
+    BERT_REPORT_LT_10_3,
+    BERT_REPORT_LT_10_4,
+    BERT_REPORT_LT_10_5,
+    BERT_REPORT_LT_10_6,
+    BERT_REPORT_LT_10_7
+};
+
+/* The QBF strings should be:
+    "VoyeZ Le BricK GeanT QuE J'ExaminE PreS Du WharF 123 456 7890 + - * : = $ % ( )"
+    "ThE QuicK BrowN FoX JumpS OveR ThE LazY DoG 123 456 7890 + - * : = $ % ( )"
+*/
+
+enum
+{
+    BERT_PATTERN_ZEROS,
+    BERT_PATTERN_ONES,
+    BERT_PATTERN_7_TO_1,
+    BERT_PATTERN_3_TO_1,
+    BERT_PATTERN_1_TO_1,
+    BERT_PATTERN_1_TO_3,
+    BERT_PATTERN_1_TO_7,
+    BERT_PATTERN_QBF,
+    BERT_PATTERN_ITU_O151_23,
+    BERT_PATTERN_ITU_O151_20,
+    BERT_PATTERN_ITU_O151_15,
+    BERT_PATTERN_ITU_O152_11,
+    BERT_PATTERN_ITU_O153_9
+};
+
+/*!
+    Bit error rate tester (BERT) results descriptor. This is used to report the
+    results of a BER test.
+*/
+typedef struct
+{
+    int total_bits;
+    int bad_bits;
+    int resyncs;
+} bert_results_t;
+
+typedef void (*bert_report_func_t)(void *user_data, int reason, bert_results_t *bert_results);
+
+/*!
+    Bit error rate tester (BERT) descriptor. This defines the working state for a
+    single instance of the BERT.
+*/
+typedef struct
+{
+    int pattern;
+    int pattern_class;
+    bert_report_func_t reporter;
+    void *user_data;
+    int report_frequency;
+    int limit;
+
+    uint32_t tx_reg;
+    int tx_step;
+    int tx_step_bit;
+    int tx_bits;
+    int tx_zeros;
+
+    uint32_t rx_reg;
+    uint32_t ref_reg;
+    uint32_t master_reg;
+    int rx_step;
+    int rx_step_bit;
+    int resync;
+    int rx_bits;
+    int rx_zeros;
+    int resync_len;
+    int resync_percent;
+    int resync_bad_bits;
+    int resync_cnt;
+    
+    uint32_t mask;
+    int shift;
+    int shift2;
+    int max_zeros;
+    int invert;
+    int resync_time;
+
+    int decade_ptr[8];
+    int decade_bad[8][10];
+    int step;
+    int error_rate;
+
+    int bit_error_status;
+    int report_countdown;
+
+    bert_results_t results;
+
+    /*! \brief Error and flow logging control */
+    logging_state_t logging;
+} bert_state_t;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*! Initialise a BERT context.
+    \param s The BERT context.
+    \param limit The maximum test duration.
+    \param pattern One of the supported BERT signal patterns.
+    \param resync_len ???
+    \param resync_percent The percentage of bad bits which will cause a resync.
+    \return The BERT context. */
+bert_state_t *bert_init(bert_state_t *s, int limit, int pattern, int resync_len, int resync_percent);
+
+/*! Get the next bit of the BERT sequence from the generator.
+    \param s The BERT context.
+    \return The bit. */
+int bert_get_bit(bert_state_t *s);
+
+/*! Put the next bit of the BERT sequence to the analyser.
+    \param s The BERT context.
+    \param bit The bit. */
+void bert_put_bit(bert_state_t *s, int bit);
+
+/*! Set the callback function for reporting the test status.
+    \param s The BERT context.
+    \param freq The required frequency of regular reports.
+    \param reporter The callback function.
+    \param user_data An opaque pointer passed to the reporter routine. */
+void bert_set_report(bert_state_t *s, int freq, bert_report_func_t reporter, void *user_data);
+
+/*! Get the results of the BERT.
+    \param s The BERT context.
+    \param results The results.
+    \return The size of the result structure. */
+int bert_result(bert_state_t *s, bert_results_t *results);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+/*- End of file ------------------------------------------------------------*/

Repositories maintained by Peter Meerwald, pmeerw@pmeerw.net.