Skip to main content

JS Array & Matrix Concepts


JavaScript Array & Matrix Concepts Demo

This demo covers key JavaScript array and matrix operations used in signal processing and general programming.

1. Array Manipulation (1D)


// Original binary array
let inputBits = [0, 1, 1, 0, 1, 0];

// map(): Convert bits to BPSK symbols (0 -> -1, 1 -> 1)
let inputSymbols = inputBits.map(bit => bit===0 ? -1 : 1);
console.log('map():', inputSymbols); // [-1, 1, 1, -1, 1, -1]

// filter(): Split even and odd indices
let s1 = inputSymbols.filter((_, i) => i % 2 === 0); // Even indices
let s2 = inputSymbols.filter((_, i) => i % 2 === 1); // Odd indices
console.log('filter() s1:', s1); // [-1, 1, 1]
console.log('filter() s2:', s2); // [1, -1, -1]

// reduce(): Sum of all bits
let sumBits = inputBits.reduce((sum, b) => sum + b, 0);
console.log('reduce() sum:', sumBits); // 3

// some() / every(): Check conditions
let allValid = inputBits.every(b => b===0 || b===1);
console.log('every() all valid bits?', allValid); // true

2. Pre-allocating Arrays


// Array.from(): Pre-allocate a 2D array for transmitted signals
let numSymbols = inputBits.length;
let transmittedSignals = Array.from({ length: 2 }, () => new Array(numSymbols).fill(0));
console.log('Array.from() 2D array:', transmittedSignals);
/*
[
  [0,0,0,0,0,0],
  [0,0,0,0,0,0]
]
*/

3. Matrix Manipulation (2D)


// Original binary matrix (antennas × time slots)
let bitMatrix = [
  [0, 1, 1],
  [1, 0, 1]
];

// map(): Convert each row to BPSK symbols
let symbolMatrix = bitMatrix.map(row => row.map(bit => bit===0 ? -1 : 1));
console.log('map() 2D matrix:', symbolMatrix);
/*
[
  [-1, 1, 1],
  [1, -1, 1]
]
*/

// flat(): Flatten matrix into 1D array
let flatSymbols = symbolMatrix.flat();
console.log('flat():', flatSymbols); // [-1,1,1,1,-1,1]

// flatMap(): Transform & flatten in one step
let transformedFlat = bitMatrix.flatMap(row => row.map(bit => bit*2));
console.log('flatMap():', transformedFlat); // [0,2,2,2,0,2]

// reduce() per row: sum of each row
let rowSums = bitMatrix.map(row => row.reduce((a,b) => a+b, 0));
console.log('reduce() row sums:', rowSums); // [2,2]

// every() on matrix: check all bits are 0 or 1
let allBitsValid = bitMatrix.every(row => row.every(b => b===0 || b===1));
console.log('every() 2D matrix all valid?', allBitsValid); // true

// Pre-allocate 2D array with Array.from() for matrix
let rows = 2, cols = 3;
let matrixPrealloc = Array.from({ length: rows }, () => new Array(cols).fill(0));
console.log('Array.from() preallocated 2D matrix:', matrixPrealloc);

4. Concepts Summary Table

Concept Similar JS Methods 1D Array Example 2D/Matrix Example
map() → transform each element forEach(), reduce(), flatMap() inputBits.map(bit => bit===0?-1:1) matrix.map(row => row.map(bit => bit===0?-1:1))
filter() → select elements reduce() with condition, some(), every() inputBits.filter((_,i) => i%2===0) matrix.flat().filter((_,i) => i%2===0)
Array.from() → create arrays new Array(length).fill(), spread [...Array(length)], Array.of() Array.from({length:n},()=>0) Array.from({length:rows},()=>new Array(cols).fill(0))
reduce() → combine values array.reduce((acc,val)=>acc+val,0) inputBits.reduce((sum,b)=>sum+b,0) matrix.map(row => row.reduce((a,b)=>a+b,0))
flat() / flatMap() → flatten arrays [].concat(...arrays) [[1,2],[3,4]].flat() → [1,2,3,4] matrix.flatMap(row => row.map(b => b*2))
some() / every() → check conditions logical checks inputBits.every(b => b===0||b===1) matrix.every(row => row.every(b => b===0||b===1))

<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Array & Matrix Concepts Demo</title>
<style>
body{
    font-family: Arial, sans-serif;
    background:#f4f6f9;
    margin:40px;
}
.container{
    max-width:700px;
    margin:auto;
    background:white;
    padding:30px;
    border-radius:8px;
    box-shadow:0 3px 12px rgba(0,0,0,0.1);
}
input{
    width:100%;
    padding:12px;
    border:1px solid #ccc;
    border-radius:5px;
    margin-top:10px;
}
.message{
    margin-top:12px;
    font-weight:bold;
}
.valid{ color:#2ecc71; }
.error{ color:#e74c3c; }
pre{
    background:#eee;
    padding:10px;
    border-radius:5px;
    overflow-x:auto;
}
</style>
</head>
<body>

<div class="container" id="container">
    <h1>Array & Matrix Concepts Demo</h1>
    <p>Enter numbers separated by commas (example: <strong>1,2,3,4</strong>)</p>

    <input type="text" id="inputArray" placeholder="Enter numbers here">

    <div id="message" class="message"></div>

    <h2>Results:</h2>
    <pre id="results"></pre>
</div>

<script>
const inputField = document.getElementById("inputArray");
const message = document.getElementById("message");
const results = document.getElementById("results");

// Fixed size for 2D array (rows x cols)
const ROWS = 2;
const COLS = 3;

inputField.addEventListener("input", function() {
    const value = inputField.value.trim();
    if(value === "") {
        message.textContent = "";
        results.textContent = "";
        return;
    }

    // Convert input to numerical array
    let numArray = value.split(',').map(item => Number(item.trim()));

    // Validate input
    if(!numArray.every(n => !isNaN(n))) {
        message.textContent = "Only numbers are allowed.";
        message.className = "message error";
        results.textContent = "";
        return;
    }

    message.textContent = "✓ Valid input!";
    message.className = "message valid";

    // 1. map(): double each element
    let doubled = numArray.map(n => n * 2);

    // 2. filter(): get even numbers
    let evens = numArray.filter(n => n % 2 === 0);

    // 3. reduce(): sum of all numbers
    let sum = numArray.reduce((acc, n) => acc + n, 0);

    // 4. some(): check if any number > 10
    let anyLarge = numArray.some(n => n > 10);

    // 5. every(): check if all numbers >= 0
    let allPositive = numArray.every(n => n >= 0);

    // --- Pad numArray for 2D matrix ---
    let matrixArray = [...numArray];
    let totalSize = ROWS * COLS;
    if(matrixArray.length < totalSize){
        matrixArray = matrixArray.concat(Array(totalSize - matrixArray.length).fill(0)); // pad zeros
    } else if(matrixArray.length > totalSize){
        matrixArray = matrixArray.slice(0, totalSize); // truncate
    }

    // 6. Array.from(): create 2D matrix
    let matrix = Array.from({ length: ROWS }, (_, r) =>
        matrixArray.slice(r * COLS, r * COLS + COLS)
    );

    // --- Pad for flatMap ---
    let flatMapArray = [...numArray];
    if(flatMapArray.length < totalSize){
        flatMapArray = flatMapArray.concat(Array(totalSize - flatMapArray.length).fill(0));
    }
    let flatMapped = flatMapArray.flatMap(n => [n, n]);

    // --- Pad for flat() ---
    let flatMatrix = matrix.flat();

    // Display results
    results.textContent = `
Original array: [${numArray}]
map() - doubled: [${doubled}]
filter() - even numbers: [${evens}]
reduce() - sum: ${sum}
some() - any number > 10? ${anyLarge}
every() - all numbers >= 0? ${allPositive}
Array.from() - 2D matrix (padded to ${ROWS}x${COLS}): ${JSON.stringify(matrix)}
flatMap() - duplicate each element (padded if needed): [${flatMapped}]
flat() - flattened matrix: [${flatMatrix}]
    `;
});
</script>

</body>
</html>


Output 

 



Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. 📘 Overview 🧮 Encoding 🧩 Decoding 📚 Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) đŸ“Ĩ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Sol...

Gaussian minimum shift keying (GMSK)

📘 Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK 📚 Simulation Results for GMSK 📚 Q & A and Summary 📚 Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: θ(t) = 2Ī€h ∫ 0 t m filtered (Ī„) dĪ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📈 Q-function 📚 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...

1G to 5G Technology - Evolution of Wireless Generations

Cellular wireless evolution Generation Frequency band PHY features Data rate Spectral Eff. (bps/Hz) 1G 850 MHz FDMA, FM N/A N/A 2G 900 MHz, 1.8 GHz TDMA/CDMA, GMSK/QPSK, FEC, PC 10 Kbps < 1 3G 1.8–2.5 GHz CDMA, QAM 1–40 Mbps 1–8 4G 2–8 GHz OFDMA, SC-FDMA, QAM, MIMO-OFDM 100–600 Mbps 15 5G 1–6 GHz mm wave (26–28 GHz) < 1 GHz (massive IoT) visible light? massive MIMO, beamforming D2D, Full duplex, NOMA LDPC and Polar codes OFDM & variants (adapted to extremes?) multi-Gbps several tens Waveform design is the major change between the generations Mobile Wireless Generations Specifications  1G  Voice, Analog traffic, FDMA  2G  Voice, SMS, CS data ...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator đŸ“ļ FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...