{'fraction_non_alphanumeric': 0.01814300960512273, 'fraction_numerical': 0.0021344717182497333, 'mean_word_length': 4.8625, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Code Coverage analysis of 4 point FFT using Assertions and Constrained Randomization

A Fast Fourier transform (FFT) is a popular algorithm that takes out the signal as samples over a period of time (or space) and converts the signal into its frequency counterpart. The frequency samples are single sine-cosine samples oscillating at different frequencies, having their own amplitude and own phase. An FFT algorithm computes the discrete FT of a sequence, or its inverse i.e. Inverse FFT or IFFT. Fourier transform converts a signal from its original timing domain to a format in the frequency domain and also the other way around. In this project, a 4 point FFT has been designed and verified using System Verilog. System Verilog concepts such as randomized constraints and assertions are used for the verification process. The code coverage analysis is performed to check the verification efficiency and isolate areas of untested code.