created demultiplexer and tests, not working yet

dataflow_neuro/coders.act

@@ -1041,6 +1041,99 @@ defproc decoder_2d_hybrid (avMx1of2<NxC+NyC> in; bool! out_req_x[Nx], out_req_y[
 		}
 
 
+	/**
+	 * 2D decoder which uses either synapse handshaking, or just a delay.
+	 * Controlled by the "hs_en" (handshake_enable) config bit.
+	 * hs_en = 0 -> use delayed version.
+	 * hs_en = 1 -> use synapse handshaking.
+	 * Regardless of which version is used, the final ack going to the buffer
+	 * goes through the prog_delay block.
+	 * Thus, for the handshaking version to be used "correctly", 
+	 * dly_cfg should be set to all zeros.
+	 * ack_disable blocks the ack being returned to the buffer.
+	 * Is needed in case there are instabilities while we fiddle with delays.
+	 */
+	 // @TODO : think hard about the fact that the line end pullups are not placed manually,
+	 // and write argumentation about whether this is fine
+	export template<pint N>
+	defproc decoder_1d (avMx1of2<std::ceil_log2(N)> in; a1of1 out[N];
+	bool? reset_B; power supply) {
+
+
+	// Buffer to recieve concat address packet
+	buffer<std::ceil_log2(N)> addr_buf(.in = in, .reset_B = reset_B, .supply = supply);
+
+	// Decoder And tree
+	decoder_dualrail_refresh<std::ceil_log2(N),N> d_dr(.supply = supply);
+	(i:0..std::ceil_log2(N)-1:d_dr.in.d[i] = addr_buf.out.d.d[i];)
+	(i:0..N-1: d_dr.out[i] = out[i].r;)
+
+
+	// Validity 
+	vtree<std::ceil_log2(N)> vtree (.in = d_dr.final_refresh, .supply = supply);
+	vtree.out = addr_buf.out.v;
+
+
+	// ORtree from all output acks, back to the buffer ack.
+	// This is instead of the ack that came from the delayed validity trees,
+	// in decoder_2d_dly.
+	ortree<N>  _ortree(.supply = supply);
+	(i:N:
+		_ortree.in[i] = out[i].a;
+	)
+	_ortree.out = addr_buf.out.a;
+
+
+	}
+
+	export template<pint N, W>
+	defproc demux_qdi2bd_1d (avMx1of2<std::ceil_log2(N)+W> in; rbd<W> out[N];
+	bool? reset_B; power supply) {
+
+	sigbuf<N+1> data_t[W];
+	(0..W-1:i:
+		data_t[i].in = addr_buf.out.d.d[std::ceil_log2(N)+i].t;
+		(0..N-1:j: 
+			data_t[i].out[j] = out[j].d.d[0];
+		)
+		data_t.supply = supply;
+	)
+
+
+	// Buffer to recieve concat address packet
+	buffer<std::ceil_log2(N)+W> addr_buf(.in = in, .reset_B = reset_B, .supply = supply);
+
+	// Decoder And tree
+	decoder_dualrail_refresh<std::ceil_log2(N),N> d_dr(.supply = supply);
+	(i:0..std::ceil_log2(N)-1:d_dr.in.d[i] = addr_buf.out.d.d[i];)
+	(i:0..N-1: d_dr.out[i] = out[i].r;)
+
+
+	// Validity 
+	vtree<std::ceil_log2(N)> vtree (.in = d_dr.final_refresh, .supply = supply);
+	vtree<W> vtree_data (.supply = supply);
+	(0..W-1:i: 
+		vtree_data.in[i].t = addr_buf.d.d[i+std::ceil_log2(N)].t;
+		vtree_data.in[i].f = data_t[i].out[N]
+
+	)
+	A_2C_B_X1 valid_Cel(.c1 = vtree.out, .c2 = vtree_data.out, .y = addr_buf.out.v,
+		.vdd = supply.vdd, .vss = supply.vss);
+
+	// ORtree from all output acks, back to the buffer ack.
+	// This is instead of the ack that came from the delayed validity trees,
+	// in decoder_2d_dly.
+	ortree<N>  _ortree(.supply = supply);
+	(i:N:
+		_ortree.in[i] = out[i].a;
+	)
+	_ortree.out = addr_buf.out.a;
+
+
+	}
+
+
+
 	}
 
 }