English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

System coding is a growing trend in all fields of engineering. Many different algorithms have been developed and studied for applications in signal processing, radar and multi-emission systems, among others. One of the most interesting algorithms, among these, is the complementary sets of sequences (CSS) given their potential and simplicity. They are characterised by a distinctive correlation and orthogonality properties. Nowadays, sustained efforts are being devoted to reducing the calculations involved in the generation and/or correlation of these sequences by means of recursive algorithms. Some authors have brought forward efficient algorithms that are based on modular architectures made up of adders, multipliers and delays. This work introduces an inverse generation approach to perform the correlation of CSS. This approach allows one to substantially reduce calculations, and enables the simultaneous correlation of M sequences, adopting neither time-multiplexing schemes nor complex parallel implementations. This is theoretically demonstrated by means of generation and correlation algorithms. An analysis of the performance and efficiency is then conducted in a reconfigurable hardware platform. The proposal represents an advance in the practical application of these sequences in the above-mentioned fields.

Improved architecture of complementary set of sequences correlation by means of an inverse generation approach